{"as_of":"2026-08-19T02:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ffce9502fe39e4d59a6647663f1c34de46ea42cca29565b6ccd068d74f272d8","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T21:28:04.262035Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2511.15390/citation-record","integrity":"/paper/2511.15390/integrity","json":"/paper/2511.15390/citation-record.json","paper":"/paper/2511.15390"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:00.409559Z","title":"https://openai.com/blog/chatgpt, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:00.409559Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:44252fec399df388198c45ed83b914a1a5fd9e9680c4a739ae3bb94a235ec550","observation_id":"dddab3e8-00a0-4b18-aaf4-3e8d298a4be3","resolution":{"observed_at":"2026-08-03T21:28:00.409559Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:00.515645Z","title":"Lan- guage models are few-shot learners.Advances in neural in- formation processing systems, 33:1877–1901, 2020","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:00.515645Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:23853864c050dddc3617bc4f6ccd74c66fe3b22405a63bbe662b627ea665d661","observation_id":"5cbefcd9-9e48-4c25-821a-19575fa9c3e5","resolution":{"observed_at":"2026-08-03T21:28:00.515645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12712","last_updated":"2023-04-13T20:41:31Z","snapshot_observed_at":"2026-08-18T22:17:47.865607Z","submitted_at":"2023-03-22T16:51:28Z","title":"Sparks of Artificial General Intelligence: Early experiments with GPT-4","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.12712","snapshot_observed_at":"2026-08-03T21:28:00.609284Z","title":"Sparks of ar- tificial general intelligence: Early experiments with gpt-4","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:00.609284Z"},"links":{"cited_paper":"/paper/2303.12712","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:230f652c2d35ea3fcb154ccb0821920073d2031705d7bbccc62affc127d4b277","observation_id":"cfd981d5-f5d5-45a9-983c-836061f3f61e","resolution":{"observed_at":"2026-08-03T21:28:00.609284Z","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-17T14:44:42.060038Z","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-03T21:28:00.802459Z","title":"Boolq: Exploring the surprising difficulty of natural yes/no questions.arXiv preprint arXiv:1905.10044, 2019","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:00.802459Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:b9512ccb526261e4ef5b8d767031bd8f818f7928f3a6b58088c3513f1ded6475","observation_id":"e0c0b710-e493-4847-913e-4871c515a1c7","resolution":{"observed_at":"2026-08-03T21:28:00.802459Z","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-08-14T19:36:07.505691Z","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-03T21:28:00.857895Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge.arXiv preprint arXiv:1803.05457,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:00.857895Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:d4798a9f99d1c0a837e1519158eaa77a774ffcff5d3d52686763410e0afcf0d3","observation_id":"2c0bd90c-bc1e-4331-998e-65089078cbaf","resolution":{"observed_at":"2026-08-03T21:28:00.857895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03635","last_updated":"2019-03-04T15:51:11Z","snapshot_observed_at":"2026-08-14T19:37:43.556604Z","submitted_at":"2018-03-09T18:51:28Z","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.03635","snapshot_observed_at":"2026-08-03T21:28:00.951063Z","title":"The lottery ticket hy- pothesis: Finding sparse, trainable neural networks.arXiv preprint arXiv:1803.03635, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:00.951063Z"},"links":{"cited_paper":"/paper/1803.03635","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:136940580d95ee6e23cb675f2098fb3e6a3e2658f18f8c16d24d3d978faf39e5","observation_id":"14ff089f-3524-48d3-8a44-3c0ccda17610","resolution":{"observed_at":"2026-08-03T21:28:00.951063Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:01.072626Z","title":"Sparsegpt: Massive lan- guage models can be accurately pruned in one-shot","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.072626Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:37c971d9ae09c1ceed09169e261716039e5252293a8de1d104a0e5c08a6bad16","observation_id":"c27a50e1-eb8c-44a2-a206-424446ca148a","resolution":{"observed_at":"2026-08-03T21:28:01.072626Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:01.222298Z","title":"A frame- work for few-shot language model evaluation.Version v0","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.222298Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:88030bd1e1e648a0233cbfc6e43412c0f89aa54305970cd9bcbee96185db5b52","observation_id":"ee81dd2b-7787-4fe7-b4e5-308932660e35","resolution":{"observed_at":"2026-08-03T21:28:01.222298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-03T21:28:01.345096Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.345096Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:c159edd458c364af2c011cc23086109ae871de4f7ce7c5bcedbf13ab718c0d73","observation_id":"7355f38d-7c31-4b51-b56e-40739d0905d2","resolution":{"observed_at":"2026-08-03T21:28:01.345096Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:01.499365Z","title":"Op- timal brain surgeon and general network pruning","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.499365Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:51fe064ee1f73f8b435e195284e0149348b3f22a5bc0309798debe98df61d4fc","observation_id":"72640df6-6b88-43cd-96ba-b5b7714e47b5","resolution":{"observed_at":"2026-08-03T21:28:01.499365Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:01.595500Z","title":"Amc: Automl for model compression and ac- celeration on mobile devices","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.595500Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:c02e9ef588092c970bf54941f6c5fad79b51ba192655603efb11b454a1c58cb5","observation_id":"b9d77090-37a6-4670-98b5-0df659ac72bb","resolution":{"observed_at":"2026-08-03T21:28:01.595500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03300","last_updated":"2021-01-12T18:57:11Z","snapshot_observed_at":"2026-08-13T20:44:28.824685Z","submitted_at":"2020-09-07T17:59:25Z","title":"Measuring Massive Multitask Language Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03300","snapshot_observed_at":"2026-08-03T21:28:01.642116Z","title":"Mea- suring massive multitask language understanding","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.642116Z"},"links":{"cited_paper":"/paper/2009.03300","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:59118d93df8485f23bc4199ac67870695767f803c81746d7e52fcfce5b60ff27","observation_id":"06635679-650e-4e5f-9e63-f123f02a993f","resolution":{"observed_at":"2026-08-03T21:28:01.642116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.03250","last_updated":"2016-07-12T07:43:01Z","snapshot_observed_at":"2026-08-18T02:23:05.471538Z","submitted_at":"2016-07-12T07:43:01Z","title":"Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architectures","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.03250","snapshot_observed_at":"2026-08-03T21:28:01.703277Z","title":"Network trimming: A data-driven neuron pruning approach towards efficient deep architectures.arXiv preprint arXiv:1607.03250, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.703277Z"},"links":{"cited_paper":"/paper/1607.03250","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:c37ad8b8817f44ac572e490c881c199bf52642e96334f4656e0ea7b1c8a4bf91","observation_id":"2a7c4f89-407c-484d-ad30-316a92989458","resolution":{"observed_at":"2026-08-03T21:28:01.703277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21276","last_updated":"2024-10-25T17:43:01Z","snapshot_observed_at":"2026-08-15T14:02:47.366139Z","submitted_at":"2024-10-25T17:43:01Z","title":"GPT-4o System Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21276","snapshot_observed_at":"2026-08-03T21:28:01.789399Z","title":"Gpt-4o system card","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.789399Z"},"links":{"cited_paper":"/paper/2410.21276","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:84a073d429237c17ba359be7c735444ac4f5df45e5a8e61f08f809a1d80a2918","observation_id":"a057c38c-24c0-4d69-8bfc-3bec195b046d","resolution":{"observed_at":"2026-08-03T21:28:01.789399Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:01.849117Z","title":"Analogcoder: Analog circuit design via training-free code generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.849117Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:f46f3bdefb9fcdec0bf8bff1a9a4d999f46eb1a64d191fa60f99baefe7055a99","observation_id":"db15284b-2bdc-4939-8745-60e5949e3efa","resolution":{"observed_at":"2026-08-03T21:28:01.849117Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:01.930456Z","title":"Optimal brain damage.Advances in neural information processing systems, 2, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.930456Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:ddd0477db772e66e841b036f6ca8e5ff8dbbd6f48f1029ab4e4f7ef5cacfaf98","observation_id":"47846482-097a-4ac9-977e-75cf46d159e6","resolution":{"observed_at":"2026-08-03T21:28:01.930456Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:01.992469Z","title":"Layer-adaptive sparsity for the magnitude-based pruning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:01.992469Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:da2220510b375960ef62e6a6bcbe323d11d13b395a2898f5c04068cc43a87a11","observation_id":"004edd36-d9f3-4dbb-acd3-328158933951","resolution":{"observed_at":"2026-08-03T21:28:01.992469Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:02.060270Z","title":"Discovering sparsity allocation for layer-wise pruning of large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.060270Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:d71321b9ec052a4cbebf2c660cdef2b0f2ea8f10f5b17d2199273e71adf65e43","observation_id":"101934b8-78c7-4e7d-baad-69bb644b9544","resolution":{"observed_at":"2026-08-03T21:28:02.060270Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:02.106032Z","title":"Adaptive layer sparsity for large language models via activation corre- lation assessment","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.106032Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:f1a0247c3444b6304ba82835640b8da35516df0baa8b3c80dd932637b72f8595","observation_id":"f1a3c082-f37b-4902-af9e-2be3744bb2d3","resolution":{"observed_at":"2026-08-03T21:28:02.106032Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:02.194407Z","title":"Llm-pruner: On the structural pruning of large language models.Ad- vances in neural information processing systems, 36:21702– 21720, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.194407Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:2a81a3849c7fd98caadbbfa7d817aef6f7e40eaf00de24ea35e1186f12a11aa9","observation_id":"dccac0d1-a4af-439f-a413-0c6062a19952","resolution":{"observed_at":"2026-08-03T21:28:02.194407Z","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-08-17T01:46:43.513643Z","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-03T21:28:02.254827Z","title":"Pointer sentinel mixture models.arXiv preprint arXiv:1609.07843, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.254827Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:9ae0059bf67f83b73bd397a5e1fec0a93e34d70e6aa3e4c6cf46c435720269e0","observation_id":"1399f40e-6c47-4af3-a0ec-3f56f95bf44e","resolution":{"observed_at":"2026-08-03T21:28:02.254827Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:02.344255Z","title":"Llama 3 8b instruct","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.344255Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:4a71c0d6dc482e9fdfe7c79230e903b35788d800a075d990bf04fdd2b0b9f917","observation_id":"0c2ff070-cd95-4d27-97ed-beeba7842dd6","resolution":{"observed_at":"2026-08-03T21:28:02.344255Z","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-03T21:28:02.435188Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering.arXiv preprint arXiv:1809.02789, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.435188Z"},"links":{"cited_paper":"/paper/1809.02789","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:296ae2d02f9110eb0bc0a37eda82e91e82ffa540080eee24607adf58c6746223","observation_id":"4400b67a-55a6-4846-865c-8c44c16dae95","resolution":{"observed_at":"2026-08-03T21:28:02.435188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.06440","last_updated":"2017-06-08T19:53:26Z","snapshot_observed_at":"2026-08-14T21:29:36.502364Z","submitted_at":"2016-11-19T22:48:30Z","title":"Pruning Convolutional Neural Networks for Resource Efficient Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.06440","snapshot_observed_at":"2026-08-03T21:28:02.495390Z","title":"Pruning convolutional neural networks for re- source efficient inference.arXiv preprint arXiv:1611.06440,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.495390Z"},"links":{"cited_paper":"/paper/1611.06440","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:c8ad2073a3208c9baa2f5bb0f5abd407eba099283765aa872ef2c8aee9acb5d8","observation_id":"6c7eca43-6f27-44b8-8905-2a41822fbeef","resolution":{"observed_at":"2026-08-03T21:28:02.495390Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:02.610953Z","title":"Importance estimation for neural net- work pruning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.610953Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:61950598269d0110363f51579ebc391dc50c8e48cedc659faacc2b4d9571db8c","observation_id":"0d0da7ca-285a-4850-9008-447a831e0983","resolution":{"observed_at":"2026-08-03T21:28:02.610953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.11395","last_updated":"2022-06-30T08:17:28Z","snapshot_observed_at":"2026-08-16T17:48:09.832881Z","submitted_at":"2021-10-19T13:53:28Z","title":"SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.11395","snapshot_observed_at":"2026-08-03T21:28:02.704555Z","title":"Sosp: Efficiently capturing global correla- tions by second-order structured pruning.arXiv preprint arXiv:2110.11395, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.704555Z"},"links":{"cited_paper":"/paper/2110.11395","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:7bc0f6597a3ba224476a81543170a2d6f383f05379b612946311392459845f02","observation_id":"a05eaaca-36ee-4a81-b545-fa039d4ae3d9","resolution":{"observed_at":"2026-08-03T21:28:02.704555Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:02.795282Z","title":"Gpt-o3 system card.OpenAI System Card, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.795282Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:2a859c675ede36b22919a0cb8e813e48ca194bbca279341c9e4c102adfecf886","observation_id":"bc76630b-f35c-4d38-a2a8-c08fbd54a41e","resolution":{"observed_at":"2026-08-03T21:28:02.795282Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:02.881748Z","title":"Winogrande: An adversarial winograd schema challenge at scale.Communications of the ACM, 64 (9):99–106, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.881748Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:abf84449747316be20ab5cefe4ca6bdb2a4b9d2068d7db45d55a0fee3017fd95","observation_id":"6fb34b74-66c0-41b1-92d2-ce3e1f009f70","resolution":{"observed_at":"2026-08-03T21:28:02.881748Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:02.939732Z","title":"The skewness of science.Journal of the Amer- ican society for information science, 43(9):628–638, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.939732Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:beef3016c4157ae81aec8802cec6325c9de166ef72a49977316710604952d260","observation_id":"13c5f4b5-5dab-42b8-a249-7a61497d7271","resolution":{"observed_at":"2026-08-03T21:28:02.939732Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:02.996725Z","title":"A simple and effective pruning approach for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:02.996725Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:368262923a9712566c5bb582831f03ce4731c43bf17ef12fd58577b4e0341451","observation_id":"70e81337-a8da-4098-b68e-47323ef26175","resolution":{"observed_at":"2026-08-03T21:28:02.996725Z","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-03T21:28:03.049131Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:03.049131Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:587485e11069de134c8ea27a2c3453db461ffbe8df606bc92acee681a96f790c","observation_id":"6864e878-da06-415f-bddd-1e05c224efc1","resolution":{"observed_at":"2026-08-03T21:28:03.049131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-03T21:28:03.089961Z","title":"Llama 2: Open foundation and fine-tuned chat models.arXiv preprint arXiv:2307.09288, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:03.089961Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:b9f2c0c8f3ba43d2ee5d4e27412e82be1218f6770e36f6b513f7deb1b1e06cd4","observation_id":"a8640133-ca39-46c9-b4aa-aa21ea05a362","resolution":{"observed_at":"2026-08-03T21:28:03.089961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.07461","last_updated":"2019-02-22T23:53:34Z","snapshot_observed_at":"2026-08-16T09:50:11.319379Z","submitted_at":"2018-04-20T06:35:04Z","title":"GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.07461","snapshot_observed_at":"2026-08-03T21:28:03.185346Z","title":"Glue: A multi-task benchmark and analysis platform for natural language understanding.arXiv preprint arXiv:1804.07461, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:03.185346Z"},"links":{"cited_paper":"/paper/1804.07461","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:c7ab8ce10f032decbb06cce000ab1965fb4b7370ab2e785fe749583e8268bb41","observation_id":"bc64d33b-9a6b-449a-8d3e-0df0a487c5e9","resolution":{"observed_at":"2026-08-03T21:28:03.185346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12013","last_updated":"2024-10-15T19:22:27Z","snapshot_observed_at":"2026-08-16T13:09:03.103606Z","submitted_at":"2024-10-15T19:22:27Z","title":"MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Router","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12013","snapshot_observed_at":"2026-08-03T21:28:03.295344Z","title":"Moe-pruner: Pruning mixture-of-experts large language model using the hints from its router.arXiv preprint arXiv:2410.12013, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:03.295344Z"},"links":{"cited_paper":"/paper/2410.12013","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:201d7cd5da2c94cd363fa543a0917b9eef4d88cdbba451767c075839ae223270","observation_id":"13d50f4b-b377-4f43-80d1-db1bddc04c00","resolution":{"observed_at":"2026-08-03T21:28:03.295344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16880","last_updated":"2024-04-19T07:54:27Z","snapshot_observed_at":"2026-08-16T14:17:36.649497Z","submitted_at":"2024-02-18T12:44:15Z","title":"BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16880","snapshot_observed_at":"2026-08-03T21:28:03.454661Z","title":"Besa: Pruning large language models with block- wise parameter-efficient sparsity allocation.arXiv preprint arXiv:2402.16880, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:03.454661Z"},"links":{"cited_paper":"/paper/2402.16880","citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:b8ff325c1f58a0db00b808fd8cada0f0b4f7ca78fdc2fddcaf99785c7d1baa3d","observation_id":"1f57266b-c0de-466d-8102-59d7af509f90","resolution":{"observed_at":"2026-08-03T21:28:03.454661Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:03.613541Z","title":"Outlier weighed layerwise sparsity (owl): A missing secret sauce for pruning llms to high sparsity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:03.613541Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:5df6d12ee9702c34258a2bdbca2339ecf1d5374cc22a09d9cbbe7bf2e30b00ea","observation_id":"6b82ac85-38ab-4b07-b12f-33167ccfdff1","resolution":{"observed_at":"2026-08-03T21:28:03.613541Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:03.726394Z","title":"Outlier weighed layerwise sparsity (owl): A missing secret sauce for pruning llms to high sparsity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:03.726394Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:d97e15117936968ca657bb88401bbce9fe8279b1d04d331c50d42dddb6e9a82f","observation_id":"68b1c6f2-10d2-4595-9aab-b9da131d8c12","resolution":{"observed_at":"2026-08-03T21:28:03.726394Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:03.873297Z","title":"Auto graph encoder-decoder for neural network pruning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:03.873297Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:1033a48ad9c2089c01f5a1fd69d3940bf8fb4e361afd08ccfb02ce2039887d86","observation_id":"ac98de61-16ce-4364-abd9-ad49a429ec20","resolution":{"observed_at":"2026-08-03T21:28:03.873297Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:03.957835Z","title":"Carrying out cnn channel pruning in a white box.IEEE Transactions on Neural Networks and Learning Systems, 34(10):7946– 7955, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:03.957835Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:953bcfd1992d4fc9659f5099f105d01be8b77c3bff640f2888b1419ff67f1d09","observation_id":"2d0f4eec-0546-415d-9c29-74b1852a7bde","resolution":{"observed_at":"2026-08-03T21:28:03.957835Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:04.058930Z","title":"A review on edge large language models: Design, execution, and applications.ACM Comput- ing Surveys, 57(8):1–35, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:04.058930Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:4d89571cc181f119d53fc19878377c6dcad81ee6ec7cc1ecb56b425680bc5ced","observation_id":"a334ca33-65be-459d-b87e-a7beac8190d3","resolution":{"observed_at":"2026-08-03T21:28:04.058930Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:04.181373Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:04.181373Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:e9836061a030e1d6e8b5a5699d957ec66bfc6675e63766a5911bfd025578a808","observation_id":"a0eea9dc-0fa4-4067-a6a2-04dbbe542e55","resolution":{"observed_at":"2026-08-03T21:28:04.181373Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:28:04.262035Z","title":"Perp: Rethinking the prune-retrain paradigm in the era of llms.arXiv preprint arXiv:2312.15230, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:04.262035Z"},"links":{"citing_paper":"/paper/2511.15390"},"observation_digest":"sha256:9a27f3aaa8808710c249533f25a96ae62a75da240146d724ac80efaad493396d","observation_id":"78f7560a-e25a-464d-8d2e-3ac93c3bd879","resolution":{"observed_at":"2026-08-03T21:28:04.262035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.15390","last_updated":"2026-05-27T15:22:38Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-18T02:23:43.530664Z","submitted_at":"2025-11-19T12:38:21Z","title":"Automatic Pruning Discovery for Large Language Models"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":42},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2511.15390."}