{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2E4OSVMK35ANXKSESNEER26JM7","short_pith_number":"pith:2E4OSVMK","schema_version":"1.0","canonical_sha256":"d138e9558adf40dbaa44934848ebc967d382a36350d60ba8308a96f048755f6c","source":{"kind":"arxiv","id":"2412.19707","version":1},"attestation_state":"computed","paper":{"title":"Toward Adaptive Reasoning in Large Language Models with Thought Rollback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Baochun Li, Sijia Chen","submitted_at":"2024-12-27T16:02:34Z","abstract_excerpt":"Large language models (LLMs) have been routinely used to solve various tasks using step-by-step reasoning. However, the structure of intermediate reasoning steps, or thoughts, is rigid and unidirectional, such as chains, trees, or acyclic-directed graphs. Consequently, the resulting inflexible and forward-only reasoning may not address challenging tasks and fail when the LLM frequently gives false responses, i.e., ``hallucinations''. This paper proposes a new reasoning framework, called Thought Rollback (TR), allowing LLMs to adaptively build thought structure while maintaining effective reaso"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.19707","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-12-27T16:02:34Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"ee03dd39097fd37bcacc0a3ae9ab28a57e5abf1df2d96b5af9afed46152a04eb","abstract_canon_sha256":"7dd213290114e97dc3bbf54a6ea3d403907081c164d0455a8cee3e53f2dc2ff6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:39.937772Z","signature_b64":"RNXMdjbFexLxGqUx+riALydznO+SeAi4yGmG1gUi9kKxklzuxNFI9C1gNVz7A1WcU5xdQjfltqWHikLVVD60Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d138e9558adf40dbaa44934848ebc967d382a36350d60ba8308a96f048755f6c","last_reissued_at":"2026-07-05T09:54:39.937343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:39.937343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward Adaptive Reasoning in Large Language Models with Thought Rollback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Baochun Li, Sijia Chen","submitted_at":"2024-12-27T16:02:34Z","abstract_excerpt":"Large language models (LLMs) have been routinely used to solve various tasks using step-by-step reasoning. However, the structure of intermediate reasoning steps, or thoughts, is rigid and unidirectional, such as chains, trees, or acyclic-directed graphs. Consequently, the resulting inflexible and forward-only reasoning may not address challenging tasks and fail when the LLM frequently gives false responses, i.e., ``hallucinations''. This paper proposes a new reasoning framework, called Thought Rollback (TR), allowing LLMs to adaptively build thought structure while maintaining effective reaso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19707","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.19707/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.19707","created_at":"2026-07-05T09:54:39.937400+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.19707v1","created_at":"2026-07-05T09:54:39.937400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19707","created_at":"2026-07-05T09:54:39.937400+00:00"},{"alias_kind":"pith_short_12","alias_value":"2E4OSVMK35AN","created_at":"2026-07-05T09:54:39.937400+00:00"},{"alias_kind":"pith_short_16","alias_value":"2E4OSVMK35ANXKSE","created_at":"2026-07-05T09:54:39.937400+00:00"},{"alias_kind":"pith_short_8","alias_value":"2E4OSVMK","created_at":"2026-07-05T09:54:39.937400+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31492","citing_title":"LinTree: Improving LLM Reasoning with Explicitly Structured Search Histories","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2E4OSVMK35ANXKSESNEER26JM7","json":"https://pith.science/pith/2E4OSVMK35ANXKSESNEER26JM7.json","graph_json":"https://pith.science/api/pith-number/2E4OSVMK35ANXKSESNEER26JM7/graph.json","events_json":"https://pith.science/api/pith-number/2E4OSVMK35ANXKSESNEER26JM7/events.json","paper":"https://pith.science/paper/2E4OSVMK"},"agent_actions":{"view_html":"https://pith.science/pith/2E4OSVMK35ANXKSESNEER26JM7","download_json":"https://pith.science/pith/2E4OSVMK35ANXKSESNEER26JM7.json","view_paper":"https://pith.science/paper/2E4OSVMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.19707&json=true","fetch_graph":"https://pith.science/api/pith-number/2E4OSVMK35ANXKSESNEER26JM7/graph.json","fetch_events":"https://pith.science/api/pith-number/2E4OSVMK35ANXKSESNEER26JM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2E4OSVMK35ANXKSESNEER26JM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2E4OSVMK35ANXKSESNEER26JM7/action/storage_attestation","attest_author":"https://pith.science/pith/2E4OSVMK35ANXKSESNEER26JM7/action/author_attestation","sign_citation":"https://pith.science/pith/2E4OSVMK35ANXKSESNEER26JM7/action/citation_signature","submit_replication":"https://pith.science/pith/2E4OSVMK35ANXKSESNEER26JM7/action/replication_record"}},"created_at":"2026-07-05T09:54:39.937400+00:00","updated_at":"2026-07-05T09:54:39.937400+00:00"}