{"as_of":"2026-08-14T23:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:356ef8faff5ed5d7cb1e51ae9ec879e5219db520856e9adf126bf50d1e94157e","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-14T06:32:32.682623+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-05T23:34:05.422247Z","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.085306Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.05754","last_updated":"2021-11-10T15:52:40Z","snapshot_observed_at":"2026-08-13T17:36:02.815074Z","submitted_at":"2021-11-10T15:52:40Z","title":"Prune Once for All: Sparse Pre-Trained Language Models","version":1},"cited_work":{"arxiv_id":"2111.05754","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.05754","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prune once for all: Sparse pre-trained language models","venue":null,"work_id":"abccd1aa-8053-4835-8987-095db778bb71","year":2021},"citing_paper":{"arxiv_id":"2310.02277","last_updated":"2026-04-30T14:28:10Z","snapshot_observed_at":"2026-07-31T12:44:57.623721Z","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":57,"source":"arxiv_source","source_observed_at":"2026-05-24T06:33:48.456209Z"},"links":{"cited_paper":"/paper/2111.05754","citing_paper":"/paper/2310.02277"},"observation_digest":"sha256:2ab70389c95504b9ef99d668b554145af7b55144e039620c60a93e5c3b7428c0","observation_id":"ab782af0-5a3f-4b23-85c7-4fa18ff0f453","resolution":{"observed_at":"2026-05-24T06:34:01.088473Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.05754","last_updated":"2021-11-10T15:52:40Z","snapshot_observed_at":"2026-08-13T17:36:02.815074Z","submitted_at":"2021-11-10T15:52:40Z","title":"Prune Once for All: Sparse Pre-Trained Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.05754","snapshot_observed_at":"2026-08-05T23:34:05.422247Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.05239","last_updated":"2025-08-07T10:27:01Z","snapshot_observed_at":"2026-08-08T15:27:25.573652Z","submitted_at":"2025-08-07T10:27:01Z","title":"Pruning Large Language Models by Identifying and Preserving Functional Networks","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T23:34:05.422247Z"},"links":{"cited_paper":"/paper/2111.05754","citing_paper":"/paper/2508.05239"},"observation_digest":"sha256:d7271d3c4ac34ee4d6988397200fa1654a286002f7c9283e16d8ca3abf85de60","observation_id":"6780cff8-c7b8-4e90-9fa0-c0bf9dbcaf9b","resolution":{"observed_at":"2026-08-05T23:34:05.422247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.05754","last_updated":"2021-11-10T15:52:40Z","snapshot_observed_at":"2026-08-13T17:36:02.815074Z","submitted_at":"2021-11-10T15:52:40Z","title":"Prune Once for All: Sparse Pre-Trained Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.05754","snapshot_observed_at":"2026-08-05T21:08:18.724499Z","title":"Prune once for all: Sparse pre-trained language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.09471","last_updated":"2025-08-13T04:00:56Z","snapshot_observed_at":"2026-08-09T15:34:29.981759Z","submitted_at":"2025-08-13T04:00:56Z","title":"EGGS-PTP: An Expander-Graph Guided Structured Post-training Pruning Method for Large Language Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T21:08:18.724499Z"},"links":{"cited_paper":"/paper/2111.05754","citing_paper":"/paper/2508.09471"},"observation_digest":"sha256:d4698fc0a552fe9136b0753d1764e4dba8364e33d276c00e46b099220f26e8e9","observation_id":"30829f63-1c4d-4676-b8d4-9bb57c7ed39b","resolution":{"observed_at":"2026-08-05T21:08:18.724499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.05754","last_updated":"2021-11-10T15:52:40Z","snapshot_observed_at":"2026-08-13T17:36:02.815074Z","submitted_at":"2021-11-10T15:52:40Z","title":"Prune Once for All: Sparse Pre-Trained Language Models","version":1},"cited_work":{"arxiv_id":"2111.05754","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.05754","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prune once for all: Sparse pre-trained language models","venue":null,"work_id":"abccd1aa-8053-4835-8987-095db778bb71","year":2021},"citing_paper":{"arxiv_id":"2512.12744","last_updated":"2026-05-21T01:18:21Z","snapshot_observed_at":"2026-08-14T14:25:19.742080Z","submitted_at":"2025-12-14T15:47:40Z","title":"Resting Neurons, Active Insights: Robustifying Activation Sparsity in LLMs via Spontaneity","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-16T22:19:25.483640Z"},"links":{"cited_paper":"/paper/2111.05754","citing_paper":"/paper/2512.12744"},"observation_digest":"sha256:6bbafd0e9e4bd6948deca35bde86556d199d9bad2876f8bb5d82ede15930e752","observation_id":"221e9d06-6313-4778-8efe-403e7fe44d6a","resolution":{"observed_at":"2026-05-16T22:21:19.024131Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.05754","last_updated":"2021-11-10T15:52:40Z","snapshot_observed_at":"2026-08-13T17:36:02.815074Z","submitted_at":"2021-11-10T15:52:40Z","title":"Prune Once for All: Sparse Pre-Trained Language Models","version":1},"cited_work":{"arxiv_id":"2111.05754","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.05754","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prune once for all: Sparse pre-trained language models","venue":null,"work_id":"abccd1aa-8053-4835-8987-095db778bb71","year":2021},"citing_paper":{"arxiv_id":"2512.12744","last_updated":"2026-05-21T01:18:21Z","snapshot_observed_at":"2026-08-14T14:25:19.742080Z","submitted_at":"2025-12-14T15:47:40Z","title":"Resting Neurons, Active Insights: Robustifying Activation Sparsity in LLMs via Spontaneity","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-22T11:54:29.436149Z"},"links":{"cited_paper":"/paper/2111.05754","citing_paper":"/paper/2512.12744"},"observation_digest":"sha256:fe7c797ff112dce0307d1e4a66789656f2cdb753759b910e2ca99ea6d7af33bd","observation_id":"ecff095c-910a-4899-bf92-cdef98be5975","resolution":{"observed_at":"2026-05-22T11:54:51.100662Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.05754","last_updated":"2021-11-10T15:52:40Z","snapshot_observed_at":"2026-08-13T17:36:02.815074Z","submitted_at":"2021-11-10T15:52:40Z","title":"Prune Once for All: Sparse Pre-Trained Language Models","version":1},"cited_work":{"arxiv_id":"2111.05754","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.05754","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prune once for all: Sparse pre-trained language models","venue":null,"work_id":"abccd1aa-8053-4835-8987-095db778bb71","year":2021},"citing_paper":{"arxiv_id":"2604.02501","last_updated":"2026-04-02T20:09:05Z","snapshot_observed_at":"2026-08-13T02:46:52.812414Z","submitted_at":"2026-04-02T20:09:05Z","title":"ECG Foundation Models and Medical LLMs for Agentic Cardiovascular Intelligence at the Edge: A Review and Outlook","version":1},"reference_index":109,"source":"pdf_text","source_observed_at":"2026-05-13T20:23:15.138933Z"},"links":{"cited_paper":"/paper/2111.05754","citing_paper":"/paper/2604.02501"},"observation_digest":"sha256:0def143fc895e966c232aa21895ab5e5cbcdf368ae7274e5f76d8849162fc4c1","observation_id":"a13485af-abc4-4ae8-bbc4-0665e8db7976","resolution":{"observed_at":"2026-05-13T20:28:14.181179Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.05754","last_updated":"2021-11-10T15:52:40Z","snapshot_observed_at":"2026-08-13T17:36:02.815074Z","submitted_at":"2021-11-10T15:52:40Z","title":"Prune Once for All: Sparse Pre-Trained Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.05754","snapshot_observed_at":"2026-08-01T05:19:34.039471Z","title":"Prune once for all: Sparse pre-trained language models,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22790","last_updated":"2026-07-24T13:12:07Z","snapshot_observed_at":"2026-08-09T18:16:21.959284Z","submitted_at":"2026-07-24T13:12:07Z","title":"The Sparsity Tax: Weight Sparsity Trade-offs in Event-Driven SIMD and SIMT Neuromorphic Cores","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T05:19:34.039471Z"},"links":{"cited_paper":"/paper/2111.05754","citing_paper":"/paper/2607.22790"},"observation_digest":"sha256:f8b5ee28ca577aa059f13f86a8fb6bc83fb341e0f5a18e73a382df27e5d0147a","observation_id":"dd2e4c22-7a51-4002-8c12-0e8f61ebefb2","resolution":{"observed_at":"2026-08-01T05:19:34.039471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2111.05754/citation-record","integrity":"/paper/2111.05754/integrity","json":"/paper/2111.05754/citation-record.json","paper":"/paper/2111.05754"},"outbound":[],"paper":{"arxiv_id":"2111.05754","last_updated":"2021-11-10T15:52:40Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T17:36:02.815074Z","submitted_at":"2021-11-10T15:52:40Z","title":"Prune Once for All: Sparse Pre-Trained 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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2111.05754."}