{"as_of":"2026-08-12T14:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:26c6ff5c308dd6958bfa92945981e833b1d6068e403af57aeed2f5f62cb4123d","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:12:32.899552Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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:54:18.045957Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T17:07:02.637116Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.19788","snapshot_observed_at":"2026-08-06T17:54:18.045957Z","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-11T20:23:03.012064Z","submitted_at":"2025-07-13T14:51:59Z","title":"Towards Concise and Adaptive Thinking in Large Reasoning Models: A Survey","version":1},"reference_index":236,"source":"arxiv_source","source_observed_at":"2026-08-06T17:54:18.045957Z"},"links":{"cited_paper":"/paper/2505.19788","citing_paper":"/paper/2507.09662"},"observation_digest":"sha256:77c81e5a2e34d8ae23363a09d5728d232616df6dd31c8b445164ed8a0a38ce51","observation_id":"8c010de4-3ff6-4ced-8cac-d9585a51b553","resolution":{"observed_at":"2026-08-06T17:54:18.045957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"cited_work":{"arxiv_id":"2505.19788","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.19788","snapshot_observed_at":"2026-08-06T17:07:02.637116Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","venue":"cs.AI","work_id":"c4584192-057e-4110-a44b-c96494460498","year":2025},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-10T23:00:33.217022Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:02.442534Z"},"links":{"cited_paper":"/paper/2505.19788","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:6ae49fa9f41153b593c0ac998434ff0f3c419fa9fa80d6c5e762f72147d6cf23","observation_id":"6f0be876-e02f-4e36-a750-4c5dbe3c5d05","resolution":{"observed_at":"2026-08-06T17:07:02.699059Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.19788/citation-record","integrity":"/paper/2505.19788/integrity","json":"/paper/2505.19788/citation-record.json","paper":"/paper/2505.19788"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:12:29.514995Z","title":"L1: Controlling how long a reasoning model thinks with reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:29.514995Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:81061e5cde9b2aea6434de88e1e3b073940d4150131193d1ed2619ac08ace4f9","observation_id":"e0a331ee-632e-4cf2-8031-9ab96442c536","resolution":{"observed_at":"2026-08-07T14:12:29.514995Z","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-07T14:12:35.522904Z","title":"Over-reasoning and redundant calculation of large language models, 2024","venue":null,"work_id":"195619a2-987b-405d-a956-2c427f734bbe","year":2024},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:29.565105Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:72c59e1dc40161d1f9eafbfb051ec2cf9e36d94b65719731e6fc22c1d005cd70","observation_id":"ddd539b4-d582-42b0-8b6d-fa05fc24dc37","resolution":{"observed_at":"2026-08-07T14:12:35.606888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:12:29.641120Z","title":"Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168, 2021","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:29.641120Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:03e5102851a62b503e041edb0051d7dda612fbcae390fe4c9c9f24cc480b83bd","observation_id":"5ca0450c-b7fa-4f02-90a4-905305722bc5","resolution":{"observed_at":"2026-08-07T14:12:29.641120Z","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-07T14:12:29.713147Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:29.713147Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:282f2c5cafc6c0177321cbabbb27fc17abddb00d489026dc637880efa755d78d","observation_id":"3c3ba1ac-fe97-400a-80ac-b8f4957e875f","resolution":{"observed_at":"2026-08-07T14:12:29.713147Z","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-07T14:12:29.801053Z","title":"Open r1: A fully open reproduction of deepseek-r1, January 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:29.801053Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:c0bbd7f62e0294f525fbd3c574e0427eb9995cf3b8df2f9738a7e1988bd339fe","observation_id":"31ea014f-89e4-4b4e-b413-d067f1da8bc0","resolution":{"observed_at":"2026-08-07T14:12:29.801053Z","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-07T14:12:29.860202Z","title":"Reasoning without self-doubt: More efficient chain-of-thought through certainty probing","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:29.860202Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:e07b0b8abc22e8ae1be09ad0577de7d9efb75640b2e392a948f53835a3fe135b","observation_id":"2c4cd343-ca6c-424b-8e63-767b789ad927","resolution":{"observed_at":"2026-08-07T14:12:29.860202Z","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-07T14:12:29.928158Z","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":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:29.928158Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:e2c0b1f9a57187728628ec993083dc8fcbb51c055c89b6ff1e3e2aeddd4a251e","observation_id":"aa9d6918-4f78-43b7-964c-a872e584770c","resolution":{"observed_at":"2026-08-07T14:12:29.928158Z","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-07T14:12:35.412890Z","title":"Training large language model to reason in a continuous latent space, 2025","venue":null,"work_id":"efd3fc6e-2015-47b7-8f98-753bbdb9c85d","year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:29.991394Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:6fc0919d8388e3f94ef4329f24d388a3819caa73a966d43d2198b43583a8d39e","observation_id":"41fe10c7-68af-40d7-b826-769b442c0109","resolution":{"observed_at":"2026-08-07T14:12:35.439917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:12:35.289229Z","title":"Thinkprune: Pruning long chain-of-thought of llms via reinforcement learning, 2025","venue":null,"work_id":"a9258b58-4904-4e24-962d-020e656c7057","year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.050827Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:82886950f9270dcc572a963dd58b40fedbe16cd86f403b99c63ed70de6c3f67a","observation_id":"114b0a90-1918-4543-8726-e7fa3f380f87","resolution":{"observed_at":"2026-08-07T14:12:35.352286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-07T14:12:30.106828Z","title":"Openai o1 system card.arXiv preprint arXiv:2412.16720, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.106828Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:88ccb275f67497993d0771113a26a1eebf57fbfae485714c9b4a23bec5d8427d","observation_id":"a5133232-c993-4e70-a299-d6dc7c81a23f","resolution":{"observed_at":"2026-08-07T14:12:30.106828Z","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-07T14:12:35.139853Z","title":"Prompt-based length controlled generation with multiple control types, 2024","venue":null,"work_id":"26b4a444-291d-48ba-aebd-61429d649642","year":2024},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.152626Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:6a00308790c3dbc7fd77512d85c2fa132ce3e071331ab87be898a710a355b542","observation_id":"687010e1-7ac8-47e1-bd0f-5f334cd28baf","resolution":{"observed_at":"2026-08-07T14:12:35.198217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:12:30.193686Z","title":"Search-r1: Training llms to reason and leverage search engines with reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.193686Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:ef00c075a15f743235f179d2f4ecb33a97c421aa16d21fe38094416e0140d54e","observation_id":"e2cd6815-9900-467b-bc47-033ec3c3883a","resolution":{"observed_at":"2026-08-07T14:12:30.193686Z","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-07T14:12:30.232422Z","title":"C3ot: Generating shorter chain-of- thought without compromising effectiveness","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.232422Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:097b1f2d77c11e95b924faf9153a3b1524ca30489c14c825ec10f635247de551","observation_id":"8207185d-d5cc-4040-924e-3c7d417bd5e0","resolution":{"observed_at":"2026-08-07T14:12:30.232422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20050","last_updated":"2023-05-31T17:24:00Z","snapshot_observed_at":"2026-08-11T17:22:43.545531Z","submitted_at":"2023-05-31T17:24:00Z","title":"Let's Verify Step by Step","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.20050","snapshot_observed_at":"2026-08-07T14:12:30.292682Z","title":"Let’s verify step by step.arXiv preprint arXiv:2305.20050, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.292682Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:ee3d39cceb2b703760189c362d7eb0d16525f1e6131b4cfa5019a10bd0cc07b8","observation_id":"04ea7c10-3d59-4c46-bed0-39db2683c62d","resolution":{"observed_at":"2026-08-07T14:12:30.292682Z","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-07T14:12:30.366374Z","title":"Cppo: Accelerating the training of group relative policy optimization-based reasoning models.arXiv preprint arXiv:2503.22342, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.366374Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:ee0f5bd0bc732cbcfecda74eeac281eee8f92e042eb37a74fef1b8c7c746dea1","observation_id":"38d1fcf7-8d8b-4883-afc0-469ec6d993e0","resolution":{"observed_at":"2026-08-07T14:12:30.366374Z","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-07T14:12:34.968986Z","title":"Understanding r1-zero-like training: A critical perspective, 2025","venue":null,"work_id":"e3130ed1-dae2-4946-b5ff-1aa1ed55134d","year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.475528Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:3037fcd2dcb08ae6ea8ba2c793923385a3471937c963e86052e5ea181d04a2a6","observation_id":"487dccce-b2cc-49ea-868d-67512d1208d6","resolution":{"observed_at":"2026-08-07T14:12:35.035804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:12:30.606496Z","title":"O1-pruner: Length-harmonizing fine-tuning for o1-like reasoning pruning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.606496Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:daca45e44882da57d34a620b7f12cb90ba0421d0c100c1a3f5402ef499d107e4","observation_id":"ed761fd6-d08e-4fa9-8800-0d6c8e05f0a1","resolution":{"observed_at":"2026-08-07T14:12:30.606496Z","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-07T14:12:34.787327Z","title":"American invitational mathematics examination - aime 2024, 2024","venue":null,"work_id":"b5591976-1859-4923-93ab-9fe6f3a71d90","year":2024},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.735780Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:39bf749ad229556caba088c408746478098007963fb5ff9e579b533cef1c8764","observation_id":"6dc71f4e-537d-4ec9-9a75-9750fda16929","resolution":{"observed_at":"2026-08-07T14:12:34.882154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:12:34.636748Z","title":"Australian mathematics competition - amc 2023, 2023","venue":null,"work_id":"1624c9af-bda4-435e-b82e-06cb7b47543e","year":2023},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.826658Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:a8e135d297a4fb6e05bcf84e78f79c0e3f94c0721a983154b0ae04153aa0cf06","observation_id":"5aff3b7f-3b72-448e-8b6d-04a9e5ef77a7","resolution":{"observed_at":"2026-08-07T14:12:34.701619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:12:30.964234Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:30.964234Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:8d513e1a659bf64860f085ae9d3d634cbe7b8211c88032ca68f391196f24de0b","observation_id":"73599af7-4078-4a6e-a8c9-c4f3e82002c1","resolution":{"observed_at":"2026-08-07T14:12:30.964234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.07891","last_updated":"2025-05-16T19:27:32Z","snapshot_observed_at":"2026-08-10T15:15:50.046842Z","submitted_at":"2025-04-10T16:05:19Z","title":"SpecReason: Fast and Accurate Inference-Time Compute via Speculative Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.07891","snapshot_observed_at":"2026-08-07T14:12:31.069320Z","title":"Specrea- son: Fast and accurate inference-time compute via speculative reasoning.arXiv preprint arXiv:2504.07891, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:31.069320Z"},"links":{"cited_paper":"/paper/2504.07891","citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:db329be400df3eeb19700bf8b651165ff49bca7e92e97042d775d8b6c2b6a934","observation_id":"c630499e-8b36-4bb6-86f1-25153b2fc253","resolution":{"observed_at":"2026-08-07T14:12:31.069320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12022","last_updated":"2023-11-20T18:57:34Z","snapshot_observed_at":"2026-08-10T12:02:35.919497Z","submitted_at":"2023-11-20T18:57:34Z","title":"GPQA: A Graduate-Level Google-Proof Q&A Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12022","snapshot_observed_at":"2026-08-07T14:12:31.103568Z","title":"Gpqa: A graduate-level google-proof q&a benchmark.arXiv preprint arXiv:2311.12022, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:31.103568Z"},"links":{"cited_paper":"/paper/2311.12022","citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:d79aea64896c2bb772433a8c6adf7d28d9a67e31150a9c6fee367c9608ff6e78","observation_id":"454f95da-1801-4159-a0b9-23de49abaf15","resolution":{"observed_at":"2026-08-07T14:12:31.103568Z","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-07T14:12:31.283233Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:31.283233Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:57e4a8ec85a5dc2e06c2069fceea4cc08e547c7e73e5bd3f4ca28c1d0af1764e","observation_id":"dfabd07d-9050-4580-9d97-2a0d701801ee","resolution":{"observed_at":"2026-08-07T14:12:31.283233Z","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-07T14:12:34.436577Z","title":"Hawkeye:efficient reasoning with model collaboration, 2025","venue":null,"work_id":"8ef2932c-2f9a-4718-b563-ef55c1a4a81d","year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:31.438257Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:f58fc89344876ec74279e7b335753ea8bdf9c4f69a46c576c429b8e1382df9f1","observation_id":"63d40254-b352-4fb0-ac92-e9a845d282fa","resolution":{"observed_at":"2026-08-07T14:12:34.526430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:12:34.237842Z","title":"Efficient reasoning with hidden thinking, 2025","venue":null,"work_id":"b96c7afa-de00-4d45-bb5d-91c222589069","year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:31.644247Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:9bde3501a8bc6cc68e92351f72c9d787596a1f3acbd290c50fbbb280e4e1e97d","observation_id":"3d079757-0d25-4482-a15e-0b3ea0ae0dcf","resolution":{"observed_at":"2026-08-07T14:12:34.315171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T14:12:31.761955Z","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":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:31.761955Z"},"links":{"cited_paper":"/paper/2409.19256","citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:bdae10aca79146a6b9e4e6b89225b5bbc321fe121d213328dbce4afe8290d019","observation_id":"700fa3e5-f88c-4f15-9e73-6d070a2c2ef0","resolution":{"observed_at":"2026-08-07T14:12:31.761955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05592","last_updated":"2025-03-18T08:32:24Z","snapshot_observed_at":"2026-08-09T05:07:17.305244Z","submitted_at":"2025-03-07T17:14:44Z","title":"R1-Searcher: Incentivizing the Search Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.05592","snapshot_observed_at":"2026-08-07T14:12:31.861612Z","title":"R1-searcher: Incentivizing the search capability in llms via reinforcement learning.arXiv preprint arXiv:2503.05592, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:31.861612Z"},"links":{"cited_paper":"/paper/2503.05592","citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:9b9b7c98fbd73e301af67f166c99380fd069582b3751ab23ad4bd2508f4a687b","observation_id":"da4e7b12-b227-4777-bb24-9b86673df2df","resolution":{"observed_at":"2026-08-07T14:12:31.861612Z","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-07T14:12:34.065297Z","title":"Token assorted: Mixing latent and text tokens for improved language model reasoning, 2025","venue":null,"work_id":"7e6eea0e-60d3-492c-8e38-a9fca88ff052","year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:31.958955Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:e6275c47fce88c104ab432f288d361e6d1a5ec1eb11b4b5625ab4b5da3360350","observation_id":"0d39ce47-01b8-4af2-8c8d-42dc87e8b213","resolution":{"observed_at":"2026-08-07T14:12:34.153467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12599","last_updated":"2025-06-03T02:14:54Z","snapshot_observed_at":"2026-08-11T01:31:26.242281Z","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-07T14:12:32.158941Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:32.158941Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:8614456baceee8583067ca6da5544af7fb593cfd2e1180e2f5cc0535f1a7f3a5","observation_id":"8a2b7add-7c0e-497a-9db2-f065b2d3e526","resolution":{"observed_at":"2026-08-07T14:12:32.158941Z","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-07T14:12:32.288045Z","title":"Qwen3, April 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:32.288045Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:1df242b3f6142194ad54f0b910da701d7b21c277bbb6f27e6588ef8c5e5a1007","observation_id":"a69fcfd9-dddf-450f-bf1f-10261598e2fc","resolution":{"observed_at":"2026-08-07T14:12:32.288045Z","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-07T14:12:33.885767Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":"10428fd3-b96b-48f6-85e9-eff04d0bc9a2","year":2022},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:32.377296Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:0464d0cbffd77c00554dc84a747e461799f786883624c4735eefa7a0f3d59384","observation_id":"dba0e144-e61d-41ff-867b-a5148cb775c1","resolution":{"observed_at":"2026-08-07T14:12:33.960197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:12:32.465022Z","title":"Tokenskip: Controllable chain-of-thought compression in llms.arXiv preprint arXiv:2502.12067, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:32.465022Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:8196413d9d7874eaba57074f9dcf37fcea50ea70eac0e843b569653318c7a400","observation_id":"556aeb49-e49f-4ae8-b0ff-967ecb273c6a","resolution":{"observed_at":"2026-08-07T14:12:32.465022Z","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-07T14:12:33.679619Z","title":"Dynamic early exit in reasoning models, 2025","venue":null,"work_id":"873ac262-ac87-490b-9b0b-4bc6820f26d0","year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:32.541663Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:c674401c10d8022f210adc023039c9104889349555d6e4268dc255442c0de291","observation_id":"53b57f70-e16b-48e7-a8a2-92db9808c3d1","resolution":{"observed_at":"2026-08-07T14:12:33.757547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:12:32.643374Z","title":"Towards thinking-optimal scaling of test-time compute for llm reasoning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:32.643374Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:5317cc2b794115c16176c67623e1271201f1233b5f6d61ae8827963eab5b3065","observation_id":"91dbd108-9885-4658-8acb-18ee4b9865f3","resolution":{"observed_at":"2026-08-07T14:12:32.643374Z","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-07T14:12:32.708344Z","title":"Dapo: An open-source llm reinforcement learning system at scale, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:32.708344Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:fdf380feb6d8319acb02cab3befc391304a1eadd4350590e8c88048f9550636e","observation_id":"31e79bc6-00a2-4474-9581-e9317db60029","resolution":{"observed_at":"2026-08-07T14:12:32.708344Z","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-07T14:12:33.429738Z","title":"Draft & verify: Lossless large language model acceleration via self-speculative decoding","venue":null,"work_id":"1aff4801-91db-42a1-8748-86c7387ff300","year":2024},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:32.822153Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:a83f70ab2441171881c6d8282f9d72de90635a5447cecf364f4ac67536f8aacc","observation_id":"05ef553f-674e-448b-8698-506c525bf52c","resolution":{"observed_at":"2026-08-07T14:12:33.527687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:12:33.218406Z","title":"[split]” between every two consecutive Reasoning Rounds. –- Problem: {question} Solution: {prediction} –- Please give the solution with “[split]","venue":null,"work_id":"eb51c2e7-caa7-4e02-9c56-46d75534362f","year":2024},"citing_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:32.899552Z"},"links":{"citing_paper":"/paper/2505.19788"},"observation_digest":"sha256:6e912807ca6a1bb3ebeb278c748fd45941954729744fe9a6ffe535c7f05dd9fa","observation_id":"ea770e5b-2c02-4cc0-af46-4cf0993d2554","resolution":{"observed_at":"2026-08-07T14:12:33.299570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-12T10:28:41.127509Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 2 inbound Pith citation observations for arXiv:2505.19788."}