{"as_of":"2026-08-08T05:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3aa02db4237e14bc6fee768e68fc84bedf4cadbb50965d148f1448cd5d91e712","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:16:23.075668Z","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-07-01T22:06:16.827177Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.08915","last_updated":"2024-02-26T02:51:30Z","snapshot_observed_at":"2026-07-06T16:32:23.448967Z","submitted_at":"2023-10-13T07:38:52Z","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08915","snapshot_observed_at":"2026-08-07T11:16:23.075668Z","title":"Dynamic sparse no training: Training-free fine-tuning for sparse llms, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03337","last_updated":"2025-06-03T19:29:50Z","snapshot_observed_at":"2026-08-07T11:03:19.477293Z","submitted_at":"2025-06-03T19:29:50Z","title":"Mitigating Non-IID Drift in Zeroth-Order Federated LLM Fine-Tuning with Transferable Sparsity","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:23.075668Z"},"links":{"cited_paper":"/paper/2310.08915","citing_paper":"/paper/2506.03337"},"observation_digest":"sha256:ebaaf1683f432257a46dca8f84fdfa8a83b90ae592a9f069f8ef02f9bffd4da4","observation_id":"4ca45ddc-6dd6-4a4b-aa4d-3f385f7fd442","resolution":{"observed_at":"2026-08-07T11:16:23.075668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08915","last_updated":"2024-02-26T02:51:30Z","snapshot_observed_at":"2026-07-06T16:32:23.448967Z","submitted_at":"2023-10-13T07:38:52Z","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08915","snapshot_observed_at":"2026-08-06T16:57:33.377605Z","title":"Dynamic sparse no training: Training-free fine-tuning for sparse llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.12205","last_updated":"2025-07-16T13:04:06Z","snapshot_observed_at":"2026-08-07T12:21:15.238746Z","submitted_at":"2025-07-16T13:04:06Z","title":"Toward Efficient SpMV in Sparse LLMs via Block Extraction and Compressed Storage","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T16:57:33.377605Z"},"links":{"cited_paper":"/paper/2310.08915","citing_paper":"/paper/2507.12205"},"observation_digest":"sha256:1a99edfffa4c437927ce1f612ec6c191bcbfe62d65cabecd6f94f7ced0368876","observation_id":"839236d8-5228-4f8f-9019-a9802689158d","resolution":{"observed_at":"2026-08-06T16:57:33.377605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08915","last_updated":"2024-02-26T02:51:30Z","snapshot_observed_at":"2026-07-06T16:32:23.448967Z","submitted_at":"2023-10-13T07:38:52Z","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08915","snapshot_observed_at":"2026-08-06T05:11:11.693310Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.02128","last_updated":"2025-08-04T07:22:36Z","snapshot_observed_at":"2026-08-07T06:33:30.391233Z","submitted_at":"2025-08-04T07:22:36Z","title":"Amber Pruner: Leveraging N:M Activation Sparsity for Efficient Prefill in Large Language Models","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-06T05:11:11.693310Z"},"links":{"cited_paper":"/paper/2310.08915","citing_paper":"/paper/2508.02128"},"observation_digest":"sha256:19536d7f25ce28dfe436667b08f858fa78a5bf518c24cb06a39c1be3678805c6","observation_id":"8a5aad82-a7e2-47bc-8c2b-4632188e5680","resolution":{"observed_at":"2026-08-06T05:11:11.693310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08915","last_updated":"2024-02-26T02:51:30Z","snapshot_observed_at":"2026-07-06T16:32:23.448967Z","submitted_at":"2023-10-13T07:38:52Z","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08915","snapshot_observed_at":"2026-08-04T21:06:26.915311Z","title":"Dynamic sparse no training: Training-free fine-tuning for sparse llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.08233","last_updated":"2025-09-10T02:19:56Z","snapshot_observed_at":"2026-08-06T06:55:03.018292Z","submitted_at":"2025-09-10T02:19:56Z","title":"Strategies for Improving Communication Efficiency in Distributed and Federated Learning: Compression, Local Training, and Personalization","version":1},"reference_index":250,"source":"arxiv_source","source_observed_at":"2026-08-04T21:06:26.915311Z"},"links":{"cited_paper":"/paper/2310.08915","citing_paper":"/paper/2509.08233"},"observation_digest":"sha256:edfd123c4d95c479f3f386c77597d659c244969b7b42de9683355c1b976157cc","observation_id":"7eb01700-c5d4-43e4-88fc-1862242d86c3","resolution":{"observed_at":"2026-08-04T21:06:26.915311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08915","last_updated":"2024-02-26T02:51:30Z","snapshot_observed_at":"2026-07-06T16:32:23.448967Z","submitted_at":"2023-10-13T07:38:52Z","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","version":3},"cited_work":{"arxiv_id":"2310.08915","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.08915","snapshot_observed_at":"2026-07-01T22:06:16.827177Z","title":"Dynamic sparse no training: Training-free fine-tuning for sparse llms","venue":null,"work_id":"65d0fbfd-26a2-4c9f-8921-981192d24b58","year":2024},"citing_paper":{"arxiv_id":"2604.04493","last_updated":"2026-04-06T07:36:48Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-06T07:36:48Z","title":"SLaB: Sparse-Lowrank-Binary Decomposition for Efficient Large Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T18:43:15.746399Z"},"links":{"cited_paper":"/paper/2310.08915","citing_paper":"/paper/2604.04493"},"observation_digest":"sha256:d81e57c4eeea398fc89eea50ee82d889cce6faa0263c94ead62324b7703dcddf","observation_id":"9f98ba68-47d3-4d4b-96cd-99064ff82678","resolution":{"observed_at":"2026-05-11T00:05:49.223989Z","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":"2310.08915","last_updated":"2024-02-26T02:51:30Z","snapshot_observed_at":"2026-07-06T16:32:23.448967Z","submitted_at":"2023-10-13T07:38:52Z","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","version":3},"cited_work":{"arxiv_id":"2310.08915","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.08915","snapshot_observed_at":"2026-07-01T22:06:16.827177Z","title":"Dynamic sparse no training: Training-free fine-tuning for sparse llms","venue":null,"work_id":"65d0fbfd-26a2-4c9f-8921-981192d24b58","year":2024},"citing_paper":{"arxiv_id":"2605.26632","last_updated":"2026-06-01T03:03:29Z","snapshot_observed_at":"2026-07-06T23:36:29.930024Z","submitted_at":"2026-05-26T07:09:49Z","title":"RT-Lynx: Putting the GEMM Sparsity In a Right Way for Diffusion Models","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-06-29T19:40:42.033793Z"},"links":{"cited_paper":"/paper/2310.08915","citing_paper":"/paper/2605.26632"},"observation_digest":"sha256:5de0162d00138318971d622daee8014c74a8efe6dd7185ef642c55c61437df3a","observation_id":"4ac09952-2a4c-499c-a8a6-9c8e1944693a","resolution":{"observed_at":"2026-06-29T19:43:54.707509Z","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":"2310.08915","last_updated":"2024-02-26T02:51:30Z","snapshot_observed_at":"2026-07-06T16:32:23.448967Z","submitted_at":"2023-10-13T07:38:52Z","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","version":3},"cited_work":{"arxiv_id":"2310.08915","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.08915","snapshot_observed_at":"2026-07-01T22:06:16.827177Z","title":"Dynamic sparse no training: Training-free fine-tuning for sparse llms","venue":null,"work_id":"65d0fbfd-26a2-4c9f-8921-981192d24b58","year":2024},"citing_paper":{"arxiv_id":"2606.01544","last_updated":"2026-06-01T01:44:31Z","snapshot_observed_at":"2026-07-06T23:42:07.508474Z","submitted_at":"2026-06-01T01:44:31Z","title":"CRePE: Convolution-aware Relative Importance in Post-training Pruning with Efficient Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T15:43:35.063909Z"},"links":{"cited_paper":"/paper/2310.08915","citing_paper":"/paper/2606.01544"},"observation_digest":"sha256:0866de8cf52d23ed65e59865a364327d744051b0ff586fad3e4453054986474f","observation_id":"e2aa05a2-d2e1-48bd-80b2-d71257d21897","resolution":{"observed_at":"2026-07-01T22:06:16.828733Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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/2310.08915/citation-record","integrity":"/paper/2310.08915/integrity","json":"/paper/2310.08915/citation-record.json","paper":"/paper/2310.08915"},"outbound":[],"paper":{"arxiv_id":"2310.08915","last_updated":"2024-02-26T02:51:30Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T16:32:23.448967Z","submitted_at":"2023-10-13T07:38:52Z","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2310.08915."}