{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IEBCQACCCEQO55L4NREYAH2V3Q","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":"2263ce672846468b29f09a16079821010ee865d89bb95b27c5dd4c112ea2992b","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T04:13:09Z","title_canon_sha256":"6d146a28ad4148a7e80264e0c4589692805f124d7aa1e9edec8af48cd7684825"},"schema_version":"1.0","source":{"id":"1801.10292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10292","created_at":"2026-05-18T00:15:51Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10292v2","created_at":"2026-05-18T00:15:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10292","created_at":"2026-05-18T00:15:51Z"},{"alias_kind":"pith_short_12","alias_value":"IEBCQACCCEQO","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IEBCQACCCEQO55L4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IEBCQACC","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:3e4e39d9b66b163db766884a0f500cc79c595a34ada6f6f8f95c69d6e33986f5","target":"graph","created_at":"2026-05-18T00:15:51Z","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"},"paper":{"abstract_excerpt":"We provide novel coded computation strategies for distributed matrix-matrix products that outperform the recent \"Polynomial code\" constructions in recovery threshold, i.e., the required number of successful workers. When $m$-th fraction of each matrix can be stored in each worker node, Polynomial codes require $m^2$ successful workers, while our MatDot codes only require $2m-1$ successful workers, albeit at a higher communication cost from each worker to the fusion node. We also provide a systematic construction of MatDot codes. Further, we propose \"PolyDot\" coding that interpolates between Po","authors_text":"Farzin Haddadpour, Haewon Jeong, Mohammad Fahim, Pulkit Grover, Sanghamitra Dutta, Viveck Cadambe","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T04:13:09Z","title":"On the Optimal Recovery Threshold of Coded Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10292","kind":"arxiv","version":2},"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:b0d9ce8e13cea2d6f008ecc05be5059b0a95e3579a8ffe9b54eb1aefc96cb4ef","target":"record","created_at":"2026-05-18T00:15:51Z","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":"2263ce672846468b29f09a16079821010ee865d89bb95b27c5dd4c112ea2992b","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T04:13:09Z","title_canon_sha256":"6d146a28ad4148a7e80264e0c4589692805f124d7aa1e9edec8af48cd7684825"},"schema_version":"1.0","source":{"id":"1801.10292","kind":"arxiv","version":2}},"canonical_sha256":"41022800421120eef57c6c49801f55dc26eecf322552f8c5210cce170ec92929","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41022800421120eef57c6c49801f55dc26eecf322552f8c5210cce170ec92929","first_computed_at":"2026-05-18T00:15:51.938527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:51.938527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m2LC2xkzZ3UBRIgGfH1PHsjCyHFD+O5X7rTIFrcekSbjTpfOHUkrAoXnetHn+62vW+S7zWfTyWSP30+N7KB9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:51.939242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.10292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d9ce8e13cea2d6f008ecc05be5059b0a95e3579a8ffe9b54eb1aefc96cb4ef","sha256:3e4e39d9b66b163db766884a0f500cc79c595a34ada6f6f8f95c69d6e33986f5"],"state_sha256":"9ecf4cf522cfac664d85df9dcd683e06840013f99be734f8bda19a53ce9a60cc"}