{"as_of":"2026-08-07T06:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd937ea736b632e7fec6c512da1390da32602a232d0d8a9f26d7750a427e45ed","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:25:23.127224Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:07:01.912817Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T08:51:25.771911Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"cited_work":{"arxiv_id":"2602.08324","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.08324","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards efficient large language reasoning models via extreme-ratio chain-of-thought compression.arXiv preprint arXiv:2602.08324","venue":null,"work_id":"631e7cdc-7518-42d1-827d-f9e845abdf51","year":null},"citing_paper":{"arxiv_id":"2604.26355","last_updated":"2026-05-05T16:38:19Z","snapshot_observed_at":"2026-07-06T23:12:01.813588Z","submitted_at":"2026-04-29T07:06:43Z","title":"Shorthand for Thought: Compressing LLM Reasoning via Entropy-Guided Supertokens","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-07T13:33:21.840958Z"},"links":{"cited_paper":"/paper/2602.08324","citing_paper":"/paper/2604.26355"},"observation_digest":"sha256:b1c1095a949d5433ae7b16bece6bb39b2ebd9766086e2776780d4ea79d74353c","observation_id":"8f051acc-4b4b-475f-b939-021194b0c8ec","resolution":{"observed_at":"2026-05-20T00:00:33.920223Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.08324","snapshot_observed_at":"2026-08-03T00:54:35.872755Z","title":"Towards efficient large language reasoning models via extreme-ratio chain-of-thought compression, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28642","last_updated":"2026-05-26T02:25:09Z","snapshot_observed_at":"2026-08-07T04:44:56.772769Z","submitted_at":"2026-05-26T02:25:09Z","title":"ThinkReset: Learnable Intermediate Interface Construction for Bounded-Context Long-Horizon Reasoning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-03T00:54:35.872755Z"},"links":{"cited_paper":"/paper/2602.08324","citing_paper":"/paper/2607.28642"},"observation_digest":"sha256:a2458fa9f06532d7fe384fdd81676e4bc09a06a951164a23da2f0924c3407248","observation_id":"e88854b1-0ecd-4d8f-9c0a-2b69aa6a0591","resolution":{"observed_at":"2026-08-03T00:54:35.872755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.08324","snapshot_observed_at":"2026-08-06T17:07:01.912817Z","title":"InPro- ceedings of the 63rd Annual Meeting of the Association for ComputationalLinguistics(Volume1:LongPapers),15629– 15644","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T06:31:10.406784Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.912817Z"},"links":{"cited_paper":"/paper/2602.08324","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:b440aca8df86cce353df8b31ab421969940ff2ff86b9cd2653a835f16f3bbb35","observation_id":"3d84b4c5-e307-46b6-ab4b-e2182e7b85a1","resolution":{"observed_at":"2026-08-06T17:07:01.912817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2602.08324/citation-record","integrity":"/paper/2602.08324/integrity","json":"/paper/2602.08324/citation-record.json","paper":"/paper/2602.08324"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:25:21.652002Z","title":"Aimo validation amc (amc 2023 sub- set)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:21.652002Z"},"links":{"citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:3299bdc4ec9abf6fa59d9165533ad868c3bde5cf9554b1f3ba87ca8d9b8348d9","observation_id":"b787c03f-2f8c-4f87-9519-111c2c64fd39","resolution":{"observed_at":"2026-08-03T03:25:21.652002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.21187","last_updated":"2025-02-01T07:57:37Z","snapshot_observed_at":"2026-08-01T16:43:44.704797Z","submitted_at":"2024-12-30T18:55:12Z","title":"Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.21187","snapshot_observed_at":"2026-08-03T03:25:21.948273Z","title":"Do not think that much for 2+ 3=? on the overthinking of o1-like llms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:21.948273Z"},"links":{"cited_paper":"/paper/2412.21187","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:3e0f6d41a8af85dc581b97690b56e1a21d709cbe60ba2b6291e3ce93a0e72df3","observation_id":"6f823bb8-2644-4fb1-b4b4-beb4b53345dd","resolution":{"observed_at":"2026-08-03T03:25:21.948273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-03T03:25:22.036858Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:22.036858Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:2ce340322d3643ef372f2f26646406c18567e0ec37cac0c64b6352c1a705ac36","observation_id":"689fa491-2b48-482c-9e3a-c1250e06a65b","resolution":{"observed_at":"2026-08-03T03:25:22.036858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.06514","last_updated":"2025-04-11T02:36:28Z","snapshot_observed_at":"2026-07-06T21:06:27.043207Z","submitted_at":"2025-04-09T01:25:27Z","title":"Missing Premise exacerbates Overthinking: Are Reasoning Models losing Critical Thinking Skill?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.06514","snapshot_observed_at":"2026-08-03T03:25:22.240045Z","title":"Missing premise exacerbates overthinking: Are reasoning models losing critical thinking skill?arXiv preprint arXiv:2504.06514,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:22.240045Z"},"links":{"cited_paper":"/paper/2504.06514","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:8fbf44197f72079554ccf0eead1b1e96f2655905e698e34105362c7fa3a943e7","observation_id":"93275367-85c0-44f0-86fb-34e2801cc0bf","resolution":{"observed_at":"2026-08-03T03:25:22.240045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13379","last_updated":"2025-06-26T14:06:49Z","snapshot_observed_at":"2026-07-06T21:26:25.429980Z","submitted_at":"2025-05-19T17:24:16Z","title":"Thinkless: LLM Learns When to Think","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13379","snapshot_observed_at":"2026-08-03T03:25:22.412034Z","title":"Thinkless: Llm learns when to think.arXiv preprint arXiv:2505.13379,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:22.412034Z"},"links":{"cited_paper":"/paper/2505.13379","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:ab2d5b4030d1b464a07fb66cae2170f1aeba7daf682773dc867ae68607ba10a7","observation_id":"42201804-09fc-49d4-b13d-f17754432bd8","resolution":{"observed_at":"2026-08-03T03:25:22.412034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-03T03:25:22.577703Z","title":"The llama 3 herd of models.arXiv preprint arXiv:2407.21783,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:22.577703Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:56c99ff57c9fe920dc57149634119c65b279d9a96ff05eae60201769742543cb","observation_id":"6cdf3ff9-098a-4a9c-80ae-bfa056f7648e","resolution":{"observed_at":"2026-08-03T03:25:22.577703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-03T03:25:22.800369Z","title":"Deepseek-r1: In- centivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:22.800369Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:39d9684816ab1e059be5eb160c0bef204aff5bd19c1e0c495dc31d227e8c96bb","observation_id":"944adebc-fe28-4677-bdcc-cd6edcc65b4f","resolution":{"observed_at":"2026-08-03T03:25:22.800369Z","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-03T03:25:22.966268Z","title":"Token-budget-aware llm reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:22.966268Z"},"links":{"citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:661c96414090f358c4d77b5a06c6259754717e6bdd0704a472905085053c0213","observation_id":"29853ef6-98c9-4dfc-9d7b-9fd3d019a526","resolution":{"observed_at":"2026-08-03T03:25:22.966268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06769","last_updated":"2025-11-03T00:53:34Z","snapshot_observed_at":"2026-08-07T06:05:27.895209Z","submitted_at":"2024-12-09T18:55:56Z","title":"Training Large Language Models to Reason in a Continuous Latent Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.06769","snapshot_observed_at":"2026-08-03T03:25:23.051877Z","title":"Training large language models to reason in a continuous latent space.arXiv preprint arXiv:2412.06769,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.051877Z"},"links":{"cited_paper":"/paper/2412.06769","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:591e4ecb988a0b2694af75d97f0d092f223fc3e074287eb11ec995b71f0fbc1d","observation_id":"944dddfa-7dcf-4033-82de-a0af1b45d601","resolution":{"observed_at":"2026-08-03T03:25:23.051877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03300","last_updated":"2021-01-12T18:57:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-09-07T17:59:25Z","title":"Measuring Massive Multitask Language Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03300","snapshot_observed_at":"2026-08-03T03:25:23.055603Z","title":"Measuring mas- sive multitask language understanding.arXiv preprint arXiv:2009.03300,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.055603Z"},"links":{"cited_paper":"/paper/2009.03300","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:22b314150352fc6bbe02692c68f3de6a8161471f043450da0cba8dfb126fc420","observation_id":"a7a60c79-0cca-42b5-bf27-deaf55c2957c","resolution":{"observed_at":"2026-08-03T03:25:23.055603Z","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-03T03:25:23.059549Z","title":"Distill- ing step-by-step! outperforming larger language models with less training data and smaller model sizes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.059549Z"},"links":{"citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:588b4cd66aaeb21190c4e3080efed9be4574c686f28195af5e73085b27aa2efa","observation_id":"cc252d22-aa4f-4b2f-8835-637288b4c727","resolution":{"observed_at":"2026-08-03T03:25:23.059549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21276","last_updated":"2024-10-25T17:43:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-25T17:43:01Z","title":"GPT-4o System Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21276","snapshot_observed_at":"2026-08-03T03:25:23.066774Z","title":"P., Perelman, A., Ramesh, A., Clark, A., Ostrow, A., Welihinda, A., Hayes, A., Radford, A., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.066774Z"},"links":{"cited_paper":"/paper/2410.21276","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:34edd9ea576ff25320024e3dc0122059037c72396285e8215b3ecaca887e5497","observation_id":"2551d760-6d40-4c57-885f-b74047e6332f","resolution":{"observed_at":"2026-08-03T03:25:23.066774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00559","last_updated":"2024-05-21T09:55:07Z","snapshot_observed_at":"2026-08-06T18:38:04.978620Z","submitted_at":"2024-02-01T12:46:45Z","title":"A Chain-of-Thought Is as Strong as Its Weakest Link: A Benchmark for Verifiers of Reasoning Chains","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00559","snapshot_observed_at":"2026-08-03T03:25:23.069996Z","title":"A chain-of-thought is as strong as its weakest link: A bench- mark for verifiers of reasoning chains.arXiv preprint arXiv:2402.00559,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.069996Z"},"links":{"cited_paper":"/paper/2402.00559","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:2ccd8333719c2a40f074fbee1d571478420e1869dd8c134bc77b6a3f152a03c3","observation_id":"2ab171ee-c6a5-40d3-bd4d-5fb41b370f7b","resolution":{"observed_at":"2026-08-03T03:25:23.069996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-03T03:25:23.073538Z","title":"Openai o1 system card.arXiv preprint arXiv:2412.16720,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.073538Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:d06defef4d3f3163b6d4195a0e4ec58a7f4b7539a63e6552b1e1adf410ba79b6","observation_id":"2b50410e-ef9f-4db9-afb8-0eab5dee48b2","resolution":{"observed_at":"2026-08-03T03:25:23.073538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05736","last_updated":"2023-12-06T17:02:25Z","snapshot_observed_at":"2026-08-06T08:38:21.368130Z","submitted_at":"2023-10-09T14:10:21Z","title":"LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05736","snapshot_observed_at":"2026-08-03T03:25:23.076743Z","title":"Llmlin- gua: Compressing prompts for accelerated inference of large language models.arXiv preprint arXiv:2310.05736,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.076743Z"},"links":{"cited_paper":"/paper/2310.05736","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:d26a696bf9f5fe9e1d2dfba4bf7b5f78b312d2822151b4719e30c72ea4857b20","observation_id":"33b6f1fa-13fa-4b47-9045-1a7d96d29872","resolution":{"observed_at":"2026-08-03T03:25:23.076743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01141","last_updated":"2025-04-01T00:41:36Z","snapshot_observed_at":"2026-08-05T08:31:33.714333Z","submitted_at":"2025-03-03T03:48:20Z","title":"How Well do LLMs Compress Their Own Chain-of-Thought? A Token Complexity Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01141","snapshot_observed_at":"2026-08-03T03:25:23.079397Z","title":"How well do llms compress their own chain-of-thought? a token complexity approach","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.079397Z"},"links":{"cited_paper":"/paper/2503.01141","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:661c9894fc7c360a21497948fcd32f2e59861451b789e85f1007acaa58241c36","observation_id":"078b5a79-d31b-40a2-91fc-5d0ebe7a4ad1","resolution":{"observed_at":"2026-08-03T03:25:23.079397Z","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-03T03:25:23.082140Z","title":"Camel: Communicative agents for “mind” exploration of large language model society.Advances in Neural In- formation Processing Systems, 36:51991–52008, 2023a","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.082140Z"},"links":{"citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:3bf99099f2f087b0674db640ada7bbf19b47397d7ba5cd2c1ebcd9e8360a5314","observation_id":"2d11f3d9-71d8-4b9e-880f-5a737ed32fcd","resolution":{"observed_at":"2026-08-03T03:25:23.082140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-08-03T03:25:23.085492Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.085492Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:dbff323a0d607b91d9d7fe9fed9aae6f24124803f3d82393dd8459ae76e4d95c","observation_id":"177561b4-6493-4f29-9d35-87c6eb984f55","resolution":{"observed_at":"2026-08-03T03:25:23.085492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.07191","last_updated":"2021-04-15T06:11:12Z","snapshot_observed_at":"2026-07-06T10:49:19.314215Z","submitted_at":"2021-03-12T10:23:47Z","title":"Are NLP Models really able to Solve Simple Math Word Problems?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.07191","snapshot_observed_at":"2026-08-03T03:25:23.089243Z","title":"Are nlp models really able to solve simple math word problems?arXiv preprint arXiv:2103.07191,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.089243Z"},"links":{"cited_paper":"/paper/2103.07191","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:4a8a71e2d47061a1aeec89688cb464ac9459165a129cfdc40020b8ffdc07698f","observation_id":"c9fa71df-135f-4ea9-a372-c5a149fd64de","resolution":{"observed_at":"2026-08-03T03:25:23.089243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14042","last_updated":"2024-10-17T21:35:49Z","snapshot_observed_at":"2026-07-06T19:35:39.803671Z","submitted_at":"2024-10-17T21:35:49Z","title":"Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14042","snapshot_observed_at":"2026-08-03T03:25:23.091906Z","title":"Style-compress: An llm-based prompt compression framework considering task-specific styles.arXiv preprint arXiv:2410.14042,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.091906Z"},"links":{"cited_paper":"/paper/2410.14042","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:6294ab8d47ebbc1b7d486b7cb1c3a1de0d41749006a9fe1522ab5f1d40583a69","observation_id":"f3d84f19-c962-47c5-9bab-fa16907ba3ba","resolution":{"observed_at":"2026-08-03T03:25:23.091906Z","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-03T03:25:23.094844Z","title":"and Roth, D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.094844Z"},"links":{"citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:b2ec412d6d0d5940c3bb41add6ade065837ae4b58a7ace8a72c0a32f3142e363","observation_id":"a98dc63f-898c-48ee-b20d-03a20c88dc2c","resolution":{"observed_at":"2026-08-03T03:25:23.094844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-07T04:27:23.738927Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.16419","snapshot_observed_at":"2026-08-03T03:25:23.100560Z","title":"Stop overthinking: A survey on efficient reasoning for large language models.arXiv preprint arXiv:2503.16419,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.100560Z"},"links":{"cited_paper":"/paper/2503.16419","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:8705f2b7ad5ebbdcafd6b0fadb5c3b134192398e37216c89ee75a017b14f239d","observation_id":"c86d522e-4a0d-4f9f-825c-7f0ffecb28d6","resolution":{"observed_at":"2026-08-03T03:25:23.100560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.20534","last_updated":"2026-02-03T04:57:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-28T05:35:43Z","title":"Kimi K2: Open Agentic Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.20534","snapshot_observed_at":"2026-08-03T03:25:23.103962Z","title":"Kimi k2: Open agentic intelligence.arXiv preprint arXiv:2507.20534,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.103962Z"},"links":{"cited_paper":"/paper/2507.20534","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:655175b1452b49ea506d6f89d82c7af719f0e93d8d69d4f9374f9cffb20d7a1f","observation_id":"5aca0811-63d2-48b0-a1eb-7d3a9b7c5039","resolution":{"observed_at":"2026-08-03T03:25:23.103962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.08343","last_updated":"2025-06-18T14:43:36Z","snapshot_observed_at":"2026-08-07T05:10:59.917329Z","submitted_at":"2025-06-10T01:54:04Z","title":"Wait, We Don't Need to \"Wait\"! Removing Thinking Tokens Improves Reasoning Efficiency","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.08343","snapshot_observed_at":"2026-08-03T03:25:23.107762Z","title":"Wait, we don’t need to “wait”! removing think- ing tokens improves reasoning efficiency.arXiv preprint arXiv:2506.08343,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.107762Z"},"links":{"cited_paper":"/paper/2506.08343","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:852d8baf0c56ea93e3c3936775ad0be461abf449ae9dde98bd928c4d2cc79a8d","observation_id":"0bd65bd6-05fd-40e6-bfdb-9c149437f192","resolution":{"observed_at":"2026-08-03T03:25:23.107762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12134","last_updated":"2025-05-27T14:54:51Z","snapshot_observed_at":"2026-07-06T20:38:06.085744Z","submitted_at":"2025-02-17T18:52:29Z","title":"SoftCoT: Soft Chain-of-Thought for Efficient Reasoning with LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12134","snapshot_observed_at":"2026-08-03T03:25:23.113752Z","title":"Softcot: Soft chain-of-thought for efficient reasoning with llms.arXiv preprint arXiv:2502.12134,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.113752Z"},"links":{"cited_paper":"/paper/2502.12134","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:c20c62094326c7b5ae4bf165d605e14529ed2dcba7137eec2d307db423c7b861","observation_id":"7540ab61-7b11-48c2-9f55-80b9e1ebd974","resolution":{"observed_at":"2026-08-03T03:25:23.113752Z","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-03T03:25:23.116384Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.116384Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:12e3112a80e4438d32986046ffec1d577cde2332f60c2aafd8d889bc30fa7388","observation_id":"82472bad-f486-48c4-8989-170418be3d6b","resolution":{"observed_at":"2026-08-03T03:25:23.116384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.09014","last_updated":"2024-10-14T12:42:54Z","snapshot_observed_at":"2026-07-06T18:45:13.949715Z","submitted_at":"2024-07-12T06:06:54Z","title":"CompAct: Compressing Retrieved Documents Actively for Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.09014","snapshot_observed_at":"2026-08-03T03:25:23.118918Z","title":"Compact: Compressing retrieved documents actively for question answering.arXiv preprint arXiv:2407.09014,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.118918Z"},"links":{"cited_paper":"/paper/2407.09014","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:52a84adf12e3c53de067b70275070bd7973aae22cedae19fc07b49d258366f2f","observation_id":"a087667f-21cd-453c-814c-2c39eca4adb7","resolution":{"observed_at":"2026-08-03T03:25:23.118918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.12284","last_updated":"2024-05-03T17:36:07Z","snapshot_observed_at":"2026-08-02T15:00:50.388422Z","submitted_at":"2023-09-21T17:45:42Z","title":"MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.12284","snapshot_observed_at":"2026-08-03T03:25:23.121511Z","title":"T., Li, Z., Weller, A., and Liu, W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.121511Z"},"links":{"cited_paper":"/paper/2309.12284","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:f093830f5af0e28dc55713107635b667dec16e51f0c7c6a7a421cfdd374608ca","observation_id":"ed337479-3dd2-4505-9de1-f447ec5fd921","resolution":{"observed_at":"2026-08-03T03:25:23.121511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17827","last_updated":"2025-08-02T10:54:47Z","snapshot_observed_at":"2026-07-06T21:29:16.251954Z","submitted_at":"2025-05-23T12:41:29Z","title":"Not All Tokens Are What You Need In Thinking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.17827","snapshot_observed_at":"2026-08-03T03:25:23.124002Z","title":"D., Yu, Z., Xu, X., Qi, W., and Chen, K","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.124002Z"},"links":{"cited_paper":"/paper/2505.17827","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:440ca02ea43b6cd77d7f6dcacfc3f20776cdfb27c6869db0574c85a2454d0bb3","observation_id":"6966de69-b04c-4b94-8a81-eacccd573cda","resolution":{"observed_at":"2026-08-03T03:25:23.124002Z","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-03T03:25:23.127224Z","title":"BudgetγOurs (Wins) llmlingua-2 (Wins) Ours Pref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.127224Z"},"links":{"citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:c9ec7ebfdb89f27a482734fbe73bf2265a90c68d24980796f3e9fc6fac04aa6f","observation_id":"d8562d37-fc08-4436-b9a8-be6c2582204c","resolution":{"observed_at":"2026-08-03T03:25:23.127224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00127","last_updated":"2025-04-30T18:48:06Z","snapshot_observed_at":"2026-07-06T21:17:19.119854Z","submitted_at":"2025-04-30T18:48:06Z","title":"Between Underthinking and Overthinking: An Empirical Study of Reasoning Length and correctness in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.00127","snapshot_observed_at":"2026-08-03T03:25:23.097878Z","title":"Between un- derthinking and overthinking: An empirical study of rea- soning length and correctness in llms.arXiv preprint arXiv:2505.00127,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.097878Z"},"links":{"cited_paper":"/paper/2505.00127","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:fc364f572e3d559458ef8f19737ee913182074933bc31e16061e9e96318f5bab","observation_id":"9364801c-1f5d-4e98-aed8-44f7a9aaf310","resolution":{"observed_at":"2026-08-03T03:25:23.097878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22375","last_updated":"2025-05-29T01:59:00Z","snapshot_observed_at":"2026-08-07T01:28:35.749508Z","submitted_at":"2025-05-28T14:03:02Z","title":"Pangu Embedded: An Efficient Dual-system LLM Reasoner with Metacognition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22375","snapshot_observed_at":"2026-08-03T03:25:21.840888Z","title":"Pangu embedded: An efficient dual-system llm reasoner with metacognition","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:21.840888Z"},"links":{"cited_paper":"/paper/2505.22375","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:8200cabd618eb23e448da41b872ec79220075c1bb781766f8115ded0302fd879","observation_id":"6c8be02d-a32e-4279-95f1-5b3314e97aa2","resolution":{"observed_at":"2026-08-03T03:25:21.840888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.06261","last_updated":"2025-12-19T14:25:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-07T17:36:04Z","title":"Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.06261","snapshot_observed_at":"2026-08-03T03:25:22.094581Z","title":"Gemini 2.5: Pushing the frontier with advanced reasoning, multimodality, long context, and next generation agentic capabilities.arXiv preprint arXiv:2507.06261,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:22.094581Z"},"links":{"cited_paper":"/paper/2507.06261","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:e334999e9a82f790b71a750bac662d6fe0b15315d72998cb1dd10a41c9ed7e48","observation_id":"569f5b33-37f9-432c-a75d-c63ae61cff50","resolution":{"observed_at":"2026-08-03T03:25:22.094581Z","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-03T03:25:23.110772Z","title":"T., Wang, W., Li, Y ., and Li, W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.110772Z"},"links":{"citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:92ab1b6485d1e4fcf85f468c78d0e559ce95d3ca28472df8d9329751b0167289","observation_id":"07391250-0c93-4703-a1d4-5a988d70d5eb","resolution":{"observed_at":"2026-08-03T03:25:23.110772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06749","last_updated":"2026-02-28T21:10:52Z","snapshot_observed_at":"2026-07-06T20:49:27.466064Z","submitted_at":"2025-03-09T20:06:45Z","title":"Vision-R1: Incentivizing Reasoning Capability in Multimodal Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.06749","snapshot_observed_at":"2026-08-03T03:25:23.063091Z","title":"Vision-r1: Incentivizing reasoning capability in multimodal large language models.arXiv preprint arXiv:2503.06749,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.063091Z"},"links":{"cited_paper":"/paper/2503.06749","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:8e8cf7613a5e9b31ad29cd920f0fc7cb962993bfeca86dbf9636597a9c81fed0","observation_id":"92758fd6-999d-4a20-9112-4846162f7f83","resolution":{"observed_at":"2026-08-03T03:25:23.063091Z","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-03T03:25:21.706216Z","title":"Derived from AMC12 2022–2023 problems; this work uses the 2023 subset","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:21.706216Z"},"links":{"citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:ac2e3a88e640dde9d8e04b8937a5a4f13571d906f20a3305afa9702104912ef1","observation_id":"c0bc6187-0996-4b39-aad7-4e3e148466d8","resolution":{"observed_at":"2026-08-03T03:25:21.706216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05150","last_updated":"2020-12-02T17:52:35Z","snapshot_observed_at":"2026-07-31T17:17:17.205582Z","submitted_at":"2020-04-10T17:54:09Z","title":"Longformer: The Long-Document Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.05150","snapshot_observed_at":"2026-08-03T03:25:21.768283Z","title":"E., and Cohan, A","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:21.768283Z"},"links":{"cited_paper":"/paper/2004.05150","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:34c6d8fb344b083f340e1adf9dd8deeb4280c51597b824cfc99b875204c981c5","observation_id":"64574e80-1e3a-4f5e-aa6e-71a943f578e6","resolution":{"observed_at":"2026-08-03T03:25:21.768283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":37},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 3 inbound Pith citation observations for arXiv:2602.08324."}