{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:V4TWZTSCXGEMKFIEMS7UTP73UA","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":"43518b52ce65e7a84f7f7e04e083a3b86d80870bf67bfcc2cafc9b55fad5b378","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-19T14:22:30Z","title_canon_sha256":"7c819972fca09c5a236ec4bdf1d3b987447035a17478e1bfaa5bd1e81cef54a8"},"schema_version":"1.0","source":{"id":"2505.13164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.13164","created_at":"2026-07-05T11:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"2505.13164v1","created_at":"2026-07-05T11:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13164","created_at":"2026-07-05T11:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"V4TWZTSCXGEM","created_at":"2026-07-05T11:05:26Z"},{"alias_kind":"pith_short_16","alias_value":"V4TWZTSCXGEMKFIE","created_at":"2026-07-05T11:05:26Z"},{"alias_kind":"pith_short_8","alias_value":"V4TWZTSC","created_at":"2026-07-05T11:05:26Z"}],"graph_snapshots":[{"event_id":"sha256:4ae448b730d7c0bdaf12ef7974ab2b5c79e967fc92485c9f8051fa8105a40515","target":"graph","created_at":"2026-07-05T11:05:26Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.13164/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Iris Kaplan, Or Ordentlich","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-19T14:22:30Z","title":"High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13164","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:02db4242f48a286f4e0deb3800c320d2f55b17fe48d68db714b612908f737015","target":"record","created_at":"2026-07-05T11:05:26Z","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":"43518b52ce65e7a84f7f7e04e083a3b86d80870bf67bfcc2cafc9b55fad5b378","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-19T14:22:30Z","title_canon_sha256":"7c819972fca09c5a236ec4bdf1d3b987447035a17478e1bfaa5bd1e81cef54a8"},"schema_version":"1.0","source":{"id":"2505.13164","kind":"arxiv","version":1}},"canonical_sha256":"af276cce42b988c5150464bf49bffba016daf5447a5b4915119c7c9982c173f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af276cce42b988c5150464bf49bffba016daf5447a5b4915119c7c9982c173f4","first_computed_at":"2026-07-05T11:05:26.100201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:05:26.100201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M2KPIZn1c7PzOlGrKl6mLecEHpfIJzFjIVPL+ZWxoM+pI8h+UOHYEB52t93Pwdxt9jlhGjpPwoZq42Kwn+0sDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:05:26.100732Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.13164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02db4242f48a286f4e0deb3800c320d2f55b17fe48d68db714b612908f737015","sha256:4ae448b730d7c0bdaf12ef7974ab2b5c79e967fc92485c9f8051fa8105a40515"],"state_sha256":"d6f9c4b22551899b257c67f9a8bbfffefa09145ce63bfc7dfc16e68d9e3ca9bd"}