{"as_of":"2026-08-07T15:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:206244153abc1148c99f0098aa740dcb3639958a70623449db59c80de1d62233","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:48:31.112567Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T20:05:19.624171Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T14:45:49.686304Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"cited_work":{"arxiv_id":"2507.18212","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.18212","snapshot_observed_at":"2026-07-01T14:45:49.686304Z","title":"Prune&comp: Free lunch for layer-pruned LLMs via iterative pruning with magnitude compensation","venue":null,"work_id":"9b4d5184-b5b3-46fa-90c5-1c2a458c7a07","year":2025},"citing_paper":{"arxiv_id":"2604.24938","last_updated":"2026-05-09T03:09:53Z","snapshot_observed_at":"2026-07-31T18:37:45.542966Z","submitted_at":"2026-04-27T19:25:28Z","title":"Rethinking Layer Redundancy in Large Language Models: Calibration Objectives and Search for Depth Pruning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T03:56:11.148569Z"},"links":{"cited_paper":"/paper/2507.18212","citing_paper":"/paper/2604.24938"},"observation_digest":"sha256:7e0b0959e84ba561ba13e3a0b3a8149283904e916dced1d86ccbc31c6c91a386","observation_id":"c9f57684-7ab0-4bbe-b1b7-3cfeb234253c","resolution":{"observed_at":"2026-05-11T21:51:33.709283Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"cited_work":{"arxiv_id":"2507.18212","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.18212","snapshot_observed_at":"2026-07-01T14:45:49.686304Z","title":"Prune&comp: Free lunch for layer-pruned LLMs via iterative pruning with magnitude compensation","venue":null,"work_id":"9b4d5184-b5b3-46fa-90c5-1c2a458c7a07","year":2025},"citing_paper":{"arxiv_id":"2604.24938","last_updated":"2026-05-09T03:09:53Z","snapshot_observed_at":"2026-07-31T18:37:45.542966Z","submitted_at":"2026-04-27T19:25:28Z","title":"Rethinking Layer Redundancy in Large Language Models: Calibration Objectives and Search for Depth Pruning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-12T01:10:54.457902Z"},"links":{"cited_paper":"/paper/2507.18212","citing_paper":"/paper/2604.24938"},"observation_digest":"sha256:bfd69c948a20cf3fc78e603cb71db46b94b3973cef1dbe9c80983ebefaba6110","observation_id":"b9d0f8c0-b2f9-49cf-89e6-35e614696582","resolution":{"observed_at":"2026-05-12T08:26:24.020687Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"cited_work":{"arxiv_id":"2507.18212","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.18212","snapshot_observed_at":"2026-07-01T14:45:49.686304Z","title":"Prune&comp: Free lunch for layer-pruned LLMs via iterative pruning with magnitude compensation","venue":null,"work_id":"9b4d5184-b5b3-46fa-90c5-1c2a458c7a07","year":2025},"citing_paper":{"arxiv_id":"2605.15491","last_updated":"2026-06-07T05:17:05Z","snapshot_observed_at":"2026-07-06T23:26:46.595393Z","submitted_at":"2026-05-15T00:15:16Z","title":"Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T16:15:27.075005Z"},"links":{"cited_paper":"/paper/2507.18212","citing_paper":"/paper/2605.15491"},"observation_digest":"sha256:ef6c61a3588042183edec85bd29d8010d5cd0e97f6dc218000fd8c60ccaf9aa6","observation_id":"13be60b3-d85a-437e-88fd-afefd3dc4a1b","resolution":{"observed_at":"2026-05-19T16:22:40.249962Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"cited_work":{"arxiv_id":"2507.18212","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.18212","snapshot_observed_at":"2026-07-01T14:45:49.686304Z","title":"Prune&comp: Free lunch for layer-pruned LLMs via iterative pruning with magnitude compensation","venue":null,"work_id":"9b4d5184-b5b3-46fa-90c5-1c2a458c7a07","year":2025},"citing_paper":{"arxiv_id":"2605.15491","last_updated":"2026-06-07T05:17:05Z","snapshot_observed_at":"2026-07-06T23:26:46.595393Z","submitted_at":"2026-05-15T00:15:16Z","title":"Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T20:05:19.624171Z"},"links":{"cited_paper":"/paper/2507.18212","citing_paper":"/paper/2605.15491"},"observation_digest":"sha256:f0c7918df1683a4fdc043fa43949ac95f782c2e1cbab4bf124b9b16192e9af6f","observation_id":"fc1216f4-bc95-45d2-87e4-846f0f4b4a53","resolution":{"observed_at":"2026-07-01T14:45:49.687857Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.18212/citation-record","integrity":"/paper/2507.18212/integrity","json":"/paper/2507.18212/citation-record.json","paper":"/paper/2507.18212"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:48:27.385951Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:27.385951Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:17279d618c59d76de904b7222bc527148013720b3988c3d151254846c068eb9a","observation_id":"9c4e15a1-18e2-43d1-8511-e1359297d610","resolution":{"observed_at":"2026-08-06T14:48:27.385951Z","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-06T14:48:27.450320Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:27.450320Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:ffa0755fd5ebecda5892e1e73e6b8b40a95ff99be128350b60b207789241ca4b","observation_id":"8233bf35-d488-4e20-b601-df5c0a449534","resolution":{"observed_at":"2026-08-06T14:48:27.450320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-06T14:48:27.513899Z","title":"L.; Almeida, D.; Altenschmidt, J.; Altman, S.; Anadkat, S.; et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:27.513899Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:650aaa1d55c33d611688e08701cd61edec349625791a5eb64bcb46560423ab23","observation_id":"203f0c78-8df0-4320-954d-eb3c93e646d2","resolution":{"observed_at":"2026-08-06T14:48:27.513899Z","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-06T14:48:27.593107Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:27.593107Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:b08382e49a700886ddd5212ecdabf847068cc51ca641c75db289d9edaa16098b","observation_id":"29d4b591-d747-4660-9ce5-945b2ef8fcbe","resolution":{"observed_at":"2026-08-06T14:48:27.593107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15024","last_updated":"2024-02-09T17:59:40Z","snapshot_observed_at":"2026-07-06T17:21:01.918787Z","submitted_at":"2024-01-26T17:35:45Z","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15024","snapshot_observed_at":"2026-08-06T14:48:27.711161Z","title":"L.; Nascimento, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:27.711161Z"},"links":{"cited_paper":"/paper/2401.15024","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:8c6abfdb11ed5a1548bc22908e8e6b4df2d7f8f55d49358e3e9d3f6bd37065e8","observation_id":"4a6dd48c-9034-49cd-b7f6-c129a55090cb","resolution":{"observed_at":"2026-08-06T14:48:27.711161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00456","last_updated":"2024-10-29T11:09:12Z","snapshot_observed_at":"2026-08-05T10:45:45.389337Z","submitted_at":"2024-03-30T19:20:06Z","title":"QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00456","snapshot_observed_at":"2026-08-06T14:48:27.815438Z","title":"L.; Li, B.; Jaggi, M.; Alistarh, D.; Hoefler, T.; and Hensman, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:27.815438Z"},"links":{"cited_paper":"/paper/2404.00456","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:6b8ba3c33665f54530ef8da8b5c9cf588d72c45d5c44f587ff4b5da42506182b","observation_id":"78e5521c-12a9-461e-9bc8-8a703b5b8612","resolution":{"observed_at":"2026-08-06T14:48:27.815438Z","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-06T14:48:27.884150Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:27.884150Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:c7126f734a4546cf02f98f38ba53db0de9328e87dc38da73cd2a79a9731fe236","observation_id":"b9808810-0f31-42c1-ace1-2e4b0298d786","resolution":{"observed_at":"2026-08-06T14:48:27.884150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19135","last_updated":"2025-01-25T00:11:26Z","snapshot_observed_at":"2026-07-06T17:52:22.360870Z","submitted_at":"2024-03-28T04:12:13Z","title":"Streamlining Redundant Layers to Compress Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19135","snapshot_observed_at":"2026-08-06T14:48:28.208165Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:28.208165Z"},"links":{"cited_paper":"/paper/2403.19135","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:d9e5a40509145aee02c36e4e07cfe3fa6c02cb21f43ba517c7eff4be4223292f","observation_id":"49a42d07-a58b-4e49-9cf0-388dc536869d","resolution":{"observed_at":"2026-08-06T14:48:28.208165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-07-06T07:55:12.121264Z","submitted_at":"2019-05-24T05:48:49Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10044","snapshot_observed_at":"2026-08-06T14:48:28.312425Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:28.312425Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:c23895f3646ba21d16440c7ef9230fcaecfeb5ab7d44aec14f60a49f9ca2dcc9","observation_id":"a26a17f6-c00e-4f4f-9163-949b18de1e93","resolution":{"observed_at":"2026-08-06T14:48:28.312425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-06T14:48:28.457115Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:28.457115Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:0d351f0c69404dcafbe9b27cb1587509577e135ec33c3a689052189f9036dc6d","observation_id":"582ea67e-0899-43f4-bcf2-5708383dedbd","resolution":{"observed_at":"2026-08-06T14:48:28.457115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-06T14:48:28.531038Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:28.531038Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:a3776bf3f1a3f802899c250bc91cce89bf76b4a7c21203aa37fbaa543beba125","observation_id":"4a149450-1fc8-4935-bda6-fcdad3442e15","resolution":{"observed_at":"2026-08-06T14:48:28.531038Z","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-06T14:48:32.335671Z","title":null,"venue":null,"work_id":"255278a7-ea98-4476-8540-e90b8ebaedae","year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:28.627233Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:23028fe92a85c43eca025609e7e78cba161b0aba740cf9d2242ea218f08b3f16","observation_id":"83b50d35-c862-4828-a093-d5bbd2bfa90c","resolution":{"observed_at":"2026-08-06T14:48:32.418806Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-06T14:48:28.767530Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:28.767530Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:be415751e67f6ead71056b2606adf95e3e3055753afdca47fb9d88d9ae2e7ac6","observation_id":"9578cc95-c765-4e0c-8772-6ec6f2bca669","resolution":{"observed_at":"2026-08-06T14:48:28.767530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03300","last_updated":"2021-01-12T18:57:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-09-07T17:59:25Z","title":"Measuring Massive Multitask Language Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03300","snapshot_observed_at":"2026-08-06T14:48:28.850429Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:28.850429Z"},"links":{"cited_paper":"/paper/2009.03300","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:38003d60dab393ebe2a59f6df780369cd292d83cecbda90fa22710fbab527274","observation_id":"b37fa718-efe6-4e79-b4cc-c8e66f9b1182","resolution":{"observed_at":"2026-08-06T14:48:28.850429Z","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-06T14:48:32.181551Z","title":null,"venue":null,"work_id":"bf94eb02-2004-49fc-956d-b1101345df95","year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:28.904188Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:f0e0ebecf239949f6b0fca8bdef54dc71fd01a90453f00552e21260096a4aee3","observation_id":"39b4bf28-6fbb-4683-a6f0-74180c998283","resolution":{"observed_at":"2026-08-06T14:48:32.280427Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-06T14:48:28.963832Z","title":"Q.; Sablayrolles, A.; Mensch, A.; Bamford, C.; Chaplot, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:28.963832Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:1abb994bc09c2a245e44b19414b19a57a89612c92680335595482235eec13d6c","observation_id":"d81f966c-95ca-4b86-b79a-5e9b773d54fd","resolution":{"observed_at":"2026-08-06T14:48:28.963832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02834","last_updated":"2024-06-23T08:45:33Z","snapshot_observed_at":"2026-07-06T17:25:18.238343Z","submitted_at":"2024-02-05T09:44:49Z","title":"Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02834","snapshot_observed_at":"2026-08-06T14:48:29.073496Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:29.073496Z"},"links":{"cited_paper":"/paper/2402.02834","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:a1a8847da45efdcd05806a3632562d639b631c5c8e2ea84b6e01a65c3608c946","observation_id":"63c4b711-5a6c-467d-aca9-ed665381ee4c","resolution":{"observed_at":"2026-08-06T14:48:29.073496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04683","last_updated":"2017-12-05T19:36:03Z","snapshot_observed_at":"2026-08-07T10:40:47.462532Z","submitted_at":"2017-04-15T19:31:41Z","title":"RACE: Large-scale ReAding Comprehension Dataset From Examinations","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.04683","snapshot_observed_at":"2026-08-06T14:48:29.143095Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:29.143095Z"},"links":{"cited_paper":"/paper/1704.04683","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:4d45a77de982384d85feb650e6081f269d6fa088cba3eea420a50530fb61bb2d","observation_id":"f20c32d1-fb94-41c9-a0a7-cb2756fba962","resolution":{"observed_at":"2026-08-06T14:48:29.143095Z","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-06T14:48:32.030712Z","title":null,"venue":null,"work_id":"f8a3e272-0115-4bd8-9714-6def72b179e3","year":2012},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:29.271675Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:b83d905b2d2a08a30bdad4ddb1fae830ae79b5b0f9eb6c0dbb581486e3b8d116","observation_id":"500aedbb-9f57-4dbd-8aa7-1f53971e219c","resolution":{"observed_at":"2026-08-06T14:48:32.106843Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-06T14:48:29.362596Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:29.362596Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:876ee5585b2e0dc056827f54dbb23f5e18ce02038635e0c5d8380b9224fc23b7","observation_id":"55ce02b3-0f29-4780-8b8a-48aed765325c","resolution":{"observed_at":"2026-08-06T14:48:29.362596Z","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-06T14:48:29.483203Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:29.483203Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:58c4738add37eb682c157e7c1ca7efff8e189491f631f49e683957cbf205b42d","observation_id":"8e8786d9-9b67-43a5-b400-a2b506f3bd6b","resolution":{"observed_at":"2026-08-06T14:48:29.483203Z","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-06T14:48:31.812846Z","title":"P.; Santorini, B.; and Marcinkiewicz, M","venue":null,"work_id":"753d2c11-4105-4a2a-9066-70eea78537ce","year":1993},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:29.590938Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:de1a08087ba8240d7f2c44599872c1e96b3fb42fad3ef1d4e7181001bad6274e","observation_id":"1a8cf0fc-9262-43b2-bf27-1f27e8787c3e","resolution":{"observed_at":"2026-08-06T14:48:31.941117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03853","last_updated":"2024-10-11T09:43:32Z","snapshot_observed_at":"2026-08-03T01:48:18.654934Z","submitted_at":"2024-03-06T17:04:18Z","title":"ShortGPT: Layers in Large Language Models are More Redundant Than You Expect","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03853","snapshot_observed_at":"2026-08-06T14:48:29.745950Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:29.745950Z"},"links":{"cited_paper":"/paper/2403.03853","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:b7b090fad8d21b42ab131797529370f6cf0379054948fe8a75e6c9eb71a64e64","observation_id":"5d4749fa-b4ec-4dc7-8b2b-d4d4b1e84d4e","resolution":{"observed_at":"2026-08-06T14:48:29.745950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-07-06T05:12:10.387914Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-06T14:48:29.897738Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:29.897738Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:c7d124259a9eff4c2814b411a2041e55819fe7dfc306d4912e1ca920ba7918df","observation_id":"962d919e-a854-4b9b-9af3-3acf43976c29","resolution":{"observed_at":"2026-08-06T14:48:29.897738Z","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-06T14:48:31.602357Z","title":null,"venue":null,"work_id":"453ba6d9-d4cb-4018-91ed-e8c6be704f43","year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:29.979333Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:f78ef68caec1f6326650c9a43d3d7318136cf789b4c0c1a1528905fe96c7f1aa","observation_id":"d1654fc4-b7f2-40c6-8cde-1c25264f875c","resolution":{"observed_at":"2026-08-06T14:48:31.700843Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T14:48:30.025960Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.025960Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:91fa73245dcd3215cceb8f75e2925491f6aeb85c9ef8adf1907084ca5417f45d","observation_id":"a7a2d1cb-f2f1-41b7-a158-eb0fe3aab586","resolution":{"observed_at":"2026-08-06T14:48:30.025960Z","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-06T14:48:31.477147Z","title":null,"venue":null,"work_id":"4c197990-50a6-4cf6-a563-bc21f7a92837","year":2020},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.122526Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:218ddc578aff23d433d17e97e4aec9231afa8d8dfa29893aadd595140b0c4a1f","observation_id":"7fde39bd-a105-47d4-81c2-1034a71ff21a","resolution":{"observed_at":"2026-08-06T14:48:31.547694Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.18377","last_updated":"2024-05-28T17:20:44Z","snapshot_observed_at":"2026-07-06T18:21:26.195207Z","submitted_at":"2024-05-28T17:20:44Z","title":"LLaMA-NAS: Efficient Neural Architecture Search for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.18377","snapshot_observed_at":"2026-08-06T14:48:30.186039Z","title":"N.; Szankin, M.; and Sundaresan, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.186039Z"},"links":{"cited_paper":"/paper/2405.18377","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:dd47f5f0a901d54c64a01cadcaa6357342701ecaa049e7861b55078d27f8a5cc","observation_id":"24b44234-c6ec-4912-be83-e92a4182d77d","resolution":{"observed_at":"2026-08-06T14:48:30.186039Z","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-06T14:48:30.299270Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.299270Z"},"links":{"citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:29e6c5d1a3ac135d5531cfad52fbd9211c79c5dabe1d4edf1a67ac4656926a0a","observation_id":"253b1e89-f118-4dbc-ad63-3b8c5b8cba17","resolution":{"observed_at":"2026-08-06T14:48:30.299270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-08-06T14:48:30.383090Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.383090Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:b15390937221540760fcb425953b3351939707a8c71132e6f313a199a0b10f63","observation_id":"e6567f3c-3e5f-4d7b-ba81-7140ec8adb65","resolution":{"observed_at":"2026-08-06T14:48:30.383090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11796","last_updated":"2024-12-09T18:31:01Z","snapshot_observed_at":"2026-08-07T10:56:20.468878Z","submitted_at":"2024-08-21T17:38:48Z","title":"LLM Pruning and Distillation in Practice: The Minitron Approach","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11796","snapshot_observed_at":"2026-08-06T14:48:30.490362Z","title":"T.; Muralidharan, S.; Joshi, R.; Chochowski, M.; Mahabaleshwarkar, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.490362Z"},"links":{"cited_paper":"/paper/2408.11796","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:d027bbd3c8ad64526870b5843a5f3c21e67baa364c10c9430d880e0f27fc1392","observation_id":"6a757ed2-78c4-4e62-a543-83ccf6affcbc","resolution":{"observed_at":"2026-08-06T14:48:30.490362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11695","last_updated":"2024-05-06T17:47:01Z","snapshot_observed_at":"2026-07-06T15:44:42.776459Z","submitted_at":"2023-06-20T17:18:20Z","title":"A Simple and Effective Pruning Approach for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11695","snapshot_observed_at":"2026-08-06T14:48:30.559260Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.559260Z"},"links":{"cited_paper":"/paper/2306.11695","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:a7c2307350d39b734441806b31a4c6948cd1ab11e87b4f0425c8efd38d274073","observation_id":"53102572-170d-477c-98a4-bbf7328d36a3","resolution":{"observed_at":"2026-08-06T14:48:30.559260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09426","last_updated":"2025-08-10T14:08:54Z","snapshot_observed_at":"2026-08-06T23:56:49.803329Z","submitted_at":"2024-10-12T08:10:28Z","title":"FlatQuant: Flatness Matters for LLM Quantization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09426","snapshot_observed_at":"2026-08-06T14:48:30.655337Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.655337Z"},"links":{"cited_paper":"/paper/2410.09426","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:f812a6863b6e2e0450d290394204418aa120b661ecc861e57d548d43d93c1020","observation_id":"01d5bc78-5d95-421a-980a-e0fa4f1b8566","resolution":{"observed_at":"2026-08-06T14:48:30.655337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12599","last_updated":"2025-06-03T02:14:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T02:48:14Z","title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12599","snapshot_observed_at":"2026-08-06T14:48:30.735705Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.735705Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:67b2e49a392ea6eb6f30a07b1f3074b641d7748acce673683b0ab482c30b79d2","observation_id":"2eae604f-e47c-4152-938b-69fbc06e6877","resolution":{"observed_at":"2026-08-06T14:48:30.735705Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-06T14:48:30.765872Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.765872Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:2533721e3f19ec2503c3e619a65fc2c65347ef23f8662579a7419a8953fbac2b","observation_id":"8720bdc4-1e6b-4be8-8765-ccdaec8acdb4","resolution":{"observed_at":"2026-08-06T14:48:30.765872Z","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-06T14:48:30.823051Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.823051Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:8efc9a73f1b6c88cf73ad671193ad63ef243cedbf44c93dfdcbc51716bc99cbc","observation_id":"39d0df1f-38f4-40a6-a335-e62510cb4b6c","resolution":{"observed_at":"2026-08-06T14:48:30.823051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.17244","last_updated":"2024-03-20T20:21:58Z","snapshot_observed_at":"2026-08-04T16:58:03.675077Z","submitted_at":"2023-12-28T18:59:09Z","title":"The LLM Surgeon","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.17244","snapshot_observed_at":"2026-08-06T14:48:30.947207Z","title":"F.; Nagel, M.; Van Baalen, M.; Asano, Y","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.947207Z"},"links":{"cited_paper":"/paper/2312.17244","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:3555480cdee3c5a0990b70528ea98e70e6a0f9dd99c1149949d1e6a838b288a0","observation_id":"f514a3aa-2f88-4ff0-b9db-118019b52c53","resolution":{"observed_at":"2026-08-06T14:48:30.947207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06694","last_updated":"2024-04-11T01:18:06Z","snapshot_observed_at":"2026-08-07T03:20:22.127593Z","submitted_at":"2023-10-10T15:13:30Z","title":"Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06694","snapshot_observed_at":"2026-08-06T14:48:31.043874Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:31.043874Z"},"links":{"cited_paper":"/paper/2310.06694","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:02526522645266911994d77445b595f4e93aa79171a1ac4dab2e4353746d5990","observation_id":"f2e75abe-8d09-4f00-8771-64cb389afb47","resolution":{"observed_at":"2026-08-06T14:48:31.043874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-07-31T00:09:56.948833Z","submitted_at":"2019-05-19T23:57:23Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07830","snapshot_observed_at":"2026-08-06T14:48:31.112567Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:31.112567Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:12d79dab4d5804502cca111415ed4c9daaa26f6d47b779a993252e24e664a76a","observation_id":"e2d7c3f5-b98f-4cc5-afbb-47d5030f6f2a","resolution":{"observed_at":"2026-08-06T14:48:31.112567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":39},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 4 inbound Pith citation observations for arXiv:2507.18212."}