{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:V65TOPCM2IFPKR245PQBWVRYTJ","short_pith_number":"pith:V65TOPCM","schema_version":"1.0","canonical_sha256":"afbb373c4cd20af5475cebe01b56389a774e0d022526adfd04b7c012dd952b00","source":{"kind":"arxiv","id":"1404.1831","version":1},"attestation_state":"computed","paper":{"title":"Improving Bilayer Product Quantization for Billion-Scale Approximate Nearest Neighbors in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Artem Babenko, Victor Lempitsky","submitted_at":"2014-04-07T16:08:13Z","abstract_excerpt":"The top-performing systems for billion-scale high-dimensional approximate nearest neighbor (ANN) search are all based on two-layer architectures that include an indexing structure and a compressed datapoints layer. An indexing structure is crucial as it allows to avoid exhaustive search, while the lossy data compression is needed to fit the dataset into RAM. Several of the most successful systems use product quantization (PQ) for both the indexing and the dataset compression layers. These systems are however limited in the way they exploit the interaction of product quantization processes that"},"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":"1404.1831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-07T16:08:13Z","cross_cats_sorted":[],"title_canon_sha256":"d4b3eee15372b2c8ff108472e20328c8748fcf18f5cac0d920e4b5e75ef5d2e5","abstract_canon_sha256":"99d22b54d77579c161899a7d496bf957d4460c34314492d158f6b8296cee76a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:40.097025Z","signature_b64":"24xoF9q+6Q8cWhRec/SKKevCdsxNREv84PcyxVv+9FH3V852heEXrp2kJEjeK4nUvH6/qOMmQ66G628rHrZjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afbb373c4cd20af5475cebe01b56389a774e0d022526adfd04b7c012dd952b00","last_reissued_at":"2026-05-18T02:54:40.096632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:40.096632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Bilayer Product Quantization for Billion-Scale Approximate Nearest Neighbors in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Artem Babenko, Victor Lempitsky","submitted_at":"2014-04-07T16:08:13Z","abstract_excerpt":"The top-performing systems for billion-scale high-dimensional approximate nearest neighbor (ANN) search are all based on two-layer architectures that include an indexing structure and a compressed datapoints layer. An indexing structure is crucial as it allows to avoid exhaustive search, while the lossy data compression is needed to fit the dataset into RAM. Several of the most successful systems use product quantization (PQ) for both the indexing and the dataset compression layers. These systems are however limited in the way they exploit the interaction of product quantization processes that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1831","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":"1404.1831","created_at":"2026-05-18T02:54:40.096687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1831v1","created_at":"2026-05-18T02:54:40.096687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1831","created_at":"2026-05-18T02:54:40.096687+00:00"},{"alias_kind":"pith_short_12","alias_value":"V65TOPCM2IFP","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"V65TOPCM2IFPKR24","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"V65TOPCM","created_at":"2026-05-18T12:28:52.271510+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/V65TOPCM2IFPKR245PQBWVRYTJ","json":"https://pith.science/pith/V65TOPCM2IFPKR245PQBWVRYTJ.json","graph_json":"https://pith.science/api/pith-number/V65TOPCM2IFPKR245PQBWVRYTJ/graph.json","events_json":"https://pith.science/api/pith-number/V65TOPCM2IFPKR245PQBWVRYTJ/events.json","paper":"https://pith.science/paper/V65TOPCM"},"agent_actions":{"view_html":"https://pith.science/pith/V65TOPCM2IFPKR245PQBWVRYTJ","download_json":"https://pith.science/pith/V65TOPCM2IFPKR245PQBWVRYTJ.json","view_paper":"https://pith.science/paper/V65TOPCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1831&json=true","fetch_graph":"https://pith.science/api/pith-number/V65TOPCM2IFPKR245PQBWVRYTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/V65TOPCM2IFPKR245PQBWVRYTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V65TOPCM2IFPKR245PQBWVRYTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V65TOPCM2IFPKR245PQBWVRYTJ/action/storage_attestation","attest_author":"https://pith.science/pith/V65TOPCM2IFPKR245PQBWVRYTJ/action/author_attestation","sign_citation":"https://pith.science/pith/V65TOPCM2IFPKR245PQBWVRYTJ/action/citation_signature","submit_replication":"https://pith.science/pith/V65TOPCM2IFPKR245PQBWVRYTJ/action/replication_record"}},"created_at":"2026-05-18T02:54:40.096687+00:00","updated_at":"2026-05-18T02:54:40.096687+00:00"}