{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:WJIO3YYJPOAUTJEFMDH7CL5H62","short_pith_number":"pith:WJIO3YYJ","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"},"canonical_sha256":"b250ede3097b8149a48560cff12fa7f6b7579dcadc1c095fa1d8fd334a33d1b1","source":{"kind":"arxiv","id":"2211.13802","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.13802","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"2211.13802v2","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.13802","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"WJIO3YYJPOAU","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"pith_short_16","alias_value":"WJIO3YYJPOAUTJEF","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"pith_short_8","alias_value":"WJIO3YYJ","created_at":"2026-07-05T06:25:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:WJIO3YYJPOAUTJEFMDH7CL5H62","target":"record","payload":{"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"},"canonical_sha256":"b250ede3097b8149a48560cff12fa7f6b7579dcadc1c095fa1d8fd334a33d1b1","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"},"source_kind":"arxiv","source_id":"2211.13802","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:25:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sB/jDoE0QpL/PONbXpcCNSxp3+eshmj5PjFrGQa7A+sNvAXesk8FE1CLMm9CX6riGPVb8Jdzk2R6BuRbjF4HDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T14:08:35.974064Z"},"content_sha256":"c987295a1ba764469a8363950311e5137ef43e805aa75dd209cfe270a70d4df2","schema_version":"1.0","event_id":"sha256:c987295a1ba764469a8363950311e5137ef43e805aa75dd209cfe270a70d4df2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:WJIO3YYJPOAUTJEFMDH7CL5H62","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:25:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LunzmVZISvcgP8v6ijW+F1FTMUQijMx2haPMtnp9zBFT+FsSl7SjTTYwbMbJvLbu0ShUw673RICF5HxcRMxcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T14:08:35.974701Z"},"content_sha256":"4bbe0c61fd3dc3f579c50f1730074f9458eda2996d2280e7ee9b2ef6fa879e71","schema_version":"1.0","event_id":"sha256:4bbe0c61fd3dc3f579c50f1730074f9458eda2996d2280e7ee9b2ef6fa879e71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/bundle.json","state_url":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T14:08:35Z","links":{"resolver":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62","bundle":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/bundle.json","state":"https://pith.science/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJIO3YYJPOAUTJEFMDH7CL5H62/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WJIO3YYJPOAUTJEFMDH7CL5H62","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":"753fb7c5c8fd010552506b7360d82fd6af04462073ddde481e6e459bf1389ef7","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-24T21:12:49Z","title_canon_sha256":"faed0cbb90cd0d67683e60a1aa55269edeac7ecc64380075b6f2b6b102814a12"},"schema_version":"1.0","source":{"id":"2211.13802","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.13802","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"2211.13802v2","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.13802","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"WJIO3YYJPOAU","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"pith_short_16","alias_value":"WJIO3YYJPOAUTJEF","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"pith_short_8","alias_value":"WJIO3YYJ","created_at":"2026-07-05T06:25:38Z"}],"graph_snapshots":[{"event_id":"sha256:4bbe0c61fd3dc3f579c50f1730074f9458eda2996d2280e7ee9b2ef6fa879e71","target":"graph","created_at":"2026-07-05T06:25:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.13802/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ashish Khisti, M. Nikhil Krishnan, MohammadReza Ebrahimi","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-24T21:12:49Z","title":"Sequential Gradient Coding For Straggler Mitigation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.13802","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:c987295a1ba764469a8363950311e5137ef43e805aa75dd209cfe270a70d4df2","target":"record","created_at":"2026-07-05T06:25:38Z","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":"753fb7c5c8fd010552506b7360d82fd6af04462073ddde481e6e459bf1389ef7","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-24T21:12:49Z","title_canon_sha256":"faed0cbb90cd0d67683e60a1aa55269edeac7ecc64380075b6f2b6b102814a12"},"schema_version":"1.0","source":{"id":"2211.13802","kind":"arxiv","version":2}},"canonical_sha256":"b250ede3097b8149a48560cff12fa7f6b7579dcadc1c095fa1d8fd334a33d1b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b250ede3097b8149a48560cff12fa7f6b7579dcadc1c095fa1d8fd334a33d1b1","first_computed_at":"2026-07-05T06:25:38.689119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:25:38.689119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kcYii/6PPN+713dnR8XLIMqLspCKCPBdCEmuhnFmLz+TI5xK4DAMRJr603aTios708BJbnFvP423r9Gg0Fz4Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:25:38.689712Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.13802","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c987295a1ba764469a8363950311e5137ef43e805aa75dd209cfe270a70d4df2","sha256:4bbe0c61fd3dc3f579c50f1730074f9458eda2996d2280e7ee9b2ef6fa879e71"],"state_sha256":"0c84b0fe68a956b95c1fcab71805cbb6c91d05cebbe237a6e650ad257d1fbbaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqDbLUtb6NwZMeZCnqjnRld1J2miCdeaZdNnYP/fgCn7+780wzL4W9iPst3ZSvVx7oXkqIok70AqDswOO72FDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T14:08:35.979166Z","bundle_sha256":"fd716296af3da0c24744c26c432c2055f199bbd3fe6953cd305496fc142ef65b"}}