{"as_of":"2026-08-18T07:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e9deddfbe97f083b4ae7650e9aaf49f368dd1a7b27a84293c4c8b3ecb29b513","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:44:32.136821Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.12216/citation-record","integrity":"/paper/2505.12216/integrity","json":"/paper/2505.12216/citation-record.json","paper":"/paper/2505.12216"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.02834","last_updated":"2024-06-23T08:45:33Z","snapshot_observed_at":"2026-08-16T14:21:31.545370Z","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-15T20:44:31.996022Z","title":"arXiv preprint arXiv:2402.02834,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:31.996022Z"},"links":{"cited_paper":"/paper/2402.02834","citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:7b0996c8dbe61c08acac00dec82e8518b60425bac91193e03a7f4d3c3cccc82d","observation_id":"38e2a364-1366-44e6-9eb5-38f3223ad163","resolution":{"observed_at":"2026-08-15T20:44:31.996022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03853","last_updated":"2024-10-11T09:43:32Z","snapshot_observed_at":"2026-08-16T14:12:14.696997Z","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-15T20:44:32.000215Z","title":"arXiv preprint arXiv:2403.03853","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:32.000215Z"},"links":{"cited_paper":"/paper/2403.03853","citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:fd99aa132dcbaf2fbbf9752727c2198255ea2db07442e3aaf465b5fa87105a23","observation_id":"9ce29c8e-504f-47db-af1b-a2b46962e63b","resolution":{"observed_at":"2026-08-15T20:44:32.000215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.17557","last_updated":"2024-10-31T11:37:49Z","snapshot_observed_at":"2026-08-14T14:43:02.130172Z","submitted_at":"2024-06-25T13:50:56Z","title":"The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.17557","snapshot_observed_at":"2026-08-15T20:44:32.106556Z","title":"arXiv preprint arXiv:2406.17557","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:32.106556Z"},"links":{"cited_paper":"/paper/2406.17557","citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:da5d63c23bfb95019f53dbf8a71f89772f023dfc78502872c1545d09bd336445","observation_id":"7a2efdac-6b4f-4fd4-a41a-6e89c241eca1","resolution":{"observed_at":"2026-08-15T20:44:32.106556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14649","last_updated":"2025-07-01T14:41:08Z","snapshot_observed_at":"2026-08-16T13:07:57.030685Z","submitted_at":"2024-10-18T17:46:37Z","title":"EvoPress: Accurate Dynamic Model Compression via Evolutionary Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14649","snapshot_observed_at":"2026-08-15T20:44:32.115409Z","title":"arXiv preprint arXiv:2410.14649","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:32.115409Z"},"links":{"cited_paper":"/paper/2410.14649","citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:4fec632c347fed7ab2457e0fd8d69872a5a50e992669491ca353e5c5a793640f","observation_id":"4b9f4fd5-1703-47c2-8ff1-acd17001c7a7","resolution":{"observed_at":"2026-08-15T20:44:32.115409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04396","last_updated":"2024-06-04T04:51:52Z","snapshot_observed_at":"2026-08-16T14:20:50.908439Z","submitted_at":"2024-02-06T20:52:12Z","title":"QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebooks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04396","snapshot_observed_at":"2026-08-15T20:44:32.123193Z","title":"arXiv preprint arXiv:2402.04396","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:32.123193Z"},"links":{"cited_paper":"/paper/2402.04396","citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:2ffcff116d3b3eb6e10b4e199057bf83564b612dda86980004851b152a643923","observation_id":"d6712259-3d05-4354-8759-50afda2488a3","resolution":{"observed_at":"2026-08-15T20:44:32.123193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05175","last_updated":"2025-06-30T22:16:39Z","snapshot_observed_at":"2026-08-16T14:54:04.707528Z","submitted_at":"2023-10-08T14:22:58Z","title":"Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05175","snapshot_observed_at":"2026-08-15T20:44:32.127470Z","title":"arXiv preprint arXiv:2310.05175","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:32.127470Z"},"links":{"cited_paper":"/paper/2310.05175","citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:b627bac84dbc3db1f35544880a01551a275610c58f8aa93d97c1c0a806730900","observation_id":"0ac7c410-f328-4c0c-b2d5-37322410a269","resolution":{"observed_at":"2026-08-15T20:44:32.127470Z","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-15T20:44:32.276494Z","title":"Transactions of the Associa- tion for Computational Linguistics, 12:1556–1577","venue":null,"work_id":"54875d27-e287-4160-8e4e-192f3b0575fb","year":2024},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:32.132173Z"},"links":{"citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:fe22d16d457cd69ae842a6a8733205c8b8ce147c0e1506e99b6d550cd1121180","observation_id":"5556c198-136c-4e34-ac83-1475d5b3fda7","resolution":{"observed_at":"2026-08-15T20:44:32.280711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:44:32.261751Z","title":"SparseGPT generates spar- sified blocks with varying sparsity levels across layers","venue":null,"work_id":"22843750-9f46-40cc-b186-698ddc541fbf","year":2023},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:32.136821Z"},"links":{"citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:df968fdc78b443521acdf24c9e085cc4eaebbc215469c2e9679db75df9d23847","observation_id":"b9fb8bea-e17b-4f0e-a736-526f62c90390","resolution":{"observed_at":"2026-08-15T20:44:32.268129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:44:32.288186Z","title":"In 15th In- ternational Conference on Scientific and Statistical Database Management, 2003., pages 141–150","venue":null,"work_id":"9d01ad49-f3d9-4940-9ccd-1f16754e7b98","year":2003},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:32.119355Z"},"links":{"citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:ec827dad3d38cb501aa0fd4a88e576613afbaa22e93c323e879679e1477ad378","observation_id":"e7ef7af7-77ce-4ae9-8a5c-52ce8f7785a0","resolution":{"observed_at":"2026-08-15T20:44:32.292280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-08-17T01:46:43.513643Z","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-15T20:44:32.101934Z","title":"arXiv preprint arXiv:1609.07843","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:32.101934Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:61fdc30b99daaae0373762cf8a9d25fadb92c1b56d271f081d07fd05f7d012d5","observation_id":"3a0d2829-fc77-4fce-a0fd-2f7d1ddc7fc8","resolution":{"observed_at":"2026-08-15T20:44:32.101934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-08-14T19:36:07.505691Z","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-15T20:44:31.986746Z","title":"arXiv preprint arXiv:1803.05457","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:31.986746Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:df492d82340b43a63183441cefa3c522fcbbf222b3044b2e254fbfbf6ff691a8","observation_id":"4bdc28a0-2ff6-4cb9-b7f0-fcd5f2a05e0c","resolution":{"observed_at":"2026-08-15T20:44:31.986746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.09299","last_updated":"2023-12-14T19:08:56Z","snapshot_observed_at":"2026-08-16T14:34:37.658133Z","submitted_at":"2023-12-14T19:08:56Z","title":"Weight subcloning: direct initialization of transformers using larger pretrained ones","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.09299","snapshot_observed_at":"2026-08-15T20:44:32.111122Z","title":"arXiv preprint arXiv:2312.09299","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:32.111122Z"},"links":{"cited_paper":"/paper/2312.09299","citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:8ddf1419be26236bb11ecaef6765d856f17ac6f671458cfa5bfcaf1a3e8a253e","observation_id":"33b7391d-9ae5-4c39-82ad-7f837963e7c7","resolution":{"observed_at":"2026-08-15T20:44:32.111122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17887","last_updated":"2025-03-03T17:02:05Z","snapshot_observed_at":"2026-08-16T14:06:10.494270Z","submitted_at":"2024-03-26T17:20:04Z","title":"The Unreasonable Ineffectiveness of the Deeper Layers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.17887","snapshot_observed_at":"2026-08-15T20:44:31.991534Z","title":"arXiv preprint arXiv:2403.17887","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:31.991534Z"},"links":{"cited_paper":"/paper/2403.17887","citing_paper":"/paper/2505.12216"},"observation_digest":"sha256:1e34fa71165503bd0a537d9bb7446545f02d99b08acc26e7201f40ddefa521b5","observation_id":"45bf08ae-5f02-4f3c-a600-d612d4339a6c","resolution":{"observed_at":"2026-08-15T20:44:31.991534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.12216","last_updated":"2025-05-25T06:23:30Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-18T05:09:53.461480Z","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":13},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2505.12216."}