{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:32KERSU6GWGKIG2MKNZQ3KGZPH","short_pith_number":"pith:32KERSU6","canonical_record":{"source":{"id":"1811.09271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-22T18:39:40Z","cross_cats_sorted":["cs.DC","cs.IT","eess.SP","math.IT","stat.ML"],"title_canon_sha256":"83659bf71e0fc6774b5930ec311fa9c50f3acbed09062c88713ac8dbcc573aa2","abstract_canon_sha256":"53876ffe0e9160acd90bfbe02094e864a3486a791fefce3ea9988a1516fc20f2"},"schema_version":"1.0"},"canonical_sha256":"de9448ca9e358ca41b4c53730da8d979f560c09147a6597f99c5c8dd39d2b6bc","source":{"kind":"arxiv","id":"1811.09271","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09271","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09271v1","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09271","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"pith_short_12","alias_value":"32KERSU6GWGK","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"32KERSU6GWGKIG2M","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"32KERSU6","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:32KERSU6GWGKIG2MKNZQ3KGZPH","target":"record","payload":{"canonical_record":{"source":{"id":"1811.09271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-22T18:39:40Z","cross_cats_sorted":["cs.DC","cs.IT","eess.SP","math.IT","stat.ML"],"title_canon_sha256":"83659bf71e0fc6774b5930ec311fa9c50f3acbed09062c88713ac8dbcc573aa2","abstract_canon_sha256":"53876ffe0e9160acd90bfbe02094e864a3486a791fefce3ea9988a1516fc20f2"},"schema_version":"1.0"},"canonical_sha256":"de9448ca9e358ca41b4c53730da8d979f560c09147a6597f99c5c8dd39d2b6bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:43.268846Z","signature_b64":"kUitPzdPetV42pmtMVG+5zoAtZtll4hWelcDKFUFdC7UnuZyFcYLdas/YBUvxdelizhHbBUQbgzugUmTiKvjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de9448ca9e358ca41b4c53730da8d979f560c09147a6597f99c5c8dd39d2b6bc","last_reissued_at":"2026-05-17T23:59:43.268302Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:43.268302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.09271","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:59:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGo4bTMruWXtJB9USNSxiReWBE6lDLPutpXhTfPFb6lA0IqUH89zee4sN3oZb/S0JmFxMuYQVhYXceEg4CvfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:20:38.860361Z"},"content_sha256":"29b1de124b9de7efe9764c2443c08f08f86ea1ff9c32aed8bba8737818d48c30","schema_version":"1.0","event_id":"sha256:29b1de124b9de7efe9764c2443c08f08f86ea1ff9c32aed8bba8737818d48c30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:32KERSU6GWGKIG2MKNZQ3KGZPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Gradient Descent with Coded Partial Gradient Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","eess.SP","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Deniz Gunduz, Emre Ozfatura, Sennur Ulukus","submitted_at":"2018-11-22T18:39:40Z","abstract_excerpt":"Coded computation techniques provide robustness against straggling servers in distributed computing, with the following limitations: First, they increase decoding complexity. Second, they ignore computations carried out by straggling servers; and they are typically designed to recover the full gradient, and thus, cannot provide a balance between the accuracy of the gradient and per-iteration completion time. Here we introduce a hybrid approach, called coded partial gradient computation (CPGC), that benefits from the advantages of both coded and uncoded computation schemes, and reduces both the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09271","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:59:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h8tnDh2+YhnOJEaC4RFZ+hPpnIYmnIa6HhygLBLJDqf2QA3VUkSsLPyYEezYJRerhX8XYvnS3/AHU3MCzSICBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:20:38.860711Z"},"content_sha256":"aae0c2a053fb1c2dee2b5549f7779df4834d8d1778e107e9767f3b55405efc47","schema_version":"1.0","event_id":"sha256:aae0c2a053fb1c2dee2b5549f7779df4834d8d1778e107e9767f3b55405efc47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32KERSU6GWGKIG2MKNZQ3KGZPH/bundle.json","state_url":"https://pith.science/pith/32KERSU6GWGKIG2MKNZQ3KGZPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32KERSU6GWGKIG2MKNZQ3KGZPH/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-28T13:20:38Z","links":{"resolver":"https://pith.science/pith/32KERSU6GWGKIG2MKNZQ3KGZPH","bundle":"https://pith.science/pith/32KERSU6GWGKIG2MKNZQ3KGZPH/bundle.json","state":"https://pith.science/pith/32KERSU6GWGKIG2MKNZQ3KGZPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32KERSU6GWGKIG2MKNZQ3KGZPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:32KERSU6GWGKIG2MKNZQ3KGZPH","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":"53876ffe0e9160acd90bfbe02094e864a3486a791fefce3ea9988a1516fc20f2","cross_cats_sorted":["cs.DC","cs.IT","eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-22T18:39:40Z","title_canon_sha256":"83659bf71e0fc6774b5930ec311fa9c50f3acbed09062c88713ac8dbcc573aa2"},"schema_version":"1.0","source":{"id":"1811.09271","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09271","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09271v1","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09271","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"pith_short_12","alias_value":"32KERSU6GWGK","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"32KERSU6GWGKIG2M","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"32KERSU6","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:aae0c2a053fb1c2dee2b5549f7779df4834d8d1778e107e9767f3b55405efc47","target":"graph","created_at":"2026-05-17T23:59:43Z","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":"Coded computation techniques provide robustness against straggling servers in distributed computing, with the following limitations: First, they increase decoding complexity. Second, they ignore computations carried out by straggling servers; and they are typically designed to recover the full gradient, and thus, cannot provide a balance between the accuracy of the gradient and per-iteration completion time. Here we introduce a hybrid approach, called coded partial gradient computation (CPGC), that benefits from the advantages of both coded and uncoded computation schemes, and reduces both the","authors_text":"Deniz Gunduz, Emre Ozfatura, Sennur Ulukus","cross_cats":["cs.DC","cs.IT","eess.SP","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-22T18:39:40Z","title":"Distributed Gradient Descent with Coded Partial Gradient Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09271","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:29b1de124b9de7efe9764c2443c08f08f86ea1ff9c32aed8bba8737818d48c30","target":"record","created_at":"2026-05-17T23:59:43Z","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":"53876ffe0e9160acd90bfbe02094e864a3486a791fefce3ea9988a1516fc20f2","cross_cats_sorted":["cs.DC","cs.IT","eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-22T18:39:40Z","title_canon_sha256":"83659bf71e0fc6774b5930ec311fa9c50f3acbed09062c88713ac8dbcc573aa2"},"schema_version":"1.0","source":{"id":"1811.09271","kind":"arxiv","version":1}},"canonical_sha256":"de9448ca9e358ca41b4c53730da8d979f560c09147a6597f99c5c8dd39d2b6bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de9448ca9e358ca41b4c53730da8d979f560c09147a6597f99c5c8dd39d2b6bc","first_computed_at":"2026-05-17T23:59:43.268302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:43.268302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kUitPzdPetV42pmtMVG+5zoAtZtll4hWelcDKFUFdC7UnuZyFcYLdas/YBUvxdelizhHbBUQbgzugUmTiKvjAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:43.268846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.09271","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29b1de124b9de7efe9764c2443c08f08f86ea1ff9c32aed8bba8737818d48c30","sha256:aae0c2a053fb1c2dee2b5549f7779df4834d8d1778e107e9767f3b55405efc47"],"state_sha256":"d8c398f04bdd92c184924073ac3d567f53d3e28642db060abe198b0eb779453e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2ZzExr1h+ojqYJcaB1HmwGxTLBQYjZQeh9SpObWymlhFeZRebEhpsUeX7oGoA5uFA0e9ZLjUSfLDTGZG2wvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:20:38.862714Z","bundle_sha256":"9dfafbef43b1afb171f51948956de9583e6358dbcaeefcc51bd3cbfd8d3f434f"}}