{"as_of":"2026-08-20T03:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4e67a1845495da46351a1a0c190526f5f5b3d759a925704b6289e8b6c5e8239","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:17:58.459309Z","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-24T06:34:01.028840Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.07259","last_updated":"2022-10-17T23:24:22Z","snapshot_observed_at":"2026-08-19T11:06:08.255035Z","submitted_at":"2022-03-14T16:40:31Z","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":"2203.07259","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.07259","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The optimal bert surgeon: Scalable and accurate second-order pruning for large language models","venue":null,"work_id":"6d8c300d-8845-448b-9827-06b347e8da30","year":2022},"citing_paper":{"arxiv_id":"2310.02277","last_updated":"2026-04-30T14:28:10Z","snapshot_observed_at":"2026-08-15T00:50:40.778054Z","submitted_at":"2023-09-29T22:55:06Z","title":"Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs \"Difficult\" Downstream Tasks in LLMs","version":4},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-24T06:33:48.456209Z"},"links":{"cited_paper":"/paper/2203.07259","citing_paper":"/paper/2310.02277"},"observation_digest":"sha256:3be69b31ba0c05ce83e25a89b0c71ad25e6477907fdd20bf378ae3666bb955ac","observation_id":"6226168c-6a08-4d79-a6b4-492d57de9818","resolution":{"observed_at":"2026-05-24T06:34:01.032445Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07259","last_updated":"2022-10-17T23:24:22Z","snapshot_observed_at":"2026-08-19T11:06:08.255035Z","submitted_at":"2022-03-14T16:40:31Z","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":"2203.07259","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.07259","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The optimal bert surgeon: Scalable and accurate second-order pruning for large language models","venue":null,"work_id":"6d8c300d-8845-448b-9827-06b347e8da30","year":2022},"citing_paper":{"arxiv_id":"2401.15077","last_updated":"2025-03-04T13:58:39Z","snapshot_observed_at":"2026-08-03T09:40:31.365295Z","submitted_at":"2024-01-26T18:59:01Z","title":"EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty","version":3},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-15T00:15:49.303458Z"},"links":{"cited_paper":"/paper/2203.07259","citing_paper":"/paper/2401.15077"},"observation_digest":"sha256:620d7410ceb8e7f61546d20d8f5b6eac66330b436d7bb0148d842f9cf7da78e1","observation_id":"e6e6223d-1b77-4d2a-9aac-03324add31f4","resolution":{"observed_at":"2026-05-15T00:15:49.356462Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07259","last_updated":"2022-10-17T23:24:22Z","snapshot_observed_at":"2026-08-19T11:06:08.255035Z","submitted_at":"2022-03-14T16:40:31Z","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07259","snapshot_observed_at":"2026-08-12T12:00:00.049894Z","title":"The optimal BERT surgeon: Scalable and accurate second-order pruning for large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.17796","last_updated":"2024-11-26T17:54:02Z","snapshot_observed_at":"2026-08-17T16:17:22.951981Z","submitted_at":"2024-11-26T17:54:02Z","title":"Scalable iterative pruning of large language and vision models using block coordinate descent","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:00:00.049894Z"},"links":{"cited_paper":"/paper/2203.07259","citing_paper":"/paper/2411.17796"},"observation_digest":"sha256:38020373b498fc28dffb84d46598e626b711a326110b9a196801bdb64308ed7e","observation_id":"b8f15d4d-240d-45a0-b419-51ff8fa59b4c","resolution":{"observed_at":"2026-08-12T12:00:00.049894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07259","last_updated":"2022-10-17T23:24:22Z","snapshot_observed_at":"2026-08-19T11:06:08.255035Z","submitted_at":"2022-03-14T16:40:31Z","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07259","snapshot_observed_at":"2026-08-09T17:26:45.362597Z","title":"The optimal bert surgeon: Scalable and accurate second-order pruning for large language models, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.00899","last_updated":"2025-02-02T20:23:32Z","snapshot_observed_at":"2026-08-17T14:09:12.832357Z","submitted_at":"2025-02-02T20:23:32Z","title":"HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T17:26:45.362597Z"},"links":{"cited_paper":"/paper/2203.07259","citing_paper":"/paper/2502.00899"},"observation_digest":"sha256:ea3360082395b2c4761c358c0fd7e47ef0ba03981fdc9d4e3bc84a7741d5fee6","observation_id":"a46df798-23c3-4dbe-a153-7dfaf4fb688a","resolution":{"observed_at":"2026-08-09T17:26:45.362597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07259","last_updated":"2022-10-17T23:24:22Z","snapshot_observed_at":"2026-08-19T11:06:08.255035Z","submitted_at":"2022-03-14T16:40:31Z","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07259","snapshot_observed_at":"2026-08-08T11:39:09.502096Z","title":"The optimal bert surgeon: Scalable and accurate second-order pruning for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.07780","last_updated":"2026-07-15T12:46:32Z","snapshot_observed_at":"2026-08-16T11:18:36.530410Z","submitted_at":"2025-02-11T18:59:35Z","title":"DarwinLM: Evolutionary Structured Pruning of Large Language Models","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T11:39:09.502096Z"},"links":{"cited_paper":"/paper/2203.07259","citing_paper":"/paper/2502.07780"},"observation_digest":"sha256:f073e64971cc0718ae382cab270abec872011be39e5e9511a46953c8059fd990","observation_id":"fcaebf1a-5306-4fd8-ad94-9dc109472f79","resolution":{"observed_at":"2026-08-08T11:39:09.502096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07259","last_updated":"2022-10-17T23:24:22Z","snapshot_observed_at":"2026-08-19T11:06:08.255035Z","submitted_at":"2022-03-14T16:40:31Z","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07259","snapshot_observed_at":"2026-08-16T04:17:58.459309Z","title":"The optimal bert surgeon: Scalable and accurate second-order pruning for large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.01731","last_updated":"2025-05-21T01:38:25Z","snapshot_observed_at":"2026-08-18T17:32:11.138384Z","submitted_at":"2025-05-03T07:57:02Z","title":"Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T04:17:58.459309Z"},"links":{"cited_paper":"/paper/2203.07259","citing_paper":"/paper/2505.01731"},"observation_digest":"sha256:034bbf59f0f53ceda85584a8ed833f1ecb7a456ae3b75f2182dd58add09003c2","observation_id":"bfc4e564-f8bc-44de-89d9-16f5790c9a7e","resolution":{"observed_at":"2026-08-16T04:17:58.459309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07259","last_updated":"2022-10-17T23:24:22Z","snapshot_observed_at":"2026-08-19T11:06:08.255035Z","submitted_at":"2022-03-14T16:40:31Z","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07259","snapshot_observed_at":"2026-08-15T21:04:26.088585Z","title":"Hong Liu, Zhiyuan Li, David Hall, Percy Liang, and Tengyu Ma","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11564","last_updated":"2025-05-16T08:27:43Z","snapshot_observed_at":"2026-08-19T11:05:41.803912Z","submitted_at":"2025-05-16T08:27:43Z","title":"HessFormer: Hessians at Foundation Scale","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:04:26.088585Z"},"links":{"cited_paper":"/paper/2203.07259","citing_paper":"/paper/2505.11564"},"observation_digest":"sha256:30be9c0ddba9f3d9c4db20eaed3fd33de83a596e121e6dd0511d43f41dbed9b4","observation_id":"9a16a874-0005-47f3-94ae-98b9e092b88f","resolution":{"observed_at":"2026-08-15T21:04:26.088585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07259","last_updated":"2022-10-17T23:24:22Z","snapshot_observed_at":"2026-08-19T11:06:08.255035Z","submitted_at":"2022-03-14T16:40:31Z","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07259","snapshot_observed_at":"2026-08-06T23:03:15.433831Z","title":"Kurtic, D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20037","last_updated":"2025-06-24T22:24:47Z","snapshot_observed_at":"2026-08-18T11:52:11.250345Z","submitted_at":"2025-06-24T22:24:47Z","title":"Verifiable Unlearning on Edge","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T23:03:15.433831Z"},"links":{"cited_paper":"/paper/2203.07259","citing_paper":"/paper/2506.20037"},"observation_digest":"sha256:bc414487f3644b69e89eb421212610f65e9300aabe012221c1dc7379e812a1c3","observation_id":"037adfac-1b6b-4651-a3f0-996dbbaf1ffc","resolution":{"observed_at":"2026-08-06T23:03:15.433831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07259","last_updated":"2022-10-17T23:24:22Z","snapshot_observed_at":"2026-08-19T11:06:08.255035Z","submitted_at":"2022-03-14T16:40:31Z","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07259","snapshot_observed_at":"2026-08-01T17:12:33.850789Z","title":"arXiv preprint arXiv:2203.07259 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17733","last_updated":"2026-07-20T09:23:10Z","snapshot_observed_at":"2026-08-20T01:37:42.473116Z","submitted_at":"2026-07-20T09:23:10Z","title":"MXSens: Sensitivity-Aware Mixed-Precision Quantization for Efficient LLM Inference","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T17:12:33.850789Z"},"links":{"cited_paper":"/paper/2203.07259","citing_paper":"/paper/2607.17733"},"observation_digest":"sha256:ff23095f4df351efdbaa8ce86ce2f471114b89ddd1125e3a9dd57eaaa167962a","observation_id":"3d797cb1-e33a-4b9f-96dc-1652136e8d05","resolution":{"observed_at":"2026-08-01T17:12:33.850789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2203.07259/citation-record","integrity":"/paper/2203.07259/integrity","json":"/paper/2203.07259/citation-record.json","paper":"/paper/2203.07259"},"outbound":[],"paper":{"arxiv_id":"2203.07259","last_updated":"2022-10-17T23:24:22Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-19T11:06:08.255035Z","submitted_at":"2022-03-14T16:40:31Z","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2203.07259."}