{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RCPJNHT4CCSRIR5ZEOXBTRJ3TM","short_pith_number":"pith:RCPJNHT4","schema_version":"1.0","canonical_sha256":"889e969e7c10a51447b923ae19c53b9b0cc279c7f9eae21a19aa2502faa59678","source":{"kind":"arxiv","id":"1611.05898","version":2},"attestation_state":"computed","paper":{"title":"Associative Memories to Accelerate Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.LG","authors_text":"Franck Vermet, Matthias L\\\"owe, Vincent Gripon","submitted_at":"2016-11-10T16:08:31Z","abstract_excerpt":"Nearest neighbor search is a very active field in machine learning for it appears in many application cases, including classification and object retrieval. In its canonical version, the complexity of the search is linear with both the dimension and the cardinal of the collection of vectors the search is performed in. Recently many works have focused on reducing the dimension of vectors using quantization techniques or hashing, while providing an approximate result. In this paper we focus instead on tackling the cardinal of the collection of vectors. Namely, we introduce a technique that partit"},"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":"1611.05898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-10T16:08:31Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2833ff00c0c3358800405dacec28b8b8f8ef95b12e0462d449cb365a0e063c24","abstract_canon_sha256":"e7cbbc83a55608cd87ef999c58ff6e6ac1ad4bd8b7d1f3fce2926d459c4d047c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:52.742739Z","signature_b64":"BuCO5Kfo0f52VC4MHdm4kANa6Y2gKqm63WXXcY1uTgJ7XvWjtL4MWvZGQ+16xi1SsbYnMQnEFrMqEsEQf7uUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"889e969e7c10a51447b923ae19c53b9b0cc279c7f9eae21a19aa2502faa59678","last_reissued_at":"2026-05-18T00:40:52.742223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:52.742223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Associative Memories to Accelerate Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.LG","authors_text":"Franck Vermet, Matthias L\\\"owe, Vincent Gripon","submitted_at":"2016-11-10T16:08:31Z","abstract_excerpt":"Nearest neighbor search is a very active field in machine learning for it appears in many application cases, including classification and object retrieval. In its canonical version, the complexity of the search is linear with both the dimension and the cardinal of the collection of vectors the search is performed in. Recently many works have focused on reducing the dimension of vectors using quantization techniques or hashing, while providing an approximate result. In this paper we focus instead on tackling the cardinal of the collection of vectors. Namely, we introduce a technique that partit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05898","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.05898","created_at":"2026-05-18T00:40:52.742301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05898v2","created_at":"2026-05-18T00:40:52.742301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05898","created_at":"2026-05-18T00:40:52.742301+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCPJNHT4CCSR","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCPJNHT4CCSRIR5Z","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCPJNHT4","created_at":"2026-05-18T12:30:41.710351+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/RCPJNHT4CCSRIR5ZEOXBTRJ3TM","json":"https://pith.science/pith/RCPJNHT4CCSRIR5ZEOXBTRJ3TM.json","graph_json":"https://pith.science/api/pith-number/RCPJNHT4CCSRIR5ZEOXBTRJ3TM/graph.json","events_json":"https://pith.science/api/pith-number/RCPJNHT4CCSRIR5ZEOXBTRJ3TM/events.json","paper":"https://pith.science/paper/RCPJNHT4"},"agent_actions":{"view_html":"https://pith.science/pith/RCPJNHT4CCSRIR5ZEOXBTRJ3TM","download_json":"https://pith.science/pith/RCPJNHT4CCSRIR5ZEOXBTRJ3TM.json","view_paper":"https://pith.science/paper/RCPJNHT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05898&json=true","fetch_graph":"https://pith.science/api/pith-number/RCPJNHT4CCSRIR5ZEOXBTRJ3TM/graph.json","fetch_events":"https://pith.science/api/pith-number/RCPJNHT4CCSRIR5ZEOXBTRJ3TM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCPJNHT4CCSRIR5ZEOXBTRJ3TM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCPJNHT4CCSRIR5ZEOXBTRJ3TM/action/storage_attestation","attest_author":"https://pith.science/pith/RCPJNHT4CCSRIR5ZEOXBTRJ3TM/action/author_attestation","sign_citation":"https://pith.science/pith/RCPJNHT4CCSRIR5ZEOXBTRJ3TM/action/citation_signature","submit_replication":"https://pith.science/pith/RCPJNHT4CCSRIR5ZEOXBTRJ3TM/action/replication_record"}},"created_at":"2026-05-18T00:40:52.742301+00:00","updated_at":"2026-05-18T00:40:52.742301+00:00"}