{"as_of":"2026-08-08T11:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:894c2bcac9a50f764224f38fc7271052d7bdb99aa50faf1201c5710bafef5805","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:11:58.490081Z","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-06-28T19:02:34.540502Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2204.00408","last_updated":"2022-05-02T19:21:13Z","snapshot_observed_at":"2026-08-02T16:36:17.936691Z","submitted_at":"2022-04-01T13:09:56Z","title":"Structured Pruning Learns Compact and Accurate Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.00408","snapshot_observed_at":"2026-08-06T22:11:58.490081Z","title":"Structured pruning learns compact and accurate models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.22255","last_updated":"2025-06-27T14:24:01Z","snapshot_observed_at":"2026-08-06T22:05:33.236884Z","submitted_at":"2025-06-27T14:24:01Z","title":"Projected Compression: Trainable Projection for Efficient Transformer Compression","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:11:58.490081Z"},"links":{"cited_paper":"/paper/2204.00408","citing_paper":"/paper/2506.22255"},"observation_digest":"sha256:4da91165ec55d9aa43ed3627dcd5c780867555f029c2e411f10e160cf7738b21","observation_id":"fa19ff03-e060-4162-a87b-09a05543d1b0","resolution":{"observed_at":"2026-08-06T22:11:58.490081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.00408","last_updated":"2022-05-02T19:21:13Z","snapshot_observed_at":"2026-08-02T16:36:17.936691Z","submitted_at":"2022-04-01T13:09:56Z","title":"Structured Pruning Learns Compact and Accurate Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.00408","snapshot_observed_at":"2026-08-06T20:59:02.848131Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.01438","last_updated":"2025-07-02T07:47:28Z","snapshot_observed_at":"2026-08-06T20:49:01.786008Z","submitted_at":"2025-07-02T07:47:28Z","title":"EdgeLoRA: An Efficient Multi-Tenant LLM Serving System on Edge Devices","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-06T20:59:02.848131Z"},"links":{"cited_paper":"/paper/2204.00408","citing_paper":"/paper/2507.01438"},"observation_digest":"sha256:e958764c50b7824f42d634247e5136a6f5afe93b41ed6e287b57e41cc60f5e18","observation_id":"e57df223-99ed-4b89-8ea7-69d3d8776c19","resolution":{"observed_at":"2026-08-06T20:59:02.848131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.00408","last_updated":"2022-05-02T19:21:13Z","snapshot_observed_at":"2026-08-02T16:36:17.936691Z","submitted_at":"2022-04-01T13:09:56Z","title":"Structured Pruning Learns Compact and Accurate Models","version":3},"cited_work":{"arxiv_id":"2204.00408","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.00408","snapshot_observed_at":"2026-06-28T19:02:34.540502Z","title":"Structured pruning learns compact and accurate models.arXiv preprint arXiv:2204.00408","venue":null,"work_id":"27010574-2037-41f0-b345-187f586cd460","year":null},"citing_paper":{"arxiv_id":"2510.08008","last_updated":"2026-05-15T08:53:04Z","snapshot_observed_at":"2026-08-03T22:05:31.756040Z","submitted_at":"2025-10-09T09:45:45Z","title":"Beyond Sunk Costs: Boosting LLM Pre-training Efficiency via Orthogonal Growth of Mixture-of-Experts","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-21T20:36:22.974054Z"},"links":{"cited_paper":"/paper/2204.00408","citing_paper":"/paper/2510.08008"},"observation_digest":"sha256:4667b1505abca7fde606240e717d9e61337b0e1d43a6c28026d020d6bce7729f","observation_id":"608b344a-220c-4b94-ad99-0ce204877e42","resolution":{"observed_at":"2026-05-21T20:40:36.512250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.00408","last_updated":"2022-05-02T19:21:13Z","snapshot_observed_at":"2026-08-02T16:36:17.936691Z","submitted_at":"2022-04-01T13:09:56Z","title":"Structured Pruning Learns Compact and Accurate Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.00408","snapshot_observed_at":"2026-08-03T06:01:16.388311Z","title":"Structured Pruning Learns Compact and Accurate Models.arXiv, cs/2204.00408: 1–16,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.00942","last_updated":"2026-05-28T22:25:40Z","snapshot_observed_at":"2026-08-06T17:02:26.888999Z","submitted_at":"2026-02-01T00:00:11Z","title":"SALAAD: Sparse And Low-Rank Adaptation via ADMM for Large Language Model Inference","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T06:01:16.388311Z"},"links":{"cited_paper":"/paper/2204.00408","citing_paper":"/paper/2602.00942"},"observation_digest":"sha256:ae75f3c028822f03f8b6130d543466635e05abdbe969b797a0bb5cfff72fe83f","observation_id":"7f6d88e5-8006-46f0-89a2-578f60f73887","resolution":{"observed_at":"2026-08-03T06:01:16.388311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.00408","last_updated":"2022-05-02T19:21:13Z","snapshot_observed_at":"2026-08-02T16:36:17.936691Z","submitted_at":"2022-04-01T13:09:56Z","title":"Structured Pruning Learns Compact and Accurate Models","version":3},"cited_work":{"arxiv_id":"2204.00408","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.00408","snapshot_observed_at":"2026-06-28T19:02:34.540502Z","title":"Structured pruning learns compact and accurate models.arXiv preprint arXiv:2204.00408","venue":null,"work_id":"27010574-2037-41f0-b345-187f586cd460","year":null},"citing_paper":{"arxiv_id":"2606.00535","last_updated":"2026-05-30T05:05:24Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:05:24Z","title":"DREAM-S: Speculative Decoding with Searchable Drafting and Target-Aware Refinement for Multimodal Generation","version":1},"reference_index":141,"source":"arxiv_source","source_observed_at":"2026-06-28T18:55:51.474956Z"},"links":{"cited_paper":"/paper/2204.00408","citing_paper":"/paper/2606.00535"},"observation_digest":"sha256:3c721dc55ffce3c8c905facfba190dd411326827636c8e456bb64a88f412d05d","observation_id":"21be61e3-d804-4d25-a5f5-307f56c6c89e","resolution":{"observed_at":"2026-06-28T19:02:34.541777Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2204.00408/citation-record","integrity":"/paper/2204.00408/integrity","json":"/paper/2204.00408/citation-record.json","paper":"/paper/2204.00408"},"outbound":[],"paper":{"arxiv_id":"2204.00408","last_updated":"2022-05-02T19:21:13Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-02T16:36:17.936691Z","submitted_at":"2022-04-01T13:09:56Z","title":"Structured Pruning Learns Compact and Accurate 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2204.00408."}