{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YVWCZLWLI7F3RKSHO32BAUJQ2U","short_pith_number":"pith:YVWCZLWL","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"},"canonical_sha256":"c56c2caecb47cbb8aa4776f4105130d524bfbfadf44f68b8133db554e1f45bc2","source":{"kind":"arxiv","id":"1509.05195","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05195","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05195v1","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05195","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"YVWCZLWLI7F3","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YVWCZLWLI7F3RKSH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YVWCZLWL","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YVWCZLWLI7F3RKSHO32BAUJQ2U","target":"record","payload":{"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"},"canonical_sha256":"c56c2caecb47cbb8aa4776f4105130d524bfbfadf44f68b8133db554e1f45bc2","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"},"source_kind":"arxiv","source_id":"1509.05195","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cuCevrlD0+4QVfk/hweL7HfPDbmx4K+BtoqikVJq2VZqSdJYl8L1q/KsutJftBbaa89F+jT3lDoNbK2R8Cn3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T19:07:24.901699Z"},"content_sha256":"0dbdddf98c0e37bda429073ac7293d198fa3f0ef0b2d31a72fe87795596ed1fe","schema_version":"1.0","event_id":"sha256:0dbdddf98c0e37bda429073ac7293d198fa3f0ef0b2d31a72fe87795596ed1fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YVWCZLWLI7F3RKSHO32BAUJQ2U","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B69r3b/MWn1G62UYaDJgrve7hQuL1y+AKqt3YCmM4jHm+jPt8ooFVGc24LS2zYd1CqgmY12QfsPckeFxDcgTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T19:07:24.902041Z"},"content_sha256":"2aab818666a5c24341a28d96c78bdcfaeaf6a32715e2af8a444f468c6b79893a","schema_version":"1.0","event_id":"sha256:2aab818666a5c24341a28d96c78bdcfaeaf6a32715e2af8a444f468c6b79893a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/bundle.json","state_url":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T19:07:24Z","links":{"resolver":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U","bundle":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/bundle.json","state":"https://pith.science/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVWCZLWLI7F3RKSHO32BAUJQ2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YVWCZLWLI7F3RKSHO32BAUJQ2U","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cb029e27ed3f250b583489f33034ba2a2e399f385ec2390a32db05b206316eb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-17T10:19:37Z","title_canon_sha256":"3c1e022ad7f087495895d547728f3ae526aeed66b26b0b72e6d37fe862731aaf"},"schema_version":"1.0","source":{"id":"1509.05195","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05195","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05195v1","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05195","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"YVWCZLWLI7F3","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YVWCZLWLI7F3RKSH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YVWCZLWL","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:2aab818666a5c24341a28d96c78bdcfaeaf6a32715e2af8a444f468c6b79893a","target":"graph","created_at":"2026-05-18T01:32:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hongtao Lu, Junru Shao, Shicong Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-17T10:19:37Z","title":"Improved Residual Vector Quantization for High-dimensional Approximate Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05195","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0dbdddf98c0e37bda429073ac7293d198fa3f0ef0b2d31a72fe87795596ed1fe","target":"record","created_at":"2026-05-18T01:32:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cb029e27ed3f250b583489f33034ba2a2e399f385ec2390a32db05b206316eb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-17T10:19:37Z","title_canon_sha256":"3c1e022ad7f087495895d547728f3ae526aeed66b26b0b72e6d37fe862731aaf"},"schema_version":"1.0","source":{"id":"1509.05195","kind":"arxiv","version":1}},"canonical_sha256":"c56c2caecb47cbb8aa4776f4105130d524bfbfadf44f68b8133db554e1f45bc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c56c2caecb47cbb8aa4776f4105130d524bfbfadf44f68b8133db554e1f45bc2","first_computed_at":"2026-05-18T01:32:49.644707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:49.644707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UW1qTMJiJ15yZIIQno+64DwHW/ugG/PVmtcUKCAebCyBHZ7j0/TeIkdVNkUe6mgwJyAoOQ23DOE+6IFzZFlLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:49.645346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05195","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dbdddf98c0e37bda429073ac7293d198fa3f0ef0b2d31a72fe87795596ed1fe","sha256:2aab818666a5c24341a28d96c78bdcfaeaf6a32715e2af8a444f468c6b79893a"],"state_sha256":"85fbd5f8a1d3275fc92fabec403fe08ffa08c094a780a9d3d80a26ba158df566"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dEmWwmYdjmDH/5GaMaYwwh8ak1QjVrSRMI8ha4XxzllK9GbycHb5QiYf3RiVFUxjW+10eoUMeFiqQC2l838oBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T19:07:24.904055Z","bundle_sha256":"387985e4f68d7175776e6d7cc99bfc429608d0e28e57d1dcfdd3b0e510d6443c"}}