{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SSOWXDDMNCIVLI77BVECQTMBS5","short_pith_number":"pith:SSOWXDDM","schema_version":"1.0","canonical_sha256":"949d6b8c6c689155a3ff0d48284d81977847f304b58b20f5880c3354edbba977","source":{"kind":"arxiv","id":"2102.01583","version":2},"attestation_state":"computed","paper":{"title":"The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Blake Woodworth, Brian Bullins, Nathan Srebro, Ohad Shamir","submitted_at":"2021-02-02T16:18:29Z","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."},"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":"2102.01583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T16:18:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fc2fa5f76c4071a856e836582609539a9f96ed24fbe1d10b474329b490b12987","abstract_canon_sha256":"c08714021a4c686d6e513db6dbe58ea58a5781e13de63b0a1a0aecc872588e04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:03:27.020221Z","signature_b64":"wuaptBHLRuMFIC5TSj+AtL/ZBguMjsL5pR2b6J9tt/sGG4u5OI1JxyV6POC/ubpnb22ZndFmQRcwZaoJPbV8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"949d6b8c6c689155a3ff0d48284d81977847f304b58b20f5880c3354edbba977","last_reissued_at":"2026-07-05T03:03:27.019687Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:03:27.019687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Blake Woodworth, Brian Bullins, Nathan Srebro, Ohad Shamir","submitted_at":"2021-02-02T16:18:29Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01583","kind":"arxiv","version":2},"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/2102.01583/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":"2102.01583","created_at":"2026-07-05T03:03:27.019752+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.01583v2","created_at":"2026-07-05T03:03:27.019752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01583","created_at":"2026-07-05T03:03:27.019752+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSOWXDDMNCIV","created_at":"2026-07-05T03:03:27.019752+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSOWXDDMNCIVLI77","created_at":"2026-07-05T03:03:27.019752+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSOWXDDM","created_at":"2026-07-05T03:03:27.019752+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06563","citing_title":"Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization","ref_index":277,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSOWXDDMNCIVLI77BVECQTMBS5","json":"https://pith.science/pith/SSOWXDDMNCIVLI77BVECQTMBS5.json","graph_json":"https://pith.science/api/pith-number/SSOWXDDMNCIVLI77BVECQTMBS5/graph.json","events_json":"https://pith.science/api/pith-number/SSOWXDDMNCIVLI77BVECQTMBS5/events.json","paper":"https://pith.science/paper/SSOWXDDM"},"agent_actions":{"view_html":"https://pith.science/pith/SSOWXDDMNCIVLI77BVECQTMBS5","download_json":"https://pith.science/pith/SSOWXDDMNCIVLI77BVECQTMBS5.json","view_paper":"https://pith.science/paper/SSOWXDDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.01583&json=true","fetch_graph":"https://pith.science/api/pith-number/SSOWXDDMNCIVLI77BVECQTMBS5/graph.json","fetch_events":"https://pith.science/api/pith-number/SSOWXDDMNCIVLI77BVECQTMBS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSOWXDDMNCIVLI77BVECQTMBS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSOWXDDMNCIVLI77BVECQTMBS5/action/storage_attestation","attest_author":"https://pith.science/pith/SSOWXDDMNCIVLI77BVECQTMBS5/action/author_attestation","sign_citation":"https://pith.science/pith/SSOWXDDMNCIVLI77BVECQTMBS5/action/citation_signature","submit_replication":"https://pith.science/pith/SSOWXDDMNCIVLI77BVECQTMBS5/action/replication_record"}},"created_at":"2026-07-05T03:03:27.019752+00:00","updated_at":"2026-07-05T03:03:27.019752+00:00"}