{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MLI3RH2S6ZEW6EK2BAPLUWQIKL","short_pith_number":"pith:MLI3RH2S","canonical_record":{"source":{"id":"1903.01974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T18:38:15Z","cross_cats_sorted":["cs.DC","cs.LG","eess.SP","math.IT"],"title_canon_sha256":"77b3b5fae55e6dae7f0af2dfc7ac03f7a11d38602fffdac02910281da2b2ba8a","abstract_canon_sha256":"12f72d37eeafeb8849bf46633f8d9f67c0d4fffd0bbc049a5d848eaa11349f8c"},"schema_version":"1.0"},"canonical_sha256":"62d1b89f52f6496f115a081eba5a0852d7837936193e8e51dda2b10346cb0ba0","source":{"kind":"arxiv","id":"1903.01974","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01974","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01974v1","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01974","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"MLI3RH2S6ZEW","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MLI3RH2S6ZEW6EK2","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MLI3RH2S","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MLI3RH2S6ZEW6EK2BAPLUWQIKL","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T18:38:15Z","cross_cats_sorted":["cs.DC","cs.LG","eess.SP","math.IT"],"title_canon_sha256":"77b3b5fae55e6dae7f0af2dfc7ac03f7a11d38602fffdac02910281da2b2ba8a","abstract_canon_sha256":"12f72d37eeafeb8849bf46633f8d9f67c0d4fffd0bbc049a5d848eaa11349f8c"},"schema_version":"1.0"},"canonical_sha256":"62d1b89f52f6496f115a081eba5a0852d7837936193e8e51dda2b10346cb0ba0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.329035Z","signature_b64":"acvEJ4GcZd+KZTcykjm8o5bZz4Fe+zGGcfswQDP89iS/RoIShqUQnjlZD27VFC1Y6KEoWc0PuOZNMzGEdaqIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62d1b89f52f6496f115a081eba5a0852d7837936193e8e51dda2b10346cb0ba0","last_reissued_at":"2026-05-17T23:51:59.328554Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.328554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01974","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:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d44XmVjJzsdBFSJsAnoSCLxGPHv/qbj2cubMgvd/hneySSSu1INPyX+4AmEbr6mrcdlC9xvO3PhCIf0+D466Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:49:28.338281Z"},"content_sha256":"1decba34fac077e565101bc37f92ab569052e767295e92c8171f8d957c8b6746","schema_version":"1.0","event_id":"sha256:1decba34fac077e565101bc37f92ab569052e767295e92c8171f8d957c8b6746"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MLI3RH2S6ZEW6EK2BAPLUWQIKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient Coding with Clustering and Multi-message Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Deniz Gunduz, Emre Ozfatura, Sennur Ulukus","submitted_at":"2019-03-05T18:38:15Z","abstract_excerpt":"Gradient descent (GD) methods are commonly employed in machine learning problems to optimize the parameters of the model in an iterative fashion. For problems with massive datasets, computations are distributed to many parallel computing servers (i.e., workers) to speed up GD iterations. While distributed computing can increase the computation speed significantly, the per-iteration completion time is limited by the slowest straggling workers. Coded distributed computing can mitigate straggling workers by introducing redundant computations; however, existing coded computing schemes are mainly d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01974","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:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"beexdn43KGu34jvNuwd6fPrxC1t3f5GdGm/KtVZGMi021CV39UitDzBEfj8pCv5C2E7EgQlAkCXaVivFK6fVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:49:28.338961Z"},"content_sha256":"8453eab9116791d1369de30f9435c606fdd94399ec335049752897d80e2a827a","schema_version":"1.0","event_id":"sha256:8453eab9116791d1369de30f9435c606fdd94399ec335049752897d80e2a827a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLI3RH2S6ZEW6EK2BAPLUWQIKL/bundle.json","state_url":"https://pith.science/pith/MLI3RH2S6ZEW6EK2BAPLUWQIKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLI3RH2S6ZEW6EK2BAPLUWQIKL/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-26T22:49:28Z","links":{"resolver":"https://pith.science/pith/MLI3RH2S6ZEW6EK2BAPLUWQIKL","bundle":"https://pith.science/pith/MLI3RH2S6ZEW6EK2BAPLUWQIKL/bundle.json","state":"https://pith.science/pith/MLI3RH2S6ZEW6EK2BAPLUWQIKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLI3RH2S6ZEW6EK2BAPLUWQIKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MLI3RH2S6ZEW6EK2BAPLUWQIKL","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":"12f72d37eeafeb8849bf46633f8d9f67c0d4fffd0bbc049a5d848eaa11349f8c","cross_cats_sorted":["cs.DC","cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T18:38:15Z","title_canon_sha256":"77b3b5fae55e6dae7f0af2dfc7ac03f7a11d38602fffdac02910281da2b2ba8a"},"schema_version":"1.0","source":{"id":"1903.01974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01974","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01974v1","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01974","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"MLI3RH2S6ZEW","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MLI3RH2S6ZEW6EK2","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MLI3RH2S","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:8453eab9116791d1369de30f9435c606fdd94399ec335049752897d80e2a827a","target":"graph","created_at":"2026-05-17T23:51:59Z","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":"Gradient descent (GD) methods are commonly employed in machine learning problems to optimize the parameters of the model in an iterative fashion. For problems with massive datasets, computations are distributed to many parallel computing servers (i.e., workers) to speed up GD iterations. While distributed computing can increase the computation speed significantly, the per-iteration completion time is limited by the slowest straggling workers. Coded distributed computing can mitigate straggling workers by introducing redundant computations; however, existing coded computing schemes are mainly d","authors_text":"Deniz Gunduz, Emre Ozfatura, Sennur Ulukus","cross_cats":["cs.DC","cs.LG","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T18:38:15Z","title":"Gradient Coding with Clustering and Multi-message Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01974","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:1decba34fac077e565101bc37f92ab569052e767295e92c8171f8d957c8b6746","target":"record","created_at":"2026-05-17T23:51:59Z","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":"12f72d37eeafeb8849bf46633f8d9f67c0d4fffd0bbc049a5d848eaa11349f8c","cross_cats_sorted":["cs.DC","cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T18:38:15Z","title_canon_sha256":"77b3b5fae55e6dae7f0af2dfc7ac03f7a11d38602fffdac02910281da2b2ba8a"},"schema_version":"1.0","source":{"id":"1903.01974","kind":"arxiv","version":1}},"canonical_sha256":"62d1b89f52f6496f115a081eba5a0852d7837936193e8e51dda2b10346cb0ba0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62d1b89f52f6496f115a081eba5a0852d7837936193e8e51dda2b10346cb0ba0","first_computed_at":"2026-05-17T23:51:59.328554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:59.328554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"acvEJ4GcZd+KZTcykjm8o5bZz4Fe+zGGcfswQDP89iS/RoIShqUQnjlZD27VFC1Y6KEoWc0PuOZNMzGEdaqIAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:59.329035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1decba34fac077e565101bc37f92ab569052e767295e92c8171f8d957c8b6746","sha256:8453eab9116791d1369de30f9435c606fdd94399ec335049752897d80e2a827a"],"state_sha256":"fd8c57919d03877b2e5786b8e816a646920b87443802d114b2876d769d5ed8de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"coXuNLhjYAGufEBAoVEyszy4+nEl5sijt+vFf1sHlZkHLzxZsMsulfViOEQx3ecSxS6QAQZgILB9HUqOPYTLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:49:28.342716Z","bundle_sha256":"e7e24f795189b6e54ac60bce8399b44f21519681e745f4ac47ab22e49cc8551e"}}