{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:A6DOFS2LSIEB7LFZCZ2YWM22QQ","short_pith_number":"pith:A6DOFS2L","canonical_record":{"source":{"id":"1905.11068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-27T09:17:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6eb5da1e4e992155c732651e24625beeb79e229380201783f5bdfd0078f224ec","abstract_canon_sha256":"626363377bbb2ad6342c612ca84a575ff03cab13e4e6749c5b20e562a32007ad"},"schema_version":"1.0"},"canonical_sha256":"0786e2cb4b92081facb916758b335a842ee8b9e527d3fd00e3f50802d05b77ef","source":{"kind":"arxiv","id":"1905.11068","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11068","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11068v2","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11068","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"A6DOFS2LSIEB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A6DOFS2LSIEB7LFZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A6DOFS2L","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:A6DOFS2LSIEB7LFZCZ2YWM22QQ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-27T09:17:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6eb5da1e4e992155c732651e24625beeb79e229380201783f5bdfd0078f224ec","abstract_canon_sha256":"626363377bbb2ad6342c612ca84a575ff03cab13e4e6749c5b20e562a32007ad"},"schema_version":"1.0"},"canonical_sha256":"0786e2cb4b92081facb916758b335a842ee8b9e527d3fd00e3f50802d05b77ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:52.969478Z","signature_b64":"Qk5yVy8hffUwOJXaFVeJPoeHadZMlej4OBtrVROeUQnueWDqwZS6JL+H7x9GD8RUlsqN2J7jr7RYOrypO8QTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0786e2cb4b92081facb916758b335a842ee8b9e527d3fd00e3f50802d05b77ef","last_reissued_at":"2026-05-17T23:41:52.968926Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:52.968926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11068","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-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/lL8K2m6BTvSljRCLyncMdbQ5Ptl7ac3k1fPidmhIQNMqc64ptpK57kNAr4r7TlmYXKi3DobrITN0FOXyHqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:35:14.075455Z"},"content_sha256":"85c5cc126049514d297f00ffb4aa9629b7e06981fc967b3a72dc92cbca02449b","schema_version":"1.0","event_id":"sha256:85c5cc126049514d297f00ffb4aa9629b7e06981fc967b3a72dc92cbca02449b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:A6DOFS2LSIEB7LFZCZ2YWM22QQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Value Iteration Networks on Multiple Levels of Abstraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Daniel Schleich, Sven Behnke, Tobias Klamt","submitted_at":"2019-05-27T09:17:33Z","abstract_excerpt":"Learning-based methods are promising to plan robot motion without performing extensive search, which is needed by many non-learning approaches. Recently, Value Iteration Networks (VINs) received much interest since---in contrast to standard CNN-based architectures---they learn goal-directed behaviors which generalize well to unseen domains. However, VINs are restricted to small and low-dimensional domains, limiting their applicability to real-world planning problems.\n  To address this issue, we propose to extend VINs to representations with multiple levels of abstraction. While the vicinity of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11068","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-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+NOZiCpp9kceM0VfO1Vc//AVV5aBUJnXA3i8QcGUUazfbuV9+z/BCNyhwySAOAWwU/QZ4YPu0/iwDPtadXgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:35:14.076243Z"},"content_sha256":"33c1ed0c0c1afc254720d0760027b2ec3e52b06fde570c3f780e681bd3a90d88","schema_version":"1.0","event_id":"sha256:33c1ed0c0c1afc254720d0760027b2ec3e52b06fde570c3f780e681bd3a90d88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/bundle.json","state_url":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/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-06-11T06:35:14Z","links":{"resolver":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ","bundle":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/bundle.json","state":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:A6DOFS2LSIEB7LFZCZ2YWM22QQ","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":"626363377bbb2ad6342c612ca84a575ff03cab13e4e6749c5b20e562a32007ad","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-27T09:17:33Z","title_canon_sha256":"6eb5da1e4e992155c732651e24625beeb79e229380201783f5bdfd0078f224ec"},"schema_version":"1.0","source":{"id":"1905.11068","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11068","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11068v2","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11068","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"A6DOFS2LSIEB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A6DOFS2LSIEB7LFZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A6DOFS2L","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:33c1ed0c0c1afc254720d0760027b2ec3e52b06fde570c3f780e681bd3a90d88","target":"graph","created_at":"2026-05-17T23:41:52Z","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":"Learning-based methods are promising to plan robot motion without performing extensive search, which is needed by many non-learning approaches. Recently, Value Iteration Networks (VINs) received much interest since---in contrast to standard CNN-based architectures---they learn goal-directed behaviors which generalize well to unseen domains. However, VINs are restricted to small and low-dimensional domains, limiting their applicability to real-world planning problems.\n  To address this issue, we propose to extend VINs to representations with multiple levels of abstraction. While the vicinity of","authors_text":"Daniel Schleich, Sven Behnke, Tobias Klamt","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-27T09:17:33Z","title":"Value Iteration Networks on Multiple Levels of Abstraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11068","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:85c5cc126049514d297f00ffb4aa9629b7e06981fc967b3a72dc92cbca02449b","target":"record","created_at":"2026-05-17T23:41:52Z","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":"626363377bbb2ad6342c612ca84a575ff03cab13e4e6749c5b20e562a32007ad","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-27T09:17:33Z","title_canon_sha256":"6eb5da1e4e992155c732651e24625beeb79e229380201783f5bdfd0078f224ec"},"schema_version":"1.0","source":{"id":"1905.11068","kind":"arxiv","version":2}},"canonical_sha256":"0786e2cb4b92081facb916758b335a842ee8b9e527d3fd00e3f50802d05b77ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0786e2cb4b92081facb916758b335a842ee8b9e527d3fd00e3f50802d05b77ef","first_computed_at":"2026-05-17T23:41:52.968926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:52.968926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qk5yVy8hffUwOJXaFVeJPoeHadZMlej4OBtrVROeUQnueWDqwZS6JL+H7x9GD8RUlsqN2J7jr7RYOrypO8QTBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:52.969478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11068","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85c5cc126049514d297f00ffb4aa9629b7e06981fc967b3a72dc92cbca02449b","sha256:33c1ed0c0c1afc254720d0760027b2ec3e52b06fde570c3f780e681bd3a90d88"],"state_sha256":"4d7ec1066c5802de1408bd742cae38d333f65a68159d44ca77573556f94a429a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8zWAs3cSS3n2G/TSdXLhlgNCUCRSbnbVJ9oChXYB3RuGXmjcVeCu+4KvfxF/LXwr7GaX5PH4XGOtMkEH6VVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:35:14.080268Z","bundle_sha256":"313bcb0e94b4991999175da947ed5608fe7195d6124ea415169637df1f96bbf9"}}