{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MRJW4FTHKOGOTMAZ3Z3NZ24LFU","short_pith_number":"pith:MRJW4FTH","canonical_record":{"source":{"id":"1904.11325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-25T13:27:30Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"911f0ca34b8df0fd56ef584564c3fbfcc63fbf9dbd4421df70ee0ef02995472f","abstract_canon_sha256":"6f24c4729f848f882b05b5136e07f82b6411b0abbd10c1bf96c5b086f1473867"},"schema_version":"1.0"},"canonical_sha256":"64536e1667538ce9b019de76dceb8b2d2e4d7c85b01b201436ef7775bea85e84","source":{"kind":"arxiv","id":"1904.11325","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11325","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11325v1","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11325","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"MRJW4FTHKOGO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MRJW4FTHKOGOTMAZ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MRJW4FTH","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MRJW4FTHKOGOTMAZ3Z3NZ24LFU","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-25T13:27:30Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"911f0ca34b8df0fd56ef584564c3fbfcc63fbf9dbd4421df70ee0ef02995472f","abstract_canon_sha256":"6f24c4729f848f882b05b5136e07f82b6411b0abbd10c1bf96c5b086f1473867"},"schema_version":"1.0"},"canonical_sha256":"64536e1667538ce9b019de76dceb8b2d2e4d7c85b01b201436ef7775bea85e84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:45.210069Z","signature_b64":"8TAVfOjlWJk5vzGlTJagzFpbWQA0hLFNGfEIoEV9h2XGbHf45yxZf8Uo4JfadV+d0daafVh/169Grt4vAzs7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64536e1667538ce9b019de76dceb8b2d2e4d7c85b01b201436ef7775bea85e84","last_reissued_at":"2026-05-17T23:47:45.209508Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:45.209508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11325","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:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NKE1P+cGvNYrTuBs35wx55kguwcmyr5axpkE0EnreiT5NJb8+SB5jl9dBz7AqikfiT5eHO+vTUgy9uj7wYr9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T16:18:00.172065Z"},"content_sha256":"987a9761f085cdaef9a0895452753fddee479b8188122b41183945cccd7baaa3","schema_version":"1.0","event_id":"sha256:987a9761f085cdaef9a0895452753fddee479b8188122b41183945cccd7baaa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MRJW4FTHKOGOTMAZ3Z3NZ24LFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication trade-offs for synchronized distributed SGD with large step size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aymeric Dieuleveut, Kumar Kshitij Patel","submitted_at":"2019-04-25T13:27:30Z","abstract_excerpt":"Synchronous mini-batch SGD is state-of-the-art for large-scale distributed machine learning. However, in practice, its convergence is bottlenecked by slow communication rounds between worker nodes. A natural solution to reduce communication is to use the \\emph{`local-SGD'} model in which the workers train their model independently and synchronize every once in a while. This algorithm improves the computation-communication trade-off but its convergence is not understood very well. We propose a non-asymptotic error analysis, which enables comparison to \\emph{one-shot averaging} i.e., a single co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11325","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:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WyKTJOiVPuyCs5ZmWDU+7yFuxEcTeT+ecSeYRBteTKXN56u9Je7GAyPzonFv/vvev8D520TgWQxpexpNxnP2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T16:18:00.172427Z"},"content_sha256":"dd2c31301a9020aaa5af0d6c633e525a78d88390c8149becdba1ba997a5829c8","schema_version":"1.0","event_id":"sha256:dd2c31301a9020aaa5af0d6c633e525a78d88390c8149becdba1ba997a5829c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRJW4FTHKOGOTMAZ3Z3NZ24LFU/bundle.json","state_url":"https://pith.science/pith/MRJW4FTHKOGOTMAZ3Z3NZ24LFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRJW4FTHKOGOTMAZ3Z3NZ24LFU/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-07-03T16:18:00Z","links":{"resolver":"https://pith.science/pith/MRJW4FTHKOGOTMAZ3Z3NZ24LFU","bundle":"https://pith.science/pith/MRJW4FTHKOGOTMAZ3Z3NZ24LFU/bundle.json","state":"https://pith.science/pith/MRJW4FTHKOGOTMAZ3Z3NZ24LFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRJW4FTHKOGOTMAZ3Z3NZ24LFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MRJW4FTHKOGOTMAZ3Z3NZ24LFU","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":"6f24c4729f848f882b05b5136e07f82b6411b0abbd10c1bf96c5b086f1473867","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-25T13:27:30Z","title_canon_sha256":"911f0ca34b8df0fd56ef584564c3fbfcc63fbf9dbd4421df70ee0ef02995472f"},"schema_version":"1.0","source":{"id":"1904.11325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11325","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11325v1","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11325","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"MRJW4FTHKOGO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MRJW4FTHKOGOTMAZ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MRJW4FTH","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:dd2c31301a9020aaa5af0d6c633e525a78d88390c8149becdba1ba997a5829c8","target":"graph","created_at":"2026-05-17T23:47:45Z","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":"Synchronous mini-batch SGD is state-of-the-art for large-scale distributed machine learning. However, in practice, its convergence is bottlenecked by slow communication rounds between worker nodes. A natural solution to reduce communication is to use the \\emph{`local-SGD'} model in which the workers train their model independently and synchronize every once in a while. This algorithm improves the computation-communication trade-off but its convergence is not understood very well. We propose a non-asymptotic error analysis, which enables comparison to \\emph{one-shot averaging} i.e., a single co","authors_text":"Aymeric Dieuleveut, Kumar Kshitij Patel","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-25T13:27:30Z","title":"Communication trade-offs for synchronized distributed SGD with large step size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11325","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:987a9761f085cdaef9a0895452753fddee479b8188122b41183945cccd7baaa3","target":"record","created_at":"2026-05-17T23:47:45Z","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":"6f24c4729f848f882b05b5136e07f82b6411b0abbd10c1bf96c5b086f1473867","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-25T13:27:30Z","title_canon_sha256":"911f0ca34b8df0fd56ef584564c3fbfcc63fbf9dbd4421df70ee0ef02995472f"},"schema_version":"1.0","source":{"id":"1904.11325","kind":"arxiv","version":1}},"canonical_sha256":"64536e1667538ce9b019de76dceb8b2d2e4d7c85b01b201436ef7775bea85e84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64536e1667538ce9b019de76dceb8b2d2e4d7c85b01b201436ef7775bea85e84","first_computed_at":"2026-05-17T23:47:45.209508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:45.209508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8TAVfOjlWJk5vzGlTJagzFpbWQA0hLFNGfEIoEV9h2XGbHf45yxZf8Uo4JfadV+d0daafVh/169Grt4vAzs7CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:45.210069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:987a9761f085cdaef9a0895452753fddee479b8188122b41183945cccd7baaa3","sha256:dd2c31301a9020aaa5af0d6c633e525a78d88390c8149becdba1ba997a5829c8"],"state_sha256":"31a4b5d8fd2fa71d3ba09d02dd9e46018cc3b151ce4870c89399ac9ad14419c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTleIJruSTNgCwTV3ZZ3LXvnVF71iEBgX/U/Jye90od6WaBoL4FIp5Gn6zopA7uXl3jjnlroj7j251CHnYfRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T16:18:00.174422Z","bundle_sha256":"c6f8947387de6c768c4cb404a2d8bb1b5ba3ceee6c7be3d08537e0dfe9a5329f"}}