{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BASWHEQ4MXJAZ47REVANJWOUCQ","short_pith_number":"pith:BASWHEQ4","schema_version":"1.0","canonical_sha256":"082563921c65d20cf3f12540d4d9d4141b513a0f568bbe05d84dd8cb15128411","source":{"kind":"arxiv","id":"2507.05230","version":1},"attestation_state":"computed","paper":{"title":"Cooperative Gradient Coding","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chao Ren, Mikael Skoglund, Ming Xiao, Shudi Weng","submitted_at":"2025-07-07T17:39:58Z","abstract_excerpt":"This work studies gradient coding (GC) in the context of distributed training problems with unreliable communication. We propose cooperative GC (CoGC), a novel gradient-sharing-based GC framework that leverages cooperative communication among clients. This approach ultimately eliminates the need for dataset replication, making it both communication- and computation-efficient and suitable for federated learning (FL). By employing the standard GC decoding mechanism, CoGC yields strictly binary outcomes: either the global model is exactly recovered, or the decoding fails entirely, with no interme"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.05230","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-07T17:39:58Z","cross_cats_sorted":[],"title_canon_sha256":"a557c1fdaf27892c2c517d27cbd7361bcc55a75fc77522da77733596659b0d88","abstract_canon_sha256":"e8646b06736ca3e355556f6c16070e4386246e3ddcc44ccbf01a68103712f5b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:10.936897Z","signature_b64":"ZTcy7a+dh0MqaUMFyqSkDd6xl5PmPd/nR1aCrvbdZe0/lJkPvC+v83ftflxzMymWf5haHcVc3fiL5dSOskARBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"082563921c65d20cf3f12540d4d9d4141b513a0f568bbe05d84dd8cb15128411","last_reissued_at":"2026-07-05T11:33:10.936486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:10.936486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Gradient Coding","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chao Ren, Mikael Skoglund, Ming Xiao, Shudi Weng","submitted_at":"2025-07-07T17:39:58Z","abstract_excerpt":"This work studies gradient coding (GC) in the context of distributed training problems with unreliable communication. We propose cooperative GC (CoGC), a novel gradient-sharing-based GC framework that leverages cooperative communication among clients. This approach ultimately eliminates the need for dataset replication, making it both communication- and computation-efficient and suitable for federated learning (FL). By employing the standard GC decoding mechanism, CoGC yields strictly binary outcomes: either the global model is exactly recovered, or the decoding fails entirely, with no interme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05230","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.05230/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.05230","created_at":"2026-07-05T11:33:10.936538+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.05230v1","created_at":"2026-07-05T11:33:10.936538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05230","created_at":"2026-07-05T11:33:10.936538+00:00"},{"alias_kind":"pith_short_12","alias_value":"BASWHEQ4MXJA","created_at":"2026-07-05T11:33:10.936538+00:00"},{"alias_kind":"pith_short_16","alias_value":"BASWHEQ4MXJAZ47R","created_at":"2026-07-05T11:33:10.936538+00:00"},{"alias_kind":"pith_short_8","alias_value":"BASWHEQ4","created_at":"2026-07-05T11:33:10.936538+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07565","citing_title":"Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ","json":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ.json","graph_json":"https://pith.science/api/pith-number/BASWHEQ4MXJAZ47REVANJWOUCQ/graph.json","events_json":"https://pith.science/api/pith-number/BASWHEQ4MXJAZ47REVANJWOUCQ/events.json","paper":"https://pith.science/paper/BASWHEQ4"},"agent_actions":{"view_html":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ","download_json":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ.json","view_paper":"https://pith.science/paper/BASWHEQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.05230&json=true","fetch_graph":"https://pith.science/api/pith-number/BASWHEQ4MXJAZ47REVANJWOUCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BASWHEQ4MXJAZ47REVANJWOUCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/action/storage_attestation","attest_author":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/action/author_attestation","sign_citation":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/action/citation_signature","submit_replication":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/action/replication_record"}},"created_at":"2026-07-05T11:33:10.936538+00:00","updated_at":"2026-07-05T11:33:10.936538+00:00"}