{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AMOY4UFTZBVIIKLIKTXRCMHMX7","short_pith_number":"pith:AMOY4UFT","schema_version":"1.0","canonical_sha256":"031d8e50b3c86a84296854ef1130ecbff4c25ba7a8c69db1308a3bc4021e95db","source":{"kind":"arxiv","id":"2605.02171","version":3},"attestation_state":"computed","paper":{"title":"QuIVer: Rethinking ANN Graph Topology via Training-Free Binary Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"QuIVer builds ANN graph indices entirely inside a 2-bit sign-magnitude binary quantization space.","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chengcheng Li, Wenxuan Xiao, Zhiyou Wang","submitted_at":"2026-05-04T03:04:12Z","abstract_excerpt":"Approximate nearest neighbor (ANN) graph indices such as HNSW and Vamana construct their edge topology in full-precision or high-fidelity quantized metric spaces, relegating binary quantization (BQ) to a post-hoc distance estimator during search. This paper asks a different question: Can binary quantization define the graph topology itself -- and if so, under what conditions? We study this question through QuIVer (Quantized Index for Vector Retrieval), a training-free ANN graph index that performs Vamana edge selection, diversity pruning, and beam-search navigation entirely within a 2-bit Sign"},"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":true},"canonical_record":{"source":{"id":"2605.02171","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-04T03:04:12Z","cross_cats_sorted":[],"title_canon_sha256":"0ff3f864b0bb5b7a900acda496c62535c52a8e5612c5371e8e66ad3d9a9b011b","abstract_canon_sha256":"0bc436fad5e0383f8c2f7cdc76ddcdce19ee1a96b9f669355e9a7a49e1b64571"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:33.547067Z","signature_b64":"AlGiOpFL4DCgukGABWsZFfPnl3Lb5ATKpym25YQctVRm0HQ68UtM0DJUJEAiiPvqU3hwzc5+Ft6cXiOtXKirDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"031d8e50b3c86a84296854ef1130ecbff4c25ba7a8c69db1308a3bc4021e95db","last_reissued_at":"2026-05-20T00:04:33.546337Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:33.546337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QuIVer: Rethinking ANN Graph Topology via Training-Free Binary Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"QuIVer builds ANN graph indices entirely inside a 2-bit sign-magnitude binary quantization space.","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chengcheng Li, Wenxuan Xiao, Zhiyou Wang","submitted_at":"2026-05-04T03:04:12Z","abstract_excerpt":"Approximate nearest neighbor (ANN) graph indices such as HNSW and Vamana construct their edge topology in full-precision or high-fidelity quantized metric spaces, relegating binary quantization (BQ) to a post-hoc distance estimator during search. This paper asks a different question: Can binary quantization define the graph topology itself -- and if so, under what conditions? We study this question through QuIVer (Quantized Index for Vector Retrieval), a training-free ANN graph index that performs Vamana edge selection, diversity pruning, and beam-search navigation entirely within a 2-bit Sign"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"QuIVer performs edge selection, pruning, and graph navigation entirely in a 2-bit Sign-Magnitude BQ metric space, achieving at least 88% Recall@10 at 13--41K multi-threaded QPS with 58--262-second construction and less than 1.3 GB hot memory on six embedding datasets.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That 2-bit sign-magnitude quantization preserves enough distance information for Vamana-style alpha-diversity pruning and beam search to produce a graph topology whose quality is close to full-precision construction, at least for cosine-native low-effective-dimensionality data.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"QuIVer constructs ANN graphs using only 2-bit sign-magnitude binary quantization for topology decisions, achieving at least 88% Recall@10 at high throughput with low memory on embedding datasets.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"QuIVer builds ANN graph indices entirely inside a 2-bit sign-magnitude binary quantization space.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"98227fa1ac77948c666d7009359c15384e32215c06edde6dc25d40a6a2384184"},"source":{"id":"2605.02171","kind":"arxiv","version":3},"verdict":{"id":"5a412625-a302-4e7e-97bf-6b9505cc9cac","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T01:48:47.909907Z","strongest_claim":"QuIVer performs edge selection, pruning, and graph navigation entirely in a 2-bit Sign-Magnitude BQ metric space, achieving at least 88% Recall@10 at 13--41K multi-threaded QPS with 58--262-second construction and less than 1.3 GB hot memory on six embedding datasets.","one_line_summary":"QuIVer constructs ANN graphs using only 2-bit sign-magnitude binary quantization for topology decisions, achieving at least 88% Recall@10 at high throughput with low memory on embedding datasets.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That 2-bit sign-magnitude quantization preserves enough distance information for Vamana-style alpha-diversity pruning and beam search to produce a graph topology whose quality is close to full-precision construction, at least for cosine-native low-effective-dimensionality data.","pith_extraction_headline":"QuIVer builds ANN graph indices entirely inside a 2-bit sign-magnitude binary quantization space."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.02171/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T16:37:36.711643Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c388a9c9ce25618f32a05a45abf3e810edb440d1007d64dc20d566b98e53cae0"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3361213e65725c136f33317cd532b624d9f62839080d35efa45253131963ecd1"},"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":"2605.02171","created_at":"2026-05-20T00:04:33.546440+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.02171v3","created_at":"2026-05-20T00:04:33.546440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.02171","created_at":"2026-05-20T00:04:33.546440+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMOY4UFTZBVI","created_at":"2026-05-20T00:04:33.546440+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMOY4UFTZBVIIKLI","created_at":"2026-05-20T00:04:33.546440+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMOY4UFT","created_at":"2026-05-20T00:04:33.546440+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AMOY4UFTZBVIIKLIKTXRCMHMX7","json":"https://pith.science/pith/AMOY4UFTZBVIIKLIKTXRCMHMX7.json","graph_json":"https://pith.science/api/pith-number/AMOY4UFTZBVIIKLIKTXRCMHMX7/graph.json","events_json":"https://pith.science/api/pith-number/AMOY4UFTZBVIIKLIKTXRCMHMX7/events.json","paper":"https://pith.science/paper/AMOY4UFT"},"agent_actions":{"view_html":"https://pith.science/pith/AMOY4UFTZBVIIKLIKTXRCMHMX7","download_json":"https://pith.science/pith/AMOY4UFTZBVIIKLIKTXRCMHMX7.json","view_paper":"https://pith.science/paper/AMOY4UFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.02171&json=true","fetch_graph":"https://pith.science/api/pith-number/AMOY4UFTZBVIIKLIKTXRCMHMX7/graph.json","fetch_events":"https://pith.science/api/pith-number/AMOY4UFTZBVIIKLIKTXRCMHMX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMOY4UFTZBVIIKLIKTXRCMHMX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMOY4UFTZBVIIKLIKTXRCMHMX7/action/storage_attestation","attest_author":"https://pith.science/pith/AMOY4UFTZBVIIKLIKTXRCMHMX7/action/author_attestation","sign_citation":"https://pith.science/pith/AMOY4UFTZBVIIKLIKTXRCMHMX7/action/citation_signature","submit_replication":"https://pith.science/pith/AMOY4UFTZBVIIKLIKTXRCMHMX7/action/replication_record"}},"created_at":"2026-05-20T00:04:33.546440+00:00","updated_at":"2026-05-20T00:04:33.546440+00:00"}