{"as_of":"2026-08-08T03:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04c3b05d3078895d3a5d4de29a03344d44f769a412d2161217e6b97089dd3a96","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:24:03.563539Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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:54:16.766414Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T09:19:43.891734Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10822","snapshot_observed_at":"2026-08-06T17:54:16.766414Z","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":89,"source":"arxiv_source","source_observed_at":"2026-08-06T17:54:16.766414Z"},"links":{"cited_paper":"/paper/2506.10822","citing_paper":"/paper/2507.09662"},"observation_digest":"sha256:c25d0350356d217f0f9e30d8fba00c3e239b785d4544d2e782339e9cca05f476","observation_id":"c6533a2e-66b8-495e-a0f5-78258de6cca8","resolution":{"observed_at":"2026-08-06T17:54:16.766414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"cited_work":{"arxiv_id":"2506.10822","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10822","snapshot_observed_at":"2026-07-04T09:19:43.891734Z","title":"2506.10822 , archivePrefix=","venue":null,"work_id":"2037c403-5f56-4e50-9892-a0fc853eaf1c","year":null},"citing_paper":{"arxiv_id":"2606.22716","last_updated":"2026-06-21T23:27:12Z","snapshot_observed_at":"2026-08-02T15:57:58.597260Z","submitted_at":"2026-06-21T23:27:12Z","title":"Beyond Penalizing Mistakes: Stabilizing Efficiency Training in Large Reasoning Models via Adaptive Correct-Only Rewards","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-26T10:12:30.692295Z"},"links":{"cited_paper":"/paper/2506.10822","citing_paper":"/paper/2606.22716"},"observation_digest":"sha256:f1418f88ef5109a9912f47ca04328444c9dd43a1a5f687b7015bd8ec6fa8ade5","observation_id":"72452bd8-cde6-42b1-b99a-3d82cf6d34c6","resolution":{"observed_at":"2026-07-04T09:19:43.893126Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10822","snapshot_observed_at":"2026-08-01T13:40:39.777071Z","title":"Efficient multimodal large language models: A survey.Visual Intelligence, 3(1):27, 2025a","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.19046","last_updated":"2026-07-21T12:35:04Z","snapshot_observed_at":"2026-08-01T13:40:35.820857Z","submitted_at":"2026-07-21T12:35:04Z","title":"Contrastive On-Policy Distillation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T13:40:39.777071Z"},"links":{"cited_paper":"/paper/2506.10822","citing_paper":"/paper/2607.19046"},"observation_digest":"sha256:b89387bbc4dc0c6352705fb837b5ce398d881470edddf75a18a809291573f8b8","observation_id":"d58fab11-0a67-4879-9243-c240d0895db4","resolution":{"observed_at":"2026-08-01T13:40:39.777071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.10822/citation-record","integrity":"/paper/2506.10822/integrity","json":"/paper/2506.10822/citation-record.json","paper":"/paper/2506.10822"},"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-07T04:24:01.152545Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.152545Z"},"links":{"cited_paper":"/paper/2503.04697","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:ed3897caa9645233dbaca33d5d34991199c37dba2971537557c4b7d21b078f0d","observation_id":"5404fa91-5fff-4202-b533-2710c7b4e10c","resolution":{"observed_at":"2026-08-07T04:24:01.152545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.09567","last_updated":"2025-07-18T15:57:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-12T17:35:03Z","title":"Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.09567","snapshot_observed_at":"2026-08-07T04:24:01.236638Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.236638Z"},"links":{"cited_paper":"/paper/2503.09567","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:c2337185025f141c1527b1b7b9dc2f06ca2d1086888cf3e85a09469cd3d4bcd9","observation_id":"34ea02ed-bc12-4adf-bf32-fb438273c6a9","resolution":{"observed_at":"2026-08-07T04:24:01.236638Z","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-07T04:24:01.308511Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.308511Z"},"links":{"cited_paper":"/paper/2412.21187","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:2cab8b0b443d0a8fcce4eb7f9a70a8ac9bf45fbcab15f89534fd31e735081545","observation_id":"4fe7ae4c-3a13-42eb-a79e-3a7470f2ebdc","resolution":{"observed_at":"2026-08-07T04:24:01.308511Z","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-07T04:24:05.342238Z","title":null,"venue":null,"work_id":"42461c25-2c74-43a1-9c1b-a41c3a45d508","year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.384046Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:52ad8f69ecc65d7b9599ee32f1d934bc3c402f926b003569dcac786a8bc8c453","observation_id":"2623af2b-e124-468e-b761-ea109da9f813","resolution":{"observed_at":"2026-08-07T04:24:05.446844Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-07T04:24:01.461204Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.461204Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:abf3fd6d8d33cc70396c2e36b7a11a2fbf90299e6bde4d850b1ee8c4a94ed01a","observation_id":"f51e2e38-bdd0-4d4a-a857-58ff832411a1","resolution":{"observed_at":"2026-08-07T04:24:01.461204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08235","last_updated":"2025-02-12T09:23:26Z","snapshot_observed_at":"2026-07-06T20:35:16.369243Z","submitted_at":"2025-02-12T09:23:26Z","title":"The Danger of Overthinking: Examining the Reasoning-Action Dilemma in Agentic Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08235","snapshot_observed_at":"2026-08-07T04:24:01.508410Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.508410Z"},"links":{"cited_paper":"/paper/2502.08235","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:7d057696869e0de9ceffb71b202fc39be2cc1e2a5fd2d403bd8fca38738eb8b7","observation_id":"98814e70-03e1-42da-824a-9817c40d10ef","resolution":{"observed_at":"2026-08-07T04:24:01.508410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","snapshot_observed_at":"2026-08-08T01:05:55.260474Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13260","snapshot_observed_at":"2026-08-07T04:24:01.619558Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.619558Z"},"links":{"cited_paper":"/paper/2502.13260","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:66bc72290d36932003ab0f03ef4e29e51f7ad2722a6baaea01024065b811922d","observation_id":"c975d91d-02ee-43e8-86ac-857102901f45","resolution":{"observed_at":"2026-08-07T04:24:01.619558Z","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-07T04:24:01.705143Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.705143Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:a538bb34e668a5ffb2eb87d9b128c1ff7d80d7ca34df67bc7ad20c42e98e18e4","observation_id":"43213829-d65c-4a63-b610-80379d7ad101","resolution":{"observed_at":"2026-08-07T04:24:01.705143Z","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-07T04:24:05.140256Z","title":null,"venue":null,"work_id":"613e3fb7-d756-4d92-92a8-08848c31534d","year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.765995Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:4860ec86e44a23a74ad68dfe06d56e5d40f5b20d13e1881dcf44cb864846762a","observation_id":"39b38077-a240-4858-a691-dd927ce51381","resolution":{"observed_at":"2026-08-07T04:24:05.256164Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-07T04:24:01.871204Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.871204Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:07a4c5122605ab5f54a44e5e6bb3334206d1b4ac4959f479002af3bb6777e1b3","observation_id":"f011c757-b625-41f1-bb60-b830d868ee44","resolution":{"observed_at":"2026-08-07T04:24:01.871204Z","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-07T04:24:05.005070Z","title":null,"venue":null,"work_id":"d686f77e-980f-4131-84a3-c6618adf0f50","year":2021},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.964299Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:04ee6500c59e38b2627a21283484f1517e5538e2fbc51fb34aaec9f68180e3a5","observation_id":"fe7e531b-9f6c-454b-b2ce-0d280933f93d","resolution":{"observed_at":"2026-08-07T04:24:05.069974Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:24:04.852199Z","title":"Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen - Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen","venue":null,"work_id":"c04c35c2-d7cc-485e-a462-4ff447a64e38","year":2022},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.027730Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:bd49159231c01355192a81f5e9a979cc8a2a456f7f949fef9958f9da471903c0","observation_id":"5501d904-6679-4e88-8817-20592503c0dd","resolution":{"observed_at":"2026-08-07T04:24:04.919480Z","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":"2401.04925","last_updated":"2024-06-22T08:18:48Z","snapshot_observed_at":"2026-07-06T17:13:33.874642Z","submitted_at":"2024-01-10T04:37:38Z","title":"The Impact of Reasoning Step Length on Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04925","snapshot_observed_at":"2026-08-07T04:24:02.102954Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.102954Z"},"links":{"cited_paper":"/paper/2401.04925","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:d80fa2e1068ef0df71da57aeaf4eb73f88b386de049783adb86cb5765f421289","observation_id":"3750dc38-2bfd-4a39-a36a-020960dc4387","resolution":{"observed_at":"2026-08-07T04:24:02.102954Z","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-07T04:24:02.191167Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.191167Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:6a9617fe29bd1653f8fa432b7090b96d263e49a5255b43365ec533ffdc20db33","observation_id":"6bf73b08-5a11-4830-8323-5dd4b1e1cdb6","resolution":{"observed_at":"2026-08-07T04:24:02.191167Z","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-07T17:34:59.382893Z","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-07T04:24:02.269001Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.269001Z"},"links":{"cited_paper":"/paper/2503.01141","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:64b4785e196bb23a68b3f83f0e6e814250a9dce3a4f8e2cb0b8bc5d907a22d2a","observation_id":"ba57bb8a-0c5c-4241-93b9-14de7bab1e93","resolution":{"observed_at":"2026-08-07T04:24:02.269001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.05366","last_updated":"2025-01-09T16:48:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-09T16:48:17Z","title":"Search-o1: Agentic Search-Enhanced Large Reasoning Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.05366","snapshot_observed_at":"2026-08-07T04:24:02.371341Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.371341Z"},"links":{"cited_paper":"/paper/2501.05366","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:d200b5d7485ebb87a8b8be57de310947bc9eeea937bcc279ed9c7dd563ecb336","observation_id":"314ff115-b3cb-4b0a-ba0e-2c1b8acb06ca","resolution":{"observed_at":"2026-08-07T04:24:02.371341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.06657","last_updated":"2024-01-23T23:16:11Z","snapshot_observed_at":"2026-07-31T03:53:01.450978Z","submitted_at":"2023-09-13T01:07:25Z","title":"Statistical Rejection Sampling Improves Preference Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.06657","snapshot_observed_at":"2026-08-07T04:24:02.421271Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.421271Z"},"links":{"cited_paper":"/paper/2309.06657","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:0598244fce4655815e63ca342be0e904b30a8118f1ffb7d68700303d5adba2a0","observation_id":"4c055b56-2701-4ae8-8fbb-2fc9eba799b1","resolution":{"observed_at":"2026-08-07T04:24:02.421271Z","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-07T04:24:04.684729Z","title":null,"venue":null,"work_id":"39bd37d4-0642-4b60-9bce-c8e56285403c","year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.489694Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:0e15198dfc0a785607470e006e2043a846233d253d348e66dd1417b96576bed1","observation_id":"fb5cb2b4-fc13-40e1-a1e6-e3e33cae6a07","resolution":{"observed_at":"2026-08-07T04:24:04.732686Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08747","last_updated":"2025-01-05T04:09:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-08-17T02:53:23Z","title":"An Empirical Study of Catastrophic Forgetting in Large Language Models During Continual Fine-tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.08747","snapshot_observed_at":"2026-08-07T04:24:02.545702Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.545702Z"},"links":{"cited_paper":"/paper/2308.08747","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:0d990c02ce6e31c83c155179ad00e720992a0fa750526790cc7e772a4821e72c","observation_id":"ffdbcf01-12bc-429c-9fd0-0d23f918e9c8","resolution":{"observed_at":"2026-08-07T04:24:02.545702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.09413","last_updated":"2024-12-22T10:44:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-12T16:20:36Z","title":"Imitate, Explore, and Self-Improve: A Reproduction Report on Slow-thinking Reasoning Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.09413","snapshot_observed_at":"2026-08-07T04:24:02.607794Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.607794Z"},"links":{"cited_paper":"/paper/2412.09413","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:a2105e691e2d8f465b0bf41b802319a8c1d694b5fbdad91f7f79f76a78fe463e","observation_id":"aed5cf32-2f4c-4e9c-a25a-9e81c25584a5","resolution":{"observed_at":"2026-08-07T04:24:02.607794Z","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-07T04:24:02.680283Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.680283Z"},"links":{"cited_paper":"/paper/2501.19393","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:c4bda715d2546c587b55c49f939ea737e72449e9778241b2f60fb18f901e61ac","observation_id":"fee36d18-fa3d-4800-97c7-7a84c00bcc8f","resolution":{"observed_at":"2026-08-07T04:24:02.680283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T04:24:02.731062Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.731062Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:136dbd85900848a3e4e0de1bf9dad806a835e322e9ad3a8fba7b5da39519e076","observation_id":"9a670ecf-dc91-42d6-865e-3d62d972189e","resolution":{"observed_at":"2026-08-07T04:24:02.731062Z","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-07T04:24:04.535035Z","title":"Manning, Stefano Ermon, and Chelsea Finn","venue":null,"work_id":"f1402896-b08f-4ab0-bbaf-96738b4e2f40","year":2023},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.783764Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:7bb6045fa3d1c0a4854dca6bb926e78a940f86ca9baff249245229dbc50aaa75","observation_id":"178eb223-ce63-4f13-8bf7-1b01694aeee0","resolution":{"observed_at":"2026-08-07T04:24:04.573506Z","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-07T04:24:02.825216Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.825216Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:a10e66aab60e6f0a62d8387e99929f7ea6677410c446f1031f336b9d216ea0b8","observation_id":"d5857fad-8f67-4e61-8da7-386a809794a3","resolution":{"observed_at":"2026-08-07T04:24:02.825216Z","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-07T04:24:04.344848Z","title":null,"venue":null,"work_id":"a0b594a5-c608-4df6-944b-206d2cf5379a","year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.858228Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:6cfe4fec73f8eafd0b38dbde318479c968c6394df18528804d45d7f9779a83b8","observation_id":"3a0e35a4-9244-4757-95a2-62b8940ee970","resolution":{"observed_at":"2026-08-07T04:24:04.392950Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-07T04:24:02.927593Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.927593Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:7ce2e1556e03c85e31368d20cd27de910c497af65326442e7ea10a2fa6139bca","observation_id":"6ea0fa13-aade-43d9-9070-26c983e3a6ae","resolution":{"observed_at":"2026-08-07T04:24:02.927593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-07T04:24:02.970521Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:02.970521Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:45e269693a5a0bc42782d09c6e36f1c536d2f1be8d7607b93131cf3b06b73b3b","observation_id":"c616a405-5f18-42e8-8f10-c5c04c36e468","resolution":{"observed_at":"2026-08-07T04:24:02.970521Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-07T04:24:03.025228Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.025228Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:016af3a2ce8501bd994cd9d63db8dfdbbae3344c11d431618774b71b899bffbf","observation_id":"6048d337-99a9-4d2e-8024-d4ff69da1082","resolution":{"observed_at":"2026-08-07T04:24:03.025228Z","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-07T04:24:03.079588Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.079588Z"},"links":{"cited_paper":"/paper/2503.16419","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:42cd98f02355128c1e257ad9862b39b9dd23b1c91ef8547bbe21a9984fef07ca","observation_id":"e6d33c28-cd8c-4a02-b06a-252d6ae4fe64","resolution":{"observed_at":"2026-08-07T04:24:03.079588Z","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-07T04:24:03.115259Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.115259Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:f39cbe5bfc891893bad6624d8fcb4987a24ca0311b1a5c6a25e207c55c5af823","observation_id":"5b20b30a-4686-4524-8fa6-7861393d7cf2","resolution":{"observed_at":"2026-08-07T04:24:03.115259Z","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-07T04:24:03.180660Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.180660Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:1ca564e766196288042ee47bf2009e3a7f9be08f7ce4320535abf4f2f0418537","observation_id":"f8b9a322-79dc-4824-92e7-a0242ed02690","resolution":{"observed_at":"2026-08-07T04:24:03.180660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15335","last_updated":"2025-04-12T02:22:25Z","snapshot_observed_at":"2026-08-07T17:59:13.832548Z","submitted_at":"2025-02-21T09:39:27Z","title":"Stepwise Informativeness Search for Efficient and Effective LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15335","snapshot_observed_at":"2026-08-07T04:24:03.223176Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.223176Z"},"links":{"cited_paper":"/paper/2502.15335","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:6ccb7f3fcd76db5e0ddef2056abd1a65657c33cb3ad4a2c5c3dbab90242a9219","observation_id":"e50c0efe-b777-4e95-8282-549b71725a2d","resolution":{"observed_at":"2026-08-07T04:24:03.223176Z","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-07T04:24:04.266002Z","title":"Chi, Quoc V","venue":null,"work_id":"00b9f3ea-cc12-46f8-899f-066add961e44","year":2022},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.264778Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:7e827f9d4068c5f983baca1e0b05e5e03674167f51508268f5580f63ee3b0f0b","observation_id":"4f9daa93-d461-4eae-a47f-79353d10285d","resolution":{"observed_at":"2026-08-07T04:24:04.285467Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:24:04.062406Z","title":null,"venue":null,"work_id":"912e7a01-0ba5-4fba-aa82-51aa2d1e7da5","year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.306237Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:82fd9dd5bbac814cc5746246d6b06cf815c706eab4587cd90affff57380ac6d2","observation_id":"a036fb45-bfb3-444b-a741-e8a060b5fdc6","resolution":{"observed_at":"2026-08-07T04:24:04.187564Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18600","last_updated":"2025-03-03T17:08:21Z","snapshot_observed_at":"2026-08-07T17:49:06.764625Z","submitted_at":"2025-02-25T19:36:06Z","title":"Chain of Draft: Thinking Faster by Writing Less","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18600","snapshot_observed_at":"2026-08-07T04:24:03.355899Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.355899Z"},"links":{"cited_paper":"/paper/2502.18600","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:fc1c14a470159b99c118874f7d730df1f0e7c1fbb8a649d824441d43177df13c","observation_id":"4f56cec3-8647-4a4b-971d-23051d6b58d5","resolution":{"observed_at":"2026-08-07T04:24:03.355899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-07T04:24:03.420787Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.420787Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:c198a227444d68924df755acc5e536568a44a566f16fd7553f60e539be791d05","observation_id":"fe912320-4d28-4a1a-aeb6-06ddf9e965bd","resolution":{"observed_at":"2026-08-07T04:24:03.420787Z","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-07T04:24:03.469910Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.469910Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:099140822cf4e1a0a33e3fb77e147772347f205d7d33ee0361ed8219fac5afc6","observation_id":"c1c8df38-0e13-4ce2-bede-c837bc669fd3","resolution":{"observed_at":"2026-08-07T04:24:03.469910Z","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-07T04:24:03.512395Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.512395Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:0a6e2455d70074037146e499acb96810571b0df28f2513fceefff975b0cf12f0","observation_id":"bb3dafcc-d682-44ba-874c-a37b49243a37","resolution":{"observed_at":"2026-08-07T04:24:03.512395Z","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-07T04:24:03.563539Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:03.563539Z"},"links":{"citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:c820819f43cffb396b42385e88dc507d51b05d8f870ab4debc5804fce5739650","observation_id":"ab50e0db-9787-4f4f-b8b1-3c25ef1fbb95","resolution":{"observed_at":"2026-08-07T04:24:03.563539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T16:25:30.151416Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":36,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":39},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 3 inbound Pith citation observations for arXiv:2506.10822."}