{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GPLOGFPREDPALMNKUB4FF2BHCM","short_pith_number":"pith:GPLOGFPR","schema_version":"1.0","canonical_sha256":"33d6e315f120de05b1aaa07852e82713129d377b62d97d8f8c9573f3e9542c9f","source":{"kind":"arxiv","id":"1801.07487","version":5},"attestation_state":"computed","paper":{"title":"Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding","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":"2018-01-23T11:34:59Z","abstract_excerpt":"We consider the problem of massive matrix multiplication, which underlies many data analytic applications, in a large-scale distributed system comprising a group of worker nodes. We target the stragglers' delay performance bottleneck, which is due to the unpredictable latency in waiting for slowest nodes (or stragglers) to finish their tasks. We propose a novel coding strategy, named \\emph{entangled polynomial code}, for designing the intermediate computations at the worker nodes in order to minimize the recovery threshold (i.e., the number of workers that we need to wait for in order to compu"},"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":"1801.07487","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T11:34:59Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"d2fe8282d9cb5631e310900c2f131fa58b2fb4428250dde8fcdb80127857209a","abstract_canon_sha256":"c7abb211c52c3a6240f31cf9a89d6e4f62a321dd602dec8cc41d0ec5e8a56fb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:00.207273Z","signature_b64":"YszxasDflx9tJeEqmwsI6vuqMcG1aOp4kaz4V4CG3ZYazcz0vAYshueXk/wjuztFMMsy63elpEwAhWBTRKckDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d6e315f120de05b1aaa07852e82713129d377b62d97d8f8c9573f3e9542c9f","last_reissued_at":"2026-07-05T00:54:00.206902Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:00.206902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding","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":"2018-01-23T11:34:59Z","abstract_excerpt":"We consider the problem of massive matrix multiplication, which underlies many data analytic applications, in a large-scale distributed system comprising a group of worker nodes. We target the stragglers' delay performance bottleneck, which is due to the unpredictable latency in waiting for slowest nodes (or stragglers) to finish their tasks. We propose a novel coding strategy, named \\emph{entangled polynomial code}, for designing the intermediate computations at the worker nodes in order to minimize the recovery threshold (i.e., the number of workers that we need to wait for in order to compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07487","kind":"arxiv","version":5},"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/1801.07487/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":"1801.07487","created_at":"2026-07-05T00:54:00.206951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07487v5","created_at":"2026-07-05T00:54:00.206951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07487","created_at":"2026-07-05T00:54:00.206951+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPLOGFPREDPA","created_at":"2026-07-05T00:54:00.206951+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPLOGFPREDPALMNK","created_at":"2026-07-05T00:54:00.206951+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPLOGFPR","created_at":"2026-07-05T00:54:00.206951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1906.10684","citing_title":"On the Upload versus Download Cost for Secure and Private Matrix Multiplication","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"1907.05984","citing_title":"Distributed Black-Box Optimization via Error Correcting Codes","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"1907.05965","citing_title":"Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GPLOGFPREDPALMNKUB4FF2BHCM","json":"https://pith.science/pith/GPLOGFPREDPALMNKUB4FF2BHCM.json","graph_json":"https://pith.science/api/pith-number/GPLOGFPREDPALMNKUB4FF2BHCM/graph.json","events_json":"https://pith.science/api/pith-number/GPLOGFPREDPALMNKUB4FF2BHCM/events.json","paper":"https://pith.science/paper/GPLOGFPR"},"agent_actions":{"view_html":"https://pith.science/pith/GPLOGFPREDPALMNKUB4FF2BHCM","download_json":"https://pith.science/pith/GPLOGFPREDPALMNKUB4FF2BHCM.json","view_paper":"https://pith.science/paper/GPLOGFPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07487&json=true","fetch_graph":"https://pith.science/api/pith-number/GPLOGFPREDPALMNKUB4FF2BHCM/graph.json","fetch_events":"https://pith.science/api/pith-number/GPLOGFPREDPALMNKUB4FF2BHCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPLOGFPREDPALMNKUB4FF2BHCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPLOGFPREDPALMNKUB4FF2BHCM/action/storage_attestation","attest_author":"https://pith.science/pith/GPLOGFPREDPALMNKUB4FF2BHCM/action/author_attestation","sign_citation":"https://pith.science/pith/GPLOGFPREDPALMNKUB4FF2BHCM/action/citation_signature","submit_replication":"https://pith.science/pith/GPLOGFPREDPALMNKUB4FF2BHCM/action/replication_record"}},"created_at":"2026-07-05T00:54:00.206951+00:00","updated_at":"2026-07-05T00:54:00.206951+00:00"}