{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ICUSYCBXUG5D7CNS3HINYXL4DV","short_pith_number":"pith:ICUSYCBX","schema_version":"1.0","canonical_sha256":"40a92c0837a1ba3f89b2d9d0dc5d7c1d59fd4770976a9cc42d74c16609ff13a6","source":{"kind":"arxiv","id":"2602.09574","version":2},"attestation_state":"computed","paper":{"title":"Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Daisuke Oba, Naoaki Okazaki, Sora Miyamoto","submitted_at":"2026-02-10T09:23:26Z","abstract_excerpt":"Tree-search decoding is an effective form of test-time scaling for large language models (LLMs), but real-world deployment often imposes a fixed per-query token budget that varies across settings. Existing tree-search policies are largely budget-agnostic, treating the budget merely as a termination condition, thereby risking late-stage over-branching or premature termination. We propose Budget-Guided MCTS (BG-MCTS), a tree-search decoding algorithm that aligns its search policy with the remaining token budget: it starts with broad exploration, then prioritizes refinement and answer completion "},"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":"2602.09574","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-02-10T09:23:26Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"5c029e898bce53c128749a096b0e91c7f52045b74dc056b4fb82407117c4d279","abstract_canon_sha256":"83c268bf61eac18994c70b3d018f85f989f4f2af5685405fd90897c07adb01e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:20.016547Z","signature_b64":"o+OmruEZTj17i4+Z9LTFHMsftOLVCJlao4lx1Vefudp9bAX/VDVy1kTZZsnjwUWbQQCy9xw/ACaLfIFofTNCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40a92c0837a1ba3f89b2d9d0dc5d7c1d59fd4770976a9cc42d74c16609ff13a6","last_reissued_at":"2026-06-05T01:15:20.016093Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:20.016093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Daisuke Oba, Naoaki Okazaki, Sora Miyamoto","submitted_at":"2026-02-10T09:23:26Z","abstract_excerpt":"Tree-search decoding is an effective form of test-time scaling for large language models (LLMs), but real-world deployment often imposes a fixed per-query token budget that varies across settings. Existing tree-search policies are largely budget-agnostic, treating the budget merely as a termination condition, thereby risking late-stage over-branching or premature termination. We propose Budget-Guided MCTS (BG-MCTS), a tree-search decoding algorithm that aligns its search policy with the remaining token budget: it starts with broad exploration, then prioritizes refinement and answer completion "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.09574","kind":"arxiv","version":2},"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/2602.09574/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":"2602.09574","created_at":"2026-06-05T01:15:20.016145+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.09574v2","created_at":"2026-06-05T01:15:20.016145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.09574","created_at":"2026-06-05T01:15:20.016145+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICUSYCBXUG5D","created_at":"2026-06-05T01:15:20.016145+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICUSYCBXUG5D7CNS","created_at":"2026-06-05T01:15:20.016145+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICUSYCBX","created_at":"2026-06-05T01:15:20.016145+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.20599","citing_title":"Beyond Fixed Budgets: Characterizing the Inelasticity and Limitations of Tree-of-Thought Reasoning Strategies","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2605.29268","citing_title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ICUSYCBXUG5D7CNS3HINYXL4DV","json":"https://pith.science/pith/ICUSYCBXUG5D7CNS3HINYXL4DV.json","graph_json":"https://pith.science/api/pith-number/ICUSYCBXUG5D7CNS3HINYXL4DV/graph.json","events_json":"https://pith.science/api/pith-number/ICUSYCBXUG5D7CNS3HINYXL4DV/events.json","paper":"https://pith.science/paper/ICUSYCBX"},"agent_actions":{"view_html":"https://pith.science/pith/ICUSYCBXUG5D7CNS3HINYXL4DV","download_json":"https://pith.science/pith/ICUSYCBXUG5D7CNS3HINYXL4DV.json","view_paper":"https://pith.science/paper/ICUSYCBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.09574&json=true","fetch_graph":"https://pith.science/api/pith-number/ICUSYCBXUG5D7CNS3HINYXL4DV/graph.json","fetch_events":"https://pith.science/api/pith-number/ICUSYCBXUG5D7CNS3HINYXL4DV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICUSYCBXUG5D7CNS3HINYXL4DV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICUSYCBXUG5D7CNS3HINYXL4DV/action/storage_attestation","attest_author":"https://pith.science/pith/ICUSYCBXUG5D7CNS3HINYXL4DV/action/author_attestation","sign_citation":"https://pith.science/pith/ICUSYCBXUG5D7CNS3HINYXL4DV/action/citation_signature","submit_replication":"https://pith.science/pith/ICUSYCBXUG5D7CNS3HINYXL4DV/action/replication_record"}},"created_at":"2026-06-05T01:15:20.016145+00:00","updated_at":"2026-06-05T01:15:20.016145+00:00"}