{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IFVUXJM6BBNI62JQVGDZ2N4NG5","short_pith_number":"pith:IFVUXJM6","schema_version":"1.0","canonical_sha256":"416b4ba59e085a8f6930a9879d378d377a2e9781c38deec20bd455d30756b0f4","source":{"kind":"arxiv","id":"1802.02422","version":2},"attestation_state":"computed","paper":{"title":"Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Artem Babenko, Dmitry Baranchuk, Yury Malkov","submitted_at":"2018-02-07T14:01:04Z","abstract_excerpt":"This work addresses the problem of billion-scale nearest neighbor search. The state-of-the-art retrieval systems for billion-scale databases are currently based on the inverted multi-index, the recently proposed generalization of the inverted index structure. The multi-index provides a very fine-grained partition of the feature space that allows extracting concise and accurate short-lists of candidates for the search queries. In this paper, we argue that the potential of the simple inverted index was not fully exploited in previous works and advocate its usage both for the highly-entangled dee"},"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":"1802.02422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-07T14:01:04Z","cross_cats_sorted":[],"title_canon_sha256":"ce875a1b81d3f81f9fd586f9a554425e8564e63fe29bd340c81a73e5ed9220e9","abstract_canon_sha256":"3e26cefc03ddf9146bf0fb6e753a9824878399df7957b779c2c2053942988788"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:10.731869Z","signature_b64":"mIpvZ4UvtzZ+9e0FEgGPLKCI1q89OGQBGiXFfwFm8Q6TM3QEUH7W+5guCm1pBhB2kqwrBTR03GkcWRJhjfuTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"416b4ba59e085a8f6930a9879d378d377a2e9781c38deec20bd455d30756b0f4","last_reissued_at":"2026-05-18T00:10:10.731138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:10.731138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Artem Babenko, Dmitry Baranchuk, Yury Malkov","submitted_at":"2018-02-07T14:01:04Z","abstract_excerpt":"This work addresses the problem of billion-scale nearest neighbor search. The state-of-the-art retrieval systems for billion-scale databases are currently based on the inverted multi-index, the recently proposed generalization of the inverted index structure. The multi-index provides a very fine-grained partition of the feature space that allows extracting concise and accurate short-lists of candidates for the search queries. In this paper, we argue that the potential of the simple inverted index was not fully exploited in previous works and advocate its usage both for the highly-entangled dee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02422","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":"1802.02422","created_at":"2026-05-18T00:10:10.731228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02422v2","created_at":"2026-05-18T00:10:10.731228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02422","created_at":"2026-05-18T00:10:10.731228+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFVUXJM6BBNI","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFVUXJM6BBNI62JQ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFVUXJM6","created_at":"2026-05-18T12:32:28.185984+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/IFVUXJM6BBNI62JQVGDZ2N4NG5","json":"https://pith.science/pith/IFVUXJM6BBNI62JQVGDZ2N4NG5.json","graph_json":"https://pith.science/api/pith-number/IFVUXJM6BBNI62JQVGDZ2N4NG5/graph.json","events_json":"https://pith.science/api/pith-number/IFVUXJM6BBNI62JQVGDZ2N4NG5/events.json","paper":"https://pith.science/paper/IFVUXJM6"},"agent_actions":{"view_html":"https://pith.science/pith/IFVUXJM6BBNI62JQVGDZ2N4NG5","download_json":"https://pith.science/pith/IFVUXJM6BBNI62JQVGDZ2N4NG5.json","view_paper":"https://pith.science/paper/IFVUXJM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02422&json=true","fetch_graph":"https://pith.science/api/pith-number/IFVUXJM6BBNI62JQVGDZ2N4NG5/graph.json","fetch_events":"https://pith.science/api/pith-number/IFVUXJM6BBNI62JQVGDZ2N4NG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFVUXJM6BBNI62JQVGDZ2N4NG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFVUXJM6BBNI62JQVGDZ2N4NG5/action/storage_attestation","attest_author":"https://pith.science/pith/IFVUXJM6BBNI62JQVGDZ2N4NG5/action/author_attestation","sign_citation":"https://pith.science/pith/IFVUXJM6BBNI62JQVGDZ2N4NG5/action/citation_signature","submit_replication":"https://pith.science/pith/IFVUXJM6BBNI62JQVGDZ2N4NG5/action/replication_record"}},"created_at":"2026-05-18T00:10:10.731228+00:00","updated_at":"2026-05-18T00:10:10.731228+00:00"}