{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:76AWZFNOGTTA36DJGWKQGKCI3G","short_pith_number":"pith:76AWZFNO","canonical_record":{"source":{"id":"1706.02416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T00:04:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"aa97ae834759e8781c29fb677f2682527eb48ab0f0a934e25d2c7bed0145b5b0","abstract_canon_sha256":"8f8d8148c8fc59b26fccce323fbc56d2972c3fff60ee11ce895587208e8cd2cb"},"schema_version":"1.0"},"canonical_sha256":"ff816c95ae34e60df8693595032848d9af3db016c4766d7a68f697bdfb896505","source":{"kind":"arxiv","id":"1706.02416","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02416","created_at":"2026-05-18T00:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02416v2","created_at":"2026-05-18T00:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02416","created_at":"2026-05-18T00:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"76AWZFNOGTTA","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"76AWZFNOGTTA36DJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"76AWZFNO","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:76AWZFNOGTTA36DJGWKQGKCI3G","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T00:04:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"aa97ae834759e8781c29fb677f2682527eb48ab0f0a934e25d2c7bed0145b5b0","abstract_canon_sha256":"8f8d8148c8fc59b26fccce323fbc56d2972c3fff60ee11ce895587208e8cd2cb"},"schema_version":"1.0"},"canonical_sha256":"ff816c95ae34e60df8693595032848d9af3db016c4766d7a68f697bdfb896505","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:58.788818Z","signature_b64":"u0OByrcIQom5PWZY4BdMKu2C9WHl0d7a2hazMhgU73JNLIsNecwpV6Xkcvm/bFvz4vEslsrLFM+KkwBy7SaUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff816c95ae34e60df8693595032848d9af3db016c4766d7a68f697bdfb896505","last_reissued_at":"2026-05-18T00:31:58.788453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:58.788453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02416","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:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1L9Yi9ZCa8SXYp2Al/teh1QSwvKjhEZE2fXEPnxT4Wth9b1qlTVKY8EUndLhX+4FweEDEXhNBiaJRuRbNBIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:33:48.373986Z"},"content_sha256":"768a8de8600c23c817d6b4299f5565bcbb2c6791cf5c4e3d914f20d183cc2e74","schema_version":"1.0","event_id":"sha256:768a8de8600c23c817d6b4299f5565bcbb2c6791cf5c4e3d914f20d183cc2e74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:76AWZFNOGTTA36DJGWKQGKCI3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Value Iteration Networks: Life Beyond Lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Colin Targonski, Hanyu Guo, Jelena Kova\\v{c}evi\\'c, Melissa C. Smith, Siheng Chen, Sufeng Niu","submitted_at":"2017-06-08T00:04:05Z","abstract_excerpt":"In this paper, we introduce a generalized value iteration network (GVIN), which is an end-to-end neural network planning module. GVIN emulates the value iteration algorithm by using a novel graph convolution operator, which enables GVIN to learn and plan on irregular spatial graphs. We propose three novel differentiable kernels as graph convolution operators and show that the embedding based kernel achieves the best performance. We further propose episodic Q-learning, an improvement upon traditional n-step Q-learning that stabilizes training for networks that contain a planning module. Lastly,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02416","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:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/Y0wkfTMx5rNZZSV90ORtBDvzUV7/uW1GVcmUdZx2L9GAqEAeyOdAlD10fzyDAunFxrpqzLFp7IBQr/Tx9hDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:33:48.374349Z"},"content_sha256":"021f7c74a46f4dd5963df4dac4818426dce844857dbedf5c5897df471c94e85a","schema_version":"1.0","event_id":"sha256:021f7c74a46f4dd5963df4dac4818426dce844857dbedf5c5897df471c94e85a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76AWZFNOGTTA36DJGWKQGKCI3G/bundle.json","state_url":"https://pith.science/pith/76AWZFNOGTTA36DJGWKQGKCI3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76AWZFNOGTTA36DJGWKQGKCI3G/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-19T07:33:48Z","links":{"resolver":"https://pith.science/pith/76AWZFNOGTTA36DJGWKQGKCI3G","bundle":"https://pith.science/pith/76AWZFNOGTTA36DJGWKQGKCI3G/bundle.json","state":"https://pith.science/pith/76AWZFNOGTTA36DJGWKQGKCI3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76AWZFNOGTTA36DJGWKQGKCI3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:76AWZFNOGTTA36DJGWKQGKCI3G","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":"8f8d8148c8fc59b26fccce323fbc56d2972c3fff60ee11ce895587208e8cd2cb","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T00:04:05Z","title_canon_sha256":"aa97ae834759e8781c29fb677f2682527eb48ab0f0a934e25d2c7bed0145b5b0"},"schema_version":"1.0","source":{"id":"1706.02416","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02416","created_at":"2026-05-18T00:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02416v2","created_at":"2026-05-18T00:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02416","created_at":"2026-05-18T00:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"76AWZFNOGTTA","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"76AWZFNOGTTA36DJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"76AWZFNO","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:021f7c74a46f4dd5963df4dac4818426dce844857dbedf5c5897df471c94e85a","target":"graph","created_at":"2026-05-18T00:31:58Z","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 a generalized value iteration network (GVIN), which is an end-to-end neural network planning module. GVIN emulates the value iteration algorithm by using a novel graph convolution operator, which enables GVIN to learn and plan on irregular spatial graphs. We propose three novel differentiable kernels as graph convolution operators and show that the embedding based kernel achieves the best performance. We further propose episodic Q-learning, an improvement upon traditional n-step Q-learning that stabilizes training for networks that contain a planning module. Lastly,","authors_text":"Colin Targonski, Hanyu Guo, Jelena Kova\\v{c}evi\\'c, Melissa C. Smith, Siheng Chen, Sufeng Niu","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T00:04:05Z","title":"Generalized Value Iteration Networks: Life Beyond Lattices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02416","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:768a8de8600c23c817d6b4299f5565bcbb2c6791cf5c4e3d914f20d183cc2e74","target":"record","created_at":"2026-05-18T00:31:58Z","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":"8f8d8148c8fc59b26fccce323fbc56d2972c3fff60ee11ce895587208e8cd2cb","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T00:04:05Z","title_canon_sha256":"aa97ae834759e8781c29fb677f2682527eb48ab0f0a934e25d2c7bed0145b5b0"},"schema_version":"1.0","source":{"id":"1706.02416","kind":"arxiv","version":2}},"canonical_sha256":"ff816c95ae34e60df8693595032848d9af3db016c4766d7a68f697bdfb896505","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff816c95ae34e60df8693595032848d9af3db016c4766d7a68f697bdfb896505","first_computed_at":"2026-05-18T00:31:58.788453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:58.788453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u0OByrcIQom5PWZY4BdMKu2C9WHl0d7a2hazMhgU73JNLIsNecwpV6Xkcvm/bFvz4vEslsrLFM+KkwBy7SaUDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:58.788818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02416","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:768a8de8600c23c817d6b4299f5565bcbb2c6791cf5c4e3d914f20d183cc2e74","sha256:021f7c74a46f4dd5963df4dac4818426dce844857dbedf5c5897df471c94e85a"],"state_sha256":"d9cf4cebead764ea313ca1eb6f11bf7ab1340fcd7ae172e2616f161a4a1bf6a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7b9YR3l1hBhFnqLxWr1BpCOJLZraIRjdEilRXfNnQV8Q62h8TSUvgvWEHKocreGr02qxO5lKAekAQNaaVZMLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T07:33:48.377277Z","bundle_sha256":"4fdf5660f66c719b388db0fd210c79ab4bc4910a01babe27671e8259471457fe"}}