{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XHGOEB2D5GTXUBW5CDQSKILXN3","short_pith_number":"pith:XHGOEB2D","canonical_record":{"source":{"id":"1908.01362","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2019-08-04T15:37:13Z","cross_cats_sorted":[],"title_canon_sha256":"8486eb3a04d73f0919886a099dabb5905bf33c4bf52eb8f82338b6dc974eccaa","abstract_canon_sha256":"d738c23dc1a4b540b8d6bd53fc4e42389421d1486724a8f40fa588a4d7a4b1bf"},"schema_version":"1.0"},"canonical_sha256":"b9cce20743e9a77a06dd10e12521776ed613543e5b2c8b8361cb9edc04ccdf0b","source":{"kind":"arxiv","id":"1908.01362","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01362","created_at":"2026-07-05T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01362v2","created_at":"2026-07-05T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01362","created_at":"2026-07-05T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"XHGOEB2D5GTX","created_at":"2026-07-05T01:00:12Z"},{"alias_kind":"pith_short_16","alias_value":"XHGOEB2D5GTXUBW5","created_at":"2026-07-05T01:00:12Z"},{"alias_kind":"pith_short_8","alias_value":"XHGOEB2D","created_at":"2026-07-05T01:00:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XHGOEB2D5GTXUBW5CDQSKILXN3","target":"record","payload":{"canonical_record":{"source":{"id":"1908.01362","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2019-08-04T15:37:13Z","cross_cats_sorted":[],"title_canon_sha256":"8486eb3a04d73f0919886a099dabb5905bf33c4bf52eb8f82338b6dc974eccaa","abstract_canon_sha256":"d738c23dc1a4b540b8d6bd53fc4e42389421d1486724a8f40fa588a4d7a4b1bf"},"schema_version":"1.0"},"canonical_sha256":"b9cce20743e9a77a06dd10e12521776ed613543e5b2c8b8361cb9edc04ccdf0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:00:12.912088Z","signature_b64":"s/GKdsjprTaQoXIvJCa0mm3NtYQL/skKD5vTjWpuVW3Tk4Bli8ts33HmXoBW7TBXjlyL3mg1QGy1zDUDkV2AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9cce20743e9a77a06dd10e12521776ed613543e5b2c8b8361cb9edc04ccdf0b","last_reissued_at":"2026-07-05T01:00:12.911661Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:00:12.911661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.01362","source_version":2,"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-05T01:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZmATI6mX9Qp02Htv3al8t6tbefjjkKRTwLIF9HJ1yrTsf2/GrjmDbVJkiMJPKh2YWlXalgN/w1Wf9E8HHkKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:44:37.171362Z"},"content_sha256":"fe81105eac9f9c2da940ff3ca1875159a53014d21dfb0d8ea0e2e679550b200d","schema_version":"1.0","event_id":"sha256:fe81105eac9f9c2da940ff3ca1875159a53014d21dfb0d8ea0e2e679550b200d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XHGOEB2D5GTXUBW5CDQSKILXN3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ASNets: Deep Learning for Generalised Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Felipe Trevizan, Lexing Xie, Sam Toyer, Sylvie Thi\\'ebaux","submitted_at":"2019-08-04T15:37:13Z","abstract_excerpt":"In this paper, we discuss the learning of generalised policies for probabilistic and classical planning problems using Action Schema Networks (ASNets). The ASNet is a neural network architecture that exploits the relational structure of (P)PDDL planning problems to learn a common set of weights that can be applied to any problem in a domain. By mimicking the actions chosen by a traditional, non-learning planner on a handful of small problems in a domain, ASNets are able to learn a generalised reactive policy that can quickly solve much larger instances from the domain. This work extends the AS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01362","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/1908.01362/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-05T01:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8MwJF9P+wpvmfZhdxUZtpPHGjeXiPWnBjocWf1gTaYcXiJ1fTKVNDdTC1fJ+IpaMmrnCxoDKIs2j6b5XP0S3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:44:37.171834Z"},"content_sha256":"176efad385d00347aff31e608c0999525646e8c18f7db002bec2ef069ff1e725","schema_version":"1.0","event_id":"sha256:176efad385d00347aff31e608c0999525646e8c18f7db002bec2ef069ff1e725"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHGOEB2D5GTXUBW5CDQSKILXN3/bundle.json","state_url":"https://pith.science/pith/XHGOEB2D5GTXUBW5CDQSKILXN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHGOEB2D5GTXUBW5CDQSKILXN3/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-16T08:44:37Z","links":{"resolver":"https://pith.science/pith/XHGOEB2D5GTXUBW5CDQSKILXN3","bundle":"https://pith.science/pith/XHGOEB2D5GTXUBW5CDQSKILXN3/bundle.json","state":"https://pith.science/pith/XHGOEB2D5GTXUBW5CDQSKILXN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHGOEB2D5GTXUBW5CDQSKILXN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XHGOEB2D5GTXUBW5CDQSKILXN3","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":"d738c23dc1a4b540b8d6bd53fc4e42389421d1486724a8f40fa588a4d7a4b1bf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2019-08-04T15:37:13Z","title_canon_sha256":"8486eb3a04d73f0919886a099dabb5905bf33c4bf52eb8f82338b6dc974eccaa"},"schema_version":"1.0","source":{"id":"1908.01362","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01362","created_at":"2026-07-05T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01362v2","created_at":"2026-07-05T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01362","created_at":"2026-07-05T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"XHGOEB2D5GTX","created_at":"2026-07-05T01:00:12Z"},{"alias_kind":"pith_short_16","alias_value":"XHGOEB2D5GTXUBW5","created_at":"2026-07-05T01:00:12Z"},{"alias_kind":"pith_short_8","alias_value":"XHGOEB2D","created_at":"2026-07-05T01:00:12Z"}],"graph_snapshots":[{"event_id":"sha256:176efad385d00347aff31e608c0999525646e8c18f7db002bec2ef069ff1e725","target":"graph","created_at":"2026-07-05T01:00:12Z","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/1908.01362/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we discuss the learning of generalised policies for probabilistic and classical planning problems using Action Schema Networks (ASNets). The ASNet is a neural network architecture that exploits the relational structure of (P)PDDL planning problems to learn a common set of weights that can be applied to any problem in a domain. By mimicking the actions chosen by a traditional, non-learning planner on a handful of small problems in a domain, ASNets are able to learn a generalised reactive policy that can quickly solve much larger instances from the domain. This work extends the AS","authors_text":"Felipe Trevizan, Lexing Xie, Sam Toyer, Sylvie Thi\\'ebaux","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2019-08-04T15:37:13Z","title":"ASNets: Deep Learning for Generalised Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01362","kind":"arxiv","version":2},"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:fe81105eac9f9c2da940ff3ca1875159a53014d21dfb0d8ea0e2e679550b200d","target":"record","created_at":"2026-07-05T01:00:12Z","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":"d738c23dc1a4b540b8d6bd53fc4e42389421d1486724a8f40fa588a4d7a4b1bf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2019-08-04T15:37:13Z","title_canon_sha256":"8486eb3a04d73f0919886a099dabb5905bf33c4bf52eb8f82338b6dc974eccaa"},"schema_version":"1.0","source":{"id":"1908.01362","kind":"arxiv","version":2}},"canonical_sha256":"b9cce20743e9a77a06dd10e12521776ed613543e5b2c8b8361cb9edc04ccdf0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9cce20743e9a77a06dd10e12521776ed613543e5b2c8b8361cb9edc04ccdf0b","first_computed_at":"2026-07-05T01:00:12.911661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:00:12.911661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s/GKdsjprTaQoXIvJCa0mm3NtYQL/skKD5vTjWpuVW3Tk4Bli8ts33HmXoBW7TBXjlyL3mg1QGy1zDUDkV2AAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:00:12.912088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01362","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe81105eac9f9c2da940ff3ca1875159a53014d21dfb0d8ea0e2e679550b200d","sha256:176efad385d00347aff31e608c0999525646e8c18f7db002bec2ef069ff1e725"],"state_sha256":"f5a0a73d37f88117a54ff4150eb02e12111d65e7d2870ae847082644a4bd489f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOxbWNcLuoNL+vyzpgwhlmE69yXgYORZKiSd0iGilOvPKNJF+Qg5pnOzAzpwh6s12w26vT2+0D2eDsjmrUSBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:44:37.176167Z","bundle_sha256":"d762f6d27492c99001d7fe177efa043d3c616929805cef2e2d874237f3909538"}}