{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AMOY4UFTZBVIIKLIKTXRCMHMX7","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":"0bc436fad5e0383f8c2f7cdc76ddcdce19ee1a96b9f669355e9a7a49e1b64571","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-04T03:04:12Z","title_canon_sha256":"0ff3f864b0bb5b7a900acda496c62535c52a8e5612c5371e8e66ad3d9a9b011b"},"schema_version":"1.0","source":{"id":"2605.02171","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.02171","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.02171v3","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.02171","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"pith_short_12","alias_value":"AMOY4UFTZBVI","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"pith_short_16","alias_value":"AMOY4UFTZBVIIKLI","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"pith_short_8","alias_value":"AMOY4UFT","created_at":"2026-05-20T00:04:33Z"}],"graph_snapshots":[{"event_id":"sha256:20725f12dd5dfc60aed84a681ec6cd37adc7b9f91d508eda6ef33407f5ce855a","target":"graph","created_at":"2026-05-20T00:04:33Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"QuIVer builds ANN graph indices entirely inside a 2-bit sign-magnitude binary quantization space."}],"snapshot_sha256":"98227fa1ac77948c666d7009359c15384e32215c06edde6dc25d40a6a2384184"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3361213e65725c136f33317cd532b624d9f62839080d35efa45253131963ecd1"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:37:36.711643Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.02171/integrity.json","findings":[],"snapshot_sha256":"c388a9c9ce25618f32a05a45abf3e810edb440d1007d64dc20d566b98e53cae0","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chengcheng Li, Wenxuan Xiao, Zhiyou Wang","cross_cats":[],"headline":"QuIVer builds ANN graph indices entirely inside a 2-bit sign-magnitude binary quantization space.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-04T03:04:12Z","title":"QuIVer: Rethinking ANN Graph Topology via Training-Free Binary Quantization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.02171","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-12T01:48:47.909907Z","id":"5a412625-a302-4e7e-97bf-6b9505cc9cac","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"QuIVer builds ANN graph indices entirely inside a 2-bit sign-magnitude binary quantization space.","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.","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."}},"verdict_id":"5a412625-a302-4e7e-97bf-6b9505cc9cac"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4fa796bed6fd1656740a54207611955526972ab91a307815cdac228a44adc819","target":"record","created_at":"2026-05-20T00:04:33Z","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":"0bc436fad5e0383f8c2f7cdc76ddcdce19ee1a96b9f669355e9a7a49e1b64571","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-04T03:04:12Z","title_canon_sha256":"0ff3f864b0bb5b7a900acda496c62535c52a8e5612c5371e8e66ad3d9a9b011b"},"schema_version":"1.0","source":{"id":"2605.02171","kind":"arxiv","version":3}},"canonical_sha256":"031d8e50b3c86a84296854ef1130ecbff4c25ba7a8c69db1308a3bc4021e95db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"031d8e50b3c86a84296854ef1130ecbff4c25ba7a8c69db1308a3bc4021e95db","first_computed_at":"2026-05-20T00:04:33.546337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:33.546337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AlGiOpFL4DCgukGABWsZFfPnl3Lb5ATKpym25YQctVRm0HQ68UtM0DJUJEAiiPvqU3hwzc5+Ft6cXiOtXKirDQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:33.547067Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.02171","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fa796bed6fd1656740a54207611955526972ab91a307815cdac228a44adc819","sha256:20725f12dd5dfc60aed84a681ec6cd37adc7b9f91d508eda6ef33407f5ce855a"],"state_sha256":"317cb92cc3a874e195e89e259fa075ed0e50109c8b4e7a40deafeb10d32fe591"}