{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:A6DOFS2LSIEB7LFZCZ2YWM22QQ","short_pith_number":"pith:A6DOFS2L","schema_version":"1.0","canonical_sha256":"0786e2cb4b92081facb916758b335a842ee8b9e527d3fd00e3f50802d05b77ef","source":{"kind":"arxiv","id":"1905.11068","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.11068","created_at":"2026-05-17T23:41:52.969002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11068v2","created_at":"2026-05-17T23:41:52.969002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11068","created_at":"2026-05-17T23:41:52.969002+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6DOFS2LSIEB","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6DOFS2LSIEB7LFZ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6DOFS2L","created_at":"2026-05-18T12:33:12.712433+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/A6DOFS2LSIEB7LFZCZ2YWM22QQ","json":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ.json","graph_json":"https://pith.science/api/pith-number/A6DOFS2LSIEB7LFZCZ2YWM22QQ/graph.json","events_json":"https://pith.science/api/pith-number/A6DOFS2LSIEB7LFZCZ2YWM22QQ/events.json","paper":"https://pith.science/paper/A6DOFS2L"},"agent_actions":{"view_html":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ","download_json":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ.json","view_paper":"https://pith.science/paper/A6DOFS2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11068&json=true","fetch_graph":"https://pith.science/api/pith-number/A6DOFS2LSIEB7LFZCZ2YWM22QQ/graph.json","fetch_events":"https://pith.science/api/pith-number/A6DOFS2LSIEB7LFZCZ2YWM22QQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/action/storage_attestation","attest_author":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/action/author_attestation","sign_citation":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/action/citation_signature","submit_replication":"https://pith.science/pith/A6DOFS2LSIEB7LFZCZ2YWM22QQ/action/replication_record"}},"created_at":"2026-05-17T23:41:52.969002+00:00","updated_at":"2026-05-17T23:41:52.969002+00:00"}