{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UE4YG64GWTGXNGGILTUMLVMNGR","short_pith_number":"pith:UE4YG64G","schema_version":"1.0","canonical_sha256":"a139837b86b4cd7698c85ce8c5d58d34578512266cfe539a6f4f799dcd1a9750","source":{"kind":"arxiv","id":"2110.08919","version":1},"attestation_state":"computed","paper":{"title":"Low-Precision Quantization for Efficient Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Anthony Ko, Eric Schkufza, Iman Keivanloo, Vihan Lakshman","submitted_at":"2021-10-17T20:42:25Z","abstract_excerpt":"Fast k-Nearest Neighbor search over real-valued vector spaces (KNN) is an important algorithmic task for information retrieval and recommendation systems. We present a method for using reduced precision to represent vectors through quantized integer values, enabling both a reduction in the memory overhead of indexing these vectors and faster distance computations at query time. While most traditional quantization techniques focus on minimizing the reconstruction error between a point and its uncompressed counterpart, we focus instead on preserving the behavior of the underlying distance metric"},"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":"2110.08919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-10-17T20:42:25Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"22d8502549b6489469066e7570689fd355d9b776fab2972ea8b9e8d3f72ea56c","abstract_canon_sha256":"c1a4b146c3ec10131d09f6e31ef3f16455ef0dd72cbfa102b45a4ce2065db2f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:21.961775Z","signature_b64":"q8/K3ukoh6cQVsimVVoh+ejNZrJLMUEDCKwqrAnlq9xmvtgOun+gTEqIsvwllWihA9crPIhcT+5lvj6qei+NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a139837b86b4cd7698c85ce8c5d58d34578512266cfe539a6f4f799dcd1a9750","last_reissued_at":"2026-07-05T03:23:21.961363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:21.961363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Precision Quantization for Efficient Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Anthony Ko, Eric Schkufza, Iman Keivanloo, Vihan Lakshman","submitted_at":"2021-10-17T20:42:25Z","abstract_excerpt":"Fast k-Nearest Neighbor search over real-valued vector spaces (KNN) is an important algorithmic task for information retrieval and recommendation systems. We present a method for using reduced precision to represent vectors through quantized integer values, enabling both a reduction in the memory overhead of indexing these vectors and faster distance computations at query time. While most traditional quantization techniques focus on minimizing the reconstruction error between a point and its uncompressed counterpart, we focus instead on preserving the behavior of the underlying distance metric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08919","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.08919/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.08919","created_at":"2026-07-05T03:23:21.961422+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.08919v1","created_at":"2026-07-05T03:23:21.961422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08919","created_at":"2026-07-05T03:23:21.961422+00:00"},{"alias_kind":"pith_short_12","alias_value":"UE4YG64GWTGX","created_at":"2026-07-05T03:23:21.961422+00:00"},{"alias_kind":"pith_short_16","alias_value":"UE4YG64GWTGXNGGI","created_at":"2026-07-05T03:23:21.961422+00:00"},{"alias_kind":"pith_short_8","alias_value":"UE4YG64G","created_at":"2026-07-05T03:23:21.961422+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07621","citing_title":"Bang for the Buck: Vector Search on Cloud CPUs","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UE4YG64GWTGXNGGILTUMLVMNGR","json":"https://pith.science/pith/UE4YG64GWTGXNGGILTUMLVMNGR.json","graph_json":"https://pith.science/api/pith-number/UE4YG64GWTGXNGGILTUMLVMNGR/graph.json","events_json":"https://pith.science/api/pith-number/UE4YG64GWTGXNGGILTUMLVMNGR/events.json","paper":"https://pith.science/paper/UE4YG64G"},"agent_actions":{"view_html":"https://pith.science/pith/UE4YG64GWTGXNGGILTUMLVMNGR","download_json":"https://pith.science/pith/UE4YG64GWTGXNGGILTUMLVMNGR.json","view_paper":"https://pith.science/paper/UE4YG64G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.08919&json=true","fetch_graph":"https://pith.science/api/pith-number/UE4YG64GWTGXNGGILTUMLVMNGR/graph.json","fetch_events":"https://pith.science/api/pith-number/UE4YG64GWTGXNGGILTUMLVMNGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UE4YG64GWTGXNGGILTUMLVMNGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UE4YG64GWTGXNGGILTUMLVMNGR/action/storage_attestation","attest_author":"https://pith.science/pith/UE4YG64GWTGXNGGILTUMLVMNGR/action/author_attestation","sign_citation":"https://pith.science/pith/UE4YG64GWTGXNGGILTUMLVMNGR/action/citation_signature","submit_replication":"https://pith.science/pith/UE4YG64GWTGXNGGILTUMLVMNGR/action/replication_record"}},"created_at":"2026-07-05T03:23:21.961422+00:00","updated_at":"2026-07-05T03:23:21.961422+00:00"}