{"as_of":"2026-08-08T18:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0677abe6997630439c13afe56d8ddaa745dc14a34e9a877a48826a9a4d6fc340","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:30:21.169863Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:41:28.847243Z","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-12T07:41:32.920838Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"cited_work":{"arxiv_id":"2505.22689","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.22689","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Slimllm: Accurate structured pruning for large language models","venue":null,"work_id":"e3917165-8d30-4a54-925b-827a8b1b28bc","year":2025},"citing_paper":{"arxiv_id":"2605.08568","last_updated":"2026-05-09T00:02:33Z","snapshot_observed_at":"2026-08-02T23:13:09.763052Z","submitted_at":"2026-05-09T00:02:33Z","title":"Different Prompts, Different Ranks: Prompt-aware Dynamic Rank Selection for SVD-based LLM Compression","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-12T02:22:51.541981Z"},"links":{"cited_paper":"/paper/2505.22689","citing_paper":"/paper/2605.08568"},"observation_digest":"sha256:3f45a04be7b66bbf659788b038e8a2d0f380429790d0b85f994863504d2baf93","observation_id":"5265b5ae-7be3-48b0-a243-4d7a21268622","resolution":{"observed_at":"2026-05-12T07:41:32.966832Z","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":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22689","snapshot_observed_at":"2026-08-02T07:56:24.530269Z","title":"Slimllm: Accurate structured pruning for large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08601","last_updated":"2026-07-18T12:48:55Z","snapshot_observed_at":"2026-08-05T20:42:37.906676Z","submitted_at":"2026-07-09T15:32:54Z","title":"It Takes a MAESTRO To Prune Bad Experts","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:24.530269Z"},"links":{"cited_paper":"/paper/2505.22689","citing_paper":"/paper/2607.08601"},"observation_digest":"sha256:29def4de2dc383f754dda852ae1a3c9c77cb73874d157121b75b3a0a100b6e6c","observation_id":"45377df2-6e0f-4677-bfb2-2bbf9b46329d","resolution":{"observed_at":"2026-08-02T07:56:24.530269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22689","snapshot_observed_at":"2026-08-05T16:41:28.847243Z","title":"Slimllm: Accurate structured pruning for large language models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.03580","last_updated":"2026-08-04T12:34:46Z","snapshot_observed_at":"2026-08-08T08:43:28.385709Z","submitted_at":"2026-08-04T12:34:46Z","title":"SlimVLM: Sensitivity-aware Dynamic Structured Pruning with Adaptive Visual Token Selection for Efficient Vision-Language Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:28.847243Z"},"links":{"cited_paper":"/paper/2505.22689","citing_paper":"/paper/2608.03580"},"observation_digest":"sha256:7c238cb3e9a9fee7a9681feab79137cdc22a733c7a3b22f9afe8cb3de9b7c2b3","observation_id":"21717134-abf6-457c-a6de-687c2673a554","resolution":{"observed_at":"2026-08-05T16:41:28.847243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.22689/citation-record","integrity":"/paper/2505.22689/integrity","json":"/paper/2505.22689/citation-record.json","paper":"/paper/2505.22689"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T13:30:18.908325Z","title":"L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:18.908325Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:c33493482adfb15753537ad4b16b30e2022b4334e647de3bd903f641b6c0e1c5","observation_id":"4a6a4c23-0e67-4321-96db-cec1a343d080","resolution":{"observed_at":"2026-08-07T13:30:18.908325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.17323","last_updated":"2023-03-22T13:10:47Z","snapshot_observed_at":"2026-08-07T08:38:54.025062Z","submitted_at":"2022-10-31T13:42:40Z","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.17323","snapshot_observed_at":"2026-08-07T13:30:19.356948Z","title":"Gptq: Accurate post-training quantization for generative pre- trained transformers","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.356948Z"},"links":{"cited_paper":"/paper/2210.17323","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:16a8f56337e9bbcc652efdd7b0c0492ed8e3935ac4c0bdb6eb136c27c845711f","observation_id":"65e72728-6e3a-401f-847f-3f6f275d870c","resolution":{"observed_at":"2026-08-07T13:30:19.356948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-07T07:43:16.294957Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-07T13:30:19.541220Z","title":"J., Shen, Y ., Wallis, P., Allen-Zhu, Z., Li, Y ., Wang, S., Wang, L., and Chen, W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.541220Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:e0c9e58833ef869b612443bd45c6c8d63712525d25b08a7d970099fe35d1799a","observation_id":"0baa9431-9e1d-4dd2-8120-672a2c264bae","resolution":{"observed_at":"2026-08-07T13:30:19.541220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.09695","last_updated":"2024-04-15T11:53:22Z","snapshot_observed_at":"2026-07-06T18:00:16.713949Z","submitted_at":"2024-04-15T11:53:22Z","title":"LoRAP: Transformer Sub-Layers Deserve Differentiated Structured Compression for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.09695","snapshot_observed_at":"2026-08-07T13:30:19.805816Z","title":"Lorap: Transformer sub- layers deserve differentiated structured compression for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.805816Z"},"links":{"cited_paper":"/paper/2404.09695","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:35687906972e8e2ad4a80f29715f782b99d945570c07194726fcf413165d5727","observation_id":"916a60c0-4740-4e01-b7e6-f560c2ec2f75","resolution":{"observed_at":"2026-08-07T13:30:19.805816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.18110","last_updated":"2024-12-24T02:49:50Z","snapshot_observed_at":"2026-07-06T20:12:31.283474Z","submitted_at":"2024-12-24T02:49:50Z","title":"SlimGPT: Layer-wise Structured Pruning for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.18110","snapshot_observed_at":"2026-08-07T13:30:19.964750Z","title":"Slimgpt: Layer- wise structured pruning for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.964750Z"},"links":{"cited_paper":"/paper/2412.18110","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:e33b35be13f90a8f9c2f9e3e178e04d5d63b0d0bc8b7ca0b5e1fb3ff6ddd36c7","observation_id":"71fa2261-fb17-479c-a901-faecfa7764a2","resolution":{"observed_at":"2026-08-07T13:30:19.964750Z","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-07T13:30:20.168376Z","title":"Pointer sentinel mixture models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:20.168376Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:97f779fc11409d04f2901d6d15c511a6f6583023e8b049c430996f72f6cf9e97","observation_id":"459bd486-32bd-4491-baee-502692a036ca","resolution":{"observed_at":"2026-08-07T13:30:20.168376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-08-07T13:30:20.434754Z","title":"Sleb: Streamlining llms through redundancy verification and elimination of transformer blocks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:20.434754Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:89f0e010661fb6f74ffeccc369559fbc2a9ec9ce191f47ef1eee43ef3f67be99","observation_id":"1c7748c0-9aa1-4f27-b552-43f5c056fbe4","resolution":{"observed_at":"2026-08-07T13:30:20.434754Z","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-07-06T15:44:42.776459Z","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-07T13:30:20.554754Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:20.554754Z"},"links":{"cited_paper":"/paper/2306.11695","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:ba18d6f18aa662470a7b2a39f4bb117389a89520938eefdf9553a37593a44a87","observation_id":"2d4cf61f-ea2f-47ae-814d-2c9854193f9d","resolution":{"observed_at":"2026-08-07T13:30:20.554754Z","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-07T13:30:20.648011Z","title":"Llama: Open and efficient foundation lan- guage models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:20.648011Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:f3fbfa652a7a1a3a3f5de0af5abeaec6cbbc449346f757c6ed95ce86e5e48298","observation_id":"1d0d542b-6dd6-480c-a9a6-cd21c682cefc","resolution":{"observed_at":"2026-08-07T13:30:20.648011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06694","last_updated":"2024-04-11T01:18:06Z","snapshot_observed_at":"2026-08-07T03:20:22.127593Z","submitted_at":"2023-10-10T15:13:30Z","title":"Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06694","snapshot_observed_at":"2026-08-07T13:30:20.878868Z","title":"Sheared llama: Accelerating language model pre-training via structured pruning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:20.878868Z"},"links":{"cited_paper":"/paper/2310.06694","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:d1a8d5ef9e4a4d1625d279a74684d4bce8c1f2f826924e42eebac4c9d31e0f22","observation_id":"5480ca71-7933-40aa-b733-a8262f9d0ca0","resolution":{"observed_at":"2026-08-07T13:30:20.878868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05175","last_updated":"2025-06-30T22:16:39Z","snapshot_observed_at":"2026-08-01T08:08:15.221032Z","submitted_at":"2023-10-08T14:22:58Z","title":"Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05175","snapshot_observed_at":"2026-08-07T13:30:20.966547Z","title":"Out- lier weighed layerwise sparsity (owl): A missing secret sauce for pruning llms to high sparsity","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:20.966547Z"},"links":{"cited_paper":"/paper/2310.05175","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:36ee0c67eca464cbf1f34fbc30c166b7d675de87006e8a4ea0e93e84d4b2be54","observation_id":"da610b3d-80d9-4024-817f-9d69ad6fc237","resolution":{"observed_at":"2026-08-07T13:30:20.966547Z","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-07-31T00:09:56.948833Z","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-07T13:30:21.091731Z","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":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:21.091731Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:e3ba4b42257117d6ef51dad0e35110dafba02d65579d0b30495deeac165a5584","observation_id":"e618d6e6-a24e-4cd9-b616-3371fe5d21f1","resolution":{"observed_at":"2026-08-07T13:30:21.091731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-08-07T13:30:21.169863Z","title":"Loraprune: Pruning meets low- rank parameter-efficient fine-tuning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:21.169863Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:a81048ef7f481f8f7726bc396dc49023a6e81dbb0c747d4a9e24f2f3cddebcdf","observation_id":"dc6e8ff4-2f01-4fdd-98d8-d4f976dffa28","resolution":{"observed_at":"2026-08-07T13:30:21.169863Z","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-03T01:48:18.654934Z","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-07T13:30:20.038351Z","title":"Shortgpt: Layers in large language mod- els are more redundant than you expect","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:20.038351Z"},"links":{"cited_paper":"/paper/2403.03853","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:c6f52b8fbe2ae6feb60d0f1fda141df40a908af255da9fb7fa380aebe31be5e5","observation_id":"1a9a1ff7-3e39-46f9-9140-d1a48800b146","resolution":{"observed_at":"2026-08-07T13:30:20.038351Z","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-08T02:19:52.596062Z","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-07T13:30:20.274967Z","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":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:20.274967Z"},"links":{"cited_paper":"/paper/1809.02789","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:e615a7b9f9da527eb2d384d78d79da5ad4ba92d8b8627c6d30ee1f73ab3e594e","observation_id":"c0c4bd2e-963b-4ccb-a0c5-1a47a1ce30ee","resolution":{"observed_at":"2026-08-07T13:30:20.274967Z","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-07T13:30:19.243071Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.243071Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:3e0ed876ff14d4beae0e47eda2f849109c291b2c4102f8c03ef8c504268f0d3c","observation_id":"8b751b8d-e408-4e28-9f69-a72de4268efb","resolution":{"observed_at":"2026-08-07T13:30:19.243071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18356","last_updated":"2023-10-31T04:21:33Z","snapshot_observed_at":"2026-07-06T16:39:40.673808Z","submitted_at":"2023-10-24T00:47:26Z","title":"LoRAShear: Efficient Large Language Model Structured Pruning and Knowledge Recovery","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.18356","snapshot_observed_at":"2026-08-07T13:30:18.984228Z","title":"Lorashear: Efficient large language model struc- tured pruning and knowledge recovery","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:18.984228Z"},"links":{"cited_paper":"/paper/2310.18356","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:bd97ea3a6f6d5303a0b016a5e0a31207d718aadbf61cbf45a508df1dc2266c9d","observation_id":"a7d2da69-6a0a-4fbf-b499-16bc3ad5ee34","resolution":{"observed_at":"2026-08-07T13:30:18.984228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02834","last_updated":"2024-06-23T08:45:33Z","snapshot_observed_at":"2026-08-07T23:10:12.222808Z","submitted_at":"2024-02-05T09:44:49Z","title":"Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02834","snapshot_observed_at":"2026-08-07T13:30:19.668268Z","title":"Shortened llama: Depth pruning for large language models with comparison of retraining methods","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.668268Z"},"links":{"cited_paper":"/paper/2402.02834","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:3a326a55ce45eb795b63ad5336f4ba59875a2066b7f3a76bf7d086edb61fb561","observation_id":"b39f791b-6bb5-4bf9-9a5c-8e4d9f42cb47","resolution":{"observed_at":"2026-08-07T13:30:19.668268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-08-07T13:30:19.451609Z","title":"Language model compression with weighted low-rank factorization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.451609Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:2ced823d56f8a8ad8107caf067d4906f54154721a6e08be46062837f3fc85190","observation_id":"a3b8eeaa-d291-47fa-9214-59a1377fb0fb","resolution":{"observed_at":"2026-08-07T13:30:19.451609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-07-06T17:52:22.360870Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-07T13:30:19.050049Z","title":"Compressing large language models by streamlining the unimportant layer","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.050049Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:402be0b92af18552d6c7c8ce138f3a4031be37278914ccbd0fe9dbccbe5d1e64","observation_id":"c6e43979-3966-4e2b-a5da-b8f2a4b90edd","resolution":{"observed_at":"2026-08-07T13:30:19.050049Z","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-07-06T07:55:12.121264Z","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-07T13:30:19.159383Z","title":"Boolq: Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.159383Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:6b9af87dc6355268f956ce2965ea293bd6a517dae3f4c0b15cef66540a0ebf9f","observation_id":"9a2cae38-8b69-4f35-82cb-4718d400dc43","resolution":{"observed_at":"2026-08-07T13:30:19.159383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":21},"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 21 of 21 outbound references and 3 inbound Pith citation observations for arXiv:2505.22689."}