{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4WOKPJBLISCI6KALYLFIYL2DUZ","short_pith_number":"pith:4WOKPJBL","schema_version":"1.0","canonical_sha256":"e59ca7a42b44848f280bc2ca8c2f43a6730c9d733d5b0c1f8751c74a26ca20a2","source":{"kind":"arxiv","id":"1702.08780","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.08780","created_at":"2026-05-18T00:49:47.913171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08780v1","created_at":"2026-05-18T00:49:47.913171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08780","created_at":"2026-05-18T00:49:47.913171+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WOKPJBLISCI","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WOKPJBLISCI6KAL","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WOKPJBL","created_at":"2026-05-18T12:31:00.734936+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/4WOKPJBLISCI6KALYLFIYL2DUZ","json":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ.json","graph_json":"https://pith.science/api/pith-number/4WOKPJBLISCI6KALYLFIYL2DUZ/graph.json","events_json":"https://pith.science/api/pith-number/4WOKPJBLISCI6KALYLFIYL2DUZ/events.json","paper":"https://pith.science/paper/4WOKPJBL"},"agent_actions":{"view_html":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ","download_json":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ.json","view_paper":"https://pith.science/paper/4WOKPJBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08780&json=true","fetch_graph":"https://pith.science/api/pith-number/4WOKPJBLISCI6KALYLFIYL2DUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4WOKPJBLISCI6KALYLFIYL2DUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/action/storage_attestation","attest_author":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/action/author_attestation","sign_citation":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/action/citation_signature","submit_replication":"https://pith.science/pith/4WOKPJBLISCI6KALYLFIYL2DUZ/action/replication_record"}},"created_at":"2026-05-18T00:49:47.913171+00:00","updated_at":"2026-05-18T00:49:47.913171+00:00"}