{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:SSOWXDDMNCIVLI77BVECQTMBS5","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":"c08714021a4c686d6e513db6dbe58ea58a5781e13de63b0a1a0aecc872588e04","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T16:18:29Z","title_canon_sha256":"fc2fa5f76c4071a856e836582609539a9f96ed24fbe1d10b474329b490b12987"},"schema_version":"1.0","source":{"id":"2102.01583","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01583","created_at":"2026-07-05T03:03:27Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01583v2","created_at":"2026-07-05T03:03:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01583","created_at":"2026-07-05T03:03:27Z"},{"alias_kind":"pith_short_12","alias_value":"SSOWXDDMNCIV","created_at":"2026-07-05T03:03:27Z"},{"alias_kind":"pith_short_16","alias_value":"SSOWXDDMNCIVLI77","created_at":"2026-07-05T03:03:27Z"},{"alias_kind":"pith_short_8","alias_value":"SSOWXDDM","created_at":"2026-07-05T03:03:27Z"}],"graph_snapshots":[{"event_id":"sha256:365d445285e1123595a4c07c35a6be5e251bbe6906cf23e1a1c8cb1d561a805f","target":"graph","created_at":"2026-07-05T03:03:27Z","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/2102.01583/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We resolve the min-max complexity of distributed stochastic convex optimization (up to a log factor) in the intermittent communication setting, where $M$ machines work in parallel over the course of $R$ rounds of communication to optimize the objective, and during each round of communication, each machine may sequentially compute $K$ stochastic gradient estimates. We present a novel lower bound with a matching upper bound that establishes an optimal algorithm.","authors_text":"Blake Woodworth, Brian Bullins, Nathan Srebro, Ohad Shamir","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T16:18:29Z","title":"The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01583","kind":"arxiv","version":2},"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:7927fd81a4833757d2ab2465f2aa90467a4b45ab9907ea1eec68ff0a4782c105","target":"record","created_at":"2026-07-05T03:03:27Z","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":"c08714021a4c686d6e513db6dbe58ea58a5781e13de63b0a1a0aecc872588e04","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T16:18:29Z","title_canon_sha256":"fc2fa5f76c4071a856e836582609539a9f96ed24fbe1d10b474329b490b12987"},"schema_version":"1.0","source":{"id":"2102.01583","kind":"arxiv","version":2}},"canonical_sha256":"949d6b8c6c689155a3ff0d48284d81977847f304b58b20f5880c3354edbba977","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"949d6b8c6c689155a3ff0d48284d81977847f304b58b20f5880c3354edbba977","first_computed_at":"2026-07-05T03:03:27.019687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:03:27.019687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wuaptBHLRuMFIC5TSj+AtL/ZBguMjsL5pR2b6J9tt/sGG4u5OI1JxyV6POC/ubpnb22ZndFmQRcwZaoJPbV8BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:03:27.020221Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.01583","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7927fd81a4833757d2ab2465f2aa90467a4b45ab9907ea1eec68ff0a4782c105","sha256:365d445285e1123595a4c07c35a6be5e251bbe6906cf23e1a1c8cb1d561a805f"],"state_sha256":"9c678107e3820db18a7e7819f053a454033f5b4a010cf4e61b5ac1fb6781006d"}