{"as_of":"2026-08-18T16:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3e8be7cfb27a9d4cf7a02403adfa99d1d52c5ceb2c79f426d339e38eab46ebcc","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:58:17.887134Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.12953/citation-record","integrity":"/paper/2608.12953/integrity","json":"/paper/2608.12953/citation-record.json","paper":"/paper/2608.12953"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","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-15T19:58:17.570168Z","title":"The llama 3 herd of models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.570168Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:23b26bb5db20929bb577419500756ec8799b0154d58c5570e14f97dcf8113859","observation_id":"7ac930d8-8a02-4ccb-8df5-6595d3e22288","resolution":{"observed_at":"2026-08-15T19:58:17.570168Z","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-15T19:58:17.576822Z","title":"Qwen3 technical report,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.576822Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:35ccd928020468e32a24d39b13a3c0787a0d7a73435c65966630adf53bda6878","observation_id":"d34fa210-4a33-45fa-9c83-ce3cc9953984","resolution":{"observed_at":"2026-08-15T19:58:17.576822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-08-15T17:27:11.980940Z","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-15T19:58:17.582268Z","title":"Deepseek-v3 technical report,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.582268Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:b372f0eb6c2d9d6b005944897dee7da1311539ce9e24772efd6925e006fd262f","observation_id":"1e6bcf37-e3ae-4c41-a1cc-cf295f1eea2a","resolution":{"observed_at":"2026-08-15T19:58:17.582268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.10925","last_updated":"2025-08-08T19:24:38Z","snapshot_observed_at":"2026-08-14T02:46:12.121034Z","submitted_at":"2025-08-08T19:24:38Z","title":"gpt-oss-120b & gpt-oss-20b Model Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.10925","snapshot_observed_at":"2026-08-15T19:58:17.587528Z","title":"gpt-oss-120b & gpt-oss-20b model card,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.587528Z"},"links":{"cited_paper":"/paper/2508.10925","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:25ead713de8d2d8d6298867003fb83c559540ff9f9b7f65b5034cc6a66bba9eb","observation_id":"358d6888-9cd0-4ce6-8649-64a1e6b6141a","resolution":{"observed_at":"2026-08-15T19:58:17.587528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.07633","last_updated":"2024-07-30T13:14:55Z","snapshot_observed_at":"2026-08-16T15:08:25.859326Z","submitted_at":"2023-08-15T08:31:05Z","title":"A Survey on Model Compression for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.07633","snapshot_observed_at":"2026-08-15T19:58:17.591834Z","title":"A survey on model compression for large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.591834Z"},"links":{"cited_paper":"/paper/2308.07633","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:8e048bf192e65cd4bd872f93ed68e9ca828785c592e2c91203652f5ef647a274","observation_id":"d7ad915d-16b2-4492-a0cb-307eb22ecf6c","resolution":{"observed_at":"2026-08-15T19:58:17.591834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20011","last_updated":"2024-10-25T23:52:28Z","snapshot_observed_at":"2026-08-16T13:05:49.624956Z","submitted_at":"2024-10-25T23:52:28Z","title":"A Survey of Small Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20011","snapshot_observed_at":"2026-08-15T19:58:17.596292Z","title":"A survey of small language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.596292Z"},"links":{"cited_paper":"/paper/2410.20011","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:7c78e4e855737fb2a522b49962138b6199d6e5b588134535b918f77a8f4cdccd","observation_id":"a529f626-b143-4411-bb47-f2230ed0df60","resolution":{"observed_at":"2026-08-15T19:58:17.596292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00532","last_updated":"2019-06-07T16:27:47Z","snapshot_observed_at":"2026-08-14T16:22:12.102152Z","submitted_at":"2019-06-03T02:29:22Z","title":"Efficient 8-Bit Quantization of Transformer Neural Machine Language Translation Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.00532","snapshot_observed_at":"2026-08-15T19:58:17.600956Z","title":"Efficient 8-bit quantization of transformer neural machine language translation model,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.600956Z"},"links":{"cited_paper":"/paper/1906.00532","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:54b43f9bd507d3d60f221e4e62fd36a3336ec6257823d4df46d7f388d79ba836","observation_id":"6081fddf-19ce-4215-b5eb-adc26899ba8a","resolution":{"observed_at":"2026-08-15T19:58:17.600956Z","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-15T19:58:19.153490Z","title":"Qlora: efficient finetuning of quantized llms,","venue":null,"work_id":"7ab5d437-3fa5-4b93-85f6-b5903a444df8","year":2023},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.605226Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:57dd69b38958227721aa817db3a00a39a63a010d6ebd1328553daeb2e30d50d7","observation_id":"e90524c1-ea53-4117-b3c7-e6fc0d72b528","resolution":{"observed_at":"2026-08-15T19:58:19.157497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:19.140920Z","title":"CBQ: Cross-block quantization for large language models,","venue":null,"work_id":"c8af2550-06f9-4a44-872a-a4a5d7b325ae","year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.609562Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:e31bd08d6c9b1ab64204602b3e9aa562ac814a4fb9b1fd35e3d858e02ec7ed1d","observation_id":"8468d2b7-74dc-4a7a-8618-9ce8c24a2637","resolution":{"observed_at":"2026-08-15T19:58:19.145645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.08543","last_updated":"2026-01-31T09:16:35Z","snapshot_observed_at":"2026-08-16T00:37:04.298248Z","submitted_at":"2023-06-14T14:44:03Z","title":"MiniLLM: On-Policy Distillation of Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.08543","snapshot_observed_at":"2026-08-15T19:58:17.613248Z","title":"Minillm: Knowledge distillation of large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.613248Z"},"links":{"cited_paper":"/paper/2306.08543","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:b0dbbd96d82966a0c36742777242712fb6c093afabef0ad2d5b6a2794abe71b4","observation_id":"696c57bf-3d76-42fe-bb32-5c796c46da7f","resolution":{"observed_at":"2026-08-15T19:58:17.613248Z","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-15T19:58:19.127748Z","title":"A good learner can teach better: Teacher-student collaborative knowledge distillation,","venue":null,"work_id":"a1708345-b0ba-404e-8a4e-634425bf14fd","year":2023},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.617237Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:0e2f94a688b1e776698f0cb53ac32902b1f16f150e822f95ae1b5416a40e92a4","observation_id":"30cfe390-b67a-4c5a-a205-7b961f1f72cb","resolution":{"observed_at":"2026-08-15T19:58:19.131814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.02819","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:58:18.519308Z","title":"Replaceme: Network simplification via depth pruning and transformer block linearization,","venue":null,"work_id":"e4f3a802-1074-4aee-a17f-876ca35f0b7e","year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.621289Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:6cc67ab2d184311e594e2322750710bf0e2604322a78e6b53fcfd879c559cc38","observation_id":"31462cd9-75d9-41c4-8670-23cb9af894b0","resolution":{"observed_at":"2026-08-15T19:58:18.525675Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03853","last_updated":"2024-10-11T09:43:32Z","snapshot_observed_at":"2026-08-16T14:12:14.696997Z","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-15T19:58:17.624897Z","title":"Shortgpt: Layers in large language models are more redundant than you expect,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.624897Z"},"links":{"cited_paper":"/paper/2403.03853","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:0dbb4f7fa573c2423ae1b552a25d4eca973cba6dc565e38e0932e66c437c839c","observation_id":"60d07a5e-d8af-4dd1-b833-012076a63079","resolution":{"observed_at":"2026-08-15T19:58:17.624897Z","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-15T19:58:19.114734Z","title":"SLEB: Streamlining LLMs through redundancy verification and elimination of transformer blocks,","venue":null,"work_id":"752795cd-56d9-4a4c-beaa-f9735f3dfc3d","year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.629406Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:4153eff9a10dcee8b589c6212504ac62ca833b9a597e722aa996b9fd48a80732","observation_id":"44a4c48d-f42f-4dcc-bce9-4c1b2f541578","resolution":{"observed_at":"2026-08-15T19:58:19.119624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:19.101615Z","title":"The unreasonable ineffectiveness of the deeper layers,","venue":null,"work_id":"5aba02b0-f700-41cc-9d94-04fce8f0bae8","year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.633026Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:3cf9ea962c97a814a8a42d5b254e526765f911f93e9f643c46ea85ee53617e13","observation_id":"96537e75-9780-4f30-8358-94a386e1bed7","resolution":{"observed_at":"2026-08-15T19:58:19.105845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:19.088985Z","title":"Llm-pruner: on the structural pruning of large language models,","venue":null,"work_id":"a3348f34-ce99-4053-9560-baaea3af5085","year":2023},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.636874Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:a05ddf70a2d6b23ca531eec92b960929171d2403aa23612ed4f96b017a3b066f","observation_id":"8ae69e94-9a9e-45b7-80d5-e3685e77b77e","resolution":{"observed_at":"2026-08-15T19:58:19.094315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:19.074892Z","title":"Y ou only prune once: Designing calibration-free model compression with policy learning,","venue":null,"work_id":"3a54fc58-02d1-4f0c-a63e-b5ecf8d8926c","year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.640794Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:8cc00286718a5555d542fc2c249fbc0ccf6bd62ceed51946157d1781b7534c96","observation_id":"c53df1b6-c14d-4676-90cf-77154a9f8373","resolution":{"observed_at":"2026-08-15T19:58:19.079357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15024","last_updated":"2024-02-09T17:59:40Z","snapshot_observed_at":"2026-08-16T14:24:10.346445Z","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-15T19:58:17.644475Z","title":"Slicegpt: Compress large language models by deleting rows and columns,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.644475Z"},"links":{"cited_paper":"/paper/2401.15024","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:73b476e977dc5b0deb918a39d00db54b4ad1b85b7d7d3f6b3823101ca60e826c","observation_id":"dbda6eff-0b50-45b3-bd3d-5ce35d707bf3","resolution":{"observed_at":"2026-08-15T19:58:17.644475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02834","last_updated":"2024-06-23T08:45:33Z","snapshot_observed_at":"2026-08-18T12:31:28.811633Z","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-15T19:58:17.649158Z","title":"Shortened llama: Depth pruning for large language models with comparison of retraining methods,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.649158Z"},"links":{"cited_paper":"/paper/2402.02834","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:de111cc0b4a47d6138705f886c3063a824aabb254ff568f4411733ccc32287dd","observation_id":"3ec65aee-ff2f-4c5f-aada-73f8f4787b34","resolution":{"observed_at":"2026-08-15T19:58:17.649158Z","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":"10.1609/aaai.v40i25.39222","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:58:17.933291Z","title":"Sliding-window merging for compacting patch-redundant layers in llms,","venue":null,"work_id":"28677031-4a06-442f-8297-710246b193ca","year":2026},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.653122Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:96c77a5abdda22548ecbc686e6a0b1542417db726c3fdef5157476155270b564","observation_id":"60b41dfa-e088-483c-8485-68f967d493f8","resolution":{"observed_at":"2026-08-15T19:58:17.939790Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:19.063585Z","title":"Beware of calibration data for pruning large language models,","venue":null,"work_id":"0bce61f9-09c8-4425-bf38-f588949796d4","year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.657284Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:7d7fdbc1047b93e9b7c7789ff5b4d7f6b29e5064cddb5abd009f9ece8feb5fbd","observation_id":"d30ab97f-f96b-426d-b3d8-fdf00b9f82ac","resolution":{"observed_at":"2026-08-15T19:58:19.067548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:19.052433Z","title":"I-bert: Integer-only bert quantization,","venue":null,"work_id":"df98f9c6-621b-4fea-a71c-68050123d348","year":2021},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.661367Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:2f498acad61eb1dbd539d758204698d99701819e63e589aae786d573f041d8fa","observation_id":"77e4b368-0511-4715-95ec-0bb061eecb1e","resolution":{"observed_at":"2026-08-15T19:58:19.056297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:17.665428Z","title":"Llm-fp4: 4-bit floating-point quantized transformers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.665428Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:05f7870d31a6b004eb63bedf4b6c8d8d4694722aa6be537cd98577cb1cc6d432","observation_id":"11053eb2-9d2f-4fe2-a02d-431438d36867","resolution":{"observed_at":"2026-08-15T19:58:17.665428Z","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-15T19:58:17.669428Z","title":"Aptq: Attention-aware post-training mixed-precision quantization for large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.669428Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:651df2f1988847c84a233c9fb46e3b52eb87f7493fc40f1563ac056a34e06a15","observation_id":"16e72b1a-077c-42cc-b8ad-a419a1ba646d","resolution":{"observed_at":"2026-08-15T19:58:17.669428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-08-16T18:00:58.008096Z","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-15T19:58:17.673469Z","title":"Distilling the knowledge in a neural network,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.673469Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:fdc167d2f6c7b03d41725a748a0f660ce7c44a086d6ec78a4c9b00f04c8ad3bd","observation_id":"983469a0-a314-4c1a-a01c-26747010387d","resolution":{"observed_at":"2026-08-15T19:58:17.673469Z","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-15T19:58:19.040471Z","title":"TinyBERT: Distilling BERT for natural language understanding,","venue":null,"work_id":"a12e3525-f781-412b-8aa6-ad0a278dfcd2","year":2020},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.677492Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:4e21960cd84738ee0055c9928a7d75046947987efbb0eae836af26c7bea1255d","observation_id":"cbe78255-4706-4877-b4a8-f6e7e1a8f471","resolution":{"observed_at":"2026-08-15T19:58:19.044424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07155","last_updated":"2025-08-26T12:19:42Z","snapshot_observed_at":"2026-08-16T13:53:28.073484Z","submitted_at":"2024-05-12T04:18:10Z","title":"Meta-Learned Modality-Weighted Knowledge Distillation for Robust Multi-Modal Learning with Missing Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.07155","snapshot_observed_at":"2026-08-15T19:58:17.681644Z","title":"Meta-learned modality-weighted knowledge distillation for robust multi-modal learning with missing data,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.681644Z"},"links":{"cited_paper":"/paper/2405.07155","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:dd3ac43160fad369929bd90d49e48b152d0e40a2c22cf7dda7c9918d8da6d48c","observation_id":"1c0e06d5-5097-4e5b-be58-b2f50810b682","resolution":{"observed_at":"2026-08-15T19:58:17.681644Z","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-15T19:58:17.685725Z","title":"Activation sparsity opportunities for compressing general large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.685725Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:1f2e4c519e22be1e513ff7a7d8343631f41f3d30e3e557136211d5b43ca7eba7","observation_id":"4ba8e24d-987e-43dd-a05f-5318d20a94bb","resolution":{"observed_at":"2026-08-15T19:58:17.685725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.02335","last_updated":"2025-06-30T09:50:52Z","snapshot_observed_at":"2026-08-18T12:37:42.364458Z","submitted_at":"2024-11-04T17:59:04Z","title":"Sparsing Law: Towards Large Language Models with Greater Activation Sparsity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.02335","snapshot_observed_at":"2026-08-15T19:58:17.689641Z","title":"Sparsing law: Towards large language models with greater activation sparsity,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.689641Z"},"links":{"cited_paper":"/paper/2411.02335","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:75c002ad17336036e07831f7eed41c8ebee7b6887bd5b606b6be951125ef7061","observation_id":"92b8990e-e227-4992-8cf1-27859f06b6a8","resolution":{"observed_at":"2026-08-15T19:58:17.689641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14690","last_updated":"2025-02-25T21:00:50Z","snapshot_observed_at":"2026-08-18T15:24:37.105582Z","submitted_at":"2024-08-26T23:30:15Z","title":"Training-Free Activation Sparsity in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14690","snapshot_observed_at":"2026-08-15T19:58:17.694467Z","title":"Training-free activation sparsity in large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.694467Z"},"links":{"cited_paper":"/paper/2408.14690","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:5a755fef4044dbc13a6ba1dd817d1af86b843c0824fc43f6dce1cfdf35472a5a","observation_id":"e52f6848-aa3b-48c8-815a-a5e43eaebdba","resolution":{"observed_at":"2026-08-15T19:58:17.694467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19449","last_updated":"2025-04-28T03:30:32Z","snapshot_observed_at":"2026-08-16T23:28:50.874978Z","submitted_at":"2025-04-28T03:30:32Z","title":"R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.19449","snapshot_observed_at":"2026-08-15T19:58:17.698832Z","title":"R-sparse: Rank-aware activation sparsity for efficient llm inference,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.698832Z"},"links":{"cited_paper":"/paper/2504.19449","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:48d6b10719c16acd0fc2bbff3feedd416f7759bfb22b2013704af44188a17a88","observation_id":"2cf05b86-2969-4ff9-b105-715602bd1e5d","resolution":{"observed_at":"2026-08-15T19:58:17.698832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02626","last_updated":"2015-10-30T23:29:27Z","snapshot_observed_at":"2026-08-15T13:34:24.234242Z","submitted_at":"2015-06-08T19:28:43Z","title":"Learning both Weights and Connections for Efficient Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.02626","snapshot_observed_at":"2026-08-15T19:58:17.702896Z","title":"Learning both weights and connections for efficient neural networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.702896Z"},"links":{"cited_paper":"/paper/1506.02626","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:d7cf2d2169e9098bca7e3b9e9ce45f7f8ee54fef6bb508aaeb46257da97d86f6","observation_id":"fe4bd0ea-41f5-42fc-a5c0-2b3634e67a60","resolution":{"observed_at":"2026-08-15T19:58:17.702896Z","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-08-13T04:32:33.562415Z","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-15T19:58:17.707021Z","title":"A simple and effective pruning approach for large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.707021Z"},"links":{"cited_paper":"/paper/2306.11695","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:a3131d13e252e860ab900c7854e4e5815fcc795673d6c95ad40b0f2dd58eabef","observation_id":"1be629ca-aff7-4404-be75-24489939386a","resolution":{"observed_at":"2026-08-15T19:58:17.707021Z","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-15T19:58:19.029378Z","title":"Second order derivatives for network pruning: Optimal brain surgeon,","venue":null,"work_id":"69c2efa6-f540-4640-b866-66ef51f8629f","year":1992},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.711354Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:ec0337d6fb418bf0c37e0203b42c2c9baef979ac2c342c9a20195f6d2847aa06","observation_id":"835b78f8-9602-40ad-b036-f6ce40090b7d","resolution":{"observed_at":"2026-08-15T19:58:19.033535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:19.016481Z","title":"Sparsegpt: massive language models can be accurately pruned in one-shot,","venue":null,"work_id":"e6b20642-2924-481a-af53-d925a54df883","year":2023},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.715286Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:aa6c4e0423a5f56e6931204e5822e6152fa7d40521c735998e13d6d22230f37a","observation_id":"c5ab5b0f-ca71-495e-8f82-73d176392d45","resolution":{"observed_at":"2026-08-15T19:58:19.021723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:19.004942Z","title":"The LLM surgeon,","venue":null,"work_id":"69a3f209-49ee-44fb-8eb9-a2b0086827ab","year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.719625Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:ec960ae3ae14999a2b42a1c9b5409612b37410c2c7d38015b93eae3cdb3c530f","observation_id":"1682e9bf-4ff6-4e81-a939-a5222e11f2e1","resolution":{"observed_at":"2026-08-15T19:58:19.009050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08378","last_updated":"2021-04-16T21:27:32Z","snapshot_observed_at":"2026-08-16T18:30:58.242028Z","submitted_at":"2021-04-16T21:27:32Z","title":"Accelerating Sparse Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08378","snapshot_observed_at":"2026-08-15T19:58:17.724608Z","title":"Accelerating sparse deep neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.724608Z"},"links":{"cited_paper":"/paper/2104.08378","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:76f2e5b834a9af50b5747169b74610fa6bedcf7014fdf308063cd1f6948b183f","observation_id":"8421378e-9aea-4a51-b3a2-6879a5967435","resolution":{"observed_at":"2026-08-15T19:58:17.724608Z","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-15T19:58:18.992042Z","title":"Analyzing multi-head self-attention: Specialized heads do the heavy lifting, the rest can be pruned,","venue":null,"work_id":"227210a8-5d5a-4695-ab87-99d8ac1648ab","year":2019},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.729033Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:edcee6e3ed88507fe6c30922eb5162e118d252cf64aa1fd1b169458e9f616e67","observation_id":"02dab4da-1e69-4554-9f89-0c7b2d4d4aea","resolution":{"observed_at":"2026-08-15T19:58:18.997246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.979341Z","title":"Are sixteen heads really better than one?","venue":null,"work_id":"8c4bc71d-d437-46fc-9836-9abb6cf93b2a","year":2019},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.734001Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:eb978a87e24d76c9e539fb1d8b0eb37b073b5b869f1004cbbafe672d7c39223a","observation_id":"fb4c46f5-ebe6-48a9-a68a-bad1dbebd5d4","resolution":{"observed_at":"2026-08-15T19:58:18.983274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.967920Z","title":"SlimLLM: Accurate structured pruning for large language models,","venue":null,"work_id":"8c35c625-288d-4da1-8bb3-8a69b27fb6da","year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.738189Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:a7acf16941b562972f53016d7c3ddaaa041b18e747d7da4eff0bcf9677ad2ce2","observation_id":"4ec01560-ca5f-4b71-bb29-47a64e0b9daf","resolution":{"observed_at":"2026-08-15T19:58:18.971864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-08-18T15:54:54.765131Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-08-15T19:58:17.742368Z","title":"Language model compression with weighted low-rank factorization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.742368Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:46f47946cb80308f467cafe4e5160178905cfe3662b825b358214863c12cc9c7","observation_id":"dc86c9f4-a687-4c65-8909-a1cd8d1aa1d0","resolution":{"observed_at":"2026-08-15T19:58:17.742368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05821","last_updated":"2025-08-28T03:57:52Z","snapshot_observed_at":"2026-08-16T15:03:40.750477Z","submitted_at":"2023-12-10T08:41:24Z","title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.05821","snapshot_observed_at":"2026-08-15T19:58:17.746535Z","title":"Asvd: Activation-aware singular value decomposition for compressing large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.746535Z"},"links":{"cited_paper":"/paper/2312.05821","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:50abbcd1d110725d00c4862ac488b0077493c818b7a55b74b8f7aac64f20ebbd","observation_id":"5b9e766c-03db-4d4e-9b90-b9a693b5935d","resolution":{"observed_at":"2026-08-15T19:58:17.746535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07378","last_updated":"2025-03-16T03:27:33Z","snapshot_observed_at":"2026-08-18T15:56:23.038008Z","submitted_at":"2024-03-12T07:31:18Z","title":"SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07378","snapshot_observed_at":"2026-08-15T19:58:17.750846Z","title":"Svd-llm: Truncation-aware singular value decomposition for large language model compression,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.750846Z"},"links":{"cited_paper":"/paper/2403.07378","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:855520400e149628fb3bd93073d80d33a72c118664fb7f5818e8f7f33ff5d9e8","observation_id":"2b1c4c22-cf84-44f5-9dad-688c9dc5f683","resolution":{"observed_at":"2026-08-15T19:58:17.750846Z","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-15T19:58:18.956828Z","title":"Streamlining redundant layers to compress large language models,","venue":null,"work_id":"319626a2-cdc6-45f8-b686-22445d666527","year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.754749Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:f312870b767adee17d30a59636eeff04f3b08990b5ebaf6a6ec60e284ed9f3f6","observation_id":"7ac99b67-d594-4f52-b4e0-1485b782a3b2","resolution":{"observed_at":"2026-08-15T19:58:18.960550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.944539Z","title":"DLP: Dynamic layerwise pruning in large language models,","venue":null,"work_id":"e08bcc9f-ca27-478c-aa9f-9fd12f68cae8","year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.758196Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:8aa74199105c3b7971bb872b9fc31a2628202cf02ab08fc333f45e167bd0d5cc","observation_id":"fd91df38-6daa-496f-94bd-2f4b04285787","resolution":{"observed_at":"2026-08-15T19:58:18.948869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.931840Z","title":"Prompt-based depth pruning of large language models,","venue":null,"work_id":"45c486b6-0de3-4d47-a06d-2051743cb322","year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.761861Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:28f003f8a564233c5876a6c05efc7e1d126496b42950926438f9f4ab5f440bd0","observation_id":"5ed00657-deb9-4148-a0d1-0b0db3e2e704","resolution":{"observed_at":"2026-08-15T19:58:18.936480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15921","last_updated":"2025-04-23T23:24:01Z","snapshot_observed_at":"2026-08-14T01:20:10.531199Z","submitted_at":"2024-12-20T14:13:09Z","title":"Less is More: Towards Green Code Large Language Models via Unified Structural Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15921","snapshot_observed_at":"2026-08-15T19:58:17.765828Z","title":"Less is more: Towards green code large language models via unified structural pruning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.765828Z"},"links":{"cited_paper":"/paper/2412.15921","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:9883aaae04a90bf789839d2297c185d6fd4a256e12bf81358ccc1f19808e0c40","observation_id":"2059058f-b6e7-4c2f-b0ba-056d15fe80e7","resolution":{"observed_at":"2026-08-15T19:58:17.765828Z","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-15T19:58:18.920885Z","title":"Knapsack problems,","venue":null,"work_id":"b7d208c9-2456-4300-a6d0-3f41afc366a8","year":1998},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.770021Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:20f42261d5e403e33855cd22ca555fc079bab2e9544e016593a621a087f5dcd5","observation_id":"087b7255-e36b-4941-8129-62473ac4b613","resolution":{"observed_at":"2026-08-15T19:58:18.924997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-08-17T18:50:07.059564Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-15T19:58:17.773699Z","title":"Qwen2.5 technical report,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.773699Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:e6aacf03c257af1fe192997585dc66ec4bfe8f1a77985a49d9d5a3a6a753e92c","observation_id":"060cd6bb-8150-4525-b190-40c229a540bc","resolution":{"observed_at":"2026-08-15T19:58:17.773699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08905","last_updated":"2024-12-12T03:37:41Z","snapshot_observed_at":"2026-08-14T03:45:52.225630Z","submitted_at":"2024-12-12T03:37:41Z","title":"Phi-4 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08905","snapshot_observed_at":"2026-08-15T19:58:17.778138Z","title":"Phi-4 technical report,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.778138Z"},"links":{"cited_paper":"/paper/2412.08905","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:16edc6bc7bb1a19d92719700058dbd986262197ae00436642ae90639dc4f8ed4","observation_id":"6639f2d4-5c59-4891-8a64-e2ae1240c9fb","resolution":{"observed_at":"2026-08-15T19:58:17.778138Z","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-15T19:58:18.908255Z","title":"2SSP: A two-stage framework for structured pruning of LLMs,","venue":null,"work_id":"1a8b481a-5390-411f-abef-c7318af933ef","year":2025},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.782678Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:ef66d9a3ac35fe0fbf616365ffa44bd14328711a4289d3618565f482cfb5799f","observation_id":"04294ee4-14a3-4a03-8844-dc2d96c24e2f","resolution":{"observed_at":"2026-08-15T19:58:18.912468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-08-17T01:46:43.513643Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-15T19:58:17.786256Z","title":"Pointer sentinel mixture models,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.786256Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:205518c95f9af4809930acbe045e827d4fce76a11acfc1a6470e014242ce281f","observation_id":"59f66471-fb33-4429-87b2-b0c73133202c","resolution":{"observed_at":"2026-08-15T19:58:17.786256Z","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-15T19:58:18.893361Z","title":"The LAMBADA dataset: Word prediction requiring a broad discourse context,","venue":null,"work_id":"67b83b21-0b0f-4ca4-b386-be0385f50199","year":2016},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.790556Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:71fedb63fb0ddd10907d94ebae5e50e8a2b11c16b59dff348d6591ada9635eaf","observation_id":"d4367532-176d-46cc-9394-10f8015ce7d1","resolution":{"observed_at":"2026-08-15T19:58:18.897570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.881353Z","title":"Piqa: Reasoning about physical commonsense in natural language,","venue":null,"work_id":"6e818da4-ad44-42ec-a79c-494b2b580da0","year":2020},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.794492Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:fcac271ba7fda16c8ac773b8ee08bc5454fbf6aa9aa34686a714702dd1a7db10","observation_id":"7df822b2-185b-4e73-a71e-aff1ecb1f928","resolution":{"observed_at":"2026-08-15T19:58:18.885339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.868961Z","title":"PROST: Physical reasoning about objects through space and time,","venue":null,"work_id":"43ecd916-dcea-4eed-839a-c3c15fd647a8","year":2021},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.798350Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:21c2c14795964f57413ac3c2110994ae238816500dd190e34e04c507014225d2","observation_id":"dfe1fa7f-c28a-4ac3-b824-77d87ace3dec","resolution":{"observed_at":"2026-08-15T19:58:18.873511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.855712Z","title":"CommonsenseQA: A question answering challenge targeting commonsense knowledge,","venue":null,"work_id":"769a3998-4d3e-4e8b-91b3-1cccfb72dc94","year":2019},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.802616Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:fea3c2ec3c824dbcae5c22647c71aa8a11b09c8f275d28051b9596fbdc1d6c9c","observation_id":"d45432b5-cb0e-45cd-89c7-f9bf80b8c679","resolution":{"observed_at":"2026-08-15T19:58:18.860632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-08-14T19:36:07.505691Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-15T19:58:17.807045Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.807045Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:db8bdd95cc6c2c7c7a76c421a375738f42ae0aaa2736ca72f3bb6a086e06fe12","observation_id":"2e065396-6d0a-4e1d-86b5-fb250ef047cc","resolution":{"observed_at":"2026-08-15T19:58:17.807045Z","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-15T19:58:18.841924Z","title":"MathQA: Towards interpretable math word problem solving with operation-based formalisms,","venue":null,"work_id":"e19dc363-1086-4968-b8a2-9b993dcb46f5","year":2019},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.811252Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:265f9d6f061a77eb43e4f846b0d849188c181a6351ac611d739b1baaac497cc0","observation_id":"1fa4547f-c2fe-48f5-b7d6-33795d28034f","resolution":{"observed_at":"2026-08-15T19:58:18.847022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.829633Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering,","venue":null,"work_id":"deedf347-29a0-40fa-857b-028ee1a16695","year":2018},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.815420Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:4cf3192a12f895f0ffdbd86e0b205745401ca8256c2b05e0527420b556b2f1ad","observation_id":"040ed4d2-2127-4e40-9e67-6ecc35da4df0","resolution":{"observed_at":"2026-08-15T19:58:18.834274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.818052Z","title":"What disease does this patient have? a large-scale open domain question answering dataset from medical exams,","venue":null,"work_id":"0e0c3974-680f-46b5-b8f7-8099dcb5273f","year":2021},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.819243Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:ba036036dc673dd69cafeb0f06f880f7f26a243ba989907a87ed5640af6c8638","observation_id":"ea146a8c-cf8e-413b-b7b5-8a2e57252d12","resolution":{"observed_at":"2026-08-15T19:58:18.822196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.803831Z","title":"Blimp: The benchmark of linguistic minimal pairs for english,","venue":null,"work_id":"61d8966b-b4c2-495e-aa75-d4464ad60aba","year":null},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.822839Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:0553cb06e23ccd533a157660ff89d3990871880915d2a6b0974ca8c780462432","observation_id":"947c4538-1edb-4c6d-af4f-b5ee71b5ae54","resolution":{"observed_at":"2026-08-15T19:58:18.810186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.790151Z","title":"BoolQ: Exploring the surprising difficulty of natural yes/no questions,","venue":null,"work_id":"1e21c11e-6c0f-4979-8c7e-a07959e6578a","year":2019},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.832137Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:954e70c4358fc7602eeea02877bf994f133fc904ba5fdc2b5e9366a872fb8391","observation_id":"00917aab-eff4-4099-b414-4caf6c1bec0a","resolution":{"observed_at":"2026-08-15T19:58:18.794454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.776655Z","title":"Winogrande: An adversarial winograd schema challenge at scale,","venue":null,"work_id":"17187105-745b-4a8c-9383-869a636c9371","year":2021},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.835862Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:dd8f2397b38f8ca9e6ce79ec5331234248eceddfbe8cee8b867f59607765c0f9","observation_id":"c75c707f-210c-40d9-afc6-1c3777098763","resolution":{"observed_at":"2026-08-15T19:58:18.781362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.762242Z","title":"CoQA: A conversational question answering challenge,","venue":null,"work_id":"866c0ad3-65d8-4e11-a85c-46aa4525d1e7","year":2019},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.840044Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:65ef177188c1eabd7371d21492e7f5190e415b3b136c7bfb0454b0153d508648","observation_id":"07774e3d-75af-4432-95fe-145439c9964c","resolution":{"observed_at":"2026-08-15T19:58:18.767056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.750323Z","title":"TruthfulQA: Measuring how models mimic human falsehoods,","venue":null,"work_id":"f81be9f9-892f-4f43-baa6-6b344369c620","year":2022},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.844378Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:2cc553e3d964e05fe613d078a70643c41aa003b379ba2b4b941ee94dbf7e3209","observation_id":"8e5f0b28-0d2f-4409-b746-da03356590e8","resolution":{"observed_at":"2026-08-15T19:58:18.754667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.736039Z","title":"Gender bias in coreference resolution,","venue":null,"work_id":"23dfe168-8374-49ad-9109-9772dff933b8","year":2018},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.848475Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:62424583c042222802eea57f77bf8525a9559622de4bb9311a944d3c33a2f372","observation_id":"4ef2c92c-d261-463d-8557-ff5c0d58bee2","resolution":{"observed_at":"2026-08-15T19:58:18.742087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.724377Z","title":"Moral stories: Situated reasoning about norms, intents, actions, and their consequences,","venue":null,"work_id":"c63f174a-33b4-4b17-add5-8e57ec0ed7c8","year":2021},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.852136Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:38a6bf426030a40aa412200077e0ca37251a3707cb504f8a6214eadd160f1a15","observation_id":"e435c4d2-12af-403b-ad16-65440c8c7241","resolution":{"observed_at":"2026-08-15T19:58:18.728310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.709752Z","title":"Slimorca: An open dataset of gpt-4 augmented flan reasoning traces, with verification,","venue":null,"work_id":"5795d561-e489-4548-980b-c9cf010f16bb","year":2023},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.855611Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:b787829f7106cec2839bfcbed485eacabd81144bf37349eb9524566f9b7502fc","observation_id":"ec2ea693-7252-4349-9d7c-207f0e5115e2","resolution":{"observed_at":"2026-08-15T19:58:18.715333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.697066Z","title":"Stanford alpaca: An instruction-following llama model,","venue":null,"work_id":"7fced498-af77-497b-a8ab-4459716d3aac","year":2023},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.859116Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:1cf6016adf65c6212a1df6af60e5e55b53065aedc5fbf67ad1c40df4dbb4248d","observation_id":"5d181749-1308-431b-8fe1-ed27e222be25","resolution":{"observed_at":"2026-08-15T19:58:18.701877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.682350Z","title":"Exploring the limits of transfer learning with a unified text-to-text transformer,","venue":null,"work_id":"af7ffa1d-7451-493d-a950-cabdea85a1b3","year":2020},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.863197Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:c555e721ba48dce07f66a36ef6e22bdf3af7585fcf3687b55a88824f2f2a981f","observation_id":"998538de-8f42-4f0c-953e-bd7885d8d123","resolution":{"observed_at":"2026-08-15T19:58:18.687441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.669471Z","title":"Pytorch: An imperative style, high-performance deep learning library,","venue":null,"work_id":"ad5e0031-652c-4403-84b7-260e19da580f","year":2019},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.867056Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:84928297a85a53b23cda164e57a709dada45285bd3b780adf8f526cbffeac363","observation_id":"120cc6de-8606-4acb-83c4-2b9428d0a37f","resolution":{"observed_at":"2026-08-15T19:58:18.673814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.656331Z","title":"Transformers: State-of-the-art natural language processing,","venue":null,"work_id":"5c7ac0d8-91d2-477a-a548-172374297a66","year":2020},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.871054Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:aec76460dc7be02354dd986e3136e39f0a6729b94f11c4ec705f4dfb67efa88c","observation_id":"8e8d49b0-d69f-4fad-9c77-dbca2ba280ce","resolution":{"observed_at":"2026-08-15T19:58:18.660947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:17.874721Z","title":"A framework for few-shot language model evaluation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.874721Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:66b63b1e5518b0d5d4a7e470bef0bb16868962dc7aa0020205c3d04558e911b2","observation_id":"e36801dc-8371-4c8c-bd2e-738baaf5a2cc","resolution":{"observed_at":"2026-08-15T19:58:17.874721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02707","last_updated":"2023-06-05T08:58:39Z","snapshot_observed_at":"2026-08-09T03:29:22.849759Z","submitted_at":"2023-06-05T08:58:39Z","title":"Orca: Progressive Learning from Complex Explanation Traces of GPT-4","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02707","snapshot_observed_at":"2026-08-15T19:58:17.878665Z","title":"Orca: Progressive learning from complex explanation traces of gpt-4,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.878665Z"},"links":{"cited_paper":"/paper/2306.02707","citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:f10dcc7da2c065528afa8ba19dc5ed3675a5f84a27e82f18c4fe4251929dea74","observation_id":"1c40f326-ec9a-4936-9e24-471e370a50d6","resolution":{"observed_at":"2026-08-15T19:58:17.878665Z","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-15T19:58:18.643158Z","title":"LoRA: Low-rank adaptation of large language models,","venue":null,"work_id":"aa4f5933-d42f-4bab-b733-1f889ee10f3c","year":2022},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.882644Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:c6d22388e58bc9393ab614762cad48b6cea1e6fbc010ea5b9262420efccf9134","observation_id":"cb88d44d-bca1-45d9-908c-b83c491f46a9","resolution":{"observed_at":"2026-08-15T19:58:18.648053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:18.629103Z","title":"he” changed to “she","venue":null,"work_id":"f4e24be9-b2e3-4dfb-85da-2ad69b90f46b","year":null},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.887134Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:e85b025b6afe339fce5d335db839111f804c1d58802556f38d85a107f80ff2fe","observation_id":"aa977938-fc61-427b-8d2a-38d9565740a3","resolution":{"observed_at":"2026-08-15T19:58:18.633442Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"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-15T19:58:17.827149Z","title":"Available: https://doi.org/10.1162/tacl_a_00321","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:17.827149Z"},"links":{"citing_paper":"/paper/2608.12953"},"observation_digest":"sha256:c4614d099fcddd52342bd9f2fcefba9ca0136cab613063bcd95339b6078c60d1","observation_id":"3ce8487c-f668-41b7-872e-21a077f33d1b","resolution":{"observed_at":"2026-08-15T19:58:17.827149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.12953","last_updated":"2026-08-13T08:32:18Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-18T15:24:39.011998Z","submitted_at":"2026-08-13T08:32:18Z","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":2,"verified_fuzzy":41},"total_outbound_references":77},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 0 inbound Pith citation observations for arXiv:2608.12953."}