{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6I4L4ONZYY5IQF5GXQNMUTWH4U","short_pith_number":"pith:6I4L4ONZ","schema_version":"1.0","canonical_sha256":"f238be39b9c63a8817a6bc1aca4ec7e50d0b00860fc6c0aaff6cad6635d22a0a","source":{"kind":"arxiv","id":"2412.02136","version":1},"attestation_state":"computed","paper":{"title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dillon Z. Chen, Felipe Trevizan, Mingyu Hao, Sylvie Thi\\'ebaux","submitted_at":"2024-12-03T03:49:27Z","abstract_excerpt":"Graph learning is naturally well suited for use in planning due to its ability to exploit relational structures exhibited in planning domains and to take as input planning instances with arbitrary number of objects. In this paper, we study the usage of graph learning for planning thus far by studying the theoretical and empirical effects on learning and planning performance of (1) graph representations of planning tasks, (2) graph learning architectures, and (3) optimisation formulations for learning. Our studies accumulate in the GOOSE framework which learns domain knowledge from small planni"},"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":"2412.02136","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-12-03T03:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"6b14c4d1c181a32384c71ed75daff10be7de6cbfd67f150ca42b23713f1a0e84","abstract_canon_sha256":"d763f4bf82ef826738f1032c0b0cbf26cf4de4b6b11f57d881799684bc5dd9c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:43:44.581949Z","signature_b64":"OKjQd/3yYs/nothwRmEA9mEwEd2liS7Z11n+W28ycOubYAHY0f584iV8WSGQ3TMkBbn4aI8PoXDT0s4bRL99BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f238be39b9c63a8817a6bc1aca4ec7e50d0b00860fc6c0aaff6cad6635d22a0a","last_reissued_at":"2026-07-05T09:43:44.581458Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:43:44.581458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dillon Z. Chen, Felipe Trevizan, Mingyu Hao, Sylvie Thi\\'ebaux","submitted_at":"2024-12-03T03:49:27Z","abstract_excerpt":"Graph learning is naturally well suited for use in planning due to its ability to exploit relational structures exhibited in planning domains and to take as input planning instances with arbitrary number of objects. In this paper, we study the usage of graph learning for planning thus far by studying the theoretical and empirical effects on learning and planning performance of (1) graph representations of planning tasks, (2) graph learning architectures, and (3) optimisation formulations for learning. Our studies accumulate in the GOOSE framework which learns domain knowledge from small planni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02136","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/2412.02136/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":"2412.02136","created_at":"2026-07-05T09:43:44.581516+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.02136v1","created_at":"2026-07-05T09:43:44.581516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02136","created_at":"2026-07-05T09:43:44.581516+00:00"},{"alias_kind":"pith_short_12","alias_value":"6I4L4ONZYY5I","created_at":"2026-07-05T09:43:44.581516+00:00"},{"alias_kind":"pith_short_16","alias_value":"6I4L4ONZYY5IQF5G","created_at":"2026-07-05T09:43:44.581516+00:00"},{"alias_kind":"pith_short_8","alias_value":"6I4L4ONZ","created_at":"2026-07-05T09:43:44.581516+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/6I4L4ONZYY5IQF5GXQNMUTWH4U","json":"https://pith.science/pith/6I4L4ONZYY5IQF5GXQNMUTWH4U.json","graph_json":"https://pith.science/api/pith-number/6I4L4ONZYY5IQF5GXQNMUTWH4U/graph.json","events_json":"https://pith.science/api/pith-number/6I4L4ONZYY5IQF5GXQNMUTWH4U/events.json","paper":"https://pith.science/paper/6I4L4ONZ"},"agent_actions":{"view_html":"https://pith.science/pith/6I4L4ONZYY5IQF5GXQNMUTWH4U","download_json":"https://pith.science/pith/6I4L4ONZYY5IQF5GXQNMUTWH4U.json","view_paper":"https://pith.science/paper/6I4L4ONZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.02136&json=true","fetch_graph":"https://pith.science/api/pith-number/6I4L4ONZYY5IQF5GXQNMUTWH4U/graph.json","fetch_events":"https://pith.science/api/pith-number/6I4L4ONZYY5IQF5GXQNMUTWH4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6I4L4ONZYY5IQF5GXQNMUTWH4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6I4L4ONZYY5IQF5GXQNMUTWH4U/action/storage_attestation","attest_author":"https://pith.science/pith/6I4L4ONZYY5IQF5GXQNMUTWH4U/action/author_attestation","sign_citation":"https://pith.science/pith/6I4L4ONZYY5IQF5GXQNMUTWH4U/action/citation_signature","submit_replication":"https://pith.science/pith/6I4L4ONZYY5IQF5GXQNMUTWH4U/action/replication_record"}},"created_at":"2026-07-05T09:43:44.581516+00:00","updated_at":"2026-07-05T09:43:44.581516+00:00"}