{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BASWHEQ4MXJAZ47REVANJWOUCQ","short_pith_number":"pith:BASWHEQ4","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"},"canonical_sha256":"082563921c65d20cf3f12540d4d9d4141b513a0f568bbe05d84dd8cb15128411","source":{"kind":"arxiv","id":"2507.05230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05230","created_at":"2026-07-05T11:33:10Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05230v1","created_at":"2026-07-05T11:33:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05230","created_at":"2026-07-05T11:33:10Z"},{"alias_kind":"pith_short_12","alias_value":"BASWHEQ4MXJA","created_at":"2026-07-05T11:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"BASWHEQ4MXJAZ47R","created_at":"2026-07-05T11:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"BASWHEQ4","created_at":"2026-07-05T11:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BASWHEQ4MXJAZ47REVANJWOUCQ","target":"record","payload":{"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"},"canonical_sha256":"082563921c65d20cf3f12540d4d9d4141b513a0f568bbe05d84dd8cb15128411","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"},"source_kind":"arxiv","source_id":"2507.05230","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-07-05T11:33:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKOVl2veS4df4PHSfhveQlaccodHULpRYY8dfic/u+e0uLh4HFzNg0Wd5Ap/txBRB1cwhZ+RWA7XJhjB53D/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:16:31.488314Z"},"content_sha256":"596f08672241358b93fde909cdcc826165ab6746dd350592bbca89242c226390","schema_version":"1.0","event_id":"sha256:596f08672241358b93fde909cdcc826165ab6746dd350592bbca89242c226390"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BASWHEQ4MXJAZ47REVANJWOUCQ","target":"graph","payload":{"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"},"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-07-05T11:33:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7foenHnyt7QHLmOMOhtVr4B+1MTBrk1nCnualrcxVhMHlQH1WxYC7Ubenqgwykvxqlnh4o59oT0QVn/Lzh/xDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:16:31.489242Z"},"content_sha256":"d476af3109951ee6f244498129b6c3946784d0dbde1091792d05553f5f6477e0","schema_version":"1.0","event_id":"sha256:d476af3109951ee6f244498129b6c3946784d0dbde1091792d05553f5f6477e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/bundle.json","state_url":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/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-08-08T17:16:31Z","links":{"resolver":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ","bundle":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/bundle.json","state":"https://pith.science/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BASWHEQ4MXJAZ47REVANJWOUCQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BASWHEQ4MXJAZ47REVANJWOUCQ","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":"e8646b06736ca3e355556f6c16070e4386246e3ddcc44ccbf01a68103712f5b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-07T17:39:58Z","title_canon_sha256":"a557c1fdaf27892c2c517d27cbd7361bcc55a75fc77522da77733596659b0d88"},"schema_version":"1.0","source":{"id":"2507.05230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05230","created_at":"2026-07-05T11:33:10Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05230v1","created_at":"2026-07-05T11:33:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05230","created_at":"2026-07-05T11:33:10Z"},{"alias_kind":"pith_short_12","alias_value":"BASWHEQ4MXJA","created_at":"2026-07-05T11:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"BASWHEQ4MXJAZ47R","created_at":"2026-07-05T11:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"BASWHEQ4","created_at":"2026-07-05T11:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:d476af3109951ee6f244498129b6c3946784d0dbde1091792d05553f5f6477e0","target":"graph","created_at":"2026-07-05T11:33:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.05230/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chao Ren, Mikael Skoglund, Ming Xiao, Shudi Weng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-07T17:39:58Z","title":"Cooperative Gradient Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05230","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:596f08672241358b93fde909cdcc826165ab6746dd350592bbca89242c226390","target":"record","created_at":"2026-07-05T11:33:10Z","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":"e8646b06736ca3e355556f6c16070e4386246e3ddcc44ccbf01a68103712f5b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-07T17:39:58Z","title_canon_sha256":"a557c1fdaf27892c2c517d27cbd7361bcc55a75fc77522da77733596659b0d88"},"schema_version":"1.0","source":{"id":"2507.05230","kind":"arxiv","version":1}},"canonical_sha256":"082563921c65d20cf3f12540d4d9d4141b513a0f568bbe05d84dd8cb15128411","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"082563921c65d20cf3f12540d4d9d4141b513a0f568bbe05d84dd8cb15128411","first_computed_at":"2026-07-05T11:33:10.936486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:10.936486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZTcy7a+dh0MqaUMFyqSkDd6xl5PmPd/nR1aCrvbdZe0/lJkPvC+v83ftflxzMymWf5haHcVc3fiL5dSOskARBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:10.936897Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.05230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:596f08672241358b93fde909cdcc826165ab6746dd350592bbca89242c226390","sha256:d476af3109951ee6f244498129b6c3946784d0dbde1091792d05553f5f6477e0"],"state_sha256":"3a39d120e5a6aef675e79f60be38a95a758c6fde79be5663b099b5020b47363c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yGgwcv7+dCQdquiT+E3J6YWWDqAqsfoLMOyQEZCN3ZDUPP0nV1UkCWNZ/IbIhf6EkAGuMI58JgI1lCDKPHHNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T17:16:31.496436Z","bundle_sha256":"24308a91cb951465f8b4570354f05e2dc33066fb5079aa5c61f5bbda0d85799e"}}