{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:USF23YIUEUXU37DM7RQQYER6BX","short_pith_number":"pith:USF23YIU","schema_version":"1.0","canonical_sha256":"a48bade114252f4dfc6cfc610c123e0df63fbff90a62537fe84be6f3a2dd2774","source":{"kind":"arxiv","id":"1705.10464","version":2},"attestation_state":"computed","paper":{"title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu","submitted_at":"2017-05-30T06:07:16Z","abstract_excerpt":"We consider a large-scale matrix multiplication problem where the computation is carried out using a distributed system with a master node and multiple worker nodes, where each worker can store parts of the input matrices. We propose a computation strategy that leverages ideas from coding theory to design intermediate computations at the worker nodes, in order to efficiently deal with straggling workers. The proposed strategy, named as \\emph{polynomial codes}, achieves the optimum recovery threshold, defined as the minimum number of workers that the master needs to wait for in order to compute"},"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":"1705.10464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T06:07:16Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"199539e976b61826884df99eb958ce85f27e1df456e965acf05d25546abda71b","abstract_canon_sha256":"d890df181a80f2181f1dc6af097bd309aa102ecace9c2c61aa30a26540ac1a1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:11.710774Z","signature_b64":"mF8KG/bcnQcz10cP5w6+f17MvqbgkjPyv2HfSE/WVYSP+K7wXAy9Zeixfjv1YAF+xwscbuSVZqRBblpJOgaeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a48bade114252f4dfc6cfc610c123e0df63fbff90a62537fe84be6f3a2dd2774","last_reissued_at":"2026-05-18T00:25:11.710300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:11.710300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu","submitted_at":"2017-05-30T06:07:16Z","abstract_excerpt":"We consider a large-scale matrix multiplication problem where the computation is carried out using a distributed system with a master node and multiple worker nodes, where each worker can store parts of the input matrices. We propose a computation strategy that leverages ideas from coding theory to design intermediate computations at the worker nodes, in order to efficiently deal with straggling workers. The proposed strategy, named as \\emph{polynomial codes}, achieves the optimum recovery threshold, defined as the minimum number of workers that the master needs to wait for in order to compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10464","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1705.10464","created_at":"2026-05-18T00:25:11.710399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10464v2","created_at":"2026-05-18T00:25:11.710399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10464","created_at":"2026-05-18T00:25:11.710399+00:00"},{"alias_kind":"pith_short_12","alias_value":"USF23YIUEUXU","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"USF23YIUEUXU37DM","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"USF23YIU","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05965","citing_title":"Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX","json":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX.json","graph_json":"https://pith.science/api/pith-number/USF23YIUEUXU37DM7RQQYER6BX/graph.json","events_json":"https://pith.science/api/pith-number/USF23YIUEUXU37DM7RQQYER6BX/events.json","paper":"https://pith.science/paper/USF23YIU"},"agent_actions":{"view_html":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX","download_json":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX.json","view_paper":"https://pith.science/paper/USF23YIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10464&json=true","fetch_graph":"https://pith.science/api/pith-number/USF23YIUEUXU37DM7RQQYER6BX/graph.json","fetch_events":"https://pith.science/api/pith-number/USF23YIUEUXU37DM7RQQYER6BX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX/action/storage_attestation","attest_author":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX/action/author_attestation","sign_citation":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX/action/citation_signature","submit_replication":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX/action/replication_record"}},"created_at":"2026-05-18T00:25:11.710399+00:00","updated_at":"2026-05-18T00:25:11.710399+00:00"}