{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WMMMXQN6FRUGF3NZHYH2YVC7QX","short_pith_number":"pith:WMMMXQN6","schema_version":"1.0","canonical_sha256":"b318cbc1be2c6862edb93e0fac545f85f71ef7aadbfcf22268b4ad1cbd5e0f82","source":{"kind":"arxiv","id":"1806.06408","version":1},"attestation_state":"computed","paper":{"title":"Gated Path Planning Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Devendra Singh Chaplot, Emilio Parisotto, Eric Xing, Lisa Lee, Ruslan Salakhutdinov","submitted_at":"2018-06-17T16:32:52Z","abstract_excerpt":"Value Iteration Networks (VINs) are effective differentiable path planning modules that can be used by agents to perform navigation while still maintaining end-to-end differentiability of the entire architecture. Despite their effectiveness, they suffer from several disadvantages including training instability, random seed sensitivity, and other optimization problems. In this work, we reframe VINs as recurrent-convolutional networks which demonstrates that VINs couple recurrent convolutions with an unconventional max-pooling activation. From this perspective, we argue that standard gated recur"},"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":"1806.06408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-17T16:32:52Z","cross_cats_sorted":["cs.AI","cs.RO","stat.ML"],"title_canon_sha256":"880bf5f2f0ad2491850b5d7d536248454c2663239db139dbd17d39d39322163b","abstract_canon_sha256":"5eb4a49d93afa6534a0c36a921487f9f52e54246316baff0fde3f7906487cca6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:02.561375Z","signature_b64":"tjwgG7SEzdSnFbihu05Yl4KuY5LwfpnH++2Y6uINH6GNCkT/4ghTzK9sXoxbd1EWQTbHRBlJ3zUnjqhjYGyLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b318cbc1be2c6862edb93e0fac545f85f71ef7aadbfcf22268b4ad1cbd5e0f82","last_reissued_at":"2026-05-18T00:13:02.560682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:02.560682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gated Path Planning Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Devendra Singh Chaplot, Emilio Parisotto, Eric Xing, Lisa Lee, Ruslan Salakhutdinov","submitted_at":"2018-06-17T16:32:52Z","abstract_excerpt":"Value Iteration Networks (VINs) are effective differentiable path planning modules that can be used by agents to perform navigation while still maintaining end-to-end differentiability of the entire architecture. Despite their effectiveness, they suffer from several disadvantages including training instability, random seed sensitivity, and other optimization problems. In this work, we reframe VINs as recurrent-convolutional networks which demonstrates that VINs couple recurrent convolutions with an unconventional max-pooling activation. From this perspective, we argue that standard gated recur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06408","kind":"arxiv","version":1},"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":"1806.06408","created_at":"2026-05-18T00:13:02.560794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.06408v1","created_at":"2026-05-18T00:13:02.560794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06408","created_at":"2026-05-18T00:13:02.560794+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMMMXQN6FRUG","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMMMXQN6FRUGF3NZ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMMMXQN6","created_at":"2026-05-18T12:33:01.666342+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/WMMMXQN6FRUGF3NZHYH2YVC7QX","json":"https://pith.science/pith/WMMMXQN6FRUGF3NZHYH2YVC7QX.json","graph_json":"https://pith.science/api/pith-number/WMMMXQN6FRUGF3NZHYH2YVC7QX/graph.json","events_json":"https://pith.science/api/pith-number/WMMMXQN6FRUGF3NZHYH2YVC7QX/events.json","paper":"https://pith.science/paper/WMMMXQN6"},"agent_actions":{"view_html":"https://pith.science/pith/WMMMXQN6FRUGF3NZHYH2YVC7QX","download_json":"https://pith.science/pith/WMMMXQN6FRUGF3NZHYH2YVC7QX.json","view_paper":"https://pith.science/paper/WMMMXQN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.06408&json=true","fetch_graph":"https://pith.science/api/pith-number/WMMMXQN6FRUGF3NZHYH2YVC7QX/graph.json","fetch_events":"https://pith.science/api/pith-number/WMMMXQN6FRUGF3NZHYH2YVC7QX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMMMXQN6FRUGF3NZHYH2YVC7QX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMMMXQN6FRUGF3NZHYH2YVC7QX/action/storage_attestation","attest_author":"https://pith.science/pith/WMMMXQN6FRUGF3NZHYH2YVC7QX/action/author_attestation","sign_citation":"https://pith.science/pith/WMMMXQN6FRUGF3NZHYH2YVC7QX/action/citation_signature","submit_replication":"https://pith.science/pith/WMMMXQN6FRUGF3NZHYH2YVC7QX/action/replication_record"}},"created_at":"2026-05-18T00:13:02.560794+00:00","updated_at":"2026-05-18T00:13:02.560794+00:00"}