{"as_of":"2026-08-07T22:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5651589c94bd401183daa054cf491ac3341abda96d5d99c5a4f42431739ad88c","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:49:40.577890Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:53:48.051608Z","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-16T13:22:55.270834Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.07104","snapshot_observed_at":"2026-08-06T17:53:48.051608Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09662","last_updated":"2025-07-13T14:51:59Z","snapshot_observed_at":"2026-08-07T01:15:50.475193Z","submitted_at":"2025-07-13T14:51:59Z","title":"Towards Concise and Adaptive Thinking in Large Reasoning Models: A Survey","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:48.051608Z"},"links":{"cited_paper":"/paper/2506.07104","citing_paper":"/paper/2507.09662"},"observation_digest":"sha256:7c4334d52f017bc457bee3acd6ec13d3d310dfd72dcf0c82b189b86bdb52a22c","observation_id":"c1c4647e-b274-4e3b-8244-f619c76f0c3b","resolution":{"observed_at":"2026-08-06T17:53:48.051608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"cited_work":{"arxiv_id":"2506.07104","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.07104","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Amirhosein Ghasemabadi, Keith G","venue":null,"work_id":"fd7a60fe-295f-400d-bc97-4dbdb5fd29a6","year":2025},"citing_paper":{"arxiv_id":"2601.11340","last_updated":"2026-04-15T07:21:40Z","snapshot_observed_at":"2026-08-02T05:43:35.759183Z","submitted_at":"2026-01-16T14:38:18Z","title":"Neural Chain-of-Thought Search: Searching the Optimal Reasoning Path to Enhance Large Language Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-16T13:21:36.606855Z"},"links":{"cited_paper":"/paper/2506.07104","citing_paper":"/paper/2601.11340"},"observation_digest":"sha256:6700f70ba47f7a8ef2e609a7b662d643e9498a4efd59e682fe5bf45dd1ae2b9c","observation_id":"8549c248-218b-49cd-b042-681bf3ad756c","resolution":{"observed_at":"2026-05-16T13:22:55.272653Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.07104/citation-record","integrity":"/paper/2506.07104/integrity","json":"/paper/2506.07104/citation-record.json","paper":"/paper/2506.07104"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.04697","last_updated":"2025-10-03T01:55:58Z","snapshot_observed_at":"2026-08-06T08:53:09.095000Z","submitted_at":"2025-03-06T18:43:29Z","title":"L1: Controlling How Long A Reasoning Model Thinks With Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.04697","snapshot_observed_at":"2026-08-07T05:49:34.499159Z","title":"L1: Controlling how long a reasoning model thinks with reinforcement learning.arXiv preprint arXiv:2503.04697, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:34.499159Z"},"links":{"cited_paper":"/paper/2503.04697","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:e08d0deb33329bcd8c45dee7fd7dc8045fef6fb675761c75dfbca29a31955ca4","observation_id":"dcf89b3e-d763-4ed3-af92-b11c20922e51","resolution":{"observed_at":"2026-08-07T05:49:34.499159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:34.596778Z","title":"Training language models to reason efficiently.arXiv preprint arXiv:2502.04463, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:34.596778Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:75146a3c19673850dd68fcdfb3ba10a748001f6119ac99ee8b58c0054f89b760","observation_id":"8db244d9-d272-41db-af6f-7ea1ce392dfc","resolution":{"observed_at":"2026-08-07T05:49:34.596778Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.18925","last_updated":"2024-12-25T15:12:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-25T15:12:34Z","title":"HuatuoGPT-o1, Towards Medical Complex Reasoning with LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.18925","snapshot_observed_at":"2026-08-07T05:49:34.696226Z","title":"Huatuogpt-o1, towards medical complex reasoning with llms, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:34.696226Z"},"links":{"cited_paper":"/paper/2412.18925","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:33837b2bdcdf116856dddc6ccb490adc9ff100de4749f0d1392a8dd6c045c52f","observation_id":"6938d49c-3201-49b0-89f0-480e540e7bec","resolution":{"observed_at":"2026-08-07T05:49:34.696226Z","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-07T05:49:35.028025Z","title":"Do not think that much for 2+3=? on the overthinking of o1-like llms, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:35.028025Z"},"links":{"cited_paper":"/paper/2412.21187","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:8ef2ead78fe9a162a03604b3a23c5a47292d5f17779187b2eb0c9e3835f5cfbb","observation_id":"9769068b-d3e3-4743-a4f4-d51336ab5248","resolution":{"observed_at":"2026-08-07T05:49:35.028025Z","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-08-07T15:43:01.592156Z","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-07T05:49:35.129268Z","title":"Thinkless: Llm learns when to think, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:35.129268Z"},"links":{"cited_paper":"/paper/2505.13379","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:5c47de848fd5bf5e50c740fd57e22cff519b002e4200a020526fddfe5499a637","observation_id":"24297eed-6dbe-462b-9d27-58e0c3675a5e","resolution":{"observed_at":"2026-08-07T05:49:35.129268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-07T05:49:35.259278Z","title":"Efficiently serving llm reasoning programs with certaindex.arXiv preprint arXiv:2412.20993, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:35.259278Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:83373e4d8dbec45e925922249239e9579f4b87f4b1c5a045618ad8a894f47807","observation_id":"e92c41ce-5ba5-40f2-a2e8-addd6482a401","resolution":{"observed_at":"2026-08-07T05:49:35.259278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:35.358710Z","title":"Reasoning without self-doubt: More efficient chain-of-thought through certainty probing","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:35.358710Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:d84e9f6bbd9048ebd50e5f29f2cc19c334795456d3d30d7013b0ccb04dc6c2ea","observation_id":"e3fa284a-d61b-4d75-a819-64c533390610","resolution":{"observed_at":"2026-08-07T05:49:35.358710Z","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-07T05:49:35.468940Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:35.468940Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:e46b57e45f91b10b600adf055d254841b0ceb65de37234380d0b08286194e5df","observation_id":"c1ffa9ca-0a8a-4e7c-9c76-86b37ecdcb0b","resolution":{"observed_at":"2026-08-07T05:49:35.468940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.18547","last_updated":"2025-06-02T00:44:09Z","snapshot_observed_at":"2026-08-07T19:18:10.858896Z","submitted_at":"2024-12-24T16:55:45Z","title":"Token-Budget-Aware LLM Reasoning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.18547","snapshot_observed_at":"2026-08-07T05:49:35.589682Z","title":"Token-budget-aware llm reasoning.arXiv preprint arXiv:2412.18547, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:35.589682Z"},"links":{"cited_paper":"/paper/2412.18547","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:66e0dfd265059aadd205ab52f995cb2d7fc260422514d3e97685d6215f8b545d","observation_id":"640a7e38-dd98-47ee-bef0-a35c7b92c105","resolution":{"observed_at":"2026-08-07T05:49:35.589682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:42.311402Z","title":"Skywork open reasoner series","venue":null,"work_id":"67334271-d999-431b-a771-401cfd5934fd","year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:35.713968Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:4fbed7e44273f560d6106ecd167721d94ec54f54829730e222a01b287b83f366","observation_id":"9e3c7f12-3266-4a4c-a2fd-a26d3488b72c","resolution":{"observed_at":"2026-08-07T05:49:42.383342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01296","last_updated":"2025-04-02T01:59:26Z","snapshot_observed_at":"2026-07-30T08:40:23.849282Z","submitted_at":"2025-04-02T01:59:26Z","title":"ThinkPrune: Pruning Long Chain-of-Thought of LLMs via Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01296","snapshot_observed_at":"2026-08-07T05:49:35.815835Z","title":"Thinkprune: Pruning long chain-of-thought of llms via reinforcement learning.arXiv preprint arXiv:2504.01296, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:35.815835Z"},"links":{"cited_paper":"/paper/2504.01296","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:72ab1844877d5740bc0d9c03faf1173df90e8101b18bbfc1d4faf130d089b7e4","observation_id":"549e5200-69e8-4e89-9a22-a52ccaa7d237","resolution":{"observed_at":"2026-08-07T05:49:35.815835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.24290","last_updated":"2025-07-05T09:01:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-31T16:36:05Z","title":"Open-Reasoner-Zero: An Open Source Approach to Scaling Up Reinforcement Learning on the Base Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.24290","snapshot_observed_at":"2026-08-07T05:49:35.897085Z","title":"Open-reasoner-zero: An open source approach to scaling up reinforcement learning on the base model, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:35.897085Z"},"links":{"cited_paper":"/paper/2503.24290","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:072462641b0dff0462c7bfa5c15708282aa2825cc3053480a703a97050825393","observation_id":"acdd038c-6254-4ca2-82e8-ba764b5ad559","resolution":{"observed_at":"2026-08-07T05:49:35.897085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.00031","last_updated":"2025-02-25T00:21:14Z","snapshot_observed_at":"2026-08-07T17:51:38.471379Z","submitted_at":"2025-02-25T00:21:14Z","title":"Efficient Test-Time Scaling via Self-Calibration","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.00031","snapshot_observed_at":"2026-08-07T05:49:36.050461Z","title":"Efficient test-time scaling via self-calibration.arXiv preprint arXiv:2503.00031, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.050461Z"},"links":{"cited_paper":"/paper/2503.00031","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:d0e4134938dac96e8170ef5c7c1dac1c01e813cc0a720785e1b596edfc9c90f5","observation_id":"96c1265e-c539-45b8-b150-55341afd6eac","resolution":{"observed_at":"2026-08-07T05:49:36.050461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14631","last_updated":"2025-05-21T05:17:34Z","snapshot_observed_at":"2026-08-07T15:28:58.246731Z","submitted_at":"2025-05-20T17:23:25Z","title":"Think Only When You Need with Large Hybrid-Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.14631","snapshot_observed_at":"2026-08-07T05:49:36.120187Z","title":"Think only when you need with large hybrid-reasoning models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.120187Z"},"links":{"cited_paper":"/paper/2505.14631","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:78077fa358242b17676680f95183e126cb25fb329327eb5fce03c3ceb1cf8e91","observation_id":"7b95b0bf-bfc5-4c36-a823-b52e471b94d0","resolution":{"observed_at":"2026-08-07T05:49:36.120187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11664","last_updated":"2024-12-16T11:12:45Z","snapshot_observed_at":"2026-07-06T20:07:41.462631Z","submitted_at":"2024-12-16T11:12:45Z","title":"C3oT: Generating Shorter Chain-of-Thought without Compromising Effectiveness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.11664","snapshot_observed_at":"2026-08-07T05:49:36.187134Z","title":"C3ot: Generating shorter chain-of- thought without compromising effectiveness.arXiv preprint arXiv:2412.11664, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.187134Z"},"links":{"cited_paper":"/paper/2412.11664","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:25de69491b20cfe1f0db56619064376f6c7e3aa3e98fb016d7b5ebf9335e07cb","observation_id":"31a2eb7d-20eb-4a0d-a9e9-925851659732","resolution":{"observed_at":"2026-08-07T05:49:36.187134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.14858","last_updated":"2022-07-01T02:15:12Z","snapshot_observed_at":"2026-08-05T15:41:22.691461Z","submitted_at":"2022-06-29T18:54:49Z","title":"Solving Quantitative Reasoning Problems with Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.14858","snapshot_observed_at":"2026-08-07T05:49:36.305178Z","title":"Solving quantitative reasoning problems with language models, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.305178Z"},"links":{"cited_paper":"/paper/2206.14858","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:dc499ecea3ec4fb817dd902b8ca09c2c6e3a0e274b1d8f1b5d6830f5a1eccf81","observation_id":"d09a825c-5489-4883-9108-1d19d919c400","resolution":{"observed_at":"2026-08-07T05:49:36.305178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11886","last_updated":"2025-02-17T15:13:29Z","snapshot_observed_at":"2026-08-07T18:12:08.883357Z","submitted_at":"2025-02-17T15:13:29Z","title":"LIMR: Less is More for RL Scaling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11886","snapshot_observed_at":"2026-08-07T05:49:36.467346Z","title":"Limr: Less is more for rl scaling, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.467346Z"},"links":{"cited_paper":"/paper/2502.11886","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:6049a6bc5d07ae4aba7d28b86499aba11d8d856f49c243ebb1ee5efa9086b373","observation_id":"86b8cbe4-6afc-4a59-89fe-b898730394fb","resolution":{"observed_at":"2026-08-07T05:49:36.467346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14183","last_updated":"2025-05-20T10:40:41Z","snapshot_observed_at":"2026-08-07T15:36:34.268994Z","submitted_at":"2025-05-20T10:40:41Z","title":"ThinkSwitcher: When to Think Hard, When to Think Fast","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.14183","snapshot_observed_at":"2026-08-07T05:49:36.597126Z","title":"Thinkswitcher: When to think hard, when to think fast, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.597126Z"},"links":{"cited_paper":"/paper/2505.14183","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:c7d77713c9ef5113e11fbe9c8c851c3c7ba6f69456d7f83ad9c679e09227839e","observation_id":"2be6c0ee-0ca8-4e3e-abbc-00a4b245e895","resolution":{"observed_at":"2026-08-07T05:49:36.597126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-07T05:49:36.717578Z","title":"Reward-guided speculative decoding for efficient llm reasoning.arXiv preprint arXiv:2501.19324, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.717578Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:771db27f802838e0f3af2f82c1294995c2a60babf64693698360360f26c270a9","observation_id":"1a1662d7-9fd7-4836-a74c-7d216dbed935","resolution":{"observed_at":"2026-08-07T05:49:36.717578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T05:49:36.874631Z","title":"Can language models learn to skip steps?arXiv preprint arXiv:2411.01855, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.874631Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:ab1cbd6517e2401fa30836ac4964c1d660a26b0a5546212c5583a2514d3d3fc8","observation_id":"29cdb302-a971-4b8b-8d35-b197d55327d9","resolution":{"observed_at":"2026-08-07T05:49:36.874631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:36.987668Z","title":"Fin-r1: A large language model for financial reasoning through reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.987668Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:512d205c9cf2a154e06a7faca33da1aebc3992e6cc20fc3cffb2a8dd8343310f","observation_id":"602394ee-2587-4421-b319-6b919e1f567d","resolution":{"observed_at":"2026-08-07T05:49:36.987668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11896","last_updated":"2025-05-25T13:39:29Z","snapshot_observed_at":"2026-08-07T15:44:24.427443Z","submitted_at":"2025-05-17T08:27:00Z","title":"AdaCoT: Pareto-Optimal Adaptive Chain-of-Thought Triggering via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11896","snapshot_observed_at":"2026-08-07T05:49:37.109195Z","title":"Adacot: Pareto-optimal adaptive chain-of-thought triggering via reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:37.109195Z"},"links":{"cited_paper":"/paper/2505.11896","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:6501e873efda809232901444b473c288062a2350cb16bec3b4b6ae8ec1292b15","observation_id":"58910aff-413b-4669-83d8-436907fc1c4c","resolution":{"observed_at":"2026-08-07T05:49:37.109195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12570","last_updated":"2025-01-29T03:11:03Z","snapshot_observed_at":"2026-07-06T20:24:12.803909Z","submitted_at":"2025-01-22T01:35:11Z","title":"O1-Pruner: Length-Harmonizing Fine-Tuning for O1-Like Reasoning Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12570","snapshot_observed_at":"2026-08-07T05:49:37.215102Z","title":"O1-pruner: Length-harmonizing fine-tuning for o1-like reasoning pruning.arXiv preprint arXiv:2501.12570, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:37.215102Z"},"links":{"cited_paper":"/paper/2501.12570","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:5b253776f6fcaa994c235dd691b544559c581fe05ae543d2f3c0940cd4afb61b","observation_id":"1ebbfb26-892d-4476-a44f-5c1083f4cc91","resolution":{"observed_at":"2026-08-07T05:49:37.215102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:42.133500Z","title":"Deepcoder: A fully open-source 14b coder at o3-mini level","venue":null,"work_id":"766fbadb-c0d8-4f8b-8425-e94c6748b71f","year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:37.308823Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:3e780b73f7ef1a397df94d1b2616df748e68d962465dce82af6bb0f0a9017c17","observation_id":"b0453166-e802-4e6b-93b9-798552d70296","resolution":{"observed_at":"2026-08-07T05:49:42.236363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:37.401902Z","title":"Tang, Manan Roongta, Colin Cai, Jeffrey Luo, Li Erran Li, Raluca Ada Popa, and Ion Stoica","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:37.401902Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:bc04358213736b2ce7547846a9421e851f51e119efe26048d7d023e13e1c5115","observation_id":"c377da9b-340c-492d-9b00-f5ca907016bb","resolution":{"observed_at":"2026-08-07T05:49:37.401902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09601","last_updated":"2025-02-13T18:52:36Z","snapshot_observed_at":"2026-08-07T20:50:22.392912Z","submitted_at":"2025-02-13T18:52:36Z","title":"CoT-Valve: Length-Compressible Chain-of-Thought Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09601","snapshot_observed_at":"2026-08-07T05:49:37.540313Z","title":"Cot-valve: Length-compressible chain-of-thought tuning.arXiv preprint arXiv:2502.09601, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:37.540313Z"},"links":{"cited_paper":"/paper/2502.09601","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:ecb9d5bcaafa9cda5bc6eddaf500aa9bc47d991ede699e6b0204c18fefa8d1e2","observation_id":"4597f838-16df-4b7d-875d-2b572aa48740","resolution":{"observed_at":"2026-08-07T05:49:37.540313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:37.684760Z","title":"Simpo: Simple preference optimization with a reference-free reward.Advances in Neural Information Processing Systems, 37:124198–124235, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:37.684760Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:080a865e98711d4b88d4bac9bcaffbc307fe46c8b4567eccc7cc811bc28b564c","observation_id":"7f0e3b78-4b8a-4a0e-b1d8-301a544ca41d","resolution":{"observed_at":"2026-08-07T05:49:37.684760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19393","last_updated":"2025-03-01T06:07:39Z","snapshot_observed_at":"2026-07-06T20:29:11.710285Z","submitted_at":"2025-01-31T18:48:08Z","title":"s1: Simple test-time scaling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19393","snapshot_observed_at":"2026-08-07T05:49:37.783145Z","title":"s1: Simple test-time scaling, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:37.783145Z"},"links":{"cited_paper":"/paper/2501.19393","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:2a89b44975c1c763ebb6fc2fd241813bf73f0473f82213d0bfa5d527797b7cf2","observation_id":"b0bfffb9-fc19-4282-bd12-c6c407233330","resolution":{"observed_at":"2026-08-07T05:49:37.783145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20122","last_updated":"2025-06-10T10:54:28Z","snapshot_observed_at":"2026-08-07T17:42:49.612783Z","submitted_at":"2025-02-27T14:14:50Z","title":"Self-Training Elicits Concise Reasoning in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20122","snapshot_observed_at":"2026-08-07T05:49:37.914205Z","title":"Self-training elicits concise reasoning in large language models.arXiv preprint arXiv:2502.20122, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:37.914205Z"},"links":{"cited_paper":"/paper/2502.20122","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:a7460d17eaa9cba05ed63acf6f91f12aa0ce5591f592483d191e169e7217bb52","observation_id":"5fb48e33-8d90-4743-a1d6-bc5beb2fc1aa","resolution":{"observed_at":"2026-08-07T05:49:37.914205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:41.976298Z","title":"Learning to reason with llms","venue":null,"work_id":"e2bac20f-169d-4a6b-bbaa-8777ed9d8975","year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.058152Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:2a612ed2917faa30e1fff4259a9c899e516b0ba2dd5b491343ca633471796625","observation_id":"c885bb26-d3fa-4261-b1ed-9b76950c1eab","resolution":{"observed_at":"2026-08-07T05:49:42.041410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.13367","last_updated":"2025-04-17T22:16:30Z","snapshot_observed_at":"2026-08-07T16:01:17.031141Z","submitted_at":"2025-04-17T22:16:30Z","title":"THOUGHTTERMINATOR: Benchmarking, Calibrating, and Mitigating Overthinking in Reasoning Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.13367","snapshot_observed_at":"2026-08-07T05:49:38.203391Z","title":"Thoughtterminator: Benchmarking, calibrating, and mitigating overthinking in reasoning models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.203391Z"},"links":{"cited_paper":"/paper/2504.13367","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:488bd40fd3cb863ebfae808b0f7d39ecf063a81fa002f39c14999777eb4bb982","observation_id":"30c26e1a-4e14-4d49-b0b5-ba9f08e06c7d","resolution":{"observed_at":"2026-08-07T05:49:38.203391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:38.275527Z","title":"Optimizing anytime reasoning via budget relative policy optimization, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.275527Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:c7210917832cfc28f708fcf8f56c6da9a96c7b29f51650c3cce40faf09d35e65","observation_id":"12d3f2f4-1a96-445b-97b0-651bbd5e1875","resolution":{"observed_at":"2026-08-07T05:49:38.275527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07572","last_updated":"2025-03-10T17:40:43Z","snapshot_observed_at":"2026-08-07T17:16:00.148793Z","submitted_at":"2025-03-10T17:40:43Z","title":"Optimizing Test-Time Compute via Meta Reinforcement Fine-Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.07572","snapshot_observed_at":"2026-08-07T05:49:38.378369Z","title":"Optimizing test-time compute via meta reinforcement fine-tuning.arXiv preprint arXiv:2503.07572, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.378369Z"},"links":{"cited_paper":"/paper/2503.07572","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:1c49384948d6603083b2bae219470c69cd101dbe50f93116f783a45b6a093c0c","observation_id":"3b642e89-0914-4e15-873d-ee3d7fab022d","resolution":{"observed_at":"2026-08-07T05:49:38.378369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:41.804062Z","title":"Areal: Ant reasoning rl","venue":null,"work_id":"d5c2a253-accb-4068-95ca-783b77339471","year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.442171Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:8cea1f02efb2eb1879ffe8bac927beb49813e336462d4385c9b0f395e7c14205","observation_id":"b79cc64b-1687-40a8-aa04-422e5c900707","resolution":{"observed_at":"2026-08-07T05:49:41.896795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00424","last_updated":"2025-08-19T03:42:00Z","snapshot_observed_at":"2026-08-07T20:59:55.992211Z","submitted_at":"2025-04-01T05:09:04Z","title":"Hawkeye:Efficient Reasoning with Model Collaboration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00424","snapshot_observed_at":"2026-08-07T05:49:38.520326Z","title":"Hawkeye:efficient reasoning with model collaboration, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.520326Z"},"links":{"cited_paper":"/paper/2504.00424","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:b6d294917ad8c894f55e31d9d25b1b606a7b8f695b24fdb7990e09db5cb93c4a","observation_id":"1a5c1ea8-2935-407c-8dd8-4cc7c720bb0e","resolution":{"observed_at":"2026-08-07T05:49:38.520326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.07615","last_updated":"2025-04-14T15:15:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-10T10:05:15Z","title":"VLM-R1: A Stable and Generalizable R1-style Large Vision-Language Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.07615","snapshot_observed_at":"2026-08-07T05:49:38.588973Z","title":"Vlm-r1: A stable and generalizable r1-style large vision-language model.arXiv preprint arXiv:2504.07615, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.588973Z"},"links":{"cited_paper":"/paper/2504.07615","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:6aed34e94005d5bfe0ad1a172ab14a244783f6b553153e0d085e209f26c18db1","observation_id":"881669e3-6609-42a6-a6ce-41f8cef58788","resolution":{"observed_at":"2026-08-07T05:49:38.588973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:38.672014Z","title":"Dast: Difficulty-adaptive slow-thinking for large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.672014Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:44b516d6414b5539fef6bbb24d176969e85fb1947bbdcbac7d24a3261022ef37","observation_id":"da7c21a4-0088-49f6-9cba-0772561ccad2","resolution":{"observed_at":"2026-08-07T05:49:38.672014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19256","last_updated":"2024-10-02T04:01:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-28T06:20:03Z","title":"HybridFlow: A Flexible and Efficient RLHF Framework","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.19256","snapshot_observed_at":"2026-08-07T05:49:38.781973Z","title":"Hybridflow: A flexible and efficient rlhf framework.arXiv preprint arXiv: 2409.19256, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.781973Z"},"links":{"cited_paper":"/paper/2409.19256","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:ef09950f25bb8f230d767f8e84333ddfd75e586ddfd914ae3ff952e201905ee2","observation_id":"f44f5bda-0b92-4924-abc8-e3dc9bcced9a","resolution":{"observed_at":"2026-08-07T05:49:38.781973Z","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-07T05:49:38.874482Z","title":"Stop overthinking: A survey on efficient reasoning for large language models.arXiv preprint arXiv:2503.16419, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.874482Z"},"links":{"cited_paper":"/paper/2503.16419","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:46b547d15d5bc7e44ce257492b6dfcb19bcad6a636833663d6a544a461ac3c71","observation_id":"1ea4eec6-f2da-4d76-8c2c-e7ede3698bc7","resolution":{"observed_at":"2026-08-07T05:49:38.874482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-07T05:49:38.967912Z","title":"Fast best-of-n decoding via speculative rejection.arXiv preprint arXiv:2410.20290, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:38.967912Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:5d8c605dc38b0e338d3ca4bb928d8f14dec4917614060cb6571433cf70df717f","observation_id":"33a60b7a-8803-4660-9fd1-0d1350d14818","resolution":{"observed_at":"2026-08-07T05:49:38.967912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:39.034718Z","title":"Confidence improves self-consistency in llms.arXiv preprint arXiv:2502.06233, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.034718Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:51a9a19e52b040cddf26e47238befd10785b58f61d9a851aabe092317d428059","observation_id":"cc5e8e5c-9620-4805-8292-b4227d436795","resolution":{"observed_at":"2026-08-07T05:49:39.034718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12599","last_updated":"2025-06-03T02:14:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T02:48:14Z","title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12599","snapshot_observed_at":"2026-08-07T05:49:39.110881Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.110881Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:e2f00f823ee563a4c936d9a0d0ca3b4cc964151c8ecfaefd1a326ec2f0d34cfd","observation_id":"62567a75-a81b-4646-a49a-eddfb5bd2f03","resolution":{"observed_at":"2026-08-07T05:49:39.110881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:41.675814Z","title":"Learning when to think: Shaping adaptive reasoning in r1-style models via multi-stage rl,","venue":null,"work_id":"d93069c7-30cb-4dcd-9727-4a2e0f879337","year":null},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.175313Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:dd44b175104ab3f022f9225bfc00030ea9e3ab48d4a6c5036c72a7db140a7ffc","observation_id":"c2579418-fe62-44ed-a47a-5b335be1e611","resolution":{"observed_at":"2026-08-07T05:49:41.736320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:39.336776Z","title":"Self-consistency improves chain of thought reasoning in language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.336776Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:b763c410d3957e354d3c1871f280e94054c50dbabdf96013a01023aaf5a50383","observation_id":"71bb0eea-045e-40b4-be43-5834fba86634","resolution":{"observed_at":"2026-08-07T05:49:39.336776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.20571","last_updated":"2025-10-24T10:02:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-29T09:24:30Z","title":"Reinforcement Learning for Reasoning in Large Language Models with One Training Example","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.20571","snapshot_observed_at":"2026-08-07T05:49:39.427926Z","title":"Reinforcement learning for reasoning in large language models with one training example, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.427926Z"},"links":{"cited_paper":"/paper/2504.20571","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:ffa4063f6342ee6ae1e0844621872e0ece2f378fe1e634c9ea40cd8169294e96","observation_id":"f6eb5b31-48c2-4dc8-a33c-42347b1f8cf9","resolution":{"observed_at":"2026-08-07T05:49:39.427926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:39.495400Z","title":"Tokenskip: Controllable chain-of-thought compression in llms.arXiv preprint arXiv:2502.12067, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.495400Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:2b1ff318103c0fe777d7ba218fe83ec5ceca99d43c1828be90e001af0c326c6a","observation_id":"50582151-68b1-42f7-aeed-02770b8720a5","resolution":{"observed_at":"2026-08-07T05:49:39.495400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.05315","last_updated":"2025-05-21T05:40:27Z","snapshot_observed_at":"2026-08-07T15:48:46.300308Z","submitted_at":"2025-05-08T15:01:06Z","title":"Scalable Chain of Thoughts via Elastic Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.05315","snapshot_observed_at":"2026-08-07T05:49:39.585269Z","title":"Scalable chain of thoughts via elastic reasoning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.585269Z"},"links":{"cited_paper":"/paper/2505.05315","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:2a4f0dd41b1399f02460d880b9b27778cb910448094a80ceaa34c052d82dc4c2","observation_id":"f1a8cdf3-9093-43e4-b5df-b24053add6fd","resolution":{"observed_at":"2026-08-07T05:49:39.585269Z","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-07T05:49:39.672165Z","title":"Qwen3 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.672165Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:6749d4cfa8d898b4d9cc08b92f93a6488e7c8fe9554240e36d9288c86edcfc33","observation_id":"66b4e1d8-cb54-4e43-bcdc-9bba618053fe","resolution":{"observed_at":"2026-08-07T05:49:39.672165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.03234","last_updated":"2025-05-21T15:26:54Z","snapshot_observed_at":"2026-08-07T16:09:40.232114Z","submitted_at":"2025-04-04T07:34:01Z","title":"Think When You Need: Self-Adaptive Chain-of-Thought Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.03234","snapshot_observed_at":"2026-08-07T05:49:39.753920Z","title":"Think when you need: Self-adaptive chain-of-thought learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.753920Z"},"links":{"cited_paper":"/paper/2504.03234","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:1568d5c92b4e5a9d3d8c6be4ab50162580cded6eae7f38871a4234a58fc72e63","observation_id":"69f3e7db-693f-42a6-82b8-c1ec8f1dc793","resolution":{"observed_at":"2026-08-07T05:49:39.753920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:39.840510Z","title":"Towards thinking-optimal scaling of test-time compute for llm reasoning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.840510Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:18712c43299c2660aa787cc9ad11db4bc9a46e3e2f3eec1d33c97772e2017936","observation_id":"bd9e2959-fb9d-4430-8ac5-4ba499f62c51","resolution":{"observed_at":"2026-08-07T05:49:39.840510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03373","last_updated":"2025-02-05T17:13:32Z","snapshot_observed_at":"2026-07-06T20:31:41.231839Z","submitted_at":"2025-02-05T17:13:32Z","title":"Demystifying Long Chain-of-Thought Reasoning in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03373","snapshot_observed_at":"2026-08-07T05:49:39.909550Z","title":"Demystifying long chain-of-thought reasoning in llms.arXiv preprint arXiv:2502.03373, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.909550Z"},"links":{"cited_paper":"/paper/2502.03373","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:b9720c81d2f7db9fff519026170991cca1c17895af94c0857b416279fde3714b","observation_id":"6af1f9e4-a779-45f5-a6d3-8a07b84ae273","resolution":{"observed_at":"2026-08-07T05:49:39.909550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.09213","last_updated":"2025-07-30T08:05:40Z","snapshot_observed_at":"2026-07-06T20:21:42.341172Z","submitted_at":"2025-01-16T00:19:19Z","title":"FineMedLM-o1: Enhancing Medical Knowledge Reasoning Ability of LLM from Supervised Fine-Tuning to Test-Time Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.09213","snapshot_observed_at":"2026-08-07T05:49:39.978220Z","title":"Finemedlm-o1: Enhancing the medical reasoning ability of llm from supervised fine-tuning to test-time training, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.978220Z"},"links":{"cited_paper":"/paper/2501.09213","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:40f59ae6452aa6e03f104146e6c863b86c7e45a2aa04a8533512a544a6df65d6","observation_id":"589595c2-21f7-4948-a720-d00509f74398","resolution":{"observed_at":"2026-08-07T05:49:39.978220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06023","last_updated":"2024-07-24T18:40:36Z","snapshot_observed_at":"2026-07-31T10:52:02.949801Z","submitted_at":"2024-07-08T15:17:46Z","title":"Distilling System 2 into System 1","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.06023","snapshot_observed_at":"2026-08-07T05:49:40.051297Z","title":"Distilling system 2 into system 1.arXiv preprint arXiv:2407.06023, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:40.051297Z"},"links":{"cited_paper":"/paper/2407.06023","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:9e1ff8907d0659980e988408c5a3bb062d2d2d2bd5930259fc6e59bfd8eeb58d","observation_id":"3def0778-7059-489c-b93e-13253303564e","resolution":{"observed_at":"2026-08-07T05:49:40.051297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14476","last_updated":"2025-05-20T01:37:34Z","snapshot_observed_at":"2026-08-02T01:40:54.187278Z","submitted_at":"2025-03-18T17:49:06Z","title":"DAPO: An Open-Source LLM Reinforcement Learning System at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14476","snapshot_observed_at":"2026-08-07T05:49:40.129855Z","title":"Dapo: An open-source llm reinforcement learning system at scale, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:40.129855Z"},"links":{"cited_paper":"/paper/2503.14476","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:490a3016de9397a72cbb8577b7cb72925b049ce4dd6b21a328dc2770ca41b367","observation_id":"6322f138-1f81-47ad-8802-2bdb1a21490b","resolution":{"observed_at":"2026-08-07T05:49:40.129855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00810","last_updated":"2025-04-01T14:01:50Z","snapshot_observed_at":"2026-08-07T16:17:22.645083Z","submitted_at":"2025-04-01T14:01:50Z","title":"Z1: Efficient Test-time Scaling with Code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00810","snapshot_observed_at":"2026-08-07T05:49:40.227034Z","title":"Z1: Efficient test-time scaling with code, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:40.227034Z"},"links":{"cited_paper":"/paper/2504.00810","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:f38a338280d86cffceb2b30d75cd15bd442137741d850239230ff074f09fa0ed","observation_id":"da1c3027-fe12-44b0-9033-217c568dacd6","resolution":{"observed_at":"2026-08-07T05:49:40.227034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05118","last_updated":"2025-04-11T02:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-07T14:21:11Z","title":"VAPO: Efficient and Reliable Reinforcement Learning for Advanced Reasoning Tasks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.05118","snapshot_observed_at":"2026-08-07T05:49:40.307416Z","title":"Vapo: Efficient and reliable reinforcement learning for advanced reasoning tasks, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:40.307416Z"},"links":{"cited_paper":"/paper/2504.05118","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:d4bcf0e8d86ab2b3b175e22820bbe70d8819e5193de9f39feef40a304d3fb6f2","observation_id":"487a986d-c299-4028-900a-37dcdba052b3","resolution":{"observed_at":"2026-08-07T05:49:40.307416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13417","last_updated":"2025-05-19T17:50:52Z","snapshot_observed_at":"2026-08-07T15:42:59.701048Z","submitted_at":"2025-05-19T17:50:52Z","title":"AdaptThink: Reasoning Models Can Learn When to Think","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13417","snapshot_observed_at":"2026-08-07T05:49:40.388824Z","title":"Adaptthink: Reasoning models can learn when to think, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:40.388824Z"},"links":{"cited_paper":"/paper/2505.13417","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:2b11057d73c1bc554fd7206969120656d133f516096d0a02f50073f8c596589a","observation_id":"db605667-f43e-46e3-a2bf-6367e64205fb","resolution":{"observed_at":"2026-08-07T05:49:40.388824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.12937","last_updated":"2025-08-04T04:22:09Z","snapshot_observed_at":"2026-08-06T21:34:54.534751Z","submitted_at":"2025-03-17T08:51:44Z","title":"R1-VL: Learning to Reason with Multimodal Large Language Models via Step-wise Group Relative Policy Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.12937","snapshot_observed_at":"2026-08-07T05:49:40.486336Z","title":"R1-vl: Learning to reason with multimodal large language models via step-wise group relative policy optimization.arXiv preprint arXiv:2503.12937, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:40.486336Z"},"links":{"cited_paper":"/paper/2503.12937","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:7bab2d94cad51b6d57663073697637ca06e4f37f04fa89a0a77c19d48aa444ba","observation_id":"2ebf69cc-e2b5-4f41-a2a4-bcc8a30e0fa4","resolution":{"observed_at":"2026-08-07T05:49:40.486336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.07104","last_updated":"2024-06-06T00:10:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-12T09:34:27Z","title":"SGLang: Efficient Execution of Structured Language Model Programs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.07104","snapshot_observed_at":"2026-08-07T05:49:40.577890Z","title":"The Final Answer is \\boxed{","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:40.577890Z"},"links":{"cited_paper":"/paper/2312.07104","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:71e2733506a8b9f6f427a2ea412b3afb2a64009b0020da77b8d33786c6ee325d","observation_id":"b26ff1b8-67af-4eb3-8ce0-a5385bfacbe9","resolution":{"observed_at":"2026-08-07T05:49:40.577890Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:49:39.249076Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.249076Z"},"links":{"citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:77f7a3645c4509669c2e3adccb37c4f8d1aaa816fd447f5208c4358892cad6f4","observation_id":"29e8489d-c029-4956-befa-11f8158d156d","resolution":{"observed_at":"2026-08-07T05:49:39.249076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":54,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":60},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 2 inbound Pith citation observations for arXiv:2506.07104."}