{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZUDAU5C5LHJJQDAICNO4U7DWWZ","short_pith_number":"pith:ZUDAU5C5","canonical_record":{"source":{"id":"1901.04668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-15T05:18:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25b3657e43d06a6f914cc633152723326be55f27086bc6b1c3991a126d003bf9","abstract_canon_sha256":"6675658f7d18064a265c409b5066f36d3ed39ee5cf5b771ead42133be2c417ee"},"schema_version":"1.0"},"canonical_sha256":"cd060a745d59d2980c08135dca7c76b65259a0237e40e18804401fedd7962421","source":{"kind":"arxiv","id":"1901.04668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04668","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04668v1","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04668","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZUDAU5C5LHJJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZUDAU5C5LHJJQDAI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZUDAU5C5","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZUDAU5C5LHJJQDAICNO4U7DWWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.04668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-15T05:18:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25b3657e43d06a6f914cc633152723326be55f27086bc6b1c3991a126d003bf9","abstract_canon_sha256":"6675658f7d18064a265c409b5066f36d3ed39ee5cf5b771ead42133be2c417ee"},"schema_version":"1.0"},"canonical_sha256":"cd060a745d59d2980c08135dca7c76b65259a0237e40e18804401fedd7962421","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:22.128217Z","signature_b64":"lqYHuDJHRPX6xqAhedJog+uYV2nQJE6o7YrMM8olZ7D4syIA/fyBmeaWyI7PdmOxB/4giZMdlpkuO0yVxO5tAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd060a745d59d2980c08135dca7c76b65259a0237e40e18804401fedd7962421","last_reissued_at":"2026-05-17T23:56:22.127573Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:22.127573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.04668","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:56:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zphusOqQHyWg2r6BNIyMMuYL/oTQqtjdLk/VdtV3zvW1vk1qx7pItv+SEKtHHFt7KyCtcpNQu7BAvs1QwKeCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:57:57.278504Z"},"content_sha256":"7b75413d6adf5abc9b782e44151f55703e3b81d8f3c5206d867b2270bb00d450","schema_version":"1.0","event_id":"sha256:7b75413d6adf5abc9b782e44151f55703e3b81d8f3c5206d867b2270bb00d450"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZUDAU5C5LHJJQDAICNO4U7DWWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Stochastic Gradient Descent Using LDGM Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Manabu Kobayashi, Shunsuke Horii, Takahiro Yoshida, Toshiyasu Matsushima","submitted_at":"2019-01-15T05:18:39Z","abstract_excerpt":"We consider a distributed learning problem in which the computation is carried out on a system consisting of a master node and multiple worker nodes. In such systems, the existence of slow-running machines called stragglers will cause a significant decrease in performance. Recently, coding theoretic framework, which is named Gradient Coding (GC), for mitigating stragglers in distributed learning has been established by Tandon et al. Most studies on GC are aiming at recovering the gradient information completely assuming that the Gradient Descent (GD) algorithm is used as a learning algorithm. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04668","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:56:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HqOsaIF7fQLv15oi/8ImJG73KcmlZr/W69+OfwFz25d8QBNwQZ/phqbUapoADOk97KKzFMphQn2Ul7vW2ziuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:57:57.279181Z"},"content_sha256":"b187373abc2ef18da312970fcfa0b4891c11b1a4a6c5aa3ada69f739e325f7d0","schema_version":"1.0","event_id":"sha256:b187373abc2ef18da312970fcfa0b4891c11b1a4a6c5aa3ada69f739e325f7d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUDAU5C5LHJJQDAICNO4U7DWWZ/bundle.json","state_url":"https://pith.science/pith/ZUDAU5C5LHJJQDAICNO4U7DWWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUDAU5C5LHJJQDAICNO4U7DWWZ/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-27T14:57:57Z","links":{"resolver":"https://pith.science/pith/ZUDAU5C5LHJJQDAICNO4U7DWWZ","bundle":"https://pith.science/pith/ZUDAU5C5LHJJQDAICNO4U7DWWZ/bundle.json","state":"https://pith.science/pith/ZUDAU5C5LHJJQDAICNO4U7DWWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUDAU5C5LHJJQDAICNO4U7DWWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZUDAU5C5LHJJQDAICNO4U7DWWZ","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":"6675658f7d18064a265c409b5066f36d3ed39ee5cf5b771ead42133be2c417ee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-15T05:18:39Z","title_canon_sha256":"25b3657e43d06a6f914cc633152723326be55f27086bc6b1c3991a126d003bf9"},"schema_version":"1.0","source":{"id":"1901.04668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04668","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04668v1","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04668","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZUDAU5C5LHJJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZUDAU5C5LHJJQDAI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZUDAU5C5","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:b187373abc2ef18da312970fcfa0b4891c11b1a4a6c5aa3ada69f739e325f7d0","target":"graph","created_at":"2026-05-17T23:56:22Z","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 a distributed learning problem in which the computation is carried out on a system consisting of a master node and multiple worker nodes. In such systems, the existence of slow-running machines called stragglers will cause a significant decrease in performance. Recently, coding theoretic framework, which is named Gradient Coding (GC), for mitigating stragglers in distributed learning has been established by Tandon et al. Most studies on GC are aiming at recovering the gradient information completely assuming that the Gradient Descent (GD) algorithm is used as a learning algorithm. ","authors_text":"Manabu Kobayashi, Shunsuke Horii, Takahiro Yoshida, Toshiyasu Matsushima","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-15T05:18:39Z","title":"Distributed Stochastic Gradient Descent Using LDGM Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04668","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:7b75413d6adf5abc9b782e44151f55703e3b81d8f3c5206d867b2270bb00d450","target":"record","created_at":"2026-05-17T23:56:22Z","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":"6675658f7d18064a265c409b5066f36d3ed39ee5cf5b771ead42133be2c417ee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-15T05:18:39Z","title_canon_sha256":"25b3657e43d06a6f914cc633152723326be55f27086bc6b1c3991a126d003bf9"},"schema_version":"1.0","source":{"id":"1901.04668","kind":"arxiv","version":1}},"canonical_sha256":"cd060a745d59d2980c08135dca7c76b65259a0237e40e18804401fedd7962421","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd060a745d59d2980c08135dca7c76b65259a0237e40e18804401fedd7962421","first_computed_at":"2026-05-17T23:56:22.127573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:22.127573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lqYHuDJHRPX6xqAhedJog+uYV2nQJE6o7YrMM8olZ7D4syIA/fyBmeaWyI7PdmOxB/4giZMdlpkuO0yVxO5tAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:22.128217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b75413d6adf5abc9b782e44151f55703e3b81d8f3c5206d867b2270bb00d450","sha256:b187373abc2ef18da312970fcfa0b4891c11b1a4a6c5aa3ada69f739e325f7d0"],"state_sha256":"72038f1210b3dbde7a90e69ab6df37fe9429f91479911352db9f5e3218e1006a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMlBd/FRD+FFzUWpiJM1zsTEiDgJxdUkv/FYGv1hDHPoyr2+qxECsTqgl4AV6uFFfSePaznzeyLqeudGKrUZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:57:57.283032Z","bundle_sha256":"7302ae526affb74c5a3c52fc2f1347b1e2425ca9357bc2dbacf8d76722947093"}}