{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4WOKPJBLISCI6KALYLFIYL2DUZ","short_pith_number":"pith:4WOKPJBL","canonical_record":{"source":{"id":"1702.08780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T13:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"928cc1586941cc472622773dcf37b82a5aa9794cb5607886ab521f6a36110991","abstract_canon_sha256":"76a35e0f13b8d78b66f6b47a0d45a80f78cb6e29d65cd0e7112c05542ca7ede0"},"schema_version":"1.0"},"canonical_sha256":"e59ca7a42b44848f280bc2ca8c2f43a6730c9d733d5b0c1f8751c74a26ca20a2","source":{"kind":"arxiv","id":"1702.08780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08780","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08780v1","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08780","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"4WOKPJBLISCI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4WOKPJBLISCI6KAL","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4WOKPJBL","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4WOKPJBLISCI6KALYLFIYL2DUZ","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T13:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"928cc1586941cc472622773dcf37b82a5aa9794cb5607886ab521f6a36110991","abstract_canon_sha256":"76a35e0f13b8d78b66f6b47a0d45a80f78cb6e29d65cd0e7112c05542ca7ede0"},"schema_version":"1.0"},"canonical_sha256":"e59ca7a42b44848f280bc2ca8c2f43a6730c9d733d5b0c1f8751c74a26ca20a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:47.913772Z","signature_b64":"pWTqUJiwzJGc2od/FqQBL5/Lo4zy+9ls6rRKN7R0jKHUsNXTg1WMruu5BRS6A4G536CP1JPCDabIXWn5RN7YBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e59ca7a42b44848f280bc2ca8c2f43a6730c9d733d5b0c1f8751c74a26ca20a2","last_reissued_at":"2026-05-18T00:49:47.913063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:47.913063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08780","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:49:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TH81nGTpKBKRFTkAeEXG83xXsNJKuKALtmBD4apvUirZ0o8bnBSeEBC5jotgr007SwNWNCfQcrsDHGHntpiFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:45:05.497658Z"},"content_sha256":"88191c972dd0c904e925f49a08ad22a3a002adaec5bbb815891ba0b8f8ee54e8","schema_version":"1.0","event_id":"sha256:88191c972dd0c904e925f49a08ad22a3a002adaec5bbb815891ba0b8f8ee54e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4WOKPJBLISCI6KALYLFIYL2DUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MILD: Multi-Index hashing for Loop closure Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Lei Han, Lu Fang","submitted_at":"2017-02-28T13:30:06Z","abstract_excerpt":"Loop Closure Detection (LCD) has been proved to be extremely useful in global consistent visual Simultaneously Localization and Mapping (SLAM) and appearance-based robot relocalization. Methods exploiting binary features in bag of words representation have recently gained a lot of popularity for their efficiency, but suffer from low recall due to the inherent drawback that high dimensional binary feature descriptors lack well-defined centroids. In this paper, we propose a realtime LCD approach called MILD (Multi-Index Hashing for Loop closure Detection), in which image similarity is measured b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08780","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:49:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUpBqxCYoFialgpaKHehr3ixq0hIoGIuTa/3ZS5sjlCTZz9++514UEidThlW2sv5HnfMmtI3IE1gQEfYtAWqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:45:05.497999Z"},"content_sha256":"80582118ab2f863ab5c1a891663b72a2802d357a5d6977480e46f932720f139d","schema_version":"1.0","event_id":"sha256:80582118ab2f863ab5c1a891663b72a2802d357a5d6977480e46f932720f139d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/bundle.json","state_url":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/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-03T19:45:05Z","links":{"resolver":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ","bundle":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/bundle.json","state":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4WOKPJBLISCI6KALYLFIYL2DUZ","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":"76a35e0f13b8d78b66f6b47a0d45a80f78cb6e29d65cd0e7112c05542ca7ede0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T13:30:06Z","title_canon_sha256":"928cc1586941cc472622773dcf37b82a5aa9794cb5607886ab521f6a36110991"},"schema_version":"1.0","source":{"id":"1702.08780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08780","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08780v1","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08780","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"4WOKPJBLISCI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4WOKPJBLISCI6KAL","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4WOKPJBL","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:80582118ab2f863ab5c1a891663b72a2802d357a5d6977480e46f932720f139d","target":"graph","created_at":"2026-05-18T00:49:47Z","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":"Loop Closure Detection (LCD) has been proved to be extremely useful in global consistent visual Simultaneously Localization and Mapping (SLAM) and appearance-based robot relocalization. Methods exploiting binary features in bag of words representation have recently gained a lot of popularity for their efficiency, but suffer from low recall due to the inherent drawback that high dimensional binary feature descriptors lack well-defined centroids. In this paper, we propose a realtime LCD approach called MILD (Multi-Index Hashing for Loop closure Detection), in which image similarity is measured b","authors_text":"Lei Han, Lu Fang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T13:30:06Z","title":"MILD: Multi-Index hashing for Loop closure Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08780","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:88191c972dd0c904e925f49a08ad22a3a002adaec5bbb815891ba0b8f8ee54e8","target":"record","created_at":"2026-05-18T00:49:47Z","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":"76a35e0f13b8d78b66f6b47a0d45a80f78cb6e29d65cd0e7112c05542ca7ede0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T13:30:06Z","title_canon_sha256":"928cc1586941cc472622773dcf37b82a5aa9794cb5607886ab521f6a36110991"},"schema_version":"1.0","source":{"id":"1702.08780","kind":"arxiv","version":1}},"canonical_sha256":"e59ca7a42b44848f280bc2ca8c2f43a6730c9d733d5b0c1f8751c74a26ca20a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e59ca7a42b44848f280bc2ca8c2f43a6730c9d733d5b0c1f8751c74a26ca20a2","first_computed_at":"2026-05-18T00:49:47.913063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:47.913063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pWTqUJiwzJGc2od/FqQBL5/Lo4zy+9ls6rRKN7R0jKHUsNXTg1WMruu5BRS6A4G536CP1JPCDabIXWn5RN7YBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:47.913772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88191c972dd0c904e925f49a08ad22a3a002adaec5bbb815891ba0b8f8ee54e8","sha256:80582118ab2f863ab5c1a891663b72a2802d357a5d6977480e46f932720f139d"],"state_sha256":"4d0d047919eefd48160b6dc9df7e592e6872ad49b58d8eb9bb2d559b5f285b79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhP9MspYSRj5SAgHAif2Wn44GWtTqeT/c3mbv+FHL2HjXp0TZxcZMkmIwro3L8yTWAStiHAdG2VIAFvVjyjfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:45:05.499915Z","bundle_sha256":"599017023d497936151f9c004f177b463504e020343d5fbfb39b1bf18ba65170"}}