{"as_of":"2026-08-07T15:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eeb3f6d67d74cb93539897a74da78a6cc152c028563973f9c83bb9dc8e2eb9ff","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:54:18.017977Z","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-04T03:19:31.599473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.10594","last_updated":"2025-05-22T04:58:06Z","snapshot_observed_at":"2026-07-06T18:31:27.512384Z","submitted_at":"2024-06-15T11:03:33Z","title":"BlockPruner: Fine-grained Pruning for Large Language Models","version":4},"cited_work":{"arxiv_id":"2406.10594","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.10594","snapshot_observed_at":"2026-07-04T03:19:31.599473Z","title":"Blockpruner: Fine- grained pruning for large language models","venue":null,"work_id":"c8e230a2-6bee-4bc9-b42a-b67a54319306","year":2025},"citing_paper":{"arxiv_id":"2505.17138","last_updated":"2026-05-18T17:05:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-22T06:12:42Z","title":"RAP: Runtime Adaptive Pruning for LLM Inference","version":5},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-22T13:20:41.739571Z"},"links":{"cited_paper":"/paper/2406.10594","citing_paper":"/paper/2505.17138"},"observation_digest":"sha256:ea6a2acb313ed9dab7e619b4223a0095031c9ebde22ccdfe5b11fac7152a34ad","observation_id":"a1da7d73-9e1b-4f14-927c-97920d2617e2","resolution":{"observed_at":"2026-05-22T13:21:35.624281Z","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":"2406.10594","last_updated":"2025-05-22T04:58:06Z","snapshot_observed_at":"2026-07-06T18:31:27.512384Z","submitted_at":"2024-06-15T11:03:33Z","title":"BlockPruner: Fine-grained Pruning for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10594","snapshot_observed_at":"2026-08-06T18:54:18.017977Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07064","last_updated":"2025-07-09T17:26:10Z","snapshot_observed_at":"2026-08-06T18:45:52.406605Z","submitted_at":"2025-07-09T17:26:10Z","title":"Boosting Parameter Efficiency in LLM-Based Recommendation through Sophisticated Pruning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T18:54:18.017977Z"},"links":{"cited_paper":"/paper/2406.10594","citing_paper":"/paper/2507.07064"},"observation_digest":"sha256:7256a062ea064b8585cff137527d97e56a92e89d4ca6daeaa0ae61120fe1118c","observation_id":"b491ff1c-699f-4a69-9c7a-544990760c87","resolution":{"observed_at":"2026-08-06T18:54:18.017977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10594","last_updated":"2025-05-22T04:58:06Z","snapshot_observed_at":"2026-07-06T18:31:27.512384Z","submitted_at":"2024-06-15T11:03:33Z","title":"BlockPruner: Fine-grained Pruning for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10594","snapshot_observed_at":"2026-08-06T05:01:16.402118Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.02381","last_updated":"2025-08-06T03:44:36Z","snapshot_observed_at":"2026-08-06T05:01:09.576100Z","submitted_at":"2025-08-04T13:08:35Z","title":"Beyond Manually Designed Pruning Policies with Second-Level Performance Prediction: A Pruning Framework for LLMs","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T05:01:16.402118Z"},"links":{"cited_paper":"/paper/2406.10594","citing_paper":"/paper/2508.02381"},"observation_digest":"sha256:5ec360bfb7b4361676753756b13ea6aa2321f39d221c68e249107cf56e2308b5","observation_id":"6fef4010-0458-46f8-96b0-18265d020eee","resolution":{"observed_at":"2026-08-06T05:01:16.402118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10594","last_updated":"2025-05-22T04:58:06Z","snapshot_observed_at":"2026-07-06T18:31:27.512384Z","submitted_at":"2024-06-15T11:03:33Z","title":"BlockPruner: Fine-grained Pruning for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10594","snapshot_observed_at":"2026-08-04T17:05:55.047920Z","title":"Blockpruner: Fine-grained pruning for large language models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11155","last_updated":"2025-09-14T08:20:48Z","snapshot_observed_at":"2026-08-04T17:05:50.271239Z","submitted_at":"2025-09-14T08:20:48Z","title":"AQUA: Attention via QUery mAgnitudes for Memory and Compute Efficient Inference in LLMs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T17:05:55.047920Z"},"links":{"cited_paper":"/paper/2406.10594","citing_paper":"/paper/2509.11155"},"observation_digest":"sha256:a1473a2b91c2dcca8099935910ea9ad2dfcaaa29a233cc869a83c2fe873dc375","observation_id":"f076a612-3a6d-4de1-9f4f-f58f04997241","resolution":{"observed_at":"2026-08-04T17:05:55.047920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10594","last_updated":"2025-05-22T04:58:06Z","snapshot_observed_at":"2026-07-06T18:31:27.512384Z","submitted_at":"2024-06-15T11:03:33Z","title":"BlockPruner: Fine-grained Pruning for Large Language Models","version":4},"cited_work":{"arxiv_id":"2406.10594","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.10594","snapshot_observed_at":"2026-07-04T03:19:31.599473Z","title":"Blockpruner: Fine- grained pruning for large language models","venue":null,"work_id":"c8e230a2-6bee-4bc9-b42a-b67a54319306","year":2025},"citing_paper":{"arxiv_id":"2606.19993","last_updated":"2026-06-18T09:31:31Z","snapshot_observed_at":"2026-08-07T06:04:20.969024Z","submitted_at":"2026-06-18T09:31:31Z","title":"Activation- and Influence-Aware Ranks (AIR): Function-Preserving SVD Compression for LLMs","version":1},"reference_index":206,"source":"arxiv_source","source_observed_at":"2026-06-26T18:09:17.414031Z"},"links":{"cited_paper":"/paper/2406.10594","citing_paper":"/paper/2606.19993"},"observation_digest":"sha256:40a48023dbe054de13e57b0fae8e3a55e6a88bb5c4bc348423e5313fa9ecfd44","observation_id":"593fc168-27a7-42b8-b745-ccab2b27d16b","resolution":{"observed_at":"2026-07-04T03:19:31.601301Z","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":"2406.10594","last_updated":"2025-05-22T04:58:06Z","snapshot_observed_at":"2026-07-06T18:31:27.512384Z","submitted_at":"2024-06-15T11:03:33Z","title":"BlockPruner: Fine-grained Pruning for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10594","snapshot_observed_at":"2026-08-06T00:09:29.407949Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.01536","last_updated":"2026-08-02T23:10:04Z","snapshot_observed_at":"2026-08-07T06:33:28.125135Z","submitted_at":"2026-08-02T23:10:04Z","title":"Celty: SpMspV GPU Kernel and SIMT Co-Design for Efficient Dual-Sparse LLM Inference","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T00:09:29.407949Z"},"links":{"cited_paper":"/paper/2406.10594","citing_paper":"/paper/2608.01536"},"observation_digest":"sha256:e9d31de120d48b6c073e39a8d2ea1e6cb9d1095a0d78186bfb33ae3f9830d7f5","observation_id":"eae9f883-b582-45c3-a052-d1e00201dc5e","resolution":{"observed_at":"2026-08-06T00:09:29.407949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.10594/citation-record","integrity":"/paper/2406.10594/integrity","json":"/paper/2406.10594/citation-record.json","paper":"/paper/2406.10594"},"outbound":[],"paper":{"arxiv_id":"2406.10594","last_updated":"2025-05-22T04:58:06Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T18:31:27.512384Z","submitted_at":"2024-06-15T11:03:33Z","title":"BlockPruner: Fine-grained Pruning for Large Language Models"},"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 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2406.10594."}