{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5VAZHMGRYNFWAMDJWWN326K5EN","short_pith_number":"pith:5VAZHMGR","canonical_record":{"source":{"id":"1709.04271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-13T12:15:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0caf9112fff1f15a61a434032c31932b0b7dd690c298429ff6ce30f185ce7066","abstract_canon_sha256":"23005962a19b62b12b63f6d387024ec54caa96245c3f06e762e638bca60d3562"},"schema_version":"1.0"},"canonical_sha256":"ed4193b0d1c34b603069b59bbd795d234e8ae70c4968cba4d1356a8119f7e13f","source":{"kind":"arxiv","id":"1709.04271","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04271","created_at":"2026-05-18T00:27:27Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04271v2","created_at":"2026-05-18T00:27:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04271","created_at":"2026-05-18T00:27:27Z"},{"alias_kind":"pith_short_12","alias_value":"5VAZHMGRYNFW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5VAZHMGRYNFWAMDJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5VAZHMGR","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5VAZHMGRYNFWAMDJWWN326K5EN","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-13T12:15:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0caf9112fff1f15a61a434032c31932b0b7dd690c298429ff6ce30f185ce7066","abstract_canon_sha256":"23005962a19b62b12b63f6d387024ec54caa96245c3f06e762e638bca60d3562"},"schema_version":"1.0"},"canonical_sha256":"ed4193b0d1c34b603069b59bbd795d234e8ae70c4968cba4d1356a8119f7e13f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:27.760363Z","signature_b64":"EVVqXSzA5x4x1B2deId1pFoBtL3Cvgft4qqlVtBm3YTRtIod3HQnhhfbIIn2h2Uh3M3Chx1i8UGwy6/ocG2NAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed4193b0d1c34b603069b59bbd795d234e8ae70c4968cba4d1356a8119f7e13f","last_reissued_at":"2026-05-18T00:27:27.759514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:27.759514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04271","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-05-18T00:27:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlgDyhSgUvtYy4Gc+b7AuRsRTkGp/WH2oYCUdZMZqZ0yrUpJtpHxyDkF3Qood2Fz29VNQ+XH2ZeniMh0Y5mOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:03:59.995398Z"},"content_sha256":"aa9716b90c71f435e386937c26a4e927b257b7082af82164f57adcdfc0ce0ca6","schema_version":"1.0","event_id":"sha256:aa9716b90c71f435e386937c26a4e927b257b7082af82164f57adcdfc0ce0ca6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5VAZHMGRYNFWAMDJWWN326K5EN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Action Schema Networks: Generalised Policies with Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Felipe Trevizan, Lexing Xie, Sam Toyer, Sylvie Thi\\'ebaux","submitted_at":"2017-09-13T12:15:52Z","abstract_excerpt":"In this paper, we introduce the Action Schema Network (ASNet): a neural network architecture for learning generalised policies for probabilistic planning problems. By mimicking the relational structure of planning problems, ASNets are able to adopt a weight-sharing scheme which allows the network to be applied to any problem from a given planning domain. This allows the cost of training the network to be amortised over all problems in that domain. Further, we propose a training method which balances exploration and supervised training on small problems to produce a policy which remains robust "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04271","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":""},"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-05-18T00:27:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dj1St82/yHndysUGURTvJV/NUF7KUjBKAxHv7PySZ6B2Cy1HFQh6QpYUm+QEe/E4lzhljAayC5u86ipmLgkjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:03:59.995754Z"},"content_sha256":"70e8d65e7fb3c10e9195733c3764eceeb9c76b0d9f10969a6b3ff77604a4bb86","schema_version":"1.0","event_id":"sha256:70e8d65e7fb3c10e9195733c3764eceeb9c76b0d9f10969a6b3ff77604a4bb86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5VAZHMGRYNFWAMDJWWN326K5EN/bundle.json","state_url":"https://pith.science/pith/5VAZHMGRYNFWAMDJWWN326K5EN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5VAZHMGRYNFWAMDJWWN326K5EN/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-05-28T09:03:59Z","links":{"resolver":"https://pith.science/pith/5VAZHMGRYNFWAMDJWWN326K5EN","bundle":"https://pith.science/pith/5VAZHMGRYNFWAMDJWWN326K5EN/bundle.json","state":"https://pith.science/pith/5VAZHMGRYNFWAMDJWWN326K5EN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5VAZHMGRYNFWAMDJWWN326K5EN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5VAZHMGRYNFWAMDJWWN326K5EN","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":"23005962a19b62b12b63f6d387024ec54caa96245c3f06e762e638bca60d3562","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-13T12:15:52Z","title_canon_sha256":"0caf9112fff1f15a61a434032c31932b0b7dd690c298429ff6ce30f185ce7066"},"schema_version":"1.0","source":{"id":"1709.04271","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04271","created_at":"2026-05-18T00:27:27Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04271v2","created_at":"2026-05-18T00:27:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04271","created_at":"2026-05-18T00:27:27Z"},{"alias_kind":"pith_short_12","alias_value":"5VAZHMGRYNFW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5VAZHMGRYNFWAMDJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5VAZHMGR","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:70e8d65e7fb3c10e9195733c3764eceeb9c76b0d9f10969a6b3ff77604a4bb86","target":"graph","created_at":"2026-05-18T00:27:27Z","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"},"paper":{"abstract_excerpt":"In this paper, we introduce the Action Schema Network (ASNet): a neural network architecture for learning generalised policies for probabilistic planning problems. By mimicking the relational structure of planning problems, ASNets are able to adopt a weight-sharing scheme which allows the network to be applied to any problem from a given planning domain. This allows the cost of training the network to be amortised over all problems in that domain. Further, we propose a training method which balances exploration and supervised training on small problems to produce a policy which remains robust ","authors_text":"Felipe Trevizan, Lexing Xie, Sam Toyer, Sylvie Thi\\'ebaux","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-13T12:15:52Z","title":"Action Schema Networks: Generalised Policies with Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04271","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:aa9716b90c71f435e386937c26a4e927b257b7082af82164f57adcdfc0ce0ca6","target":"record","created_at":"2026-05-18T00:27:27Z","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":"23005962a19b62b12b63f6d387024ec54caa96245c3f06e762e638bca60d3562","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-13T12:15:52Z","title_canon_sha256":"0caf9112fff1f15a61a434032c31932b0b7dd690c298429ff6ce30f185ce7066"},"schema_version":"1.0","source":{"id":"1709.04271","kind":"arxiv","version":2}},"canonical_sha256":"ed4193b0d1c34b603069b59bbd795d234e8ae70c4968cba4d1356a8119f7e13f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed4193b0d1c34b603069b59bbd795d234e8ae70c4968cba4d1356a8119f7e13f","first_computed_at":"2026-05-18T00:27:27.759514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:27.759514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EVVqXSzA5x4x1B2deId1pFoBtL3Cvgft4qqlVtBm3YTRtIod3HQnhhfbIIn2h2Uh3M3Chx1i8UGwy6/ocG2NAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:27.760363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04271","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa9716b90c71f435e386937c26a4e927b257b7082af82164f57adcdfc0ce0ca6","sha256:70e8d65e7fb3c10e9195733c3764eceeb9c76b0d9f10969a6b3ff77604a4bb86"],"state_sha256":"06a21cf65878b9b9576311f0883ca2d031b7584b2cba57c5fc8acbfd528ef58a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqIpFErqIhNVIaCRF2MmgSvrDCAttt8/bd0IXdWza5DUMnKt6bBihHcd+KK2NdFZPya34VPyX8Z3RJkVZ2w2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:03:59.997828Z","bundle_sha256":"4ac3b8a34c9584e3d15762fc48c263d2324f2f5a808ed6ba3d0d644fc52736cd"}}