{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VFIJ5Y4WABC6JF2WTEAAUYWZMQ","short_pith_number":"pith:VFIJ5Y4W","canonical_record":{"source":{"id":"2410.07923","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-10T13:49:05Z","cross_cats_sorted":[],"title_canon_sha256":"9e0c077733cce4847e960f533dcc36992772aa36328445f79e2d17cd12b2d332","abstract_canon_sha256":"3343e769b797260b5e8048a98e039bd6206b2aa12e5b4e3de1f2c1819733508f"},"schema_version":"1.0"},"canonical_sha256":"a9509ee3960045e4975699000a62d9640e32cdcebf356f963bdc930a41ffb172","source":{"kind":"arxiv","id":"2410.07923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.07923","created_at":"2026-07-05T09:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"2410.07923v1","created_at":"2026-07-05T09:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07923","created_at":"2026-07-05T09:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"VFIJ5Y4WABC6","created_at":"2026-07-05T09:18:46Z"},{"alias_kind":"pith_short_16","alias_value":"VFIJ5Y4WABC6JF2W","created_at":"2026-07-05T09:18:46Z"},{"alias_kind":"pith_short_8","alias_value":"VFIJ5Y4W","created_at":"2026-07-05T09:18:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VFIJ5Y4WABC6JF2WTEAAUYWZMQ","target":"record","payload":{"canonical_record":{"source":{"id":"2410.07923","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-10T13:49:05Z","cross_cats_sorted":[],"title_canon_sha256":"9e0c077733cce4847e960f533dcc36992772aa36328445f79e2d17cd12b2d332","abstract_canon_sha256":"3343e769b797260b5e8048a98e039bd6206b2aa12e5b4e3de1f2c1819733508f"},"schema_version":"1.0"},"canonical_sha256":"a9509ee3960045e4975699000a62d9640e32cdcebf356f963bdc930a41ffb172","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:46.180408Z","signature_b64":"/i6m5BytLpqvOOjAs7qziKs3OowyVz8iG3TB1uqulEQb2tQx4tcWJclcoQkZiK0kCMgUjVjWPbQerM4QeLHVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9509ee3960045e4975699000a62d9640e32cdcebf356f963bdc930a41ffb172","last_reissued_at":"2026-07-05T09:18:46.179796Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:46.179796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.07923","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VS/n4NaqwmQrCgDYJFK+KvVrILt9DV/cyIqWfuZFxQ8lAtha6GDjfUdddvuYY6gSMusYPRCcZrOV2sScHXMcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T03:55:46.631212Z"},"content_sha256":"a07c9e77f5562a9154a673d390afae31d37b2c59eee8ef54ff7dd7f9900a695a","schema_version":"1.0","event_id":"sha256:a07c9e77f5562a9154a673d390afae31d37b2c59eee8ef54ff7dd7f9900a695a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VFIJ5Y4WABC6JF2WTEAAUYWZMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Learning for Generalised Planning with Background Knowledge","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dillon Z. Chen, Gustav \\v{S}\\'ir, Rostislav Hor\\v{c}\\'ik","submitted_at":"2024-10-10T13:49:05Z","abstract_excerpt":"Automated planning is a form of declarative problem solving which has recently drawn attention from the machine learning (ML) community. ML has been applied to planning either as a way to test `reasoning capabilities' of architectures, or more pragmatically in an attempt to scale up solvers with learned domain knowledge. In practice, planning problems are easy to solve but hard to optimise. However, ML approaches still struggle to solve many problems that are often easy for both humans and classical planners. In this paper, we thus propose a new ML approach that allows users to specify backgro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07923","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/2410.07923/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+6ZMrHYidAmJLIfNHZXofvtFv2bNW8AZBJqYhgxMGIkU6ESoBUikU2y+/Rb7vJuIPy1HDj53gbIV5ET3d49DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T03:55:46.631727Z"},"content_sha256":"38cd3e73469fa830db222004f38f856843553531ca93e35d0d7a040e14b99046","schema_version":"1.0","event_id":"sha256:38cd3e73469fa830db222004f38f856843553531ca93e35d0d7a040e14b99046"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFIJ5Y4WABC6JF2WTEAAUYWZMQ/bundle.json","state_url":"https://pith.science/pith/VFIJ5Y4WABC6JF2WTEAAUYWZMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFIJ5Y4WABC6JF2WTEAAUYWZMQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T03:55:46Z","links":{"resolver":"https://pith.science/pith/VFIJ5Y4WABC6JF2WTEAAUYWZMQ","bundle":"https://pith.science/pith/VFIJ5Y4WABC6JF2WTEAAUYWZMQ/bundle.json","state":"https://pith.science/pith/VFIJ5Y4WABC6JF2WTEAAUYWZMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFIJ5Y4WABC6JF2WTEAAUYWZMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VFIJ5Y4WABC6JF2WTEAAUYWZMQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3343e769b797260b5e8048a98e039bd6206b2aa12e5b4e3de1f2c1819733508f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-10T13:49:05Z","title_canon_sha256":"9e0c077733cce4847e960f533dcc36992772aa36328445f79e2d17cd12b2d332"},"schema_version":"1.0","source":{"id":"2410.07923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.07923","created_at":"2026-07-05T09:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"2410.07923v1","created_at":"2026-07-05T09:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07923","created_at":"2026-07-05T09:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"VFIJ5Y4WABC6","created_at":"2026-07-05T09:18:46Z"},{"alias_kind":"pith_short_16","alias_value":"VFIJ5Y4WABC6JF2W","created_at":"2026-07-05T09:18:46Z"},{"alias_kind":"pith_short_8","alias_value":"VFIJ5Y4W","created_at":"2026-07-05T09:18:46Z"}],"graph_snapshots":[{"event_id":"sha256:38cd3e73469fa830db222004f38f856843553531ca93e35d0d7a040e14b99046","target":"graph","created_at":"2026-07-05T09:18:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.07923/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Automated planning is a form of declarative problem solving which has recently drawn attention from the machine learning (ML) community. ML has been applied to planning either as a way to test `reasoning capabilities' of architectures, or more pragmatically in an attempt to scale up solvers with learned domain knowledge. In practice, planning problems are easy to solve but hard to optimise. However, ML approaches still struggle to solve many problems that are often easy for both humans and classical planners. In this paper, we thus propose a new ML approach that allows users to specify backgro","authors_text":"Dillon Z. Chen, Gustav \\v{S}\\'ir, Rostislav Hor\\v{c}\\'ik","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-10T13:49:05Z","title":"Deep Learning for Generalised Planning with Background Knowledge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07923","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a07c9e77f5562a9154a673d390afae31d37b2c59eee8ef54ff7dd7f9900a695a","target":"record","created_at":"2026-07-05T09:18:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3343e769b797260b5e8048a98e039bd6206b2aa12e5b4e3de1f2c1819733508f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-10T13:49:05Z","title_canon_sha256":"9e0c077733cce4847e960f533dcc36992772aa36328445f79e2d17cd12b2d332"},"schema_version":"1.0","source":{"id":"2410.07923","kind":"arxiv","version":1}},"canonical_sha256":"a9509ee3960045e4975699000a62d9640e32cdcebf356f963bdc930a41ffb172","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9509ee3960045e4975699000a62d9640e32cdcebf356f963bdc930a41ffb172","first_computed_at":"2026-07-05T09:18:46.179796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:18:46.179796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/i6m5BytLpqvOOjAs7qziKs3OowyVz8iG3TB1uqulEQb2tQx4tcWJclcoQkZiK0kCMgUjVjWPbQerM4QeLHVBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:18:46.180408Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.07923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a07c9e77f5562a9154a673d390afae31d37b2c59eee8ef54ff7dd7f9900a695a","sha256:38cd3e73469fa830db222004f38f856843553531ca93e35d0d7a040e14b99046"],"state_sha256":"972522ab9f0d49a31835ef53fcc0c9a7d637e873af1b18165301933e0879849a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5rqUThMgadS8HM+QU7h/ZwRvH+wi/f6Bu3YXdq65D01bckxHqeC+aLy7eNJzctzBMjwIoMK5RNSt6xTCVz6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T03:55:46.637226Z","bundle_sha256":"24761ffd3cbc1229e65b08365b1c19c91ef208315fdd4ecd4e14f54edd8b5eca"}}