{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:67ZNVXGNDUCXZ3CQSP5NUPISXY","short_pith_number":"pith:67ZNVXGN","canonical_record":{"source":{"id":"1802.09261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-26T11:56:11Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"2251b3fff806b982053b16c7a26e819a99068b0f3b4b01baa3a8946bee2f9a06","abstract_canon_sha256":"e66b184991af775599e9d3b2462ca1f58139caaf4d995cb738b476f976961ef0"},"schema_version":"1.0"},"canonical_sha256":"f7f2dadccd1d057cec5093fada3d12be3e50c6e257d32b0fa0dd929524d63e8f","source":{"kind":"arxiv","id":"1802.09261","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09261","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09261v2","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09261","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"pith_short_12","alias_value":"67ZNVXGNDUCX","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"67ZNVXGNDUCXZ3CQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"67ZNVXGN","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:67ZNVXGNDUCXZ3CQSP5NUPISXY","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-26T11:56:11Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"2251b3fff806b982053b16c7a26e819a99068b0f3b4b01baa3a8946bee2f9a06","abstract_canon_sha256":"e66b184991af775599e9d3b2462ca1f58139caaf4d995cb738b476f976961ef0"},"schema_version":"1.0"},"canonical_sha256":"f7f2dadccd1d057cec5093fada3d12be3e50c6e257d32b0fa0dd929524d63e8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:31.943410Z","signature_b64":"1XIX/M/JsWBIApIdvZapbmP3ia5AG5VtxtR9snR+IhuzXYoq9xmGc6jPdIPXGkxslY2BwMnXHWjHeQ9IlU/8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f2dadccd1d057cec5093fada3d12be3e50c6e257d32b0fa0dd929524d63e8f","last_reissued_at":"2026-05-18T00:05:31.942969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:31.942969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09261","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:05:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UYDrDO0AYEFFaVlVXW1zJDfPryf/v8OxuJ4MNzdpR5PhKCA9F+XbU2rWEycZR201BMac82cBiPv1Rha/7t+3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:31:27.269636Z"},"content_sha256":"7dad4a71a36320392817f6868bfd9ecd8d1d0aa73e1a10a5a44bcb9813300ffb","schema_version":"1.0","event_id":"sha256:7dad4a71a36320392817f6868bfd9ecd8d1d0aa73e1a10a5a44bcb9813300ffb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:67ZNVXGNDUCXZ3CQSP5NUPISXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HBST: A Hamming Distance embedding Binary Search Tree for Visual Place Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Dominik Schlegel, Giorgio Grisetti","submitted_at":"2018-02-26T11:56:11Z","abstract_excerpt":"Reliable and efficient Visual Place Recognition is a major building block of modern SLAM systems. Leveraging on our prior work, in this paper we present a Hamming Distance embedding Binary Search Tree (HBST) approach for binary Descriptor Matching and Image Retrieval. HBST allows for descriptor Search and Insertion in logarithmic time by exploiting particular properties of binary Feature descriptors. We support the idea behind our search structure with a thorough analysis on the exploited descriptor properties and their effects on completeness and complexity of search and insertion. To validat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09261","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:05:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vkbknT0wz13RG//18D/oEkl7RrtNu676uBHbLGKFlmofjMUXxTuU2zgUpzKr4XquXyr4pwQ5NINoUr2rYzRdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:31:27.270300Z"},"content_sha256":"b7bb18393eb23b644791caa13ccb20323cf30dd90c735cb36ee20d5e0097f2a5","schema_version":"1.0","event_id":"sha256:b7bb18393eb23b644791caa13ccb20323cf30dd90c735cb36ee20d5e0097f2a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67ZNVXGNDUCXZ3CQSP5NUPISXY/bundle.json","state_url":"https://pith.science/pith/67ZNVXGNDUCXZ3CQSP5NUPISXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67ZNVXGNDUCXZ3CQSP5NUPISXY/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-06-06T20:31:27Z","links":{"resolver":"https://pith.science/pith/67ZNVXGNDUCXZ3CQSP5NUPISXY","bundle":"https://pith.science/pith/67ZNVXGNDUCXZ3CQSP5NUPISXY/bundle.json","state":"https://pith.science/pith/67ZNVXGNDUCXZ3CQSP5NUPISXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67ZNVXGNDUCXZ3CQSP5NUPISXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:67ZNVXGNDUCXZ3CQSP5NUPISXY","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":"e66b184991af775599e9d3b2462ca1f58139caaf4d995cb738b476f976961ef0","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-26T11:56:11Z","title_canon_sha256":"2251b3fff806b982053b16c7a26e819a99068b0f3b4b01baa3a8946bee2f9a06"},"schema_version":"1.0","source":{"id":"1802.09261","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09261","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09261v2","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09261","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"pith_short_12","alias_value":"67ZNVXGNDUCX","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"67ZNVXGNDUCXZ3CQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"67ZNVXGN","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:b7bb18393eb23b644791caa13ccb20323cf30dd90c735cb36ee20d5e0097f2a5","target":"graph","created_at":"2026-05-18T00:05:31Z","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":"Reliable and efficient Visual Place Recognition is a major building block of modern SLAM systems. Leveraging on our prior work, in this paper we present a Hamming Distance embedding Binary Search Tree (HBST) approach for binary Descriptor Matching and Image Retrieval. HBST allows for descriptor Search and Insertion in logarithmic time by exploiting particular properties of binary Feature descriptors. We support the idea behind our search structure with a thorough analysis on the exploited descriptor properties and their effects on completeness and complexity of search and insertion. To validat","authors_text":"Dominik Schlegel, Giorgio Grisetti","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-26T11:56:11Z","title":"HBST: A Hamming Distance embedding Binary Search Tree for Visual Place Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09261","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:7dad4a71a36320392817f6868bfd9ecd8d1d0aa73e1a10a5a44bcb9813300ffb","target":"record","created_at":"2026-05-18T00:05:31Z","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":"e66b184991af775599e9d3b2462ca1f58139caaf4d995cb738b476f976961ef0","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-26T11:56:11Z","title_canon_sha256":"2251b3fff806b982053b16c7a26e819a99068b0f3b4b01baa3a8946bee2f9a06"},"schema_version":"1.0","source":{"id":"1802.09261","kind":"arxiv","version":2}},"canonical_sha256":"f7f2dadccd1d057cec5093fada3d12be3e50c6e257d32b0fa0dd929524d63e8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7f2dadccd1d057cec5093fada3d12be3e50c6e257d32b0fa0dd929524d63e8f","first_computed_at":"2026-05-18T00:05:31.942969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:31.942969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1XIX/M/JsWBIApIdvZapbmP3ia5AG5VtxtR9snR+IhuzXYoq9xmGc6jPdIPXGkxslY2BwMnXHWjHeQ9IlU/8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:31.943410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09261","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dad4a71a36320392817f6868bfd9ecd8d1d0aa73e1a10a5a44bcb9813300ffb","sha256:b7bb18393eb23b644791caa13ccb20323cf30dd90c735cb36ee20d5e0097f2a5"],"state_sha256":"a0e13628c30d3426aaa69bbade1f5532c4d4f6195894306db45a49b7adb97804"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ov5cGbfRqwDEz8hQzzGSKOkHZjqUcXhEIWmYFL30cWYijmD97fY6qJX53kRLmRZHoMmEi9K0HrP2NLDDLJpoBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:31:27.274046Z","bundle_sha256":"02d1fdfa1c2af12770a1b2736eefaa0267d6b1988683a509b723af1e050eb019"}}