{"as_of":"2026-08-14T18:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f3288211d9187480f08d584daa683e0619fc3fba5bacb49f6668114542c1ad27","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:07:09.436834Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T01:07:04.330340Z","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-07-04T15:59:57.080393Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"cited_work":{"arxiv_id":"2501.09412","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.09412","snapshot_observed_at":"2026-07-04T15:59:57.080393Z","title":"Fasp: Fast and accurate structured pruning of large language models, 2025","venue":null,"work_id":"508d2760-2426-430b-a15e-f40d2e8898ee","year":2025},"citing_paper":{"arxiv_id":"2606.24970","last_updated":"2026-06-23T11:07:59Z","snapshot_observed_at":"2026-08-12T16:43:13.098274Z","submitted_at":"2026-06-23T11:07:59Z","title":"Don't Go Breaking My LLM: The Impact of Pruning Attention Layers on Explanation Faithfulness and Confidence Calibration","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-26T01:07:04.330340Z"},"links":{"cited_paper":"/paper/2501.09412","citing_paper":"/paper/2606.24970"},"observation_digest":"sha256:eeb71e156b2f4d84c3daaf90216d4431f7ce1c1c3cf105ce156756602dbd223c","observation_id":"40675128-3d3d-4fa7-9413-563b00bf7ff3","resolution":{"observed_at":"2026-07-04T15:59:57.081848Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2501.09412/citation-record","integrity":"/paper/2501.09412/integrity","json":"/paper/2501.09412/citation-record.json","paper":"/paper/2501.09412"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.15024","last_updated":"2024-02-09T17:59:40Z","snapshot_observed_at":"2026-08-14T10:49:22.047809Z","submitted_at":"2024-01-26T17:35:45Z","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15024","snapshot_observed_at":"2026-08-10T20:07:09.343243Z","title":"Slicegpt: Compress large language models by deleting rows and columns","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.343243Z"},"links":{"cited_paper":"/paper/2401.15024","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:a7ef1facdcbda156b23dcefd01d386432f51b60d92fd0fc3d601e86273a84a36","observation_id":"4674b11e-13b5-4a61-897e-8e6cae75a579","resolution":{"observed_at":"2026-08-10T20:07:09.343243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17481","last_updated":"2024-12-07T12:01:28Z","snapshot_observed_at":"2026-08-14T10:48:22.271423Z","submitted_at":"2024-09-26T02:37:41Z","title":"MaskLLM: Learnable Semi-Structured Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17481","snapshot_observed_at":"2026-08-10T20:07:09.362412Z","title":"Maskllm: Learnable semi-structured sparsity for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.362412Z"},"links":{"cited_paper":"/paper/2409.17481","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:e659b317fa6c67932680726bbc988b362680d201231594f288209661f9b86295","observation_id":"0484896d-e7a4-49bd-8e54-82d831d61f5b","resolution":{"observed_at":"2026-08-10T20:07:09.362412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.11627","last_updated":"2023-09-28T03:59:27Z","snapshot_observed_at":"2026-08-13T11:38:48.514086Z","submitted_at":"2023-05-19T12:10:53Z","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.11627","snapshot_observed_at":"2026-08-10T20:07:09.373566Z","title":"Llm-pruner: On the structural pruning of large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.373566Z"},"links":{"cited_paper":"/paper/2305.11627","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:058961cb4acdfd5386420a6be8f8f85868baa44bd12ba5eb8a74e74dcf941400","observation_id":"f033fa26-fc77-46b0-8816-e1931ace5c39","resolution":{"observed_at":"2026-08-10T20:07:09.373566Z","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-14T01:18:55.206280Z","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-10T20:07:09.379506Z","title":"Shortgpt: Layers in large language models are more redundant than you expect","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.379506Z"},"links":{"cited_paper":"/paper/2403.03853","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:c9735dd2a6c91308573fac3f89f1f933fbd5472c4c65ed3ccc87d062d0a74aa4","observation_id":"9e206c00-99b9-49c9-acef-ce8669e1378c","resolution":{"observed_at":"2026-08-10T20:07:09.379506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-07-06T05:12:10.387914Z","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-10T20:07:09.385522Z","title":"Pointer sentinel mixture models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.385522Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:b1233de35af122bdc2d3f0dd8c97af3516206cd2c2bd728bc39c591d675def8f","observation_id":"9dc20236-84cd-46e9-91fd-f86bee00f003","resolution":{"observed_at":"2026-08-10T20:07:09.385522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.02789","last_updated":"2018-09-08T11:47:16Z","snapshot_observed_at":"2026-08-14T07:00:02.529732Z","submitted_at":"2018-09-08T11:47:16Z","title":"Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.02789","snapshot_observed_at":"2026-08-10T20:07:09.391147Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.391147Z"},"links":{"cited_paper":"/paper/1809.02789","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:c0efa4eced3d1ba4db50972aacb844098ef39eed170d7115a95003a9843fdd2e","observation_id":"b37e2dec-3c3b-4acc-bb07-884df62ece02","resolution":{"observed_at":"2026-08-10T20:07:09.391147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08378","last_updated":"2021-04-16T21:27:32Z","snapshot_observed_at":"2026-08-13T19:38:24.671428Z","submitted_at":"2021-04-16T21:27:32Z","title":"Accelerating Sparse Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08378","snapshot_observed_at":"2026-08-10T20:07:09.396226Z","title":"Accelerating sparse deep neural networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.396226Z"},"links":{"cited_paper":"/paper/2104.08378","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:9c70f113caedd35217bfaaf1f4d61ab31c9c5b709d06bb765eb845373f21b934","observation_id":"3ae39eaf-7d31-4c35-b60e-5de1a9ef0eea","resolution":{"observed_at":"2026-08-10T20:07:09.396226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11695","last_updated":"2024-05-06T17:47:01Z","snapshot_observed_at":"2026-08-13T04:32:33.562415Z","submitted_at":"2023-06-20T17:18:20Z","title":"A Simple and Effective Pruning Approach for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11695","snapshot_observed_at":"2026-08-10T20:07:09.405898Z","title":"A simple and effective pruning approach for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.405898Z"},"links":{"cited_paper":"/paper/2306.11695","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:014c0f5aca575887e88ff422c25f1265e22b59937da47420ea851c0773489211","observation_id":"8a2cf523-ad97-4a1f-bf7d-023174728dd2","resolution":{"observed_at":"2026-08-10T20:07:09.405898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-10T20:07:09.411003Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.411003Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:daf98ca9b05d58a05f096d7619166182f0fc91d01e346d8f88fd2042eec16985","observation_id":"228b9470-0367-47b3-aa44-3b16b85ea7c9","resolution":{"observed_at":"2026-08-10T20:07:09.411003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.03771","last_updated":"2020-07-14T03:42:34Z","snapshot_observed_at":"2026-07-06T08:27:58.343233Z","submitted_at":"2019-10-09T03:23:22Z","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.03771","snapshot_observed_at":"2026-08-10T20:07:09.415816Z","title":"Huggingface’s transformers: State-of-the-art natural language processing","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.415816Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:fcf338b9d49214594495bf401ca6419b1c0fad9f490f8948cc7892f13931caf0","observation_id":"0981a691-c66a-4da3-b2fa-1ecb6f7f7121","resolution":{"observed_at":"2026-08-10T20:07:09.415816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-08-10T16:18:23.994244Z","submitted_at":"2019-05-19T23:57:23Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07830","snapshot_observed_at":"2026-08-10T20:07:09.421277Z","title":"Hellaswag: Can a machine really finish your sentence? arXiv preprint arXiv:1905.07830,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.421277Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:43ae9d419d0098451b9aa7b930ee15979825a73b3380e840f22612baa9221e61","observation_id":"91302eb9-2f7d-404d-ac95-8f595a08503c","resolution":{"observed_at":"2026-08-10T20:07:09.421277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.01068","last_updated":"2022-06-21T17:04:40Z","snapshot_observed_at":"2026-08-06T03:13:37.403059Z","submitted_at":"2022-05-02T17:49:50Z","title":"OPT: Open Pre-trained Transformer Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.01068","snapshot_observed_at":"2026-08-10T20:07:09.426621Z","title":"Opt: Open pre-trained transformer language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.426621Z"},"links":{"cited_paper":"/paper/2205.01068","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:4e1e96255b76b8a3632d073fe4df516f4253337a6d201e83a52b12dc15b808ba","observation_id":"f7ada54a-8917-4f55-a704-811aa4fe3ac4","resolution":{"observed_at":"2026-08-10T20:07:09.426621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03728","last_updated":"2024-08-07T12:33:46Z","snapshot_observed_at":"2026-08-12T23:07:17.926877Z","submitted_at":"2024-08-07T12:33:46Z","title":"A Convex-optimization-based Layer-wise Post-training Pruner for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03728","snapshot_observed_at":"2026-08-10T20:07:09.436834Z","title":"A convex- optimization-based layer-wise post-training pruner for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.436834Z"},"links":{"cited_paper":"/paper/2408.03728","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:03ff786e83f2bd769a684a2566f8274afaf6e2914e3cd33eda028fd7b3dce945","observation_id":"f1bfa88a-5b03-4f3e-8575-503f8e85ee92","resolution":{"observed_at":"2026-08-10T20:07:09.436834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02924","last_updated":"2024-06-05T04:25:23Z","snapshot_observed_at":"2026-08-13T18:55:20.671152Z","submitted_at":"2024-06-05T04:25:23Z","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02924","snapshot_observed_at":"2026-08-10T20:07:09.357955Z","title":"Pruner-zero: Evolving symbolic pruning metric from scratch for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.357955Z"},"links":{"cited_paper":"/paper/2406.02924","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:1c0d3f3510fb45338a3619dddcea1313e35c3e5e5f0b9481ae37c50e716755eb","observation_id":"a036a4c6-ce32-4973-ae07-3f5a0f6a67ab","resolution":{"observed_at":"2026-08-10T20:07:09.357955Z","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-07-06T02:11:23.670680Z","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-10T20:07:09.353166Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.353166Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:5ed9cf6c7a69d66c3cc89dc4e63e32a447066e2f4f1bdb7a4bbba262a0a4a367","observation_id":"0bed802f-7ac5-42c7-928e-5f56fefb4613","resolution":{"observed_at":"2026-08-10T20:07:09.353166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-08-14T15:52:43.138964Z","submitted_at":"2019-05-24T05:48:49Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10044","snapshot_observed_at":"2026-08-10T20:07:09.348136Z","title":"Boolq: Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.348136Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:89632ea7fa76e8c2af7b3f519e113e9c5dcefbbe4665b8266695434eb03d22da","observation_id":"87cbbae5-37d1-4101-9c3c-41c52134d42f","resolution":{"observed_at":"2026-08-10T20:07:09.348136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17372","last_updated":"2024-10-30T20:04:01Z","snapshot_observed_at":"2026-08-14T10:48:23.861743Z","submitted_at":"2024-09-25T21:32:12Z","title":"Search for Efficient Large Language Models","version":2},"cited_work":{"arxiv_id":"2409.17372","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.17372","snapshot_observed_at":"2026-08-10T20:07:09.600943Z","title":"Search for Efficient Large Language Models","venue":"cs.AI","work_id":"7a7b0b9e-77b2-4fb9-9392-75fe9f512a1b","year":2024},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.401266Z"},"links":{"cited_paper":"/paper/2409.17372","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:8732d853d4cd17efdbec7ea63d18bd1b819b74b0ee251e6f769b51a2cc6ce3d4","observation_id":"6fa0925c-ab3f-418b-a09a-3217d202ced5","resolution":{"observed_at":"2026-08-10T20:07:09.609071Z","resolver_source":"local_arxiv","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":"2405.18218","last_updated":"2024-10-20T09:10:25Z","snapshot_observed_at":"2026-08-12T23:56:06.888244Z","submitted_at":"2024-05-28T14:21:15Z","title":"FinerCut: Finer-grained Interpretable Layer Pruning for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.18218","snapshot_observed_at":"2026-08-10T20:07:09.431662Z","title":"Finercut: Finer-grained interpretable layer pruning for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.431662Z"},"links":{"cited_paper":"/paper/2405.18218","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:f82153d55ebcbd980a0e660c1bf921322fbd90dd8b4801a218c7feba7bf7f1ea","observation_id":"1ba5be1b-1d03-4132-b31d-502003322b6b","resolution":{"observed_at":"2026-08-10T20:07:09.431662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-10T20:07:09.367895Z","title":"Gemini: a family of highly capable multimodal models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.367895Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:a7499248b1e0ebfeecff152a14be9aac8f6ea979529b638d5aae6ec11132d263","observation_id":"b160e619-5e29-4c96-90b1-b14b03f81fd2","resolution":{"observed_at":"2026-08-10T20:07:09.367895Z","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-10T20:07:09.796745Z","title":"Md Adnan Arefeen, Biplob Debnath, and Srimat Chakradhar","venue":null,"work_id":"64472eea-de69-48cb-8de6-cbb795ebf964","year":2024},"citing_paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T20:07:09.337899Z"},"links":{"citing_paper":"/paper/2501.09412"},"observation_digest":"sha256:45726b9023f948fc1a630581154dbe8fa92a98ec5daf2769e4a0f66a977cd879","observation_id":"5912af44-8d05-49d6-ac82-6c51e1b665df","resolution":{"observed_at":"2026-08-10T20:07:09.801951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2501.09412","last_updated":"2025-01-16T09:38:39Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T17:40:53.436092Z","submitted_at":"2025-01-16T09:38:39Z","title":"FASP: Fast and Accurate Structured Pruning of Large Language Models"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":20},"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 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2501.09412."}