{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:V4TWZTSCXGEMKFIEMS7UTP73UA","short_pith_number":"pith:V4TWZTSC","schema_version":"1.0","canonical_sha256":"af276cce42b988c5150464bf49bffba016daf5447a5b4915119c7c9982c173f4","source":{"kind":"arxiv","id":"2505.13164","version":1},"attestation_state":"computed","paper":{"title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Iris Kaplan, Or Ordentlich","submitted_at":"2025-05-19T14:22:30Z","abstract_excerpt":"Recent work have shown that the quantization for matrix multiplication problem can be optimally solved by quantizing each column in each matrix using a nested lattice code, and then multiplying the de-quantized matrices. It was further demonstrated that when product codes of sub-dimension $d$ and rate $R$ are used, the de-quantization and inner product operations can be implemented with querying a lookup table (LUT) of size $2^{2dR}$, but this is only useful when $dR$ is sufficiently small. This in turn limits LUT-based inner product decoding to low-rate quantizers. In this work, we develop a "},"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":false},"canonical_record":{"source":{"id":"2505.13164","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-19T14:22:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c819972fca09c5a236ec4bdf1d3b987447035a17478e1bfaa5bd1e81cef54a8","abstract_canon_sha256":"43518b52ce65e7a84f7f7e04e083a3b86d80870bf67bfcc2cafc9b55fad5b378"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:26.100732Z","signature_b64":"M2KPIZn1c7PzOlGrKl6mLecEHpfIJzFjIVPL+ZWxoM+pI8h+UOHYEB52t93Pwdxt9jlhGjpPwoZq42Kwn+0sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af276cce42b988c5150464bf49bffba016daf5447a5b4915119c7c9982c173f4","last_reissued_at":"2026-07-05T11:05:26.100201Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:26.100201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Iris Kaplan, Or Ordentlich","submitted_at":"2025-05-19T14:22:30Z","abstract_excerpt":"Recent work have shown that the quantization for matrix multiplication problem can be optimally solved by quantizing each column in each matrix using a nested lattice code, and then multiplying the de-quantized matrices. It was further demonstrated that when product codes of sub-dimension $d$ and rate $R$ are used, the de-quantization and inner product operations can be implemented with querying a lookup table (LUT) of size $2^{2dR}$, but this is only useful when $dR$ is sufficiently small. This in turn limits LUT-based inner product decoding to low-rate quantizers. In this work, we develop a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13164","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.13164/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.13164","created_at":"2026-07-05T11:05:26.100278+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13164v1","created_at":"2026-07-05T11:05:26.100278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13164","created_at":"2026-07-05T11:05:26.100278+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4TWZTSCXGEM","created_at":"2026-07-05T11:05:26.100278+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4TWZTSCXGEMKFIE","created_at":"2026-07-05T11:05:26.100278+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4TWZTSC","created_at":"2026-07-05T11:05:26.100278+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V4TWZTSCXGEMKFIEMS7UTP73UA","json":"https://pith.science/pith/V4TWZTSCXGEMKFIEMS7UTP73UA.json","graph_json":"https://pith.science/api/pith-number/V4TWZTSCXGEMKFIEMS7UTP73UA/graph.json","events_json":"https://pith.science/api/pith-number/V4TWZTSCXGEMKFIEMS7UTP73UA/events.json","paper":"https://pith.science/paper/V4TWZTSC"},"agent_actions":{"view_html":"https://pith.science/pith/V4TWZTSCXGEMKFIEMS7UTP73UA","download_json":"https://pith.science/pith/V4TWZTSCXGEMKFIEMS7UTP73UA.json","view_paper":"https://pith.science/paper/V4TWZTSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13164&json=true","fetch_graph":"https://pith.science/api/pith-number/V4TWZTSCXGEMKFIEMS7UTP73UA/graph.json","fetch_events":"https://pith.science/api/pith-number/V4TWZTSCXGEMKFIEMS7UTP73UA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4TWZTSCXGEMKFIEMS7UTP73UA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4TWZTSCXGEMKFIEMS7UTP73UA/action/storage_attestation","attest_author":"https://pith.science/pith/V4TWZTSCXGEMKFIEMS7UTP73UA/action/author_attestation","sign_citation":"https://pith.science/pith/V4TWZTSCXGEMKFIEMS7UTP73UA/action/citation_signature","submit_replication":"https://pith.science/pith/V4TWZTSCXGEMKFIEMS7UTP73UA/action/replication_record"}},"created_at":"2026-07-05T11:05:26.100278+00:00","updated_at":"2026-07-05T11:05:26.100278+00:00"}