{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NQFGZEVFARTV37O7GBW6L4IHBG","short_pith_number":"pith:NQFGZEVF","canonical_record":{"source":{"id":"1905.05383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T04:11:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4663722b884fb95c3d0f6a2a3cf7200958325a3b25503314eefd3fe300064ac5","abstract_canon_sha256":"f750701464195d1a8f9821a9e618ac19ff54bb788fd49c3f7744870509e197b7"},"schema_version":"1.0"},"canonical_sha256":"6c0a6c92a504675dfddf306de5f107098869dcc77ec970e30561a0d6f217cde9","source":{"kind":"arxiv","id":"1905.05383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05383","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05383v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05383","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"NQFGZEVFARTV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NQFGZEVFARTV37O7","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NQFGZEVF","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NQFGZEVFARTV37O7GBW6L4IHBG","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T04:11:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4663722b884fb95c3d0f6a2a3cf7200958325a3b25503314eefd3fe300064ac5","abstract_canon_sha256":"f750701464195d1a8f9821a9e618ac19ff54bb788fd49c3f7744870509e197b7"},"schema_version":"1.0"},"canonical_sha256":"6c0a6c92a504675dfddf306de5f107098869dcc77ec970e30561a0d6f217cde9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:16.661064Z","signature_b64":"WBehGahiP20lFb9cighrtIzUTnkq4w9aidxLRR2K43LjthbdUTGfpcXdD9Ebegpmi1iaS7EJKoCqE3zAsHf1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c0a6c92a504675dfddf306de5f107098869dcc77ec970e30561a0d6f217cde9","last_reissued_at":"2026-05-17T23:46:16.660447Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:16.660447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05383","source_version":1,"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-05-17T23:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRK/reoVcq5jMh4uLiZ7zaG1XZGLAThdWgJtxgqm58+ygoL0WJXOfqxdvPNZK3bffKEwydNPVY93nKxSOx/xBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:25:15.119889Z"},"content_sha256":"fdb367c18b86057d2e7c6526da713a0efdc13eddb927c4e99536177fc5b0b0a8","schema_version":"1.0","event_id":"sha256:fdb367c18b86057d2e7c6526da713a0efdc13eddb927c4e99536177fc5b0b0a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NQFGZEVFARTV37O7GBW6L4IHBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mary Wootters, Rawad Bitar, Salim El Rouayheb","submitted_at":"2019-05-14T04:11:05Z","abstract_excerpt":"We consider distributed gradient descent in the presence of stragglers. Recent work on \\em gradient coding \\em and \\em approximate gradient coding \\em have shown how to add redundancy in distributed gradient descent to guarantee convergence even if some workers are \\em stragglers\\em---that is, slow or non-responsive. In this work we propose an approximate gradient coding scheme called \\em Stochastic Gradient Coding \\em (SGC), which works when the stragglers are random. SGC distributes data points redundantly to workers according to a pair-wise balanced design, and then simply ignores the strag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05383","kind":"arxiv","version":1},"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"},"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-05-17T23:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFGd/1H+HqucEWLALk5Iz8mw3mEzqujWkhQYJ/WXNjdzxpYxDlHnzlJpWuYvny9zxgSo0CQLtfTw5afky4ZgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:25:15.120237Z"},"content_sha256":"eae7485049ac2024037ee1eb88858b9bcc16515860d50f19bad9e9386bd5dee0","schema_version":"1.0","event_id":"sha256:eae7485049ac2024037ee1eb88858b9bcc16515860d50f19bad9e9386bd5dee0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQFGZEVFARTV37O7GBW6L4IHBG/bundle.json","state_url":"https://pith.science/pith/NQFGZEVFARTV37O7GBW6L4IHBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQFGZEVFARTV37O7GBW6L4IHBG/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-06-10T14:25:15Z","links":{"resolver":"https://pith.science/pith/NQFGZEVFARTV37O7GBW6L4IHBG","bundle":"https://pith.science/pith/NQFGZEVFARTV37O7GBW6L4IHBG/bundle.json","state":"https://pith.science/pith/NQFGZEVFARTV37O7GBW6L4IHBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQFGZEVFARTV37O7GBW6L4IHBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NQFGZEVFARTV37O7GBW6L4IHBG","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":"f750701464195d1a8f9821a9e618ac19ff54bb788fd49c3f7744870509e197b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T04:11:05Z","title_canon_sha256":"4663722b884fb95c3d0f6a2a3cf7200958325a3b25503314eefd3fe300064ac5"},"schema_version":"1.0","source":{"id":"1905.05383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05383","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05383v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05383","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"NQFGZEVFARTV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NQFGZEVFARTV37O7","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NQFGZEVF","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:eae7485049ac2024037ee1eb88858b9bcc16515860d50f19bad9e9386bd5dee0","target":"graph","created_at":"2026-05-17T23:46:16Z","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"},"paper":{"abstract_excerpt":"We consider distributed gradient descent in the presence of stragglers. Recent work on \\em gradient coding \\em and \\em approximate gradient coding \\em have shown how to add redundancy in distributed gradient descent to guarantee convergence even if some workers are \\em stragglers\\em---that is, slow or non-responsive. In this work we propose an approximate gradient coding scheme called \\em Stochastic Gradient Coding \\em (SGC), which works when the stragglers are random. SGC distributes data points redundantly to workers according to a pair-wise balanced design, and then simply ignores the strag","authors_text":"Mary Wootters, Rawad Bitar, Salim El Rouayheb","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T04:11:05Z","title":"Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05383","kind":"arxiv","version":1},"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:fdb367c18b86057d2e7c6526da713a0efdc13eddb927c4e99536177fc5b0b0a8","target":"record","created_at":"2026-05-17T23:46:16Z","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":"f750701464195d1a8f9821a9e618ac19ff54bb788fd49c3f7744870509e197b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T04:11:05Z","title_canon_sha256":"4663722b884fb95c3d0f6a2a3cf7200958325a3b25503314eefd3fe300064ac5"},"schema_version":"1.0","source":{"id":"1905.05383","kind":"arxiv","version":1}},"canonical_sha256":"6c0a6c92a504675dfddf306de5f107098869dcc77ec970e30561a0d6f217cde9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c0a6c92a504675dfddf306de5f107098869dcc77ec970e30561a0d6f217cde9","first_computed_at":"2026-05-17T23:46:16.660447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:16.660447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WBehGahiP20lFb9cighrtIzUTnkq4w9aidxLRR2K43LjthbdUTGfpcXdD9Ebegpmi1iaS7EJKoCqE3zAsHf1DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:16.661064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdb367c18b86057d2e7c6526da713a0efdc13eddb927c4e99536177fc5b0b0a8","sha256:eae7485049ac2024037ee1eb88858b9bcc16515860d50f19bad9e9386bd5dee0"],"state_sha256":"c1fa50b2593301e6a07bf7adf50145cfaedf73ebb066c4033aa186e6b57a95d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwxAL3WoSTPKXLtHewIEnVZ4N11WZ9qr/reZumDsNMlErOKikHKiQMGdyJoY3lpRXQ8cOzMvRl4qnY3xdm6hDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T14:25:15.122219Z","bundle_sha256":"2302d37dd6eed51053958e8b279418119c60ad153442213835e6f85b1431a398"}}