{"as_of":"2026-08-07T21:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c1280d1ab41893de4a8befd0e8cfeb3a63a5bec20d896fdd3e6479cc5eccdcf7","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:58:09.464521Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-20T13:02:08.337788Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-20T13:03:17.860174Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"cited_work":{"arxiv_id":"2506.20353","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.20353","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dipsvd: Dual-importance protected svd for efficient llm compression","venue":null,"work_id":"3c140ff7-c48a-46c0-88d1-e2a61f4caff8","year":2025},"citing_paper":{"arxiv_id":"2510.25977","last_updated":"2026-04-23T22:27:02Z","snapshot_observed_at":"2026-08-02T11:49:00.583840Z","submitted_at":"2025-10-29T21:22:08Z","title":"NeuronMLP: Efficient LLM Inference via Singular Value Decomposition Compression and Tiling on AWS Trainium","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-18T02:51:19.275111Z"},"links":{"cited_paper":"/paper/2506.20353","citing_paper":"/paper/2510.25977"},"observation_digest":"sha256:8fb7601e2b16aae3e5ff7ac5aa34310cd23b8da978e29b89e2364e6d3ff0ab32","observation_id":"d63e8a3f-387f-4a57-b89d-2bc88c5b2723","resolution":{"observed_at":"2026-05-18T02:52:21.852497Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"cited_work":{"arxiv_id":"2506.20353","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.20353","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dipsvd: Dual-importance protected svd for efficient llm compression","venue":null,"work_id":"3c140ff7-c48a-46c0-88d1-e2a61f4caff8","year":2025},"citing_paper":{"arxiv_id":"2605.08568","last_updated":"2026-05-09T00:02:33Z","snapshot_observed_at":"2026-08-02T23:13:09.763052Z","submitted_at":"2026-05-09T00:02:33Z","title":"Different Prompts, Different Ranks: Prompt-aware Dynamic Rank Selection for SVD-based LLM Compression","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-12T02:22:51.541981Z"},"links":{"cited_paper":"/paper/2506.20353","citing_paper":"/paper/2605.08568"},"observation_digest":"sha256:2e2a7c64b9e30ce8e5661abea32edc282a177f6282ad4e5dbe981beb7a4a2d1f","observation_id":"5ae76682-6a3f-44ca-98ef-83e4f46c0ac7","resolution":{"observed_at":"2026-05-12T07:41:33.036799Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"cited_work":{"arxiv_id":"2506.20353","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.20353","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dipsvd: Dual-importance protected svd for efficient llm compression","venue":null,"work_id":"3c140ff7-c48a-46c0-88d1-e2a61f4caff8","year":2025},"citing_paper":{"arxiv_id":"2605.17985","last_updated":"2026-05-18T07:40:46Z","snapshot_observed_at":"2026-08-03T02:11:52.628977Z","submitted_at":"2026-05-18T07:40:46Z","title":"SAFE-SVD: Sensitivity-Aware Fidelity-Enforcing SVD for Physics Foundation Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-20T13:02:08.337788Z"},"links":{"cited_paper":"/paper/2506.20353","citing_paper":"/paper/2605.17985"},"observation_digest":"sha256:4a6c65b9c080b62ba269157d3e542d7e03f14ff02bde54d93fdbcedba4f55b7c","observation_id":"9c514930-28ee-4c34-8fe1-1f30c4530206","resolution":{"observed_at":"2026-05-20T13:03:17.862221Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.20353/citation-record","integrity":"/paper/2506.20353/integrity","json":"/paper/2506.20353/citation-record.json","paper":"/paper/2506.20353"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:10.262538Z","title":null,"venue":null,"work_id":"ea7e2079-41cd-4537-a9bc-758c68407f9d","year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.252568Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:573319fe64d606ec0d77734fe60ace69202bb98908137e14a78331e61630134e","observation_id":"194c75b9-f608-4545-a424-81d471826887","resolution":{"observed_at":"2026-08-06T22:58:10.267590Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.13319","last_updated":"2019-05-30T21:28:12Z","snapshot_observed_at":"2026-07-06T07:56:54.143277Z","submitted_at":"2019-05-30T21:28:12Z","title":"MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalisms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.13319","snapshot_observed_at":"2026-08-06T22:58:09.257127Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.257127Z"},"links":{"cited_paper":"/paper/1905.13319","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:0ded43a2a9c72d657296087d49b9cd839abc81ad2afecb3ebb8ebf15b0b592bb","observation_id":"e3910760-5673-4fae-9ba4-042db60b865f","resolution":{"observed_at":"2026-08-06T22:58:09.257127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:10.246190Z","title":null,"venue":null,"work_id":"28f9beac-feb2-42ba-a8b7-528573d5fd0e","year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.262212Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:a044ef71df48aa8098518768f6f760f1a71735d18cee51751a75587c304dcdb9","observation_id":"2d889976-ed6d-4cd5-a2a9-7cb6927ab1f5","resolution":{"observed_at":"2026-08-06T22:58:10.251006Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:09.266568Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.266568Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:2319a91f2ecb594641834f87aa7dc414d04884b2c75708ffcd74407ba9e2db13","observation_id":"d59c095d-cc24-4025-b127-aa779f4c01ea","resolution":{"observed_at":"2026-08-06T22:58:09.266568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:10.219042Z","title":null,"venue":null,"work_id":"cc33f901-788a-4267-bd02-54694bb3803c","year":2021},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.270974Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:83cc49ee824fab3b14987d8be9cc080e1f34efd82056a849ef6731302d21fe6b","observation_id":"fb24fe5d-f4ae-40d2-a856-3769fda8ac8c","resolution":{"observed_at":"2026-08-06T22:58:10.224151Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14323","last_updated":"2023-11-06T11:00:26Z","snapshot_observed_at":"2026-07-06T15:31:51.249701Z","submitted_at":"2023-05-23T17:54:33Z","title":"ChatCoT: Tool-Augmented Chain-of-Thought Reasoning on Chat-based Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14323","snapshot_observed_at":"2026-08-06T22:58:09.275621Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.275621Z"},"links":{"cited_paper":"/paper/2305.14323","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:ea7554e255b49101c94e7022c474f0876e7c1d1554a87d18570c9c192fafdb58","observation_id":"d7b9f9a9-2d9d-49f6-a3e5-b96b6940bb5d","resolution":{"observed_at":"2026-08-06T22:58:09.275621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:10.202477Z","title":null,"venue":null,"work_id":"29a2870f-be5c-4a15-bb75-a6c121f2b607","year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.281012Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:9bd162af99a208f62a12cd40ea57894837523c19040b73470736798294d08022","observation_id":"caf15435-7b15-425d-a176-5b53a6816dc3","resolution":{"observed_at":"2026-08-06T22:58:10.207536Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-06T22:58:09.286016Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.286016Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:c56343e3a6f0a2d227a101fcb3ee5de61f7cf7f694791d61d889a3890784bd12","observation_id":"f9fc1b2e-6e8c-417c-a622-f422821ba665","resolution":{"observed_at":"2026-08-06T22:58:09.286016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.09712","last_updated":"2022-05-19T17:25:28Z","snapshot_observed_at":"2026-08-05T16:13:51.965874Z","submitted_at":"2022-05-19T17:25:28Z","title":"Selection-Inference: Exploiting Large Language Models for Interpretable Logical Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.09712","snapshot_observed_at":"2026-08-06T22:58:09.290196Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.290196Z"},"links":{"cited_paper":"/paper/2205.09712","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:36e6d27b3b9caf7f32e8d439bb0e8cb2371bbf075e4331069e0ca24bb07e041d","observation_id":"c1c7c815-0ab0-4a2e-a7f1-e1ac84fc1627","resolution":{"observed_at":"2026-08-06T22:58:09.290196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.04902","last_updated":"2024-04-08T22:42:49Z","snapshot_observed_at":"2026-07-30T16:56:04.978117Z","submitted_at":"2023-11-08T18:59:54Z","title":"Beyond Size: How Gradients Shape Pruning Decisions in Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.04902","snapshot_observed_at":"2026-08-06T22:58:09.294934Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.294934Z"},"links":{"cited_paper":"/paper/2311.04902","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:8ae88782c0d6847e6fdbba8f24cc6ebaf10ac8ed013238fb61837ff969624f01","observation_id":"f3e4b592-92b1-451b-8644-81e3a6770c74","resolution":{"observed_at":"2026-08-06T22:58:09.294934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-06T22:58:09.299889Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.299889Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:aca0f4a131ae4f869633ded49e71d52e10b9cdbcf5b173227996760579ba50f1","observation_id":"8d7f4b36-e9e8-44ff-9f55-458ab5adae4e","resolution":{"observed_at":"2026-08-06T22:58:09.299889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.19159","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:09.941570Z","title":null,"venue":null,"work_id":"ff191925-2953-4251-a002-49a81b52fa7b","year":2025},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.304523Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:83ee7bebaa68c03d67a1330d1d869d183b83c5fd490d064680cd1e9ac18a3877","observation_id":"6346a234-3c79-4163-a3e6-6612ca11c7a0","resolution":{"observed_at":"2026-08-06T22:58:09.952337Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12348","last_updated":"2024-06-10T17:14:09Z","snapshot_observed_at":"2026-08-06T16:37:19.128638Z","submitted_at":"2024-02-19T18:23:36Z","title":"GTBench: Uncovering the Strategic Reasoning Limitations of LLMs via Game-Theoretic Evaluations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12348","snapshot_observed_at":"2026-08-06T22:58:09.308919Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.308919Z"},"links":{"cited_paper":"/paper/2402.12348","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:3a503b041024847154dfc43db75b6607b450f78177379b14e0ee8d71c4082652","observation_id":"ade39c0f-f51e-4c82-8f16-222cdfb2ae79","resolution":{"observed_at":"2026-08-06T22:58:09.308919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:10.185379Z","title":null,"venue":null,"work_id":"a466646b-8c7b-4fd0-bf88-4ad3780d44a3","year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.313359Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:eb11d595d1d07e82cd39a851ae7a9634e748c447f7623046fda39c417c670f84","observation_id":"e33ee016-3c1b-4e61-b968-eb8bb84d1c4a","resolution":{"observed_at":"2026-08-06T22:58:10.190315Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.17323","last_updated":"2023-03-22T13:10:47Z","snapshot_observed_at":"2026-08-07T08:38:54.025062Z","submitted_at":"2022-10-31T13:42:40Z","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.17323","snapshot_observed_at":"2026-08-06T22:58:09.318047Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.318047Z"},"links":{"cited_paper":"/paper/2210.17323","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:ba8aa355d793ddf50a785439b5102b7473551a26a48a2079b6c272b09f3f2610","observation_id":"bdbaff90-18c4-44cc-b557-a820537b9852","resolution":{"observed_at":"2026-08-06T22:58:09.318047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:09.323392Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.323392Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:5e9b165df5198bc7d2ad03f3a63180e3467f75394c5b4d92b9884bf48cdd3d6a","observation_id":"942a9050-a414-408b-91f0-4234a27c573e","resolution":{"observed_at":"2026-08-06T22:58:09.323392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.08543","last_updated":"2026-01-31T09:16:35Z","snapshot_observed_at":"2026-08-02T20:03:32.798288Z","submitted_at":"2023-06-14T14:44:03Z","title":"MiniLLM: On-Policy Distillation of Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.08543","snapshot_observed_at":"2026-08-06T22:58:09.327999Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.327999Z"},"links":{"cited_paper":"/paper/2306.08543","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:8ce6bbc0a3eef3786ea3dff063fce63890547502e98c4ff35c8870657090e06a","observation_id":"8c10d2b9-b797-410b-86b5-18b665fbedf2","resolution":{"observed_at":"2026-08-06T22:58:09.327999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02301","last_updated":"2023-07-05T16:59:31Z","snapshot_observed_at":"2026-07-06T15:22:55.122322Z","submitted_at":"2023-05-03T17:50:56Z","title":"Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02301","snapshot_observed_at":"2026-08-06T22:58:09.333138Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.333138Z"},"links":{"cited_paper":"/paper/2305.02301","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:aca3b9d55fa2251e57a50c238473c273c3a82b7ecd0ce1ec7ebbf9c7ef796aba","observation_id":"f13160b3-9f5b-4067-b817-94ccb3c595bf","resolution":{"observed_at":"2026-08-06T22:58:09.333138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-08-06T22:58:09.339529Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.339529Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:887583eb9f511a067fdff576449a7b5a3df02b7aee644481bbd32f9b49f551f6","observation_id":"4e341fb2-7a76-4e91-b483-8103974df16b","resolution":{"observed_at":"2026-08-06T22:58:09.339529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02834","last_updated":"2024-06-23T08:45:33Z","snapshot_observed_at":"2026-07-06T17:25:18.238343Z","submitted_at":"2024-02-05T09:44:49Z","title":"Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02834","snapshot_observed_at":"2026-08-06T22:58:09.344388Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.344388Z"},"links":{"cited_paper":"/paper/2402.02834","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:f3b1e5500896d277318bdf7f815a899e7de01f2f10aa6dd57738014211ab046b","observation_id":"0df1acf6-6c13-4f90-b7ab-e32b7199fe7f","resolution":{"observed_at":"2026-08-06T22:58:09.344388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.06530","last_updated":"2016-02-24T11:52:12Z","snapshot_observed_at":"2026-07-06T04:37:12.487978Z","submitted_at":"2015-11-20T09:20:08Z","title":"Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.06530","snapshot_observed_at":"2026-08-06T22:58:09.349439Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.349439Z"},"links":{"cited_paper":"/paper/1511.06530","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:38b2b50aed971da5cb68c06f6d13fcbf06e2278b5db9109379499bb90a3ae579","observation_id":"98a6c3ce-3d26-4cef-9da7-94211323a179","resolution":{"observed_at":"2026-08-06T22:58:09.349439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03898","last_updated":"2024-07-03T04:57:41Z","snapshot_observed_at":"2026-08-05T01:48:55.895470Z","submitted_at":"2024-02-06T11:10:35Z","title":"DistiLLM: Towards Streamlined Distillation for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03898","snapshot_observed_at":"2026-08-06T22:58:09.354241Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.354241Z"},"links":{"cited_paper":"/paper/2402.03898","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:b42ba9b2ffbe3a542d8be747a38322e1bbaa1ed6befe43c6613ada793f5139f7","observation_id":"afb47b9a-9024-441a-b97a-73df6cff3a7a","resolution":{"observed_at":"2026-08-06T22:58:09.354241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:09.359057Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.359057Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:9c410b7fed10902b910074d804161266da7c4287c174c0fc30ea35113b651e4b","observation_id":"18fd7ab1-8b1c-4f5d-9196-ee9999f62d13","resolution":{"observed_at":"2026-08-06T22:58:09.359057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.08291","last_updated":"2023-05-15T01:18:23Z","snapshot_observed_at":"2026-07-06T15:27:02.376191Z","submitted_at":"2023-05-15T01:18:23Z","title":"Large Language Model Guided Tree-of-Thought","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.08291","snapshot_observed_at":"2026-08-06T22:58:09.363564Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.363564Z"},"links":{"cited_paper":"/paper/2305.08291","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:35477cc57e68d9f4c716e076b65bf22867176d6eb18337cf714bd70ad8e2dbd1","observation_id":"f71ed466-5fdc-4ede-847c-9b028ff63a57","resolution":{"observed_at":"2026-08-06T22:58:09.363564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:09.368195Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.368195Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:e129544790de81e0f8da29539de236730cd47c67708a39dd83a525b9692f29b8","observation_id":"15593606-7149-47cb-bc38-abd8f6cc4442","resolution":{"observed_at":"2026-08-06T22:58:09.368195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:10.144399Z","title":"Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz","venue":null,"work_id":"75bc69f9-6175-422a-b2ec-4d2e0dcb446a","year":1993},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.373052Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:876a295d10a947337707773343a8aa0e8209a0953ddb1d16e6eeafcb1c6f1f90","observation_id":"810714f1-74a0-4951-82fe-52db304eb357","resolution":{"observed_at":"2026-08-06T22:58:10.150936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03853","last_updated":"2024-10-11T09:43:32Z","snapshot_observed_at":"2026-08-03T01:48:18.654934Z","submitted_at":"2024-03-06T17:04:18Z","title":"ShortGPT: Layers in Large Language Models are More Redundant Than You Expect","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03853","snapshot_observed_at":"2026-08-06T22:58:09.378124Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.378124Z"},"links":{"cited_paper":"/paper/2403.03853","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:a923487faac769d6932c8378acf65af01c1982447e44203465dd5be146f9cd00","observation_id":"8760274e-24fa-40ef-8dfc-7271dc97bc24","resolution":{"observed_at":"2026-08-06T22:58:09.378124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-07-06T05:12:10.387914Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-06T22:58:09.383288Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.383288Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:84173c85fae3a35da3b32702935801f408680821598ac5aea916bbdd6fc301d8","observation_id":"f2f167b2-df2f-4699-af0a-04a135c3b47c","resolution":{"observed_at":"2026-08-06T22:58:09.383288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.02789","last_updated":"2018-09-08T11:47:16Z","snapshot_observed_at":"2026-07-06T06:59:57.168051Z","submitted_at":"2018-09-08T11:47:16Z","title":"Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.02789","snapshot_observed_at":"2026-08-06T22:58:09.393198Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.393198Z"},"links":{"cited_paper":"/paper/1809.02789","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:2ddeddc809d01535985d9e063697ff9d6ca477d0909e4c526f2767b90ddaa2b3","observation_id":"ddb4d8c1-9b4d-4dfe-9c8c-fd18eed320b7","resolution":{"observed_at":"2026-08-06T22:58:09.393198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.12295","last_updated":"2023-10-19T01:54:27Z","snapshot_observed_at":"2026-08-07T13:11:49.965934Z","submitted_at":"2023-05-20T22:25:38Z","title":"Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.12295","snapshot_observed_at":"2026-08-06T22:58:09.398339Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.398339Z"},"links":{"cited_paper":"/paper/2305.12295","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:5a645188c3dfa2e87945de88a3cd8d42f9440b3da5a5e0b49e8c5988c2fb1a0f","observation_id":"efca936b-7996-4a94-ae34-160008f0d7a2","resolution":{"observed_at":"2026-08-06T22:58:09.398339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:09.403280Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.403280Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:719ffc5276f016fab3d9b701ea1b3d7904daabce1dea0d7ec8bd91cdf7210eb9","observation_id":"581eeac3-912e-4be2-ba50-05a9c5c47b8b","resolution":{"observed_at":"2026-08-06T22:58:09.403280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-08-06T22:58:09.407929Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.407929Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:9d567302c70b4e1d239f6bb094bae82b7fe3ba0804f7279cd2e9c0926be3720f","observation_id":"a9097cef-a1d4-41e4-be55-c8db94e02f57","resolution":{"observed_at":"2026-08-06T22:58:09.407929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11695","last_updated":"2024-05-06T17:47:01Z","snapshot_observed_at":"2026-07-06T15:44:42.776459Z","submitted_at":"2023-06-20T17:18:20Z","title":"A Simple and Effective Pruning Approach for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11695","snapshot_observed_at":"2026-08-06T22:58:09.413012Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.413012Z"},"links":{"cited_paper":"/paper/2306.11695","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:38be0aa4cecb6e8d14024a4072a2f449bfa3e132051719798335d5af7681655b","observation_id":"ba842604-d1b8-4f2c-8cf8-522f9a910051","resolution":{"observed_at":"2026-08-06T22:58:09.413012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-06T22:58:09.418224Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.418224Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:4cfd675d2a270976589dd9167c00b70ad6e845f6b71e0e563527d8454de6e23a","observation_id":"8117c12d-ea32-4213-aa37-fca913643ca3","resolution":{"observed_at":"2026-08-06T22:58:09.418224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:10.118013Z","title":null,"venue":null,"work_id":"95d05316-ee35-47c6-b97d-2aa4b7a6f0f3","year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.423267Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:938f3528dfd777f849e5d170a426f4c38f7e60a64c85f03c219cb518be52bb10","observation_id":"97779b26-c304-4040-9cf9-3e50f6fbe2e3","resolution":{"observed_at":"2026-08-06T22:58:10.122649Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07378","last_updated":"2025-03-16T03:27:33Z","snapshot_observed_at":"2026-07-06T17:43:05.793351Z","submitted_at":"2024-03-12T07:31:18Z","title":"SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07378","snapshot_observed_at":"2026-08-06T22:58:09.427875Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.427875Z"},"links":{"cited_paper":"/paper/2403.07378","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:6bfc2d1dd15e140f25b72bda2f8439fc2f6fa2cef192270e7e784650dae93a60","observation_id":"d28d8526-f21d-4b60-a80e-fd3fbbe226a0","resolution":{"observed_at":"2026-08-06T22:58:09.427875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:09.432640Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.432640Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:e897046cab24595f03ae506198ae52e0a87948d1c424563528ead93ed4011fcf","observation_id":"f05e523d-2a85-458d-9ffe-ecd124e2f74f","resolution":{"observed_at":"2026-08-06T22:58:09.432640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05821","last_updated":"2025-08-28T03:57:52Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-10T08:41:24Z","title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.05821","snapshot_observed_at":"2026-08-06T22:58:09.437323Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.437323Z"},"links":{"cited_paper":"/paper/2312.05821","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:86b57e3db278740de16beb443e5a800e659f7a057f9a4e419814535674582a55","observation_id":"55316e5c-ff61-417a-94d4-380549eb3137","resolution":{"observed_at":"2026-08-06T22:58:09.437323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-07-31T00:09:56.948833Z","submitted_at":"2019-05-19T23:57:23Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07830","snapshot_observed_at":"2026-08-06T22:58:09.442335Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.442335Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:d6101b3bddfb88d504ae91a26735445a6a41a962e1af022565feadda0eb38392","observation_id":"ff815dcd-05d4-42a1-be56-6fbd8d3a6b9d","resolution":{"observed_at":"2026-08-06T22:58:09.442335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14381","last_updated":"2024-09-22T09:53:13Z","snapshot_observed_at":"2026-07-06T19:19:24.759288Z","submitted_at":"2024-09-22T09:53:13Z","title":"Investigating Layer Importance in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14381","snapshot_observed_at":"2026-08-06T22:58:09.448270Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.448270Z"},"links":{"cited_paper":"/paper/2409.14381","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:ee57db3db0bb56afd71a3bb85e2e4e060c593aa7df15eb821e706fa936dbb129","observation_id":"29aabc29-a33f-464c-ae12-608be072466e","resolution":{"observed_at":"2026-08-06T22:58:09.448270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14294","last_updated":"2024-07-19T04:47:36Z","snapshot_observed_at":"2026-07-06T18:03:47.096406Z","submitted_at":"2024-04-22T15:53:08Z","title":"A Survey on Efficient Inference for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14294","snapshot_observed_at":"2026-08-06T22:58:09.453345Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.453345Z"},"links":{"cited_paper":"/paper/2404.14294","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:5e82386ed331b0667a00aa5e0f7f1c5510b9a949b80dc3f26e85c6aa994b7aca","observation_id":"85177d1e-e8e2-491a-a0fb-14cbba7c2973","resolution":{"observed_at":"2026-08-06T22:58:09.453345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:09.458502Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.458502Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:ad8b4a37357c538b5375193670f75866000081e70c390a21a01f79bcd6423df5","observation_id":"e229cf20-4142-4772-ac9b-4cfa8819d3fc","resolution":{"observed_at":"2026-08-06T22:58:09.458502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:58:09.464521Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.464521Z"},"links":{"citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:591df69385828e5a19ad66852b991c99d1af85c817c07d5dd82dffb731ac84f5","observation_id":"7b23d971-ac29-4766-b509-7e6c7e2805ca","resolution":{"observed_at":"2026-08-06T22:58:09.464521Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T22:48:03.728468Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":43},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 3 inbound Pith citation observations for arXiv:2506.20353."}