{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BUWQCND3PN6CLS5NXJS37UCDBS","short_pith_number":"pith:BUWQCND3","schema_version":"1.0","canonical_sha256":"0d2d01347b7b7c25cbadba65bfd0430ca0f26974d1346591909619e900c12af6","source":{"kind":"arxiv","id":"1707.06895","version":1},"attestation_state":"computed","paper":{"title":"Towards learning domain-independent planning heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alessandra Russo, Antonio Bucchiarone, Dalal Alrajeh, Pawel Gomoluch","submitted_at":"2017-07-21T13:39:24Z","abstract_excerpt":"Automated planning remains one of the most general paradigms in Artificial Intelligence, providing means of solving problems coming from a wide variety of domains. One of the key factors restricting the applicability of planning is its computational complexity resulting from exponentially large search spaces. Heuristic approaches are necessary to solve all but the simplest problems. In this work, we explore the possibility of obtaining domain-independent heuristic functions using machine learning. This is a part of a wider research program whose objective is to improve practical applicability "},"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":"1707.06895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-21T13:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"e6724a91b9604f8431c8ac75556ca06575d2ad55745d15030b350ce9dc817098","abstract_canon_sha256":"943d0dce8616d953c24f32f2bac105f858588ff9cd252ed911a26ca7d75ee313"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:51.203952Z","signature_b64":"x0/8yAha9KjpZqgUdjGnhBqEE2eFo6gALb4JizID8wWDwQTqLH3w0xI6LJM/mMvLpWpBzVVWLjC8LN+IRK/oCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d2d01347b7b7c25cbadba65bfd0430ca0f26974d1346591909619e900c12af6","last_reissued_at":"2026-05-18T00:39:51.203230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:51.203230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards learning domain-independent planning heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alessandra Russo, Antonio Bucchiarone, Dalal Alrajeh, Pawel Gomoluch","submitted_at":"2017-07-21T13:39:24Z","abstract_excerpt":"Automated planning remains one of the most general paradigms in Artificial Intelligence, providing means of solving problems coming from a wide variety of domains. One of the key factors restricting the applicability of planning is its computational complexity resulting from exponentially large search spaces. Heuristic approaches are necessary to solve all but the simplest problems. In this work, we explore the possibility of obtaining domain-independent heuristic functions using machine learning. This is a part of a wider research program whose objective is to improve practical applicability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06895","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":""},"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":"1707.06895","created_at":"2026-05-18T00:39:51.203347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06895v1","created_at":"2026-05-18T00:39:51.203347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06895","created_at":"2026-05-18T00:39:51.203347+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUWQCND3PN6C","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUWQCND3PN6CLS5N","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUWQCND3","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BUWQCND3PN6CLS5NXJS37UCDBS","json":"https://pith.science/pith/BUWQCND3PN6CLS5NXJS37UCDBS.json","graph_json":"https://pith.science/api/pith-number/BUWQCND3PN6CLS5NXJS37UCDBS/graph.json","events_json":"https://pith.science/api/pith-number/BUWQCND3PN6CLS5NXJS37UCDBS/events.json","paper":"https://pith.science/paper/BUWQCND3"},"agent_actions":{"view_html":"https://pith.science/pith/BUWQCND3PN6CLS5NXJS37UCDBS","download_json":"https://pith.science/pith/BUWQCND3PN6CLS5NXJS37UCDBS.json","view_paper":"https://pith.science/paper/BUWQCND3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06895&json=true","fetch_graph":"https://pith.science/api/pith-number/BUWQCND3PN6CLS5NXJS37UCDBS/graph.json","fetch_events":"https://pith.science/api/pith-number/BUWQCND3PN6CLS5NXJS37UCDBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUWQCND3PN6CLS5NXJS37UCDBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUWQCND3PN6CLS5NXJS37UCDBS/action/storage_attestation","attest_author":"https://pith.science/pith/BUWQCND3PN6CLS5NXJS37UCDBS/action/author_attestation","sign_citation":"https://pith.science/pith/BUWQCND3PN6CLS5NXJS37UCDBS/action/citation_signature","submit_replication":"https://pith.science/pith/BUWQCND3PN6CLS5NXJS37UCDBS/action/replication_record"}},"created_at":"2026-05-18T00:39:51.203347+00:00","updated_at":"2026-05-18T00:39:51.203347+00:00"}