{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BIS6STTAXEGVKTNPKM5MBWDHTF","short_pith_number":"pith:BIS6STTA","schema_version":"1.0","canonical_sha256":"0a25e94e60b90d554daf533ac0d867994413943555d4e7630c6b923ac7edc499","source":{"kind":"arxiv","id":"2506.05213","version":1},"attestation_state":"computed","paper":{"title":"LLM-First Search: Self-Guided Exploration of the Solution Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Nathan Herr, Roberta Raileanu, Tim Rockt\\\"aschel","submitted_at":"2025-06-05T16:27:49Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated remarkable improvements in reasoning and planning through increased test-time compute, often by framing problem-solving as a search process. While methods like Monte Carlo Tree Search (MCTS) have proven effective in some domains, their reliance on fixed exploration hyperparameters limits their adaptability across tasks of varying difficulty, rendering them impractical or expensive in certain settings. In this paper, we propose \\textbf{LLM-First Search (LFS)}, a novel \\textit{LLM Self-Guided Search} method that removes the need for pre-defined sear"},"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":"2506.05213","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-05T16:27:49Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"9b2f44aa38758ca01ee7aba7b25fab8ea44c091aedafe1de79e7e12a97495790","abstract_canon_sha256":"be4102f6a69b4487efabe5d5a51e5f21a07441eb993c7138ab64e4e23461b7c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:44.197424Z","signature_b64":"nJuOYHQj83jRZQ6+dlzjzdOjNvlPdZoAABKJVjK1xbQk0u6GXI7uzT0Q0qfFp6ImXpntMWH/BeNILgptiV/YCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a25e94e60b90d554daf533ac0d867994413943555d4e7630c6b923ac7edc499","last_reissued_at":"2026-07-05T11:16:44.196847Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:44.196847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM-First Search: Self-Guided Exploration of the Solution Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Nathan Herr, Roberta Raileanu, Tim Rockt\\\"aschel","submitted_at":"2025-06-05T16:27:49Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated remarkable improvements in reasoning and planning through increased test-time compute, often by framing problem-solving as a search process. While methods like Monte Carlo Tree Search (MCTS) have proven effective in some domains, their reliance on fixed exploration hyperparameters limits their adaptability across tasks of varying difficulty, rendering them impractical or expensive in certain settings. In this paper, we propose \\textbf{LLM-First Search (LFS)}, a novel \\textit{LLM Self-Guided Search} method that removes the need for pre-defined sear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05213","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/2506.05213/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":"2506.05213","created_at":"2026-07-05T11:16:44.196916+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.05213v1","created_at":"2026-07-05T11:16:44.196916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05213","created_at":"2026-07-05T11:16:44.196916+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIS6STTAXEGV","created_at":"2026-07-05T11:16:44.196916+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIS6STTAXEGVKTNP","created_at":"2026-07-05T11:16:44.196916+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIS6STTA","created_at":"2026-07-05T11:16:44.196916+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21891","citing_title":"Learning the ARTS of Search for Automated Discovery","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20599","citing_title":"Beyond Fixed Budgets: Characterizing the Inelasticity and Limitations of Tree-of-Thought Reasoning Strategies","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12126","citing_title":"Long-Horizon Plan Execution in Large Tool Spaces through Entropy-Guided Branching","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BIS6STTAXEGVKTNPKM5MBWDHTF","json":"https://pith.science/pith/BIS6STTAXEGVKTNPKM5MBWDHTF.json","graph_json":"https://pith.science/api/pith-number/BIS6STTAXEGVKTNPKM5MBWDHTF/graph.json","events_json":"https://pith.science/api/pith-number/BIS6STTAXEGVKTNPKM5MBWDHTF/events.json","paper":"https://pith.science/paper/BIS6STTA"},"agent_actions":{"view_html":"https://pith.science/pith/BIS6STTAXEGVKTNPKM5MBWDHTF","download_json":"https://pith.science/pith/BIS6STTAXEGVKTNPKM5MBWDHTF.json","view_paper":"https://pith.science/paper/BIS6STTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.05213&json=true","fetch_graph":"https://pith.science/api/pith-number/BIS6STTAXEGVKTNPKM5MBWDHTF/graph.json","fetch_events":"https://pith.science/api/pith-number/BIS6STTAXEGVKTNPKM5MBWDHTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIS6STTAXEGVKTNPKM5MBWDHTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIS6STTAXEGVKTNPKM5MBWDHTF/action/storage_attestation","attest_author":"https://pith.science/pith/BIS6STTAXEGVKTNPKM5MBWDHTF/action/author_attestation","sign_citation":"https://pith.science/pith/BIS6STTAXEGVKTNPKM5MBWDHTF/action/citation_signature","submit_replication":"https://pith.science/pith/BIS6STTAXEGVKTNPKM5MBWDHTF/action/replication_record"}},"created_at":"2026-07-05T11:16:44.196916+00:00","updated_at":"2026-07-05T11:16:44.196916+00:00"}