{"as_of":"2026-08-08T07:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c0aa6ae5200767a237c2da9bf7b130a26d377f22c020ffdbc7f3bc2764712de","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:19:39.510504Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.08436/citation-record","integrity":"/paper/2506.08436/integrity","json":"/paper/2506.08436/citation-record.json","paper":"/paper/2506.08436"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:40.093493Z","title":"Fluctuation-based adaptive structured pruning for large language models","venue":null,"work_id":"ca4084bc-7b26-4fbc-b2cd-c06d815bbdf7","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.313268Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:5f417d4b9968dce6343d0f3c0fef1c15e92cdc0df686cd056d4941559b2082d5","observation_id":"41064b20-1250-4850-8e8b-40e4088f49a9","resolution":{"observed_at":"2026-08-07T05:19:40.097703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:40.084257Z","title":"L., do Nascimento, M","venue":null,"work_id":"329a647f-5a42-41c3-88e6-46fc663552d8","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.316985Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:3f08482ebd4f205ab07117ff69680340fdf9ab598c3544d079cbf4c402f4f717","observation_id":"7fe9ecfa-6eb7-4d74-969b-e453b725882d","resolution":{"observed_at":"2026-08-07T05:19:40.087208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-07T05:19:39.320152Z","title":"Qwen technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.320152Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:dd99747a87774d634da0f722ce09f5b1828fa3d3f9dd8ff223499ea272fc1298","observation_id":"569125c7-7c54-4c5b-913c-2be2283e1d96","resolution":{"observed_at":"2026-08-07T05:19:39.320152Z","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-07T05:19:40.075412Z","title":"Piqa: Reasoning about physical commonsense in natural language","venue":null,"work_id":"eb2b2f5e-ee92-4159-8c69-2f383e291577","year":2020},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.323846Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:3cbe98f615b7c562f0c646e942eae0d2c5a1bf4214595e5882e940c2997f098c","observation_id":"8bbd9edc-0898-412a-925d-5a131061c99e","resolution":{"observed_at":"2026-08-07T05:19:40.078610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-07T05:19:39.327002Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.327002Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:36c361577c1c17013b98f84a9c6c6a3b1ed8661785920e4f2a640d4bb5df2057","observation_id":"a80e6b16-a357-4333-8eeb-61eb46a25d2c","resolution":{"observed_at":"2026-08-07T05:19:39.327002Z","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-07T05:19:39.330558Z","title":"E., et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.330558Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:20fa3265474273601807197e996e3c25cce27ea590e9cfe4a090dffca60c9bd0","observation_id":"4a54c350-e938-450b-9d80-606e9d1038ed","resolution":{"observed_at":"2026-08-07T05:19:39.330558Z","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-07T05:19:40.061053Z","title":null,"venue":null,"work_id":"3da705e5-b9c1-4e34-9a6f-10da8f2ac77b","year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.333902Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:a9e0112f9c256bed211fd41ddaeb08c643faee43b43e50d4cf9c82bbaf58cdf4","observation_id":"f464c2cb-460e-4b24-92bb-268a57b9e571","resolution":{"observed_at":"2026-08-07T05:19:40.064127Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.336943Z","title":"B ool Q : Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.336943Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:b715f494668a21f4693483abe36cd347348b38d12ed649922b069b2539662e1c","observation_id":"b68a1f17-a927-4d81-8e9d-0454e2d676e7","resolution":{"observed_at":"2026-08-07T05:19:39.336943Z","resolver_source":null,"status":"malformed_identifier"},"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-07T05:19:39.341107Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.341107Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:e5c32390f7faa2ff4651851cd96e371e2fd9b794630a5a541c944534bb8ff10d","observation_id":"0c5a8a8d-19b9-423f-934e-c130bbd014f7","resolution":{"observed_at":"2026-08-07T05:19:39.341107Z","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-07T05:19:40.052161Z","title":"Llm.int8(): 8-bit matrix multiplication for transformers at scale","venue":null,"work_id":"7eddf1c5-f6c9-4858-804c-841a0a8771d5","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.344971Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:800645f235cb69d1990e8e6c439c7f4bf872e0304edd34249ca3926c1dce3a1b","observation_id":"42c8af7f-e338-4e0b-b14f-ee8d28dd5e8a","resolution":{"observed_at":"2026-08-07T05:19:40.055339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.348041Z","title":"BERT : Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.348041Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:fcbb0a815e21b6ac09c03f1e2fb3f6508358626d63adb7f732e10a8e00df47ec","observation_id":"d020975e-afee-4817-acc5-bf21a6866d45","resolution":{"observed_at":"2026-08-07T05:19:39.348041Z","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-07T05:19:39.351654Z","title":"and Carbin, M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.351654Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:f9ea647e26769db2f125f582a3435112fbe273dc44152ac9cbe0ae7c6e9aba4c","observation_id":"aba0138f-0c52-47f0-a2a8-b8e63f9a2733","resolution":{"observed_at":"2026-08-07T05:19:39.351654Z","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-07T05:19:40.037448Z","title":"and Alistarh, D","venue":null,"work_id":"f6422e64-7840-43f6-a2f7-aaad809aac2a","year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.354689Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:96a5cc1c1c19e67e381b98703f6ccc1017446b72de09eb98039001367513badd","observation_id":"eb8e21b7-79f3-4978-b306-4e42d2a0621c","resolution":{"observed_at":"2026-08-07T05:19:40.040288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:40.028557Z","title":"GPTQ : Accurate quantization for generative pre-trained transformers","venue":null,"work_id":"e20f5af4-41ae-40b0-bad5-135d897e275f","year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.357621Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:5b28209b7418b969d0caa47eb645c5d51f6d0e428127d1c1dad0b871c04787b3","observation_id":"9fd1edd8-5186-44f6-bb15-afa772a1c736","resolution":{"observed_at":"2026-08-07T05:19:40.031774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:40.018963Z","title":"A framework for few-shot language model evaluation","venue":null,"work_id":"6772b0f1-4363-4db1-8e46-a6f5d00edb83","year":2021},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.360599Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:47cee99ef04ae1ea6438a21d2eeab914df85bae6a2f4c5e8420645d59b5b5f9c","observation_id":"f8cc4228-7631-4e41-886f-176f9f491dbd","resolution":{"observed_at":"2026-08-07T05:19:40.022070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:40.010278Z","title":"DISP - LLM : Dimension-independent structural pruning for large language models","venue":null,"work_id":"7f6781af-0605-498b-8dac-41395e943405","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.363590Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:1a2db74eebee5f00396b2b683250c09ea53ceb021c121ce32ff6186f60e85b79","observation_id":"b7d143a3-5efe-411d-95d8-057a6636fc01","resolution":{"observed_at":"2026-08-07T05:19:40.013326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2310.05015","last_updated":"2023-10-11T01:46:35Z","snapshot_observed_at":"2026-08-08T03:33:54.200118Z","submitted_at":"2023-10-08T05:16:28Z","title":"Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05015","snapshot_observed_at":"2026-08-07T05:19:39.366974Z","title":"L., and Yang, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.366974Z"},"links":{"cited_paper":"/paper/2310.05015","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:d21418ee9584e9168d92bc7864ae79e287471f620e74c28999cfa505d88c99c7","observation_id":"118ceff0-c3ca-432c-be65-e4512a181769","resolution":{"observed_at":"2026-08-07T05:19:39.366974Z","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-07T05:19:40.000720Z","title":null,"venue":null,"work_id":"d363674a-ae7e-47d9-95cd-266d0a8e91ed","year":2015},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.370864Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:d482508bd9de548c3aad55b14b1d87966e3d185fabd37b3da01417b887a141fa","observation_id":"a30af46e-991b-4ebf-8c58-65c740c1685a","resolution":{"observed_at":"2026-08-07T05:19:40.004399Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.991918Z","title":"and Stork, D","venue":null,"work_id":"28a0e13f-8699-4aa2-95a4-6e02db4aca36","year":1992},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.374015Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:d6e697d19e2385b0b443c6a44fb7e7cea4af6c9b26b39c2e195977d480daa62c","observation_id":"ce77be4d-8acb-4c80-8759-464911021f49","resolution":{"observed_at":"2026-08-07T05:19:39.994977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-07T05:19:39.377093Z","title":"Distilling the knowledge in a neural network, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.377093Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:2298bd94b5e00f9687d6903fda7bbdb1cf54c44180c5ee0d8adc50d7d780403a","observation_id":"e8f83239-7055-496f-aca2-96aacd1f8aa1","resolution":{"observed_at":"2026-08-07T05:19:39.377093Z","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-07T05:19:39.981726Z","title":"Language model compression with weighted low-rank factorization","venue":null,"work_id":"cfd4c552-26f4-49c1-aa62-ab9907a2533f","year":2022},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.380900Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:43d4d2707c624aa7932514744cbb937ab2c7eb00d7a582b98e8374a58072d418","observation_id":"97aa8058-3a22-4322-993b-cd47dfa7260f","resolution":{"observed_at":"2026-08-07T05:19:39.986223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.384064Z","title":"J., yelong shen, Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., and Chen, W","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.384064Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:3595eb5ad85a3307d69921c0bcfdff1d0d4bd5dd25ab28fb751868703b062def","observation_id":"594fe956-a05e-4ad9-aab8-70035c91ba31","resolution":{"observed_at":"2026-08-07T05:19:39.384064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-07T05:19:39.387208Z","title":"B., Chess, B., Child, R., Gray, S., Radford, A., Wu, J., and Amodei, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.387208Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:882c394bf3b42b1ef888ce491b3f45378684ca145f7677bf19864c4894884e36","observation_id":"d3f912db-4898-406c-b256-cbed89c2e2a3","resolution":{"observed_at":"2026-08-07T05:19:39.387208Z","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-07T05:19:39.966390Z","title":"W., Hassoun, J., Keutzer, K., and Gholami, A","venue":null,"work_id":"afcdfa7b-db45-4df0-a250-1a07ee6d5652","year":2022},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.391342Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:ebbc99d2ac10ffc97d1ae0dcf5e55d53da8379c192635139523c446268fe800b","observation_id":"8c8f0a0a-f545-4c67-a0e4-7c77ff0b9899","resolution":{"observed_at":"2026-08-07T05:19:39.970489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.956393Z","title":"Optimal brain damage","venue":null,"work_id":"ee21daa1-a91b-4bac-8941-b1fbf44ad327","year":1989},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.394389Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:ad1f859c01db67a45d7d44e8f039d0ee922dfddc6fb0bb760cf03c01c9c377df","observation_id":"4106c974-5c69-4064-928c-ca899a392256","resolution":{"observed_at":"2026-08-07T05:19:39.959797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.946674Z","title":"Lo RAP : Transformer sub-layers deserve differentiated structured compression for large language models","venue":null,"work_id":"a9a4bc87-fc9c-417a-9a03-1bc5631e533c","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.397795Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:051e415b8343d31efb30203078df7d00dc2fea88f94038c3463ef4ef039f1149","observation_id":"73547191-d759-4027-9e6c-c9617ed2a3bc","resolution":{"observed_at":"2026-08-07T05:19:39.950637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.937123Z","title":"Slim GPT : Layer-wise structured pruning for large language models","venue":null,"work_id":"a3b99923-be1e-443e-bb49-dcdac9f7541b","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.401117Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:71a837a1daf6d5d41b094f53b07313b6bd75d632fe55494d82be93d89a3ff2e1","observation_id":"8e7c3c95-8515-4e64-bdd5-8617c9e0364a","resolution":{"observed_at":"2026-08-07T05:19:39.940835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.928392Z","title":"Group fisher pruning for practical network compression","venue":null,"work_id":"7bcb5f28-211b-4a34-b02c-14fdc22d62b1","year":2021},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.405255Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:bd052b6ab79ea6c572f82f60c66c1ff4110f0083a56a50792a76609e4bf973eb","observation_id":"9ca82a9b-3f1c-4c8f-b81a-46ab410483b4","resolution":{"observed_at":"2026-08-07T05:19:39.931512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-07T05:19:39.408016Z","title":"Roberta: A robustly optimized bert pretraining approach","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.408016Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:80fe6734d8c54e0f742f5fef9a29cf8f5b5234a268f938440a9097e2fb8f6306","observation_id":"0ef0bd3d-a453-4fea-8838-74730a677076","resolution":{"observed_at":"2026-08-07T05:19:39.408016Z","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-07T05:19:39.919028Z","title":"LLM -pruner: On the structural pruning of large language models","venue":null,"work_id":"006e48ff-4301-45a3-802c-6a0aa35052ea","year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.411740Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:a0a181c502f0c599a20b095362f89358c9d006c8fcaf271006c81aadaa89841e","observation_id":"62ee0b5a-ba6f-42ea-b7d6-f0f15b98cea2","resolution":{"observed_at":"2026-08-07T05:19:39.922602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.415097Z","title":"Pointer sentinel mixture models","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.415097Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:a4821c36cb3aa51df3bff0471789793f8a5c0e965cd89c7b17600ed84d11fcaa","observation_id":"4336b068-7375-4e4e-89a7-955d4b205683","resolution":{"observed_at":"2026-08-07T05:19:39.415097Z","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-07T05:19:39.417777Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.417777Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:924dbe075912b7f04119df63eda5d6e3d3a23ab5ca4fe30183837d85ef212f4a","observation_id":"1eacf508-f557-44a1-8fca-01a668ed44e4","resolution":{"observed_at":"2026-08-07T05:19:39.417777Z","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-07T05:19:39.904937Z","title":"Importance estimation for neural network pruning","venue":null,"work_id":"d97e8130-1baf-48c1-8c71-97776932f625","year":2019},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.420815Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:e1319a5128e42dd1e8ce553b701808d2dc7a395918deeec19b472620cc68a499","observation_id":"2934eabb-0e32-4104-aa8f-9091f2506626","resolution":{"observed_at":"2026-08-07T05:19:39.908461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"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-07T05:19:39.423678Z","title":"Gpt-4 technical report, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.423678Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:5292b89369232bb1cb78560b5cced91d23b4fab2a1f141822e58c989f236cd31","observation_id":"694a289c-a9e0-4a94-bbfa-1a83fc8c4f4e","resolution":{"observed_at":"2026-08-07T05:19:39.423678Z","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-07T05:19:39.427436Z","title":"Training language models to follow instructions with human feedback","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.427436Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:0a9fe9c68493e81ef36051ddd0de333c651275b3976b15efe138b5bdcdd6c49f","observation_id":"e09e578f-bcf7-4d90-84c1-c885a77ae29e","resolution":{"observed_at":"2026-08-07T05:19:39.427436Z","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-07T05:19:39.890151Z","title":"Improving language understanding with unsupervised learning","venue":null,"work_id":"a98561dd-6838-4ed3-bda4-7c51922c223f","year":2018},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.430459Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:2dd2c06e54106ccdf81d13760b6123ad9cf06a742220247881065599fff25d3f","observation_id":"8cc4f880-49e5-4337-934e-9749a411dcfb","resolution":{"observed_at":"2026-08-07T05:19:39.893428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.433349Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.433349Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:2d956d04f55f77e61d76000f21d71f2ec129d7672c0cabd24682e987bf8804bd","observation_id":"82401b20-babd-4438-8802-c96a75deec6b","resolution":{"observed_at":"2026-08-07T05:19:39.433349Z","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-07T05:19:39.436259Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.436259Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:84e18ba023ac1862fa862c12b25aa869bedf8e480a78f7eb4eeb68a0027475d1","observation_id":"eb23360f-8f9f-4b2d-9133-83073a2a92f2","resolution":{"observed_at":"2026-08-07T05:19:39.436259Z","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-07T05:19:39.439231Z","title":"L., Bhagavatula, C., and Choi, Y","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.439231Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:461dee76965a8a7308ee5810a224d764c5f5116674a45c06344b3f770901c045","observation_id":"91388978-07fc-4d9d-af46-8b7b28849161","resolution":{"observed_at":"2026-08-07T05:19:39.439231Z","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-07T05:19:39.864402Z","title":"Movement pruning: Adaptive sparsity by fine-tuning","venue":null,"work_id":"ac0da42f-bbb4-4113-8819-6d49f8ec1f6c","year":2020},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.442670Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:26dcfd4bcf30ea06aaa6d1c8000bb704a3a62ae11f922bed848a946f611cc714","observation_id":"75dbfb12-a160-4353-998f-327ae0df68cf","resolution":{"observed_at":"2026-08-07T05:19:39.868462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.854830Z","title":"Are emergent abilities of large language models a mirage? In Thirty-seventh Conference on Neural Information Processing Systems, 2023","venue":null,"work_id":"4869a6d4-0160-47cc-b9bd-26cefacc13e0","year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.445536Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:7fa65e2e49265ab38e2d667adaf1838f315ee019fd28738c65d06ab670c9d821","observation_id":"747be2f4-1242-4001-a78d-e335d09b429b","resolution":{"observed_at":"2026-08-07T05:19:39.858288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.448721Z","title":"Roformer: Enhanced transformer with rotary position embedding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.448721Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:dd5f55d7a330d14a6b97fd5371e7affef3ddf90be31a6b3756645258eedc0efd","observation_id":"452ebd06-00e6-4723-a9c1-cca15ebfa60d","resolution":{"observed_at":"2026-08-07T05:19:39.448721Z","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-07T05:19:39.839794Z","title":null,"venue":null,"work_id":"e97aedaa-e553-468e-b300-4ba319384925","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.451643Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:901f589c38fd4bbd0fb637ee5036516d4847d59f1d49dbe0ad470e123816f20b","observation_id":"32a897bb-0267-45f2-9a0c-1e145975645b","resolution":{"observed_at":"2026-08-07T05:19:39.843646Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1908.09355","last_updated":"2019-08-25T16:13:24Z","snapshot_observed_at":"2026-08-07T14:15:56.428313Z","submitted_at":"2019-08-25T16:13:24Z","title":"Patient Knowledge Distillation for BERT Model Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.09355","snapshot_observed_at":"2026-08-07T05:19:39.455568Z","title":"Patient knowledge distillation for bert model compression, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.455568Z"},"links":{"cited_paper":"/paper/1908.09355","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:49ce85f0e7be36c002738ea07b69e6b737ddaef625a63508a75b5088370c418e","observation_id":"9ba242ea-e607-45c4-8656-c21c32ea2bf0","resolution":{"observed_at":"2026-08-07T05:19:39.455568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.03723","last_updated":"2024-05-06T03:30:02Z","snapshot_observed_at":"2026-07-06T18:10:37.836239Z","submitted_at":"2024-05-06T03:30:02Z","title":"Generative adversarial learning with optimal input dimension and its adaptive generator architecture","version":1},"cited_work":{"arxiv_id":"2405.03723","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.03723","snapshot_observed_at":"2026-08-07T05:19:39.595219Z","title":"Generative adversarial learning with optimal input dimension and its adaptive generator architecture","venue":"cs.LG","work_id":"55972271-e172-43e3-8eb9-af45339398b9","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.459155Z"},"links":{"cited_paper":"/paper/2405.03723","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:6c3fedafc65c524ded2e106cbae532ad130c5f6d254dc0d92bab5d07b1164dac","observation_id":"4c87448d-d4ca-4590-802b-43d188747050","resolution":{"observed_at":"2026-08-07T05:19:39.600814Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.831031Z","title":"AMSC : Adaptive multi-dimensional structured compression with theoretical guarantees, 2025","venue":null,"work_id":"1b1e6b3a-62f1-4118-82e5-d93aa167660b","year":2025},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.462557Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:cfa3e800489d11c0c6980a32c5159d567edf468d50ed06c81019119b833fbde0","observation_id":"8f476692-01f8-424b-b816-5f106a56a911","resolution":{"observed_at":"2026-08-07T05:19:39.834207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.465681Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.465681Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:24f8d4c5d80c70a9d6b0026482b0a2e940d84f6a4bdc1e3e946c2b7214b1e9f1","observation_id":"1208aebe-ad52-4368-aaaf-4c78047030f7","resolution":{"observed_at":"2026-08-07T05:19:39.465681Z","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-07T05:19:39.815463Z","title":"The falcon 3 family of open models, December 2024","venue":null,"work_id":"db561ebc-23cc-40f0-b84a-ef0effff4759","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.469131Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:6e294ffeb64312d9a055268d3e00a1f347f83b2c7a8b0e663845422995fe5184","observation_id":"cdded3cc-c127-4774-81ff-7bea7c4abe4f","resolution":{"observed_at":"2026-08-07T05:19:39.819487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"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-07T05:19:39.472924Z","title":"Llama: Open and efficient foundation language models, 2023 a","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.472924Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:1d7b0bc8c707da8a1607588c9136c2046159838b1eec882be485b8d80c6e954b","observation_id":"b16bcff0-71cd-4457-8242-9ce84e140446","resolution":{"observed_at":"2026-08-07T05:19:39.472924Z","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-07T05:19:39.476207Z","title":"Llama 2: Open foundation and fine-tuned chat models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.476207Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:a856462bd2d6d25a7bbbabc0a60ba55279bbe301b38012fd6728c15fca15cf9c","observation_id":"414bbf9a-6e44-4668-a8d1-20dbd1505b45","resolution":{"observed_at":"2026-08-07T05:19:39.476207Z","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-07T05:19:39.806756Z","title":null,"venue":null,"work_id":"fd6a7b49-7be1-43ea-967f-12f93284d7b8","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.479202Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:4ff2278688cf301088e77629589c8d5f69457f7413fd6d68ba264bc0d570ee87","observation_id":"87572497-e70e-4cf9-9881-47b3eb3dc42d","resolution":{"observed_at":"2026-08-07T05:19:39.809756Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.482223Z","title":"N., Kaiser, L., and Polosukhin, I","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.482223Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:9c0f5bcb010a069e6502f082ec8cb068c6430db14e2e9f0866325f23811d6aa1","observation_id":"476cd06f-6ba0-47f9-930c-c2116b1a4bd5","resolution":{"observed_at":"2026-08-07T05:19:39.482223Z","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-07T05:19:39.792388Z","title":"H., Hashimoto, T., Vinyals, O., Liang, P., Dean, J., and Fedus, W","venue":null,"work_id":"882c2704-c8d3-4ee2-bea1-e43ee0d6728b","year":2022},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.485054Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:369dd2564c73569a135bb6b1bd2225ebd3894a0bbb282a5c09e8336bc2b90d46","observation_id":"82ea346e-1c0f-4646-8769-c4e7209e5642","resolution":{"observed_at":"2026-08-07T05:19:39.795540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.782950Z","title":"H., Le, Q","venue":null,"work_id":"01374693-d3f1-4d15-8e53-24d223e4302d","year":2022},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.488120Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:36133eb011b1d953340e76b3b34be4ed55c04c994b5fe4081688c0e9ed8aa502","observation_id":"3296aacd-ffea-423d-9557-0feb1c37d9d9","resolution":{"observed_at":"2026-08-07T05:19:39.786191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.773827Z","title":"Learning structured sparsity in deep neural networks","venue":null,"work_id":"b54a36f9-f8d8-4d8e-a3dd-210526758b73","year":2016},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.491387Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:9f3749e5e6d29f775c3349a883848bcd34f6a57ebd41b70e9d2e3075762a6856","observation_id":"7d1d67fa-b526-4a31-9211-92fbc5ca27e0","resolution":{"observed_at":"2026-08-07T05:19:39.777077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:19:39.494719Z","title":"H ella S wag: Can a machine really finish your sentence? In Korhonen, A., Traum, D., and M \\`a rquez, L","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.494719Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:9775bd145c0092397cbfaab0d486c3009fcdf9b4ffd35491bb825d903f6b4270","observation_id":"fa09fa62-a5e1-48ea-81d0-adfe6f313f4a","resolution":{"observed_at":"2026-08-07T05:19:39.494719Z","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-07T05:19:39.498089Z","title":"L o RAP rune: Structured pruning meets low-rank parameter-efficient fine-tuning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.498089Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:fe6857de4f5a915418bf4c78e19e8239c5ecf70e010467a3a7b14fd820715b3e","observation_id":"5619ad58-3d09-48f9-9351-90b7711c4ff4","resolution":{"observed_at":"2026-08-07T05:19:39.498089Z","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-07T05:19:39.764746Z","title":"Apt: Adaptive pruning and tuning pretrained language models for efficient training and inference","venue":null,"work_id":"f944b3ea-1d33-47cd-9212-99546527898f","year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.501091Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:8a8e6df27b68e71661204e8b3f4653802e307b634963ab74e9bbd98df948eda9","observation_id":"21177c80-166f-4061-a6a9-b8de78d6ba74","resolution":{"observed_at":"2026-08-07T05:19:39.768052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2303.18223","last_updated":"2026-03-18T05:34:39Z","snapshot_observed_at":"2026-08-06T23:27:24.356320Z","submitted_at":"2023-03-31T17:28:46Z","title":"A Survey of Large Language Models","version":19},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.18223","snapshot_observed_at":"2026-08-07T05:19:39.503996Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.503996Z"},"links":{"cited_paper":"/paper/2303.18223","citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:d233d29237e8503c2fcbbd73e4ea1ba2ab0dc9fc623e4138a87ba9b1af7418f3","observation_id":"d6b020db-d73b-406f-8cd1-5e423e8868b4","resolution":{"observed_at":"2026-08-07T05:19:39.503996Z","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-07T05:19:39.507237Z","title":"Aligning books and movies: Towards story-like visual explanations by watching movies and reading books","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.507237Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:d7e550a9a1093d828be5664203eba5f6c2f9636521eb4f9ccaa11e71f9bf360a","observation_id":"052e4309-de4b-4ecf-bcd7-a830a7c20aaf","resolution":{"observed_at":"2026-08-07T05:19:39.507237Z","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-07T05:19:39.510504Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:39.510504Z"},"links":{"citing_paper":"/paper/2506.08436"},"observation_digest":"sha256:811bae1498fc75ced775f1e595cf3688af8f96a89b909c77b7deff300fcd0010","observation_id":"2c267c6f-044c-40ea-a54a-8185856f4b77","resolution":{"observed_at":"2026-08-07T05:19:39.510504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.08436","last_updated":"2025-06-10T04:19:38Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T02:40:05.621496Z","submitted_at":"2025-06-10T04:19:38Z","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":1,"verified_fuzzy":26},"total_outbound_references":61},"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 61 of 61 outbound references and 0 inbound Pith citation observations for arXiv:2506.08436."}