{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DCK7WD6VL37HYQIJGYBA2ANZXX","short_pith_number":"pith:DCK7WD6V","canonical_record":{"source":{"id":"2605.13810","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T17:38:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3259f4be765356e1b7101b9ec0a7e448db8dfef729936d0c79ccee9ecb121d7e","abstract_canon_sha256":"cb576d08788a08e09795b4caddc60d07c2486d82f701b785014d55a1aa6482f1"},"schema_version":"1.0"},"canonical_sha256":"1895fb0fd55efe7c410936020d01b9bdf634b18ab5816bb150b69d7360ccb8cb","source":{"kind":"arxiv","id":"2605.13810","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13810","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13810v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13810","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"DCK7WD6VL37H","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DCK7WD6VL37HYQIJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DCK7WD6V","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DCK7WD6VL37HYQIJGYBA2ANZXX","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13810","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T17:38:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3259f4be765356e1b7101b9ec0a7e448db8dfef729936d0c79ccee9ecb121d7e","abstract_canon_sha256":"cb576d08788a08e09795b4caddc60d07c2486d82f701b785014d55a1aa6482f1"},"schema_version":"1.0"},"canonical_sha256":"1895fb0fd55efe7c410936020d01b9bdf634b18ab5816bb150b69d7360ccb8cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:15.402885Z","signature_b64":"5tlLA6EmNsJHtdMOFalsF9wN8U/896y8pwSEQ+q/7yYPPeDWX6+0IR0L6RxNfwfqp6xMEBZoQSEBviV11MrcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1895fb0fd55efe7c410936020d01b9bdf634b18ab5816bb150b69d7360ccb8cb","last_reissued_at":"2026-05-18T02:44:15.402305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:15.402305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13810","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-18T02:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ac+9j8nBzpfQKPm1ega2lvGqbBQ3H5JvCViipI46u9nMx5toM4+9jxLu1U7DcGhAnEOs4uvMfKqj8jwpkYlgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:18:28.706697Z"},"content_sha256":"ae10a28c9e57bacbe10f89b2b69fcb68e0037921ef530ab6d179b13e55c42870","schema_version":"1.0","event_id":"sha256:ae10a28c9e57bacbe10f89b2b69fcb68e0037921ef530ab6d179b13e55c42870"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DCK7WD6VL37HYQIJGYBA2ANZXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable Quantization with Randomized Hadamard Transform","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Dithered quantization after randomized Hadamard transform matches the error of dense random rotations at linearithmic cost.","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Boris Prokhorov, Dmitry Krachun, Michael Kapralov, Piotr Indyk, Ying Feng","submitted_at":"2026-05-13T17:38:18Z","abstract_excerpt":"Vector quantization via random projection followed by scalar quantization is a fundamental primitive in machine learning, with applications ranging from similarity search to federated learning and KV cache compression. While dense random rotations yield clean theoretical guarantees, they require $\\Theta(d^2)$ time. The randomized Hadamard transform $HD$ reduces this cost to $O(d \\log d)$, but its discrete structure complicates analysis and leads to weaker or purely empirical compression guarantees.\n  In this work, we study a variant of this approach: dithered quantization with a single randomi"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"A dithered version of TurboQuant achieves mean squared error (π√3/2 + o(1)) · 4^{-b} at b bits per coordinate, where the o(1) term vanishes uniformly over all unit vectors and all dimensions as the number of quantization levels grows.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The analysis assumes the input vectors are unit vectors and relies on the asymptotic regime where the number of quantization levels grows; the uniformity claim over all dimensions and vectors may require additional technical conditions on the dither distribution that are not fully detailed in the abstract.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Dithered quantization after a single randomized Hadamard transform yields unbiased estimates whose MSE asymptotically equals that of dense random rotations, specifically (π√3/2 + o(1))·4^{-b} for b-bit TurboQuant.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Dithered quantization after randomized Hadamard transform matches the error of dense random rotations at linearithmic cost.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"08c9edaf8d30133c15f7c76c2cbf144db3de9be856b06176d9c757c0b4920b15"},"source":{"id":"2605.13810","kind":"arxiv","version":1},"verdict":{"id":"55cdd0fc-1ed5-43e0-9f5a-eb4363b8a519","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:23:05.736386Z","strongest_claim":"A dithered version of TurboQuant achieves mean squared error (π√3/2 + o(1)) · 4^{-b} at b bits per coordinate, where the o(1) term vanishes uniformly over all unit vectors and all dimensions as the number of quantization levels grows.","one_line_summary":"Dithered quantization after a single randomized Hadamard transform yields unbiased estimates whose MSE asymptotically equals that of dense random rotations, specifically (π√3/2 + o(1))·4^{-b} for b-bit TurboQuant.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The analysis assumes the input vectors are unit vectors and relies on the asymptotic regime where the number of quantization levels grows; the uniformity claim over all dimensions and vectors may require additional technical conditions on the dither distribution that are not fully detailed in the abstract.","pith_extraction_headline":"Dithered quantization after randomized Hadamard transform matches the error of dense random rotations at linearithmic cost."},"references":{"count":38,"sample":[{"doi":"","year":null,"title":"Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing , pages=","work_id":"47611ad1-835b-47cc-b583-fd18f46a3525","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=","work_id":"c5b78240-0e0e-4924-9a71-749f762e602a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of the Twentieth Annual Symposium on Computational Geometry , pages=","work_id":"a37bab56-f417-4ec3-98f3-77e0f250ba56","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval , pages=","work_id":"951997c4-4a60-403e-a58f-237476c67aa6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","work_id":"67608266-46ab-4cc0-aaa8-1ebc437a78e5","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":38,"snapshot_sha256":"791bbbbbd07ffe8252d6b0c33335e8bdadb69c2f447f3404991b1353239ad2a9","internal_anchors":3},"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":"55cdd0fc-1ed5-43e0-9f5a-eb4363b8a519"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7E6rXOKCduxhL6oIgr4xJVlCPym5epvt7SnYW6uskgvuQTEhElqsuK5m8ttv/Okcq++4+2dhrdCTZmjSHbnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:18:28.707964Z"},"content_sha256":"9d252154a455edc62684bc8054546d1ca904068f3c502322668bd9a26c0ed9d3","schema_version":"1.0","event_id":"sha256:9d252154a455edc62684bc8054546d1ca904068f3c502322668bd9a26c0ed9d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCK7WD6VL37HYQIJGYBA2ANZXX/bundle.json","state_url":"https://pith.science/pith/DCK7WD6VL37HYQIJGYBA2ANZXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCK7WD6VL37HYQIJGYBA2ANZXX/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-05-30T21:18:28Z","links":{"resolver":"https://pith.science/pith/DCK7WD6VL37HYQIJGYBA2ANZXX","bundle":"https://pith.science/pith/DCK7WD6VL37HYQIJGYBA2ANZXX/bundle.json","state":"https://pith.science/pith/DCK7WD6VL37HYQIJGYBA2ANZXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCK7WD6VL37HYQIJGYBA2ANZXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DCK7WD6VL37HYQIJGYBA2ANZXX","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":"cb576d08788a08e09795b4caddc60d07c2486d82f701b785014d55a1aa6482f1","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T17:38:18Z","title_canon_sha256":"3259f4be765356e1b7101b9ec0a7e448db8dfef729936d0c79ccee9ecb121d7e"},"schema_version":"1.0","source":{"id":"2605.13810","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13810","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13810v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13810","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"DCK7WD6VL37H","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DCK7WD6VL37HYQIJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DCK7WD6V","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:9d252154a455edc62684bc8054546d1ca904068f3c502322668bd9a26c0ed9d3","target":"graph","created_at":"2026-05-18T02:44:15Z","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":"A dithered version of TurboQuant achieves mean squared error (π√3/2 + o(1)) · 4^{-b} at b bits per coordinate, where the o(1) term vanishes uniformly over all unit vectors and all dimensions as the number of quantization levels grows."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The analysis assumes the input vectors are unit vectors and relies on the asymptotic regime where the number of quantization levels grows; the uniformity claim over all dimensions and vectors may require additional technical conditions on the dither distribution that are not fully detailed in the abstract."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Dithered quantization after a single randomized Hadamard transform yields unbiased estimates whose MSE asymptotically equals that of dense random rotations, specifically (π√3/2 + o(1))·4^{-b} for b-bit TurboQuant."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Dithered quantization after randomized Hadamard transform matches the error of dense random rotations at linearithmic cost."}],"snapshot_sha256":"08c9edaf8d30133c15f7c76c2cbf144db3de9be856b06176d9c757c0b4920b15"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Vector quantization via random projection followed by scalar quantization is a fundamental primitive in machine learning, with applications ranging from similarity search to federated learning and KV cache compression. While dense random rotations yield clean theoretical guarantees, they require $\\Theta(d^2)$ time. The randomized Hadamard transform $HD$ reduces this cost to $O(d \\log d)$, but its discrete structure complicates analysis and leads to weaker or purely empirical compression guarantees.\n  In this work, we study a variant of this approach: dithered quantization with a single randomi","authors_text":"Boris Prokhorov, Dmitry Krachun, Michael Kapralov, Piotr Indyk, Ying Feng","cross_cats":["cs.DS"],"headline":"Dithered quantization after randomized Hadamard transform matches the error of dense random rotations at linearithmic cost.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T17:38:18Z","title":"Provable Quantization with Randomized Hadamard Transform"},"references":{"count":38,"internal_anchors":3,"resolved_work":38,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing , pages=","work_id":"47611ad1-835b-47cc-b583-fd18f46a3525","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=","work_id":"c5b78240-0e0e-4924-9a71-749f762e602a","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Proceedings of the Twentieth Annual Symposium on Computational Geometry , pages=","work_id":"a37bab56-f417-4ec3-98f3-77e0f250ba56","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval , pages=","work_id":"951997c4-4a60-403e-a58f-237476c67aa6","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","work_id":"67608266-46ab-4cc0-aaa8-1ebc437a78e5","year":null}],"snapshot_sha256":"791bbbbbd07ffe8252d6b0c33335e8bdadb69c2f447f3404991b1353239ad2a9"},"source":{"id":"2605.13810","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:23:05.736386Z","id":"55cdd0fc-1ed5-43e0-9f5a-eb4363b8a519","model_set":{"reader":"grok-4.3"},"one_line_summary":"Dithered quantization after a single randomized Hadamard transform yields unbiased estimates whose MSE asymptotically equals that of dense random rotations, specifically (π√3/2 + o(1))·4^{-b} for b-bit TurboQuant.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Dithered quantization after randomized Hadamard transform matches the error of dense random rotations at linearithmic cost.","strongest_claim":"A dithered version of TurboQuant achieves mean squared error (π√3/2 + o(1)) · 4^{-b} at b bits per coordinate, where the o(1) term vanishes uniformly over all unit vectors and all dimensions as the number of quantization levels grows.","weakest_assumption":"The analysis assumes the input vectors are unit vectors and relies on the asymptotic regime where the number of quantization levels grows; the uniformity claim over all dimensions and vectors may require additional technical conditions on the dither distribution that are not fully detailed in the abstract."}},"verdict_id":"55cdd0fc-1ed5-43e0-9f5a-eb4363b8a519"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ae10a28c9e57bacbe10f89b2b69fcb68e0037921ef530ab6d179b13e55c42870","target":"record","created_at":"2026-05-18T02:44:15Z","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":"cb576d08788a08e09795b4caddc60d07c2486d82f701b785014d55a1aa6482f1","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T17:38:18Z","title_canon_sha256":"3259f4be765356e1b7101b9ec0a7e448db8dfef729936d0c79ccee9ecb121d7e"},"schema_version":"1.0","source":{"id":"2605.13810","kind":"arxiv","version":1}},"canonical_sha256":"1895fb0fd55efe7c410936020d01b9bdf634b18ab5816bb150b69d7360ccb8cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1895fb0fd55efe7c410936020d01b9bdf634b18ab5816bb150b69d7360ccb8cb","first_computed_at":"2026-05-18T02:44:15.402305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:15.402305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5tlLA6EmNsJHtdMOFalsF9wN8U/896y8pwSEQ+q/7yYPPeDWX6+0IR0L6RxNfwfqp6xMEBZoQSEBviV11MrcBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:15.402885Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13810","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae10a28c9e57bacbe10f89b2b69fcb68e0037921ef530ab6d179b13e55c42870","sha256:9d252154a455edc62684bc8054546d1ca904068f3c502322668bd9a26c0ed9d3"],"state_sha256":"6ae17f0727fadf2a82bc6efb961793c1f83b19c0ada487fb044edf23042f8cd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55xoSCh1oaCRfTqbBfPfCsCuOYiwtRtPzYtONBtc417ngjkQ+AGy9DGYALrD0m+rYYiLSRZVwcTqtDzTV19vDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:18:28.714472Z","bundle_sha256":"b268a1f86777964240745cb030b16ab0928d3e0f9d9a92d1ed4a5e312c6e2dab"}}