{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YVWCZLWLI7F3RKSHO32BAUJQ2U","short_pith_number":"pith:YVWCZLWL","schema_version":"1.0","canonical_sha256":"c56c2caecb47cbb8aa4776f4105130d524bfbfadf44f68b8133db554e1f45bc2","source":{"kind":"arxiv","id":"1509.05195","version":1},"attestation_state":"computed","paper":{"title":"Improved Residual Vector Quantization for High-dimensional Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hongtao Lu, Junru Shao, Shicong Liu","submitted_at":"2015-09-17T10:19:37Z","abstract_excerpt":"Quantization methods have been introduced to perform large scale approximate nearest search tasks. Residual Vector Quantization (RVQ) is one of the effective quantization methods. RVQ uses a multi-stage codebook learning scheme to lower the quantization error stage by stage. However, there are two major limitations for RVQ when applied to on high-dimensional approximate nearest neighbor search: 1. The performance gain diminishes quickly with added stages. 2. Encoding a vector with RVQ is actually NP-hard. In this paper, we propose an improved residual vector quantization (IRVQ) method, our IRV"},"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":"1509.05195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-17T10:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"3c1e022ad7f087495895d547728f3ae526aeed66b26b0b72e6d37fe862731aaf","abstract_canon_sha256":"cb029e27ed3f250b583489f33034ba2a2e399f385ec2390a32db05b206316eb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:49.645346Z","signature_b64":"UW1qTMJiJ15yZIIQno+64DwHW/ugG/PVmtcUKCAebCyBHZ7j0/TeIkdVNkUe6mgwJyAoOQ23DOE+6IFzZFlLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c56c2caecb47cbb8aa4776f4105130d524bfbfadf44f68b8133db554e1f45bc2","last_reissued_at":"2026-05-18T01:32:49.644707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:49.644707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Residual Vector Quantization for High-dimensional Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hongtao Lu, Junru Shao, Shicong Liu","submitted_at":"2015-09-17T10:19:37Z","abstract_excerpt":"Quantization methods have been introduced to perform large scale approximate nearest search tasks. Residual Vector Quantization (RVQ) is one of the effective quantization methods. RVQ uses a multi-stage codebook learning scheme to lower the quantization error stage by stage. However, there are two major limitations for RVQ when applied to on high-dimensional approximate nearest neighbor search: 1. The performance gain diminishes quickly with added stages. 2. Encoding a vector with RVQ is actually NP-hard. In this paper, we propose an improved residual vector quantization (IRVQ) method, our IRV"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05195","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":"1509.05195","created_at":"2026-05-18T01:32:49.644803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05195v1","created_at":"2026-05-18T01:32:49.644803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05195","created_at":"2026-05-18T01:32:49.644803+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVWCZLWLI7F3","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVWCZLWLI7F3RKSH","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVWCZLWL","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2401.08281","citing_title":"The Faiss library","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U","json":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U.json","graph_json":"https://pith.science/api/pith-number/YVWCZLWLI7F3RKSHO32BAUJQ2U/graph.json","events_json":"https://pith.science/api/pith-number/YVWCZLWLI7F3RKSHO32BAUJQ2U/events.json","paper":"https://pith.science/paper/YVWCZLWL"},"agent_actions":{"view_html":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U","download_json":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U.json","view_paper":"https://pith.science/paper/YVWCZLWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05195&json=true","fetch_graph":"https://pith.science/api/pith-number/YVWCZLWLI7F3RKSHO32BAUJQ2U/graph.json","fetch_events":"https://pith.science/api/pith-number/YVWCZLWLI7F3RKSHO32BAUJQ2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/action/storage_attestation","attest_author":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/action/author_attestation","sign_citation":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/action/citation_signature","submit_replication":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/action/replication_record"}},"created_at":"2026-05-18T01:32:49.644803+00:00","updated_at":"2026-05-18T01:32:49.644803+00:00"}