{"as_of":"2026-08-09T11:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a437bb6622324f52b3bc27b3d543d3a6dd4c84ee186ed32d671e6f053646ba42","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:30:19.050049Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":3,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-07T13:30:19.050049Z","title":"Compressing large language models by streamlining the unimportant layer","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.050049Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:0f515ea46f78140bfe187634606a5d34b0b2582e79727c24b8df36b4061c8a70","observation_id":"c6e43979-3966-4e2b-a5da-b8f2a4b90edd","resolution":{"observed_at":"2026-08-07T13:30:19.050049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-07T10:51:51.433698Z","title":"Compressing large language models by streamlining the unimportant layer","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04179","last_updated":"2025-06-04T17:26:31Z","snapshot_observed_at":"2026-08-08T19:35:37.122227Z","submitted_at":"2025-06-04T17:26:31Z","title":"SkipGPT: Dynamic Layer Pruning Reinvented with Token Awareness and Module Decoupling","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:51:51.433698Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2506.04179"},"observation_digest":"sha256:cd0e3942d24facd7731e8f8e5b1110a6d56c408baa6bf5132b0e244bc5dc0491","observation_id":"567103ee-da14-48b1-994e-2e33bbada56b","resolution":{"observed_at":"2026-08-07T10:51:51.433698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-07T10:20:23.334815Z","title":"Streamlining redundant layers to compress large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05641","last_updated":"2025-06-06T00:05:38Z","snapshot_observed_at":"2026-08-07T22:21:58.673015Z","submitted_at":"2025-06-06T00:05:38Z","title":"Projectable Models: One-Shot Generation of Small Specialized Transformers from Large Ones","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:20:23.334815Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2506.05641"},"observation_digest":"sha256:26b46d631b57a7581b48235d1248a534f0708b2c9670b5fc98e176a0ef34968b","observation_id":"4cc4256c-a7b8-4d46-9afe-4135f99a4ca6","resolution":{"observed_at":"2026-08-07T10:20:23.334815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-06T14:48:28.208165Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:28.208165Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:827443cafa073c9d3b1cd8a249c03f5aa231548c1f0ff59bea08ad6fa4416063","observation_id":"49a42d07-a58b-4e49-9cf0-388dc536869d","resolution":{"observed_at":"2026-08-06T14:48:28.208165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-06T10:55:18.094704Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.23362","last_updated":"2025-07-31T09:17:53Z","snapshot_observed_at":"2026-08-08T14:50:30.917971Z","submitted_at":"2025-07-31T09:17:53Z","title":"Short-LVLM: Compressing and Accelerating Large Vision-Language Models by Pruning Redundant Layers","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T10:55:18.094704Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2507.23362"},"observation_digest":"sha256:0fe7f623459c2d614509142b41ee8ef2b4efe2026580933c8a785794c76688f1","observation_id":"2c9511e9-cd8f-4a98-a2a2-b3d273406492","resolution":{"observed_at":"2026-08-06T10:55:18.094704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":"2403.19135","doi":"10.48550/arxiv.2403.19135","metadata_source":"arxiv_reference","pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Streamlining redundant layers to compress large language models.arXiv preprint arXiv:2403.19135","venue":"arXiv (Cornell University)","work_id":"9d96ce32-98b7-4c64-adf5-9806b82d3233","year":2024},"citing_paper":{"arxiv_id":"2602.01997","last_updated":"2026-08-06T07:02:58Z","snapshot_observed_at":"2026-08-09T10:09:31.595090Z","submitted_at":"2026-02-02T11:57:22Z","title":"On the Limits of Layer Pruning for Generative Reasoning in Large Language Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T08:40:24.822863Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2602.01997"},"observation_digest":"sha256:ad3ab3c5ebf90cf839e997c9c1a55d037b0e96708cf3cc095915ef24aec3147b","observation_id":"59f40061-b6f2-4e58-aaf8-8fc44800932a","resolution":{"observed_at":"2026-05-16T08:40:46.188779Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":"2403.19135","doi":"10.48550/arxiv.2403.19135","metadata_source":"arxiv_reference","pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Streamlining redundant layers to compress large language models.arXiv preprint arXiv:2403.19135","venue":"arXiv (Cornell University)","work_id":"9d96ce32-98b7-4c64-adf5-9806b82d3233","year":2024},"citing_paper":{"arxiv_id":"2605.25344","last_updated":"2026-08-02T13:40:15Z","snapshot_observed_at":"2026-08-06T23:24:41.987610Z","submitted_at":"2026-05-25T02:00:41Z","title":"A Hamiltonian-Inspired Local-Operator Ansatz for Slimming Large Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T23:00:21.397982Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2605.25344"},"observation_digest":"sha256:2dd0bbc2db9c3b20affdbaaa41e96bce0ee969f6d4b7049b4d0685aa1ebdaf5f","observation_id":"1e7528d4-126e-4adc-8b72-d00acb658c02","resolution":{"observed_at":"2026-06-29T23:04:01.071339Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-04T05:01:02.972092Z","title":"ht tps://arxiv.org/abs/2403.19135","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.25344","last_updated":"2026-08-02T13:40:15Z","snapshot_observed_at":"2026-08-06T23:24:41.987610Z","submitted_at":"2026-05-25T02:00:41Z","title":"A Hamiltonian-Inspired Local-Operator Ansatz for Slimming Large Language Models","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T05:01:02.972092Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2605.25344"},"observation_digest":"sha256:126d740ef2b4f2270f69245caf7512d2ecd56e092a6dd2349a51ad73ec163b76","observation_id":"57064e4b-035f-4ee1-a172-47512001f9c4","resolution":{"observed_at":"2026-08-04T05:01:02.972092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":"2403.19135","doi":"10.48550/arxiv.2403.19135","metadata_source":"arxiv_reference","pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Streamlining redundant layers to compress large language models.arXiv preprint arXiv:2403.19135","venue":"arXiv (Cornell University)","work_id":"9d96ce32-98b7-4c64-adf5-9806b82d3233","year":2024},"citing_paper":{"arxiv_id":"2605.26496","last_updated":"2026-05-26T03:19:04Z","snapshot_observed_at":"2026-07-06T23:36:20.072253Z","submitted_at":"2026-05-26T03:19:04Z","title":"Dense2MoE: Pushing the Pareto Frontier of On-Device LLMs via Unified Pruning and Upcycling","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T19:34:17.270161Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2605.26496"},"observation_digest":"sha256:963b7496f82c1357dc4e0f58d99bfe0f3d11b328802b9b51eb0163b7d4fa9bca","observation_id":"54a4ea46-4664-436b-a2a3-ae80b4d5b0cb","resolution":{"observed_at":"2026-06-29T19:43:55.050399Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":"2403.19135","doi":"10.48550/arxiv.2403.19135","metadata_source":"arxiv_reference","pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Streamlining redundant layers to compress large language models.arXiv preprint arXiv:2403.19135","venue":"arXiv (Cornell University)","work_id":"9d96ce32-98b7-4c64-adf5-9806b82d3233","year":2024},"citing_paper":{"arxiv_id":"2606.20246","last_updated":"2026-06-18T13:57:12Z","snapshot_observed_at":"2026-08-05T09:17:49.575980Z","submitted_at":"2026-06-18T13:57:12Z","title":"Finetuning Vision-Language-Action Models Requires Fewer Layers Than You Think","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-26T16:59:28.243515Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2606.20246"},"observation_digest":"sha256:beceef0079e524dffb0f05458cdce5e9ce616f44fdebce63de2e36ef3ae779b2","observation_id":"9cbff2c7-a761-444e-9274-8e25d7ebb107","resolution":{"observed_at":"2026-07-04T04:29:34.941369Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":"2403.19135","doi":"10.48550/arxiv.2403.19135","metadata_source":"arxiv_reference","pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Streamlining redundant layers to compress large language models.arXiv preprint arXiv:2403.19135","venue":"arXiv (Cornell University)","work_id":"9d96ce32-98b7-4c64-adf5-9806b82d3233","year":2024},"citing_paper":{"arxiv_id":"2606.26538","last_updated":"2026-06-25T02:25:00Z","snapshot_observed_at":"2026-07-07T00:00:51.779266Z","submitted_at":"2026-06-25T02:25:00Z","title":"CascadeFormer: Depth-Tapered Transformers Motivated by Gradient Fan-in Asymmetry","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-26T05:22:26.818078Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2606.26538"},"observation_digest":"sha256:0cca624ce74dfebf356a51aa30a6c65a8980292317359ca6dcf46f9232d292ab","observation_id":"47d70c76-ea28-44b2-8c97-4039edb599ae","resolution":{"observed_at":"2026-06-26T05:29:00.039148Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.19135/citation-record","integrity":"/paper/2403.19135/integrity","json":"/paper/2403.19135/citation-record.json","paper":"/paper/2403.19135"},"outbound":[],"paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","latest_version":5,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T23:34:03.531276Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2403.19135."}