{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4YCBHVWTBR4H4AL2WK36MVAKQP","short_pith_number":"pith:4YCBHVWT","canonical_record":{"source":{"id":"1901.08166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-23T23:26:14Z","cross_cats_sorted":[],"title_canon_sha256":"44c696919928b1ff103c1aa8d7ce57dad58c4fd5d8b996a2e436c0d16678b524","abstract_canon_sha256":"a6a5410072a700a7e43d87fa10c43d6e52058b59044c5d066028a348f46620c9"},"schema_version":"1.0"},"canonical_sha256":"e60413d6d30c787e017ab2b7e6540a83ec8ad141d87d7e95742bca97605374d1","source":{"kind":"arxiv","id":"1901.08166","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08166","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08166v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08166","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"4YCBHVWTBR4H","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4YCBHVWTBR4H4AL2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4YCBHVWT","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4YCBHVWTBR4H4AL2WK36MVAKQP","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-23T23:26:14Z","cross_cats_sorted":[],"title_canon_sha256":"44c696919928b1ff103c1aa8d7ce57dad58c4fd5d8b996a2e436c0d16678b524","abstract_canon_sha256":"a6a5410072a700a7e43d87fa10c43d6e52058b59044c5d066028a348f46620c9"},"schema_version":"1.0"},"canonical_sha256":"e60413d6d30c787e017ab2b7e6540a83ec8ad141d87d7e95742bca97605374d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:37.775438Z","signature_b64":"QZR2x1w43RePmPF53baebBHD16JEfSIyBn16mv0l6wU/YOL8RnsGuwJwv9zcaNqnRZXBLM1ss7izpHm/XLBWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e60413d6d30c787e017ab2b7e6540a83ec8ad141d87d7e95742bca97605374d1","last_reissued_at":"2026-05-17T23:55:37.775059Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:37.775059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08166","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:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIhUh0hioV09LOle2ZT3v70T7jEjRz33qJI/ic8vu2JaKgG8Pgt1OwmHnPkxMuW9dxlTHOEzteDdgUTyX+0tBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:00:51.920353Z"},"content_sha256":"45530ca86aa026623519c15c5f4dbce6baf1224faa5fd951fcf7de74cbc223fa","schema_version":"1.0","event_id":"sha256:45530ca86aa026623519c15c5f4dbce6baf1224faa5fd951fcf7de74cbc223fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4YCBHVWTBR4H4AL2WK36MVAKQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fundamental Limits of Approximate Gradient Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jiashang Liu, Ness Shroff, Sinong Wang","submitted_at":"2019-01-23T23:26:14Z","abstract_excerpt":"It has been established that when the gradient coding problem is distributed among $n$ servers, the computation load (number of stored data partitions) of each worker is at least $s+1$ in order to resists $s$ stragglers. This scheme incurs a large overhead when the number of stragglers $s$ is large. In this paper, we focus on a new framework called \\emph{approximate gradient coding} to mitigate stragglers in distributed learning. We show that, to exactly recover the gradient with high probability, the computation load is lower bounded by $O(\\log(n)/\\log(n/s))$. We also propose a code that exac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08166","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:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDe7HElyVgMmbdEGuP+Gb/NpCGkNQ6SPxbGZWwxKjSRj2Q/sRdpzFEx3yypALJYNLGHjNjhrVwJkrMMdVMAjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:00:51.920957Z"},"content_sha256":"e9cba4b8d4683f1aec1ac32996b33ba8f370292842eaf1d7d38e63360df82ee9","schema_version":"1.0","event_id":"sha256:e9cba4b8d4683f1aec1ac32996b33ba8f370292842eaf1d7d38e63360df82ee9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YCBHVWTBR4H4AL2WK36MVAKQP/bundle.json","state_url":"https://pith.science/pith/4YCBHVWTBR4H4AL2WK36MVAKQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YCBHVWTBR4H4AL2WK36MVAKQP/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-05-29T17:00:51Z","links":{"resolver":"https://pith.science/pith/4YCBHVWTBR4H4AL2WK36MVAKQP","bundle":"https://pith.science/pith/4YCBHVWTBR4H4AL2WK36MVAKQP/bundle.json","state":"https://pith.science/pith/4YCBHVWTBR4H4AL2WK36MVAKQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YCBHVWTBR4H4AL2WK36MVAKQP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4YCBHVWTBR4H4AL2WK36MVAKQP","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":"a6a5410072a700a7e43d87fa10c43d6e52058b59044c5d066028a348f46620c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-23T23:26:14Z","title_canon_sha256":"44c696919928b1ff103c1aa8d7ce57dad58c4fd5d8b996a2e436c0d16678b524"},"schema_version":"1.0","source":{"id":"1901.08166","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08166","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08166v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08166","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"4YCBHVWTBR4H","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4YCBHVWTBR4H4AL2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4YCBHVWT","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:e9cba4b8d4683f1aec1ac32996b33ba8f370292842eaf1d7d38e63360df82ee9","target":"graph","created_at":"2026-05-17T23:55:37Z","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":"It has been established that when the gradient coding problem is distributed among $n$ servers, the computation load (number of stored data partitions) of each worker is at least $s+1$ in order to resists $s$ stragglers. This scheme incurs a large overhead when the number of stragglers $s$ is large. In this paper, we focus on a new framework called \\emph{approximate gradient coding} to mitigate stragglers in distributed learning. We show that, to exactly recover the gradient with high probability, the computation load is lower bounded by $O(\\log(n)/\\log(n/s))$. We also propose a code that exac","authors_text":"Jiashang Liu, Ness Shroff, Sinong Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-23T23:26:14Z","title":"Fundamental Limits of Approximate Gradient Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08166","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:45530ca86aa026623519c15c5f4dbce6baf1224faa5fd951fcf7de74cbc223fa","target":"record","created_at":"2026-05-17T23:55:37Z","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":"a6a5410072a700a7e43d87fa10c43d6e52058b59044c5d066028a348f46620c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-23T23:26:14Z","title_canon_sha256":"44c696919928b1ff103c1aa8d7ce57dad58c4fd5d8b996a2e436c0d16678b524"},"schema_version":"1.0","source":{"id":"1901.08166","kind":"arxiv","version":1}},"canonical_sha256":"e60413d6d30c787e017ab2b7e6540a83ec8ad141d87d7e95742bca97605374d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e60413d6d30c787e017ab2b7e6540a83ec8ad141d87d7e95742bca97605374d1","first_computed_at":"2026-05-17T23:55:37.775059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:37.775059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QZR2x1w43RePmPF53baebBHD16JEfSIyBn16mv0l6wU/YOL8RnsGuwJwv9zcaNqnRZXBLM1ss7izpHm/XLBWCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:37.775438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08166","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45530ca86aa026623519c15c5f4dbce6baf1224faa5fd951fcf7de74cbc223fa","sha256:e9cba4b8d4683f1aec1ac32996b33ba8f370292842eaf1d7d38e63360df82ee9"],"state_sha256":"9b3e6e4d5b897f00cee7f65c6b039f3cc6ec28ff4b7de241b18c5c44d4aef1c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btysGScEZR4+TT4Oql2SdQqHKCp7U4ZcHBSK1e4sRyHv+7TLZrqVaZcWBAtPpa79SgI5VwfdraD8OY8Ak+VfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:00:51.923275Z","bundle_sha256":"509b26121a3b2b09901ac74823ecf30207a8e5cb9c43ea12489522cda4186f6e"}}