{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5GH76EEWS4MS5UJ4GG4GBGUBXY","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":"cf722a5ec7d82415403f0c825b7b99f9a73bf52ff6e7d1d520fdad8070f33b73","cross_cats_sorted":["cs.DC","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-30T17:13:32Z","title_canon_sha256":"179bde8aa44be73744c546efe9ae5a2ef08a91680800acf520be02668b6f5c92"},"schema_version":"1.0","source":{"id":"1904.13373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.13373","created_at":"2026-05-17T23:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1904.13373v1","created_at":"2026-05-17T23:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.13373","created_at":"2026-05-17T23:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"5GH76EEWS4MS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5GH76EEWS4MS5UJ4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5GH76EEW","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:468540abe46e7a3901d669e2a6d386703da1a3469c7246921e8bd92fa837db45","target":"graph","created_at":"2026-05-17T23:47:21Z","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":"Distributed implementations of gradient-based methods, wherein a server distributes gradient computations across worker machines, suffer from slow running machines, called 'stragglers'. Gradient coding is a coding-theoretic framework to mitigate stragglers by enabling the server to recover the gradient sum in the presence of stragglers. 'Approximate gradient codes' are variants of gradient codes that reduce computation and storage overhead per worker by allowing the server to approximately reconstruct the gradient sum.\n  In this work, our goal is to construct approximate gradient codes that ar","authors_text":"Kannan Ramchandran, O. Ozan Koyluoglu, Swanand Kadhe","cross_cats":["cs.DC","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-30T17:13:32Z","title":"Gradient Coding Based on Block Designs for Mitigating Adversarial Stragglers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.13373","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:a3915bdd4a7303270389bbfda2b809418f2e02aafca3b8c197597d5fc692b740","target":"record","created_at":"2026-05-17T23:47:21Z","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":"cf722a5ec7d82415403f0c825b7b99f9a73bf52ff6e7d1d520fdad8070f33b73","cross_cats_sorted":["cs.DC","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-30T17:13:32Z","title_canon_sha256":"179bde8aa44be73744c546efe9ae5a2ef08a91680800acf520be02668b6f5c92"},"schema_version":"1.0","source":{"id":"1904.13373","kind":"arxiv","version":1}},"canonical_sha256":"e98fff109697192ed13c31b8609a81be23b102dc024a7d587e287635d4c10c33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e98fff109697192ed13c31b8609a81be23b102dc024a7d587e287635d4c10c33","first_computed_at":"2026-05-17T23:47:21.489576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:21.489576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5dncDfImyvgmC+t4ESr4cbb1SlYbsO5f3z0Qtihav+0kH/FHjRiRXvPQI18Ti83lSypOx6xjiH/62u7lEMRuAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:21.490101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.13373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3915bdd4a7303270389bbfda2b809418f2e02aafca3b8c197597d5fc692b740","sha256:468540abe46e7a3901d669e2a6d386703da1a3469c7246921e8bd92fa837db45"],"state_sha256":"78aa540129547c998fd6f12cdcf0e4b3bfd336edae926a99910c8ba3abbf5765"}