{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O6A4NWSQMQNQ5FSZKM6L4CGAUI","short_pith_number":"pith:O6A4NWSQ","schema_version":"1.0","canonical_sha256":"7781c6da50641b0e9659533cbe08c0a23c98914890e9b1718b00ade6d194ae61","source":{"kind":"arxiv","id":"1803.00653","version":1},"attestation_state":"computed","paper":{"title":"Semi-parametric Topological Memory for Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.RO"],"primary_cat":"cs.LG","authors_text":"Alexey Dosovitskiy, Nikolay Savinov, Vladlen Koltun","submitted_at":"2018-03-01T22:50:35Z","abstract_excerpt":"We introduce a new memory architecture for navigation in previously unseen environments, inspired by landmark-based navigation in animals. The proposed semi-parametric topological memory (SPTM) consists of a (non-parametric) graph with nodes corresponding to locations in the environment and a (parametric) deep network capable of retrieving nodes from the graph based on observations. The graph stores no metric information, only connectivity of locations corresponding to the nodes. We use SPTM as a planning module in a navigation system. Given only 5 minutes of footage of a previously unseen maz"},"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":"1803.00653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-01T22:50:35Z","cross_cats_sorted":["cs.AI","cs.CV","cs.RO"],"title_canon_sha256":"285382f92587c514d348e60027c24787cb76d8b96b0ee7383c318c9990bd246c","abstract_canon_sha256":"da7ecebf06e76f92630c417325337d95e87c6804d9548112897876326b2ac447"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:08.253733Z","signature_b64":"lW3cBm3tJkb61uyugSVYr6kZsoDUz7sgmRP1tHgSdHYfBN3A2S0OC7ja/pbWodljx1xWVg9/wChVDZjVftAOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7781c6da50641b0e9659533cbe08c0a23c98914890e9b1718b00ade6d194ae61","last_reissued_at":"2026-05-18T00:22:08.253166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:08.253166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-parametric Topological Memory for Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.RO"],"primary_cat":"cs.LG","authors_text":"Alexey Dosovitskiy, Nikolay Savinov, Vladlen Koltun","submitted_at":"2018-03-01T22:50:35Z","abstract_excerpt":"We introduce a new memory architecture for navigation in previously unseen environments, inspired by landmark-based navigation in animals. The proposed semi-parametric topological memory (SPTM) consists of a (non-parametric) graph with nodes corresponding to locations in the environment and a (parametric) deep network capable of retrieving nodes from the graph based on observations. The graph stores no metric information, only connectivity of locations corresponding to the nodes. We use SPTM as a planning module in a navigation system. Given only 5 minutes of footage of a previously unseen maz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00653","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":"1803.00653","created_at":"2026-05-18T00:22:08.253246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00653v1","created_at":"2026-05-18T00:22:08.253246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00653","created_at":"2026-05-18T00:22:08.253246+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6A4NWSQMQNQ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6A4NWSQMQNQ5FSZ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6A4NWSQ","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2602.06974","citing_title":"FeudalNav: A Simple Framework for Visual Navigation","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2602.11183","citing_title":"Mitigating Error Accumulation in Continuous Navigation via Memory-Augmented Kalman Filtering","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2605.01862","citing_title":"QHyer: Q-conditioned Hybrid Attention-mamba Transformer for Offline Goal-conditioned RL","ref_index":297,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05351","citing_title":"AnyImageNav: Any-View Geometry for Precise Last-Meter Image-Goal Navigation","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2204.01691","citing_title":"Do As I Can, Not As I Say: Grounding Language in Robotic Affordances","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17679","citing_title":"A Hamilton-Jacobi Reachability-Guided Search Framework for Efficient and Safe Indoor Planar Robot Navigation","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20627","citing_title":"Occupancy Reward Shaping: Improving Credit Assignment for Offline Goal-Conditioned Reinforcement Learning","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O6A4NWSQMQNQ5FSZKM6L4CGAUI","json":"https://pith.science/pith/O6A4NWSQMQNQ5FSZKM6L4CGAUI.json","graph_json":"https://pith.science/api/pith-number/O6A4NWSQMQNQ5FSZKM6L4CGAUI/graph.json","events_json":"https://pith.science/api/pith-number/O6A4NWSQMQNQ5FSZKM6L4CGAUI/events.json","paper":"https://pith.science/paper/O6A4NWSQ"},"agent_actions":{"view_html":"https://pith.science/pith/O6A4NWSQMQNQ5FSZKM6L4CGAUI","download_json":"https://pith.science/pith/O6A4NWSQMQNQ5FSZKM6L4CGAUI.json","view_paper":"https://pith.science/paper/O6A4NWSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00653&json=true","fetch_graph":"https://pith.science/api/pith-number/O6A4NWSQMQNQ5FSZKM6L4CGAUI/graph.json","fetch_events":"https://pith.science/api/pith-number/O6A4NWSQMQNQ5FSZKM6L4CGAUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6A4NWSQMQNQ5FSZKM6L4CGAUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6A4NWSQMQNQ5FSZKM6L4CGAUI/action/storage_attestation","attest_author":"https://pith.science/pith/O6A4NWSQMQNQ5FSZKM6L4CGAUI/action/author_attestation","sign_citation":"https://pith.science/pith/O6A4NWSQMQNQ5FSZKM6L4CGAUI/action/citation_signature","submit_replication":"https://pith.science/pith/O6A4NWSQMQNQ5FSZKM6L4CGAUI/action/replication_record"}},"created_at":"2026-05-18T00:22:08.253246+00:00","updated_at":"2026-05-18T00:22:08.253246+00:00"}