{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HSBJS33TBELHJOGWLDDLV43VE3","short_pith_number":"pith:HSBJS33T","schema_version":"1.0","canonical_sha256":"3c82996f73091674b8d658c6baf37526f098dc6186314a2d4a00055ab1a8b96f","source":{"kind":"arxiv","id":"2406.02598","version":1},"attestation_state":"computed","paper":{"title":"Towards Learning Foundation Models for Heuristic Functions to Solve Pathfinding Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Amit Sheth, Forest Agostinelli, Vedant Khandelwal","submitted_at":"2024-06-01T16:18:20Z","abstract_excerpt":"Pathfinding problems are found throughout robotics, computational science, and natural sciences. Traditional methods to solve these require training deep neural networks (DNNs) for each new problem domain, consuming substantial time and resources. This study introduces a novel foundation model, leveraging deep reinforcement learning to train heuristic functions that seamlessly adapt to new domains without further fine-tuning. Building upon DeepCubeA, we enhance the model by providing the heuristic function with the domain's state transition information, improving its adaptability. Utilizing a "},"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":"2406.02598","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-01T16:18:20Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e4a391f34b94ac3b12aff1e9d4a0fd589127de7a1575e33cd0fc92404f60a173","abstract_canon_sha256":"2f15b2b138f9065c114beacd3493ab914d977cc94e1b34ecb50191a9c1b54a6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:27.628831Z","signature_b64":"Ht82+9QEWQWty3j0zt026QF4ATwbewSvm+YSCN4sOt/nOpgMKXdmZSRstmPq0Jvo3Wz5OObDmNn5a0khUBRFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c82996f73091674b8d658c6baf37526f098dc6186314a2d4a00055ab1a8b96f","last_reissued_at":"2026-07-05T08:27:27.628425Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:27.628425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Learning Foundation Models for Heuristic Functions to Solve Pathfinding Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Amit Sheth, Forest Agostinelli, Vedant Khandelwal","submitted_at":"2024-06-01T16:18:20Z","abstract_excerpt":"Pathfinding problems are found throughout robotics, computational science, and natural sciences. Traditional methods to solve these require training deep neural networks (DNNs) for each new problem domain, consuming substantial time and resources. This study introduces a novel foundation model, leveraging deep reinforcement learning to train heuristic functions that seamlessly adapt to new domains without further fine-tuning. Building upon DeepCubeA, we enhance the model by providing the heuristic function with the domain's state transition information, improving its adaptability. Utilizing a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02598","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/2406.02598/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":"2406.02598","created_at":"2026-07-05T08:27:27.628480+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02598v1","created_at":"2026-07-05T08:27:27.628480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02598","created_at":"2026-07-05T08:27:27.628480+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSBJS33TBELH","created_at":"2026-07-05T08:27:27.628480+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSBJS33TBELHJOGW","created_at":"2026-07-05T08:27:27.628480+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSBJS33T","created_at":"2026-07-05T08:27:27.628480+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.19886","citing_title":"PDDLFuse: A Tool for Generating Diverse Planning Domains","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HSBJS33TBELHJOGWLDDLV43VE3","json":"https://pith.science/pith/HSBJS33TBELHJOGWLDDLV43VE3.json","graph_json":"https://pith.science/api/pith-number/HSBJS33TBELHJOGWLDDLV43VE3/graph.json","events_json":"https://pith.science/api/pith-number/HSBJS33TBELHJOGWLDDLV43VE3/events.json","paper":"https://pith.science/paper/HSBJS33T"},"agent_actions":{"view_html":"https://pith.science/pith/HSBJS33TBELHJOGWLDDLV43VE3","download_json":"https://pith.science/pith/HSBJS33TBELHJOGWLDDLV43VE3.json","view_paper":"https://pith.science/paper/HSBJS33T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02598&json=true","fetch_graph":"https://pith.science/api/pith-number/HSBJS33TBELHJOGWLDDLV43VE3/graph.json","fetch_events":"https://pith.science/api/pith-number/HSBJS33TBELHJOGWLDDLV43VE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSBJS33TBELHJOGWLDDLV43VE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSBJS33TBELHJOGWLDDLV43VE3/action/storage_attestation","attest_author":"https://pith.science/pith/HSBJS33TBELHJOGWLDDLV43VE3/action/author_attestation","sign_citation":"https://pith.science/pith/HSBJS33TBELHJOGWLDDLV43VE3/action/citation_signature","submit_replication":"https://pith.science/pith/HSBJS33TBELHJOGWLDDLV43VE3/action/replication_record"}},"created_at":"2026-07-05T08:27:27.628480+00:00","updated_at":"2026-07-05T08:27:27.628480+00:00"}