{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3Z6EQHQVYR253PRSWLUN6MV3QW","short_pith_number":"pith:3Z6EQHQV","schema_version":"1.0","canonical_sha256":"de7c481e15c475ddbe32b2e8df32bb85a7c2e5898a04d6eb9ea62a9b33526ce1","source":{"kind":"arxiv","id":"2502.11183","version":2},"attestation_state":"computed","paper":{"title":"Don't Get Lost in the Trees: Streamlining LLM Reasoning by Overcoming Tree Search Exploration Pitfalls","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ante Wang, Dian Yu, Dong Yu, Haitao Mi, Jinsong Su, Linfeng Song, Xiangyu Duan, Ye Tian, Zhaopeng Tu","submitted_at":"2025-02-16T16:12:01Z","abstract_excerpt":"Recent advancements in tree search algorithms guided by verifiers have significantly enhanced the reasoning capabilities of large language models (LLMs), but at the cost of increased computational resources. In this work, we identify two key challenges contributing to this inefficiency: $\\textit{over-exploration}$ due to redundant states with semantically equivalent content, and $\\textit{under-exploration}$ caused by high variance in verifier scoring leading to frequent trajectory switching. To address these issues, we propose FETCH, an e$\\textbf{f}$fici$\\textbf{e}$nt $\\textbf{t}$ree sear$\\tex"},"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":"2502.11183","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-16T16:12:01Z","cross_cats_sorted":[],"title_canon_sha256":"819e42f18be099988cb3935d4f8efa9e4a8c472dbdc3a7e28d7ab84d8c0b6a07","abstract_canon_sha256":"e8a3825cbd2cbff609267837e87643302081b0ea5bef0cdded1768e899fb193c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:44.628257Z","signature_b64":"bLuhAjZM7D1iHqK3fkeAd7rIuGHYYp9lGeyQXc2IDCO43SvCY4xL9m7kTDjtbV7S6alz99eolDn8HM8acLiFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7c481e15c475ddbe32b2e8df32bb85a7c2e5898a04d6eb9ea62a9b33526ce1","last_reissued_at":"2026-07-05T10:37:44.627422Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:44.627422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Don't Get Lost in the Trees: Streamlining LLM Reasoning by Overcoming Tree Search Exploration Pitfalls","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ante Wang, Dian Yu, Dong Yu, Haitao Mi, Jinsong Su, Linfeng Song, Xiangyu Duan, Ye Tian, Zhaopeng Tu","submitted_at":"2025-02-16T16:12:01Z","abstract_excerpt":"Recent advancements in tree search algorithms guided by verifiers have significantly enhanced the reasoning capabilities of large language models (LLMs), but at the cost of increased computational resources. In this work, we identify two key challenges contributing to this inefficiency: $\\textit{over-exploration}$ due to redundant states with semantically equivalent content, and $\\textit{under-exploration}$ caused by high variance in verifier scoring leading to frequent trajectory switching. To address these issues, we propose FETCH, an e$\\textbf{f}$fici$\\textbf{e}$nt $\\textbf{t}$ree sear$\\tex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11183","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/2502.11183/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":"2502.11183","created_at":"2026-07-05T10:37:44.627520+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.11183v2","created_at":"2026-07-05T10:37:44.627520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11183","created_at":"2026-07-05T10:37:44.627520+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z6EQHQVYR25","created_at":"2026-07-05T10:37:44.627520+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z6EQHQVYR253PRS","created_at":"2026-07-05T10:37:44.627520+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z6EQHQV","created_at":"2026-07-05T10:37:44.627520+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20599","citing_title":"Beyond Fixed Budgets: Characterizing the Inelasticity and Limitations of Tree-of-Thought Reasoning Strategies","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Z6EQHQVYR253PRSWLUN6MV3QW","json":"https://pith.science/pith/3Z6EQHQVYR253PRSWLUN6MV3QW.json","graph_json":"https://pith.science/api/pith-number/3Z6EQHQVYR253PRSWLUN6MV3QW/graph.json","events_json":"https://pith.science/api/pith-number/3Z6EQHQVYR253PRSWLUN6MV3QW/events.json","paper":"https://pith.science/paper/3Z6EQHQV"},"agent_actions":{"view_html":"https://pith.science/pith/3Z6EQHQVYR253PRSWLUN6MV3QW","download_json":"https://pith.science/pith/3Z6EQHQVYR253PRSWLUN6MV3QW.json","view_paper":"https://pith.science/paper/3Z6EQHQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.11183&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z6EQHQVYR253PRSWLUN6MV3QW/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z6EQHQVYR253PRSWLUN6MV3QW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z6EQHQVYR253PRSWLUN6MV3QW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z6EQHQVYR253PRSWLUN6MV3QW/action/storage_attestation","attest_author":"https://pith.science/pith/3Z6EQHQVYR253PRSWLUN6MV3QW/action/author_attestation","sign_citation":"https://pith.science/pith/3Z6EQHQVYR253PRSWLUN6MV3QW/action/citation_signature","submit_replication":"https://pith.science/pith/3Z6EQHQVYR253PRSWLUN6MV3QW/action/replication_record"}},"created_at":"2026-07-05T10:37:44.627520+00:00","updated_at":"2026-07-05T10:37:44.627520+00:00"}