{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:67KCVDKT47VLY2QBURAUXNBWVT","short_pith_number":"pith:67KCVDKT","schema_version":"1.0","canonical_sha256":"f7d42a8d53e7eabc6a01a4414bb436acee771c1d9badcdf78f5f521ac1651d34","source":{"kind":"arxiv","id":"2402.10890","version":2},"attestation_state":"computed","paper":{"title":"When is Tree Search Useful for LLM Planning? It Depends on the Discriminator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Ali Payani, Huan Sun, Michael White, Raymond Mooney, Yu Su, Ziru Chen","submitted_at":"2024-02-16T18:45:58Z","abstract_excerpt":"In this paper, we examine how large language models (LLMs) solve multi-step problems under a language agent framework with three components: a generator, a discriminator, and a planning method. We investigate the practical utility of two advanced planning methods, iterative correction and tree search. We present a comprehensive analysis of how discrimination accuracy affects the overall performance of agents when using these two methods or a simpler method, re-ranking. Experiments on two tasks, text-to-SQL parsing and mathematical reasoning, show that: (1) advanced planning methods demand disc"},"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":"2402.10890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-02-16T18:45:58Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"2e8d69f332c0a8447196bf3414abe47c86b0e76413ce6785d1cc150032a5f057","abstract_canon_sha256":"b22126e04a6f6ab646159ac8e85102ae204d2b282ae9ac2f27b1799aab2cddc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:06.122220Z","signature_b64":"HvQnbnKdWLGXvQPKXHgqcUzScssK68SUE4bqr9ue1mKZqXKKrQH0ZxPh+H2Zf4AMWc/UFPx2Kt+f+0pPqzcyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7d42a8d53e7eabc6a01a4414bb436acee771c1d9badcdf78f5f521ac1651d34","last_reissued_at":"2026-07-05T08:28:06.121790Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:06.121790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When is Tree Search Useful for LLM Planning? It Depends on the Discriminator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Ali Payani, Huan Sun, Michael White, Raymond Mooney, Yu Su, Ziru Chen","submitted_at":"2024-02-16T18:45:58Z","abstract_excerpt":"In this paper, we examine how large language models (LLMs) solve multi-step problems under a language agent framework with three components: a generator, a discriminator, and a planning method. We investigate the practical utility of two advanced planning methods, iterative correction and tree search. We present a comprehensive analysis of how discrimination accuracy affects the overall performance of agents when using these two methods or a simpler method, re-ranking. Experiments on two tasks, text-to-SQL parsing and mathematical reasoning, show that: (1) advanced planning methods demand disc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10890","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/2402.10890/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":"2402.10890","created_at":"2026-07-05T08:28:06.121847+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10890v2","created_at":"2026-07-05T08:28:06.121847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10890","created_at":"2026-07-05T08:28:06.121847+00:00"},{"alias_kind":"pith_short_12","alias_value":"67KCVDKT47VL","created_at":"2026-07-05T08:28:06.121847+00:00"},{"alias_kind":"pith_short_16","alias_value":"67KCVDKT47VLY2QB","created_at":"2026-07-05T08:28:06.121847+00:00"},{"alias_kind":"pith_short_8","alias_value":"67KCVDKT","created_at":"2026-07-05T08:28:06.121847+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17628","citing_title":"OPD-Evolver: Cultivating Holistic Agent Evolver via On-Policy Distillation","ref_index":113,"is_internal_anchor":false},{"citing_arxiv_id":"2601.12538","citing_title":"Agentic Reasoning for Large Language Models","ref_index":118,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/67KCVDKT47VLY2QBURAUXNBWVT","json":"https://pith.science/pith/67KCVDKT47VLY2QBURAUXNBWVT.json","graph_json":"https://pith.science/api/pith-number/67KCVDKT47VLY2QBURAUXNBWVT/graph.json","events_json":"https://pith.science/api/pith-number/67KCVDKT47VLY2QBURAUXNBWVT/events.json","paper":"https://pith.science/paper/67KCVDKT"},"agent_actions":{"view_html":"https://pith.science/pith/67KCVDKT47VLY2QBURAUXNBWVT","download_json":"https://pith.science/pith/67KCVDKT47VLY2QBURAUXNBWVT.json","view_paper":"https://pith.science/paper/67KCVDKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10890&json=true","fetch_graph":"https://pith.science/api/pith-number/67KCVDKT47VLY2QBURAUXNBWVT/graph.json","fetch_events":"https://pith.science/api/pith-number/67KCVDKT47VLY2QBURAUXNBWVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67KCVDKT47VLY2QBURAUXNBWVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67KCVDKT47VLY2QBURAUXNBWVT/action/storage_attestation","attest_author":"https://pith.science/pith/67KCVDKT47VLY2QBURAUXNBWVT/action/author_attestation","sign_citation":"https://pith.science/pith/67KCVDKT47VLY2QBURAUXNBWVT/action/citation_signature","submit_replication":"https://pith.science/pith/67KCVDKT47VLY2QBURAUXNBWVT/action/replication_record"}},"created_at":"2026-07-05T08:28:06.121847+00:00","updated_at":"2026-07-05T08:28:06.121847+00:00"}