{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:M65Z77A2CYGDZ2SJVSSWTQTCJZ","short_pith_number":"pith:M65Z77A2","schema_version":"1.0","canonical_sha256":"67bb9ffc1a160c3cea49aca569c2624e6c32620aef936b45a453f69694f01cd9","source":{"kind":"arxiv","id":"2308.12682","version":2},"attestation_state":"computed","paper":{"title":"SayCanPay: Heuristic Planning with Large Language Models using Learnable Domain Knowledge","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Luc De Raedt, Pedro Zuidberg Dos Martires, Rishi Hazra","submitted_at":"2023-08-24T09:47:28Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated impressive planning abilities due to their vast \"world knowledge\". Yet, obtaining plans that are both feasible (grounded in affordances) and cost-effective (in plan length), remains a challenge, despite recent progress. This contrasts with heuristic planning methods that employ domain knowledge (formalized in action models such as PDDL) and heuristic search to generate feasible, optimal plans. Inspired by this, we propose to combine the power of LLMs and heuristic planning by leveraging the world knowledge of LLMs and the principles of heuristic s"},"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":"2308.12682","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-08-24T09:47:28Z","cross_cats_sorted":[],"title_canon_sha256":"5c724b16ae9f9f17c47fb0a049df25aa428daafe9ba2ff66e3f72008258fd30a","abstract_canon_sha256":"0499498f78f524977eccb34c145fbb5ded49ee0e564b71f999c3181dcf71fe4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:27.894668Z","signature_b64":"4EqjOPoAG+L/RRa7OGkQ/jOwpjIXW+Wy0OEPpINZuZYPFDGEIPKXZLn28f+f5f4fcdU9y58vSnoI3pkizFVCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67bb9ffc1a160c3cea49aca569c2624e6c32620aef936b45a453f69694f01cd9","last_reissued_at":"2026-07-05T07:29:27.894235Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:27.894235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SayCanPay: Heuristic Planning with Large Language Models using Learnable Domain Knowledge","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Luc De Raedt, Pedro Zuidberg Dos Martires, Rishi Hazra","submitted_at":"2023-08-24T09:47:28Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated impressive planning abilities due to their vast \"world knowledge\". Yet, obtaining plans that are both feasible (grounded in affordances) and cost-effective (in plan length), remains a challenge, despite recent progress. This contrasts with heuristic planning methods that employ domain knowledge (formalized in action models such as PDDL) and heuristic search to generate feasible, optimal plans. Inspired by this, we propose to combine the power of LLMs and heuristic planning by leveraging the world knowledge of LLMs and the principles of heuristic s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12682","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/2308.12682/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":"2308.12682","created_at":"2026-07-05T07:29:27.894285+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.12682v2","created_at":"2026-07-05T07:29:27.894285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12682","created_at":"2026-07-05T07:29:27.894285+00:00"},{"alias_kind":"pith_short_12","alias_value":"M65Z77A2CYGD","created_at":"2026-07-05T07:29:27.894285+00:00"},{"alias_kind":"pith_short_16","alias_value":"M65Z77A2CYGDZ2SJ","created_at":"2026-07-05T07:29:27.894285+00:00"},{"alias_kind":"pith_short_8","alias_value":"M65Z77A2","created_at":"2026-07-05T07:29:27.894285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2304.11477","citing_title":"LLM+P: Empowering Large Language Models with Optimal Planning Proficiency","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M65Z77A2CYGDZ2SJVSSWTQTCJZ","json":"https://pith.science/pith/M65Z77A2CYGDZ2SJVSSWTQTCJZ.json","graph_json":"https://pith.science/api/pith-number/M65Z77A2CYGDZ2SJVSSWTQTCJZ/graph.json","events_json":"https://pith.science/api/pith-number/M65Z77A2CYGDZ2SJVSSWTQTCJZ/events.json","paper":"https://pith.science/paper/M65Z77A2"},"agent_actions":{"view_html":"https://pith.science/pith/M65Z77A2CYGDZ2SJVSSWTQTCJZ","download_json":"https://pith.science/pith/M65Z77A2CYGDZ2SJVSSWTQTCJZ.json","view_paper":"https://pith.science/paper/M65Z77A2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.12682&json=true","fetch_graph":"https://pith.science/api/pith-number/M65Z77A2CYGDZ2SJVSSWTQTCJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/M65Z77A2CYGDZ2SJVSSWTQTCJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M65Z77A2CYGDZ2SJVSSWTQTCJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M65Z77A2CYGDZ2SJVSSWTQTCJZ/action/storage_attestation","attest_author":"https://pith.science/pith/M65Z77A2CYGDZ2SJVSSWTQTCJZ/action/author_attestation","sign_citation":"https://pith.science/pith/M65Z77A2CYGDZ2SJVSSWTQTCJZ/action/citation_signature","submit_replication":"https://pith.science/pith/M65Z77A2CYGDZ2SJVSSWTQTCJZ/action/replication_record"}},"created_at":"2026-07-05T07:29:27.894285+00:00","updated_at":"2026-07-05T07:29:27.894285+00:00"}