{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:54M7QLOULRNBFWNASGVZSE2VVO","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":"af679655c803b83f98f81d09126d6b8465a13bdc2ddd9173821e766171303659","cross_cats_sorted":["cs.AI","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-01-23T21:32:44Z","title_canon_sha256":"28bcc846e0410a8e212152795b8654dd2d2f8d8c9d653880774b0defc57e3612"},"schema_version":"1.0","source":{"id":"2601.17187","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.17187","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2601.17187v2","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.17187","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"54M7QLOULRNB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"54M7QLOULRNBFWNA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"54M7QLOU","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:1dadad48d1793344eb6f9d9086f6b09cde4f38c86562d7971acfdb3eae2e2571","target":"graph","created_at":"2026-05-18T02:44:31Z","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":"We review the fundamental information-theoretic tradeoff between quantization rate and distortion (high-rate theory), and contrast those with the performance of popular quantization schemes (absmax INT and floating-point (FP)), for which we also derive accurate heuristic approximations."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The generic MatMul setting can be analyzed under the high-rate quantization regime without any a priori statistical information about the matrix factors."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"High-rate quantization theory yields accurate approximations for the distortion of absmax INT and FP schemes in generic weight-plus-activation matrix multiplication."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"High-rate quantization theory supplies the exact rate-distortion tradeoff for generic matrix multiplication without calibration data"}],"snapshot_sha256":"7bc443eb058df2aed8e51aed07ee7cc0485c7aeb5ebbf2c6651408dafed870ee"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"c0909d9ee5197e0c66e99c03234a7c7d4d637ab52bff298a627b8bde1ce34325"},"paper":{"abstract_excerpt":"This paper investigates the problem of quantized matrix multiplication (MatMul), which has become crucial for the efficient deployment of large language models (LLMs). We consider a Generic MatMul setting, where both matrices must be quantized (weight+activation quantization) without specific apriori (calibration) statistical information about the factors. We review the fundamental information-theoretic tradeoff between quantization rate and distortion (high-rate theory), and contrast those with the performance of popular quantization schemes (absmax INT and floating-point (FP)), for which we ","authors_text":"Or Ordentlich, Yury Polyanskiy","cross_cats":["cs.AI","math.IT"],"headline":"High-rate quantization theory supplies the exact rate-distortion tradeoff for generic matrix multiplication without calibration data","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-01-23T21:32:44Z","title":"High-Rate Quantized Matrix Multiplication I"},"references":{"count":51,"internal_anchors":3,"resolved_work":51,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Optimal quantization for matrix multiplication,","work_id":"67e0dada-22c6-4282-81b0-f8ec7b786c89","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"OPTQ: Accurate quantization for generative pre-trained transformers,","work_id":"3902ff1c-dfb5-4adc-870b-c8ec9abfbb82","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Quip: 2- bit quantization of large language models with guarantees,","work_id":"0aba206f-56c2-4635-8de8-d421053e5962","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"NestQuant: Nested lattice quantization for matrix products and LLMs,","work_id":"f992de1c-558b-403e-b88e-f81e0e9e5949","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Gpt3. int8 (): 8-bit matrix multiplication for transformers at scale,","work_id":"e5a95f16-d998-4ef7-9f71-01077b057362","year":2022}],"snapshot_sha256":"3a839c1fa857ae7801c55a43c41d51102551b6338778401aeb66350a17eb72a9"},"source":{"id":"2601.17187","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T11:16:04.954721Z","id":"d982e895-9e5a-4c8d-8015-8dd24e07edad","model_set":{"reader":"grok-4.3"},"one_line_summary":"High-rate quantization theory yields accurate approximations for the distortion of absmax INT and FP schemes in generic weight-plus-activation matrix multiplication.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"High-rate quantization theory supplies the exact rate-distortion tradeoff for generic matrix multiplication without calibration data","strongest_claim":"We review the fundamental information-theoretic tradeoff between quantization rate and distortion (high-rate theory), and contrast those with the performance of popular quantization schemes (absmax INT and floating-point (FP)), for which we also derive accurate heuristic approximations.","weakest_assumption":"The generic MatMul setting can be analyzed under the high-rate quantization regime without any a priori statistical information about the matrix factors."}},"verdict_id":"d982e895-9e5a-4c8d-8015-8dd24e07edad"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0384d59a06cb61b7d4604aac1198ceb48bf37eaea7f9ffc80099ee6feebd9eaf","target":"record","created_at":"2026-05-18T02:44:31Z","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":"af679655c803b83f98f81d09126d6b8465a13bdc2ddd9173821e766171303659","cross_cats_sorted":["cs.AI","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-01-23T21:32:44Z","title_canon_sha256":"28bcc846e0410a8e212152795b8654dd2d2f8d8c9d653880774b0defc57e3612"},"schema_version":"1.0","source":{"id":"2601.17187","kind":"arxiv","version":2}},"canonical_sha256":"ef19f82dd45c5a12d9a091ab991355abbe9fcc292adc5f6a24cfec1a8ae3e533","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef19f82dd45c5a12d9a091ab991355abbe9fcc292adc5f6a24cfec1a8ae3e533","first_computed_at":"2026-05-18T02:44:31.871149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:31.871149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2f8oeMhSlcfz4sqZm2rQKJ+A/10zfbBvKpomop//uR1ZfFAEiYm7QUTbFRHSNcZykJDzjZUBqhuhiAHPBGx+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:31.871668Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.17187","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0384d59a06cb61b7d4604aac1198ceb48bf37eaea7f9ffc80099ee6feebd9eaf","sha256:1dadad48d1793344eb6f9d9086f6b09cde4f38c86562d7971acfdb3eae2e2571"],"state_sha256":"1b489a173c5b1b4ba3d233d68a0d0d4030226898859cea3b927a2c15ffd7839c"}