{"as_of":"2026-08-10T13:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1a3622079c35651456964e6815fd462c1948455f0e77cfae38efdef1e982ce92","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-10T06:31:04.303077+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-09T09:54:36.095275Z","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:59d80185226c803d099204350dc0392db62dee6b1d5338264617ff97a85c9f91","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:8b53787ba0152fb408d8b9a12de0d0714c4b2036c472b3fafc95eb7e6a8be106","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-09T21:25:20.369782Z","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-09T09:54:36.095275Z","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:fd62123be197f8ff3f1cd4b89f51f5cf3022e8d455ece2e85c94d654dfb2fcad","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-09T09:54:36.095275Z","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:32b8865aa2847f07c11a96c4d39acd01aa2a1d75e9041f3be17274cefc6fc770","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:9070dd48193305bf587baefd40e461c11b63987dcfe1f27673304cd2c04f98cc","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-09T09:54:36.095275Z","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:fa1f72e757db89b93af554ce0314fb9ffd2decdf5c26a09f8a787d9c35f142a0","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-09T09:54:36.095275Z","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:b54f74bcbb5e970730a8d553c1354108f82fcdfd429c3d5a8904541539b01335","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:9d549660595c22769794e8e42edc878947ab6f5eefb2f1ebef60fbc4211cd93f","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-09T09:54:36.095275Z","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:3a0ec9dc411fb1e6e19f0346dfc10b3414ce4ea921a0adc30d0fb15ce32b9a18","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-09T09:54:36.095275Z","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:7ddab159558ae823f5c89a090a78997bd40c9167527e9521b1e93bfcf898fe27","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:ca55c23aaee19d1da3a6b49c0bb4c420f4948d828a9f57f172b13534514790d2","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-09T09:54:36.095275Z","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:8b187f68f08a6d80bc4f5bb801865fa718b460ddb8fcaac51b56154c269d9d0d","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-09T09:54:36.095275Z","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:dc2c0cf538504d7dfca1875861d11cf4143b4089d81ce485f8a5ef095cc37235","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:2e5f5507d827f66cfa55345a2612c33c3970619ba7b76671ab2393f4dc0faba2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:3ea206bb885969643578e8708d567110c695c52e9231d37b3662e6caad8749c5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:48b451400240979098196ae6cc98e9556abddd6872c5ec888136250d7f67b281","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T09:36:29.224880Z","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-09T09:54:36.095275Z","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:9aae403e212153caeec385531a60c68568ed25239f0f5b418a59ec89f86d169f","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-09T09:54:36.095275Z","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:bc71c9bde38045a68965731372169fe9c65512a4d04c28130dd5f07b01af2942","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:9155f72b45ccb00fde26f5856ac73c2af8861cb80238ffb1c722485a117f3dbf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:76b6a1c85d81d44f449d913a943a706d2afbbfb7f95cace1cd53b8bb5b6db52d","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-09T09:54:36.095275Z","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:1c17641fbf79f8ddd416f4a2f800bfbe579a3611ec47013cccd2b944c5599431","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:19bd9bc14860c6d5fcbd1ea56ebcc19ee5d7b06974cf04c5c24c82ee78f7bec6","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-09T09:54:36.095275Z","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:853b7f9b4f6fd1d7e22a5ed5e5d5c99a4b3d3fd8ea65afedcaddc7875dbe6415","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-09T09:54:36.095275Z","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:e424fdb32ef9e56e452644e7806b018d11c6c40d46db51b71fc39dd6b2aadc96","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:10bff6469be21473cfb2963f57664de8cf11fc8d1e30a9c9b6fdda48fdbdb582","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:667e3ad20b24cd838ef23f6165d21868fde47da5a72a40f71e2585485ed55d14","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:436042d72a9d48d1e4b300d3f25044a817ca13f7a1afd282110ad00c8c624995","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:ef57a2c566fab53999f4e0cf944181c6ac3a4fc44bab71baf92f60eaf8f859d1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:cc06f05cb8c7e99fadd5c5b3da0f3f3dcb927e472a49ad01967772bdbf7d9eb7","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-09T09:54:36.095275Z","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:a5a137d179111a06ebe300cc732ee44c711bc478756612d2d86bf91e7ca99e61","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:f2f05f93f7f36428e5da109c13c87f64058fb602b65cd5aafbce0931c5f61bf4","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-09T09:54:36.095275Z","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:d7bf3aac2837111c883956c562bf945ef53275353025345c70f5fa0f6f0fec85","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-09T09:54:36.095275Z","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:c2ddd5c5e4912af223031088b6d3e617f4a65044d6f5cacd8fbca271d69eb028","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:00c452dc631f3e85d5c87e06a11773535cc795bc30f848df1c257ad87e5badc9","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-09T09:54:36.095275Z","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:eef8f4beac66f85fd7291b5afd32c476cbd16a448f774391f77080b5c611a42d","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-09T09:54:36.095275Z","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:09aaeba712d16f9ce844bc8419d038e4c5bb8583e59927dad8d0959c8bcab540","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:b6254074fbad6ed5f8d69181179bfb550028191d68bc5b47b144f2af64717aaf","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-09T09:54:36.095275Z","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:3f2a154160ab0b1cefd6d83e7e8cfa2baaebee868852774423472398bbc7d16a","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-09T09:54:36.095275Z","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:edea89e19f780b22a0176e201a2e6c617b462fc406538b4902361acd60a7cca2","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-09T09:54:36.095275Z","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:caab0a6cdbe66eae0f840fa4485018e4ae70249d7ddfb33f4a4eda8db6f9a551","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:393ceb0da4204baa3ea9887a21184d7db3bf02e5c2df2bea551a886b5f84db83","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:170ba7bef3d40abdec83481082b4c6e8d5622b6c5c30dec90f10045035c61a1d","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-09T09:54:36.095275Z","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:91176d07c346307f1b79e564b7d7d74d01ee84a846b058d5a64cef5d40c986d6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:8d9a1f9bdf7392ea70c2f82fc416ca9978898cf0dfd7e02c4086c60744ed0b6e","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-09T09:54:36.095275Z","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:7a6ebe805b4ab31782fef0234c27231e2422cb51537be9fa75174ac50b182742","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:5a4f2978f2bd1a304ad98bb1183f5fddef4967303a1eb40db5d783f320fcf440","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:3f2143101424f6ff48c554c60038d76fdddbb4e8416e2c406f3225e0dd8a1780","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-09T09:54:36.095275Z","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:e32eafd04de552829860d40d164455db6114aa3f36bee6bca4a367fd86632d7c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:5d28a0616ecfdf62af9647a87be1e772cad4235cad00ee5b08dbb0391b8ee1c6","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-09T09:54:36.095275Z","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:d65491e67a351c81141ac523f9d1857b2a7e3517ecf2423eb359d6edba3adf07","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-09T09:54:36.095275Z","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:ebaba211b7ee28706c893105d8a87b98150a607483bd133ac11f38807d6cd607","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:390cc025ccd4ca7845b97608e04aed7efba045c4405f315b8a22b67078a820eb","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-09T09:54:36.095275Z","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:e731bc127c00f50cdc17a8a6ee00edc12fe522456eb7b47dd5b83ed157dc972e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:aea959faa6ecb85d9ad4087c5850c726f1d341224518e3fa81f3bb774caad177","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:a727f31c368d027987a283413fe8082d9c526e04523290ea3a5b48187878ef7f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:baacffae27a4b4d04aa95f52acaa85c06cc7afd716f9fcd64a94097e9f16b11f","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-09T09:54:36.095275Z","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:56610d5e74079f36a5747ef66196cf168c2c76f939d05061d30fc5b3b95b54d1","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-09T09:54:36.095275Z","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:f05d8a21d46817677f2a21a95400d6774fef768cbb5e5865fe5754aadf17eebf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T09:54:36.095275Z","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:f3673866eee1e0b870b2b8eea536b062c6e9a7f9292fac3bfcdba5289a688ce5","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-09T09:54:36.095275Z","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:78efbba65b7f1b72e70d82cbd09b5a9d273e62355c77c874cded8ecbe7b24541","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-09T09:54:36.095275Z","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:7e0e2ff2d454d1316dcf076a3e5ec30b7523e61d93571f1705242751a77251ac","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-09T09:54:36.095275Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 0 inbound Pith citation observations for arXiv:2506.08436."}