{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EKR7WTRYBEYPG7NJYEXXCID3A7","short_pith_number":"pith:EKR7WTRY","canonical_record":{"source":{"id":"1808.07576","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-22T22:06:26Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"263677f1cd0cc4947345bc28bcbe319de2a065cedbf834b2dd4efe8c68d9cbb8","abstract_canon_sha256":"b1b6decb820ecb5fe58df3bdefbed76711e6175a8d25eba667bc754158573814"},"schema_version":"1.0"},"canonical_sha256":"22a3fb4e380930f37da9c12f71207b07e4f86534cf523ea38d2573611b2d470c","source":{"kind":"arxiv","id":"1808.07576","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07576","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07576v3","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07576","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"EKR7WTRYBEYP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EKR7WTRYBEYPG7NJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EKR7WTRY","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EKR7WTRYBEYPG7NJYEXXCID3A7","target":"record","payload":{"canonical_record":{"source":{"id":"1808.07576","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-22T22:06:26Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"263677f1cd0cc4947345bc28bcbe319de2a065cedbf834b2dd4efe8c68d9cbb8","abstract_canon_sha256":"b1b6decb820ecb5fe58df3bdefbed76711e6175a8d25eba667bc754158573814"},"schema_version":"1.0"},"canonical_sha256":"22a3fb4e380930f37da9c12f71207b07e4f86534cf523ea38d2573611b2d470c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.221764Z","signature_b64":"kFgtffqNiF7s3P0oyIT8mqc7lGGyU5RJzMvkI9j0aikr9qgGl18LfSzo667Rg5i6+dWcb4Z1lKId2sVg4GbFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22a3fb4e380930f37da9c12f71207b07e4f86534cf523ea38d2573611b2d470c","last_reissued_at":"2026-05-17T23:55:34.221172Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.221172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.07576","source_version":3,"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:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07JFQ8EeUzSpp0d+IgKebN/9ESgVeLk/BHTp9c+GmJRKzW+uSeXxl6bEOsAboyZ67YOYpkPSJuPthc4CnIV9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:56:34.430615Z"},"content_sha256":"73984ad15c7f37b9047a0324e76fa0a1c24bc327109f492098738b427f0f851d","schema_version":"1.0","event_id":"sha256:73984ad15c7f37b9047a0324e76fa0a1c24bc327109f492098738b427f0f851d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EKR7WTRYBEYPG7NJYEXXCID3A7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative SGD: A unified Framework for the Design and Analysis of Communication-Efficient SGD Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gauri Joshi, Jianyu Wang","submitted_at":"2018-08-22T22:06:26Z","abstract_excerpt":"Communication-efficient SGD algorithms, which allow nodes to perform local updates and periodically synchronize local models, are highly effective in improving the speed and scalability of distributed SGD. However, a rigorous convergence analysis and comparative study of different communication-reduction strategies remains a largely open problem. This paper presents a unified framework called Cooperative SGD that subsumes existing communication-efficient SGD algorithms such as periodic-averaging, elastic-averaging and decentralized SGD. By analyzing Cooperative SGD, we provide novel convergenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07576","kind":"arxiv","version":3},"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:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3793WINYJOLfPqvsw47YQO3tOp/wMS0FgSi+xJNfb4TqvYzJJp9Uqu5ptNLSinZ++srQt65MZiGApt+4pp7fCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:56:34.430968Z"},"content_sha256":"c7f2fb0205b3083cfba52827c846d5d4026ca752bbc5fbbbc0f78c193d56ea21","schema_version":"1.0","event_id":"sha256:c7f2fb0205b3083cfba52827c846d5d4026ca752bbc5fbbbc0f78c193d56ea21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKR7WTRYBEYPG7NJYEXXCID3A7/bundle.json","state_url":"https://pith.science/pith/EKR7WTRYBEYPG7NJYEXXCID3A7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKR7WTRYBEYPG7NJYEXXCID3A7/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-30T18:56:34Z","links":{"resolver":"https://pith.science/pith/EKR7WTRYBEYPG7NJYEXXCID3A7","bundle":"https://pith.science/pith/EKR7WTRYBEYPG7NJYEXXCID3A7/bundle.json","state":"https://pith.science/pith/EKR7WTRYBEYPG7NJYEXXCID3A7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKR7WTRYBEYPG7NJYEXXCID3A7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EKR7WTRYBEYPG7NJYEXXCID3A7","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":"b1b6decb820ecb5fe58df3bdefbed76711e6175a8d25eba667bc754158573814","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-22T22:06:26Z","title_canon_sha256":"263677f1cd0cc4947345bc28bcbe319de2a065cedbf834b2dd4efe8c68d9cbb8"},"schema_version":"1.0","source":{"id":"1808.07576","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07576","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07576v3","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07576","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"EKR7WTRYBEYP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EKR7WTRYBEYPG7NJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EKR7WTRY","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:c7f2fb0205b3083cfba52827c846d5d4026ca752bbc5fbbbc0f78c193d56ea21","target":"graph","created_at":"2026-05-17T23:55:34Z","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":"Communication-efficient SGD algorithms, which allow nodes to perform local updates and periodically synchronize local models, are highly effective in improving the speed and scalability of distributed SGD. However, a rigorous convergence analysis and comparative study of different communication-reduction strategies remains a largely open problem. This paper presents a unified framework called Cooperative SGD that subsumes existing communication-efficient SGD algorithms such as periodic-averaging, elastic-averaging and decentralized SGD. By analyzing Cooperative SGD, we provide novel convergenc","authors_text":"Gauri Joshi, Jianyu Wang","cross_cats":["cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-22T22:06:26Z","title":"Cooperative SGD: A unified Framework for the Design and Analysis of Communication-Efficient SGD Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07576","kind":"arxiv","version":3},"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:73984ad15c7f37b9047a0324e76fa0a1c24bc327109f492098738b427f0f851d","target":"record","created_at":"2026-05-17T23:55:34Z","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":"b1b6decb820ecb5fe58df3bdefbed76711e6175a8d25eba667bc754158573814","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-22T22:06:26Z","title_canon_sha256":"263677f1cd0cc4947345bc28bcbe319de2a065cedbf834b2dd4efe8c68d9cbb8"},"schema_version":"1.0","source":{"id":"1808.07576","kind":"arxiv","version":3}},"canonical_sha256":"22a3fb4e380930f37da9c12f71207b07e4f86534cf523ea38d2573611b2d470c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22a3fb4e380930f37da9c12f71207b07e4f86534cf523ea38d2573611b2d470c","first_computed_at":"2026-05-17T23:55:34.221172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:34.221172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kFgtffqNiF7s3P0oyIT8mqc7lGGyU5RJzMvkI9j0aikr9qgGl18LfSzo667Rg5i6+dWcb4Z1lKId2sVg4GbFDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:34.221764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.07576","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73984ad15c7f37b9047a0324e76fa0a1c24bc327109f492098738b427f0f851d","sha256:c7f2fb0205b3083cfba52827c846d5d4026ca752bbc5fbbbc0f78c193d56ea21"],"state_sha256":"ba08d0ceb8f007ac56fa5a8db2d50a74a1a39a9e405aa6f682320e9526f858fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpOg/oHABRv6Kiv+1breKV03lj82btgrkHIknfgnkfT7tdfPEMlAze2Dv9B2P+XugpmiMdi/diCcesUkaYPEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:56:34.433458Z","bundle_sha256":"252688c74e9453d46e6c403e48a2448cf491f424d6ef0f8b2a2fe1bd199d719c"}}