{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WJIO3YYJPOAUTJEFMDH7CL5H62","short_pith_number":"pith:WJIO3YYJ","schema_version":"1.0","canonical_sha256":"b250ede3097b8149a48560cff12fa7f6b7579dcadc1c095fa1d8fd334a33d1b1","source":{"kind":"arxiv","id":"2211.13802","version":2},"attestation_state":"computed","paper":{"title":"Sequential Gradient Coding For Straggler Mitigation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Ashish Khisti, M. Nikhil Krishnan, MohammadReza Ebrahimi","submitted_at":"2022-11-24T21:12:49Z","abstract_excerpt":"In distributed computing, slower nodes (stragglers) usually become a bottleneck. Gradient Coding (GC), introduced by Tandon et al., is an efficient technique that uses principles of error-correcting codes to distribute gradient computation in the presence of stragglers. In this paper, we consider the distributed computation of a sequence of gradients $\\{g(1),g(2),\\ldots,g(J)\\}$, where processing of each gradient $g(t)$ starts in round-$t$ and finishes by round-$(t+T)$. Here $T\\geq 0$ denotes a delay parameter. For the GC scheme, coding is only across computing nodes and this results in a solut"},"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":"2211.13802","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-24T21:12:49Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"faed0cbb90cd0d67683e60a1aa55269edeac7ecc64380075b6f2b6b102814a12","abstract_canon_sha256":"753fb7c5c8fd010552506b7360d82fd6af04462073ddde481e6e459bf1389ef7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:25:38.689712Z","signature_b64":"kcYii/6PPN+713dnR8XLIMqLspCKCPBdCEmuhnFmLz+TI5xK4DAMRJr603aTios708BJbnFvP423r9Gg0Fz4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b250ede3097b8149a48560cff12fa7f6b7579dcadc1c095fa1d8fd334a33d1b1","last_reissued_at":"2026-07-05T06:25:38.689119Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:25:38.689119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Gradient Coding For Straggler Mitigation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Ashish Khisti, M. Nikhil Krishnan, MohammadReza Ebrahimi","submitted_at":"2022-11-24T21:12:49Z","abstract_excerpt":"In distributed computing, slower nodes (stragglers) usually become a bottleneck. Gradient Coding (GC), introduced by Tandon et al., is an efficient technique that uses principles of error-correcting codes to distribute gradient computation in the presence of stragglers. In this paper, we consider the distributed computation of a sequence of gradients $\\{g(1),g(2),\\ldots,g(J)\\}$, where processing of each gradient $g(t)$ starts in round-$t$ and finishes by round-$(t+T)$. Here $T\\geq 0$ denotes a delay parameter. For the GC scheme, coding is only across computing nodes and this results in a solut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.13802","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.13802/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":"2211.13802","created_at":"2026-07-05T06:25:38.689188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.13802v2","created_at":"2026-07-05T06:25:38.689188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.13802","created_at":"2026-07-05T06:25:38.689188+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJIO3YYJPOAU","created_at":"2026-07-05T06:25:38.689188+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJIO3YYJPOAUTJEF","created_at":"2026-07-05T06:25:38.689188+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJIO3YYJ","created_at":"2026-07-05T06:25:38.689188+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/WJIO3YYJPOAUTJEFMDH7CL5H62","json":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62.json","graph_json":"https://pith.science/api/pith-number/WJIO3YYJPOAUTJEFMDH7CL5H62/graph.json","events_json":"https://pith.science/api/pith-number/WJIO3YYJPOAUTJEFMDH7CL5H62/events.json","paper":"https://pith.science/paper/WJIO3YYJ"},"agent_actions":{"view_html":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62","download_json":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62.json","view_paper":"https://pith.science/paper/WJIO3YYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.13802&json=true","fetch_graph":"https://pith.science/api/pith-number/WJIO3YYJPOAUTJEFMDH7CL5H62/graph.json","fetch_events":"https://pith.science/api/pith-number/WJIO3YYJPOAUTJEFMDH7CL5H62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/action/storage_attestation","attest_author":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/action/author_attestation","sign_citation":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/action/citation_signature","submit_replication":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/action/replication_record"}},"created_at":"2026-07-05T06:25:38.689188+00:00","updated_at":"2026-07-05T06:25:38.689188+00:00"}