{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EOTXYI3KSEU7QLBBRVBCVFT62F","short_pith_number":"pith:EOTXYI3K","schema_version":"1.0","canonical_sha256":"23a77c236a9129f82c218d422a967ed16d723ee213ed68dd3b4efb7838a7db7e","source":{"kind":"arxiv","id":"1705.10739","version":1},"attestation_state":"computed","paper":{"title":"Efficient Decentralized Visual Place Recognition From Full-Image Descriptors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Davide Scaramuzza, Titus Cieslewski","submitted_at":"2017-05-30T16:43:57Z","abstract_excerpt":"In this paper, we discuss the adaptation of our decentralized place recognition method described in [1] to full image descriptors. As we had shown, the key to making a scalable decentralized visual place recognition lies in exploting deterministic key assignment in a distributed key-value map. Through this, it is possible to reduce bandwidth by up to a factor of n, the robot count, by casting visual place recognition to a key-value lookup problem. In [1], we exploited this for the bag-of-words method [3], [4]. Our method of casting bag-of-words, however, results in a complex decentralized syst"},"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":"1705.10739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-30T16:43:57Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"1cf4b6694f94efd07e732d4d7d94b5a7baaaa7f07f05411fa0bf0940e9524447","abstract_canon_sha256":"5ac8be5d9cf095892be7b6703d11291bf8022bf1dc70a4274064be555b596144"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:44.663871Z","signature_b64":"IEQmtfuyMBS9ezf78B0tbUoo2kbHMNTsjV0lPOUogtGQml+sxa/wvLwwkyFciprmjmEkpzMo5KyIKYamBvS5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23a77c236a9129f82c218d422a967ed16d723ee213ed68dd3b4efb7838a7db7e","last_reissued_at":"2026-05-18T00:20:44.663150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:44.663150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Decentralized Visual Place Recognition From Full-Image Descriptors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Davide Scaramuzza, Titus Cieslewski","submitted_at":"2017-05-30T16:43:57Z","abstract_excerpt":"In this paper, we discuss the adaptation of our decentralized place recognition method described in [1] to full image descriptors. As we had shown, the key to making a scalable decentralized visual place recognition lies in exploting deterministic key assignment in a distributed key-value map. Through this, it is possible to reduce bandwidth by up to a factor of n, the robot count, by casting visual place recognition to a key-value lookup problem. In [1], we exploited this for the bag-of-words method [3], [4]. Our method of casting bag-of-words, however, results in a complex decentralized syst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10739","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":"1705.10739","created_at":"2026-05-18T00:20:44.663260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10739v1","created_at":"2026-05-18T00:20:44.663260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10739","created_at":"2026-05-18T00:20:44.663260+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOTXYI3KSEU7","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOTXYI3KSEU7QLBB","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOTXYI3K","created_at":"2026-05-18T12:31:12.930513+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/EOTXYI3KSEU7QLBBRVBCVFT62F","json":"https://pith.science/pith/EOTXYI3KSEU7QLBBRVBCVFT62F.json","graph_json":"https://pith.science/api/pith-number/EOTXYI3KSEU7QLBBRVBCVFT62F/graph.json","events_json":"https://pith.science/api/pith-number/EOTXYI3KSEU7QLBBRVBCVFT62F/events.json","paper":"https://pith.science/paper/EOTXYI3K"},"agent_actions":{"view_html":"https://pith.science/pith/EOTXYI3KSEU7QLBBRVBCVFT62F","download_json":"https://pith.science/pith/EOTXYI3KSEU7QLBBRVBCVFT62F.json","view_paper":"https://pith.science/paper/EOTXYI3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10739&json=true","fetch_graph":"https://pith.science/api/pith-number/EOTXYI3KSEU7QLBBRVBCVFT62F/graph.json","fetch_events":"https://pith.science/api/pith-number/EOTXYI3KSEU7QLBBRVBCVFT62F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOTXYI3KSEU7QLBBRVBCVFT62F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOTXYI3KSEU7QLBBRVBCVFT62F/action/storage_attestation","attest_author":"https://pith.science/pith/EOTXYI3KSEU7QLBBRVBCVFT62F/action/author_attestation","sign_citation":"https://pith.science/pith/EOTXYI3KSEU7QLBBRVBCVFT62F/action/citation_signature","submit_replication":"https://pith.science/pith/EOTXYI3KSEU7QLBBRVBCVFT62F/action/replication_record"}},"created_at":"2026-05-18T00:20:44.663260+00:00","updated_at":"2026-05-18T00:20:44.663260+00:00"}