{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FRK4M75JGRKNV7WGRJF5VEAD4C","short_pith_number":"pith:FRK4M75J","schema_version":"1.0","canonical_sha256":"2c55c67fa93454dafec68a4bda9003e0a9b95315c7a4edde9e0677ad88d14ea7","source":{"kind":"arxiv","id":"2502.19295","version":1},"attestation_state":"computed","paper":{"title":"Complex LLM Planning via Automated Heuristics Discovery","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anwesha Basu, Blake Olson, Gaurangi Sinha, Hongyi Ling, James Caverlee, Sambhav Khurana, Shubham Parashar, Shuiwang Ji, Zhengzhong Tu","submitted_at":"2025-02-26T16:52:31Z","abstract_excerpt":"We consider enhancing large language models (LLMs) for complex planning tasks. While existing methods allow LLMs to explore intermediate steps to make plans, they either depend on unreliable self-verification or external verifiers to evaluate these steps, which demand significant data and computations. Here, we propose automated heuristics discovery (AutoHD), a novel approach that enables LLMs to explicitly generate heuristic functions to guide inference-time search, allowing accurate evaluation of intermediate states. These heuristic functions are further refined through a heuristic evolution"},"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.19295","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-26T16:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"3f85f386ecb0d1bb72eeb95d076075d096e6a165c930e3b0dd910a96aef96090","abstract_canon_sha256":"e2f8ff1c63bae81a0a788b9ec7eb799c5bfdedb4311a0dbc688b29c1bdcd63d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:29.516889Z","signature_b64":"d0bggPJMvC6Rt32LmuDfPHYGZ4is2tt0jf+vUF4ONpRA6+utkybRrTfuvggL70PkoqZK9GOLUVr7Hui/oy8BCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c55c67fa93454dafec68a4bda9003e0a9b95315c7a4edde9e0677ad88d14ea7","last_reissued_at":"2026-07-05T10:20:29.516347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:29.516347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complex LLM Planning via Automated Heuristics Discovery","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anwesha Basu, Blake Olson, Gaurangi Sinha, Hongyi Ling, James Caverlee, Sambhav Khurana, Shubham Parashar, Shuiwang Ji, Zhengzhong Tu","submitted_at":"2025-02-26T16:52:31Z","abstract_excerpt":"We consider enhancing large language models (LLMs) for complex planning tasks. While existing methods allow LLMs to explore intermediate steps to make plans, they either depend on unreliable self-verification or external verifiers to evaluate these steps, which demand significant data and computations. Here, we propose automated heuristics discovery (AutoHD), a novel approach that enables LLMs to explicitly generate heuristic functions to guide inference-time search, allowing accurate evaluation of intermediate states. These heuristic functions are further refined through a heuristic evolution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.19295","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/2502.19295/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.19295","created_at":"2026-07-05T10:20:29.516399+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.19295v1","created_at":"2026-07-05T10:20:29.516399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.19295","created_at":"2026-07-05T10:20:29.516399+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRK4M75JGRKN","created_at":"2026-07-05T10:20:29.516399+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRK4M75JGRKNV7WG","created_at":"2026-07-05T10:20:29.516399+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRK4M75J","created_at":"2026-07-05T10:20:29.516399+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08269","citing_title":"A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving","ref_index":172,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FRK4M75JGRKNV7WGRJF5VEAD4C","json":"https://pith.science/pith/FRK4M75JGRKNV7WGRJF5VEAD4C.json","graph_json":"https://pith.science/api/pith-number/FRK4M75JGRKNV7WGRJF5VEAD4C/graph.json","events_json":"https://pith.science/api/pith-number/FRK4M75JGRKNV7WGRJF5VEAD4C/events.json","paper":"https://pith.science/paper/FRK4M75J"},"agent_actions":{"view_html":"https://pith.science/pith/FRK4M75JGRKNV7WGRJF5VEAD4C","download_json":"https://pith.science/pith/FRK4M75JGRKNV7WGRJF5VEAD4C.json","view_paper":"https://pith.science/paper/FRK4M75J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.19295&json=true","fetch_graph":"https://pith.science/api/pith-number/FRK4M75JGRKNV7WGRJF5VEAD4C/graph.json","fetch_events":"https://pith.science/api/pith-number/FRK4M75JGRKNV7WGRJF5VEAD4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRK4M75JGRKNV7WGRJF5VEAD4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRK4M75JGRKNV7WGRJF5VEAD4C/action/storage_attestation","attest_author":"https://pith.science/pith/FRK4M75JGRKNV7WGRJF5VEAD4C/action/author_attestation","sign_citation":"https://pith.science/pith/FRK4M75JGRKNV7WGRJF5VEAD4C/action/citation_signature","submit_replication":"https://pith.science/pith/FRK4M75JGRKNV7WGRJF5VEAD4C/action/replication_record"}},"created_at":"2026-07-05T10:20:29.516399+00:00","updated_at":"2026-07-05T10:20:29.516399+00:00"}