{"as_of":"2026-08-07T10:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b3d1e2022bc4a4f08844dc43f89d8217060edaf66035147c2f62972ac8fb5ffb","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:54:14.254607Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T12:07:03.716884Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.02086","last_updated":"2025-06-02T21:33:43Z","snapshot_observed_at":"2026-08-02T20:26:29.728788Z","submitted_at":"2025-01-03T20:19:14Z","title":"Instruction-Following Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.02086","snapshot_observed_at":"2026-08-06T18:54:14.254607Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.07064","last_updated":"2025-07-09T17:26:10Z","snapshot_observed_at":"2026-08-06T18:45:52.406605Z","submitted_at":"2025-07-09T17:26:10Z","title":"Boosting Parameter Efficiency in LLM-Based Recommendation through Sophisticated Pruning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:54:14.254607Z"},"links":{"cited_paper":"/paper/2501.02086","citing_paper":"/paper/2507.07064"},"observation_digest":"sha256:cb88b4b5451e76e8509171bdea509030bf177cd6e706dc0200bf3d2ed930cf30","observation_id":"04212e8d-8b81-405f-b888-4f7744e76d8c","resolution":{"observed_at":"2026-08-06T18:54:14.254607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.02086","last_updated":"2025-06-02T21:33:43Z","snapshot_observed_at":"2026-08-02T20:26:29.728788Z","submitted_at":"2025-01-03T20:19:14Z","title":"Instruction-Following Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":"2501.02086","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.02086","snapshot_observed_at":"2026-07-10T12:07:03.716884Z","title":"arXiv:2501.02086 [cs]","venue":"cs.CL","work_id":"02691984-32c8-421a-9573-d3d1b1f3334e","year":2025},"citing_paper":{"arxiv_id":"2512.22671","last_updated":"2026-05-06T11:17:35Z","snapshot_observed_at":"2026-08-02T20:24:07.326890Z","submitted_at":"2025-12-27T18:09:57Z","title":"Fragile Knowledge, Robust Instruction-Following: The Width Pruning Dichotomy in Llama-3.2","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-16T18:55:48.540435Z"},"links":{"cited_paper":"/paper/2501.02086","citing_paper":"/paper/2512.22671"},"observation_digest":"sha256:a5d75a862a6f2fce58c65dd8abdebcb9c41e9e1d100b4dbbcb383c92a65cff21","observation_id":"9d632509-9cc7-4abe-9675-f75f8954adf7","resolution":{"observed_at":"2026-05-16T18:58:19.017918Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.02086","last_updated":"2025-06-02T21:33:43Z","snapshot_observed_at":"2026-08-02T20:26:29.728788Z","submitted_at":"2025-01-03T20:19:14Z","title":"Instruction-Following Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":"2501.02086","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.02086","snapshot_observed_at":"2026-07-10T12:07:03.716884Z","title":"arXiv:2501.02086 [cs]","venue":"cs.CL","work_id":"02691984-32c8-421a-9573-d3d1b1f3334e","year":2025},"citing_paper":{"arxiv_id":"2607.08170","last_updated":"2026-07-09T07:14:12Z","snapshot_observed_at":"2026-08-06T11:55:56.419446Z","submitted_at":"2026-07-09T07:14:12Z","title":"Understanding Layer Patching in Model Size Interpolation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-10T11:57:18.311409Z"},"links":{"cited_paper":"/paper/2501.02086","citing_paper":"/paper/2607.08170"},"observation_digest":"sha256:c46aea994d8482edbcc9c4366e92bbbfed0afb665e670ec79a97d8c88829f57f","observation_id":"f87028e6-38f2-49b8-aa6c-3f5df5b83b12","resolution":{"observed_at":"2026-07-10T12:07:03.718737Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.02086","last_updated":"2025-06-02T21:33:43Z","snapshot_observed_at":"2026-08-02T20:26:29.728788Z","submitted_at":"2025-01-03T20:19:14Z","title":"Instruction-Following Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.02086","snapshot_observed_at":"2026-07-30T11:48:49.482980Z","title":"Nal Kalchbrenner, Erich Elsen, Karen Simonyan, Seb Noury, Norman Norm, Eamonn Lockhart, Florian Stimberg, Aaron van den Oord, Sander Dieleman, and Koray Kavukcuoglu","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23811","last_updated":"2026-07-26T19:20:01Z","snapshot_observed_at":"2026-08-05T02:59:42.567093Z","submitted_at":"2026-07-26T19:20:01Z","title":"Memory Efficient Audio Synthesis with Decoupled Temporal Depth Diffusion Transformers","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-07-30T11:48:49.482980Z"},"links":{"cited_paper":"/paper/2501.02086","citing_paper":"/paper/2607.23811"},"observation_digest":"sha256:f3af6b5707ca919f6c5b6d007e28e0c6ec1bd5a19fc72f2246e7b59bdc233503","observation_id":"9f2d315c-a744-44a2-b2e3-7246a5d8d1a6","resolution":{"observed_at":"2026-07-30T11:48:49.482980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.02086/citation-record","integrity":"/paper/2501.02086/integrity","json":"/paper/2501.02086/citation-record.json","paper":"/paper/2501.02086"},"outbound":[],"paper":{"arxiv_id":"2501.02086","last_updated":"2025-06-02T21:33:43Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-02T20:26:29.728788Z","submitted_at":"2025-01-03T20:19:14Z","title":"Instruction-Following 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2501.02086."}