{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TVJUVZJ26KLXEZCSETPUOBOWZT","short_pith_number":"pith:TVJUVZJ2","schema_version":"1.0","canonical_sha256":"9d534ae53af29772645224df4705d6ccc88ca34978e87eac5248f4669a311b30","source":{"kind":"arxiv","id":"1707.03858","version":3},"attestation_state":"computed","paper":{"title":"Gradient Coding from Cyclic MDS Codes and Expander Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Itzhak Tamo, Netanel Raviv, Rashish Tandon","submitted_at":"2017-07-12T18:38:54Z","abstract_excerpt":"Gradient coding is a technique for straggler mitigation in distributed learning. In this paper we design novel gradient codes using tools from classical coding theory, namely, cyclic MDS codes, which compare favorably with existing solutions, both in the applicable range of parameters and in the complexity of the involved algorithms. Second, we introduce an approximate variant of the gradient coding problem, in which we settle for approximate gradient computation instead of the exact one. This approach enables graceful degradation, i.e., the $\\ell_2$ error of the approximate gradient is a decr"},"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":"1707.03858","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-12T18:38:54Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"3b9a9eccaab172c5a71c96e07d10e0bd721e1b7e1db1bf5ec17b190704139619","abstract_canon_sha256":"326267bd965476198d493455ecaa67b0c1e1ba99aab4afb18229237e97881c17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:18.369584Z","signature_b64":"mvYASiyORK6+rZcr8HBHy15Bg25gnffI1RYbcGC0JEtEIvFj2yV4Q9o4OOxRI2paV3q9UZXwY0w8+sni0y3sBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d534ae53af29772645224df4705d6ccc88ca34978e87eac5248f4669a311b30","last_reissued_at":"2026-05-17T23:41:18.368947Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:18.368947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient Coding from Cyclic MDS Codes and Expander Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Itzhak Tamo, Netanel Raviv, Rashish Tandon","submitted_at":"2017-07-12T18:38:54Z","abstract_excerpt":"Gradient coding is a technique for straggler mitigation in distributed learning. In this paper we design novel gradient codes using tools from classical coding theory, namely, cyclic MDS codes, which compare favorably with existing solutions, both in the applicable range of parameters and in the complexity of the involved algorithms. Second, we introduce an approximate variant of the gradient coding problem, in which we settle for approximate gradient computation instead of the exact one. This approach enables graceful degradation, i.e., the $\\ell_2$ error of the approximate gradient is a decr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03858","kind":"arxiv","version":3},"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":"1707.03858","created_at":"2026-05-17T23:41:18.369039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03858v3","created_at":"2026-05-17T23:41:18.369039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03858","created_at":"2026-05-17T23:41:18.369039+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVJUVZJ26KLX","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVJUVZJ26KLXEZCS","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVJUVZJ2","created_at":"2026-05-18T12:31:46.661854+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/TVJUVZJ26KLXEZCSETPUOBOWZT","json":"https://pith.science/pith/TVJUVZJ26KLXEZCSETPUOBOWZT.json","graph_json":"https://pith.science/api/pith-number/TVJUVZJ26KLXEZCSETPUOBOWZT/graph.json","events_json":"https://pith.science/api/pith-number/TVJUVZJ26KLXEZCSETPUOBOWZT/events.json","paper":"https://pith.science/paper/TVJUVZJ2"},"agent_actions":{"view_html":"https://pith.science/pith/TVJUVZJ26KLXEZCSETPUOBOWZT","download_json":"https://pith.science/pith/TVJUVZJ26KLXEZCSETPUOBOWZT.json","view_paper":"https://pith.science/paper/TVJUVZJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03858&json=true","fetch_graph":"https://pith.science/api/pith-number/TVJUVZJ26KLXEZCSETPUOBOWZT/graph.json","fetch_events":"https://pith.science/api/pith-number/TVJUVZJ26KLXEZCSETPUOBOWZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVJUVZJ26KLXEZCSETPUOBOWZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVJUVZJ26KLXEZCSETPUOBOWZT/action/storage_attestation","attest_author":"https://pith.science/pith/TVJUVZJ26KLXEZCSETPUOBOWZT/action/author_attestation","sign_citation":"https://pith.science/pith/TVJUVZJ26KLXEZCSETPUOBOWZT/action/citation_signature","submit_replication":"https://pith.science/pith/TVJUVZJ26KLXEZCSETPUOBOWZT/action/replication_record"}},"created_at":"2026-05-17T23:41:18.369039+00:00","updated_at":"2026-05-17T23:41:18.369039+00:00"}