{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RX3KT7DVLOP4UZYOJFMIYHXYDT","short_pith_number":"pith:RX3KT7DV","canonical_record":{"source":{"id":"1709.05833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-18T09:36:13Z","cross_cats_sorted":[],"title_canon_sha256":"1834887a42d20f3928f1cd3a4659c75b82c586acfe7d189be1a95e86b681a362","abstract_canon_sha256":"7a79a922dee0fe9a38c8badf9af1cd320a268e3148d5bd1fb718f9391e2c459f"},"schema_version":"1.0"},"canonical_sha256":"8df6a9fc755b9fca670e49588c1ef81ceca327e400a41bece4bcf3ea2954d0a7","source":{"kind":"arxiv","id":"1709.05833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05833","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05833v1","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05833","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"RX3KT7DVLOP4","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RX3KT7DVLOP4UZYO","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RX3KT7DV","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RX3KT7DVLOP4UZYOJFMIYHXYDT","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-18T09:36:13Z","cross_cats_sorted":[],"title_canon_sha256":"1834887a42d20f3928f1cd3a4659c75b82c586acfe7d189be1a95e86b681a362","abstract_canon_sha256":"7a79a922dee0fe9a38c8badf9af1cd320a268e3148d5bd1fb718f9391e2c459f"},"schema_version":"1.0"},"canonical_sha256":"8df6a9fc755b9fca670e49588c1ef81ceca327e400a41bece4bcf3ea2954d0a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:59.201605Z","signature_b64":"kNfscR96QEOz4iRYtW5xQZvX/7ND94lUmzi+NCoW3xzLEz7aSS0oEosYNIeXfyRjI4J/NBdJCNDIsPy1V8ulDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8df6a9fc755b9fca670e49588c1ef81ceca327e400a41bece4bcf3ea2954d0a7","last_reissued_at":"2026-05-18T00:34:59.200880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:59.200880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05833","source_version":1,"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:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jSOe68qvZgy4ARJoL8fgxtAWhcXiInDZkjCMcjwS0UCj1eP0MRbS4T6FCZpLUDEkmDCNWsiH1D7ShUIXVP43DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:21:56.851418Z"},"content_sha256":"c260fe7169c291af6650183cc8e875b1466e1324f6353a7b298392f64b08af45","schema_version":"1.0","event_id":"sha256:c260fe7169c291af6650183cc8e875b1466e1324f6353a7b298392f64b08af45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RX3KT7DVLOP4UZYOJFMIYHXYDT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond SIFT using Binary features for Loop Closure Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guyue Zhou, Lan Xu, Lei Han, Lu Fang","submitted_at":"2017-09-18T09:36:13Z","abstract_excerpt":"In this paper a binary feature based Loop Closure Detection (LCD) method is proposed, which for the first time achieves higher precision-recall (PR) performance compared with state-of-the-art SIFT feature based approaches. The proposed system originates from our previous work Multi-Index hashing for Loop closure Detection (MILD), which employs Multi-Index Hashing (MIH)~\\cite{greene1994multi} for Approximate Nearest Neighbor (ANN) search of binary features. As the accuracy of MILD is limited by repeating textures and inaccurate image similarity measurement, burstiness handling is introduced to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05833","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"},"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:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UN+3x2BMOmi0iC8Wn1MJFn1cUC23H2mrJpX/LHwNAzwbw+0NGhzWzeh9xToYUPtayKcRTrRfLDvbp7dmeZpFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:21:56.851762Z"},"content_sha256":"70ea12a6cc054412fa302c752159db469ca670cd10803a47c3efb6314860a39a","schema_version":"1.0","event_id":"sha256:70ea12a6cc054412fa302c752159db469ca670cd10803a47c3efb6314860a39a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/bundle.json","state_url":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/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-03T11:21:56Z","links":{"resolver":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT","bundle":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/bundle.json","state":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RX3KT7DVLOP4UZYOJFMIYHXYDT","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":"7a79a922dee0fe9a38c8badf9af1cd320a268e3148d5bd1fb718f9391e2c459f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-18T09:36:13Z","title_canon_sha256":"1834887a42d20f3928f1cd3a4659c75b82c586acfe7d189be1a95e86b681a362"},"schema_version":"1.0","source":{"id":"1709.05833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05833","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05833v1","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05833","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"RX3KT7DVLOP4","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RX3KT7DVLOP4UZYO","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RX3KT7DV","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:70ea12a6cc054412fa302c752159db469ca670cd10803a47c3efb6314860a39a","target":"graph","created_at":"2026-05-18T00:34:59Z","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 a binary feature based Loop Closure Detection (LCD) method is proposed, which for the first time achieves higher precision-recall (PR) performance compared with state-of-the-art SIFT feature based approaches. The proposed system originates from our previous work Multi-Index hashing for Loop closure Detection (MILD), which employs Multi-Index Hashing (MIH)~\\cite{greene1994multi} for Approximate Nearest Neighbor (ANN) search of binary features. As the accuracy of MILD is limited by repeating textures and inaccurate image similarity measurement, burstiness handling is introduced to ","authors_text":"Guyue Zhou, Lan Xu, Lei Han, Lu Fang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-18T09:36:13Z","title":"Beyond SIFT using Binary features for Loop Closure Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05833","kind":"arxiv","version":1},"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:c260fe7169c291af6650183cc8e875b1466e1324f6353a7b298392f64b08af45","target":"record","created_at":"2026-05-18T00:34:59Z","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":"7a79a922dee0fe9a38c8badf9af1cd320a268e3148d5bd1fb718f9391e2c459f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-18T09:36:13Z","title_canon_sha256":"1834887a42d20f3928f1cd3a4659c75b82c586acfe7d189be1a95e86b681a362"},"schema_version":"1.0","source":{"id":"1709.05833","kind":"arxiv","version":1}},"canonical_sha256":"8df6a9fc755b9fca670e49588c1ef81ceca327e400a41bece4bcf3ea2954d0a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8df6a9fc755b9fca670e49588c1ef81ceca327e400a41bece4bcf3ea2954d0a7","first_computed_at":"2026-05-18T00:34:59.200880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:59.200880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kNfscR96QEOz4iRYtW5xQZvX/7ND94lUmzi+NCoW3xzLEz7aSS0oEosYNIeXfyRjI4J/NBdJCNDIsPy1V8ulDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:59.201605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c260fe7169c291af6650183cc8e875b1466e1324f6353a7b298392f64b08af45","sha256:70ea12a6cc054412fa302c752159db469ca670cd10803a47c3efb6314860a39a"],"state_sha256":"6d6e4b38a757ce97e1217cbede0c1276bbd6e316282b01618d37f6359850624f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2nHIpZdacE6uG4PmqUuEkYq5UmppU9m+sdDh9c/KWPSZTEM/FYtFP8wOFU2AKRSl15dS7HJRYpariBV3RscEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:21:56.853969Z","bundle_sha256":"5db4ab20fb7f39103ec1362f1c9a2f1678e8aa00478cd272c63c2809a4ca3083"}}