{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:R27A5SSFFOOLEPA4GDQML2AWAK","short_pith_number":"pith:R27A5SSF","schema_version":"1.0","canonical_sha256":"8ebe0eca452b9cb23c1c30e0c5e81602afba410ac3024a804e4416a6b5afe0d6","source":{"kind":"arxiv","id":"2106.04469","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Dmitry Kovalev, Elnur Gasanov, Peter Richt\\'arik","submitted_at":"2021-06-08T15:54:44Z","abstract_excerpt":"We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network whose links are allowed to change in time. We solve two fundamental problems for this task. First, we establish the first lower bounds on the number of decentralized communication rounds and the number of local computations required to find an $\\epsilon$-accurate solution. Second, we design two optimal algorithms that attain these lower bounds: (i) a variant of the recently proposed algorithm ADOM (Kovalev et al., 2021) enhanced via a m"},"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":"2106.04469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-08T15:54:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3b64475fc08a5fbd323f932bc02568f8b9130ab94de8baac11e3d1f155925799","abstract_canon_sha256":"86ac9fa912f1a0745b6a95babaed0c30fce73836c8a810b3cbdbc329e9aa15d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:47:15.753753Z","signature_b64":"qtqbDQB3HSJp4jrRAXzaGIOl2MN1mP5Qoo8bwjSoq70yGKZytdiK2gDZ/f4mNQFMWKCIwqa8MRNlW+9INtPPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ebe0eca452b9cb23c1c30e0c5e81602afba410ac3024a804e4416a6b5afe0d6","last_reissued_at":"2026-07-05T02:47:15.753372Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:47:15.753372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Dmitry Kovalev, Elnur Gasanov, Peter Richt\\'arik","submitted_at":"2021-06-08T15:54:44Z","abstract_excerpt":"We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network whose links are allowed to change in time. We solve two fundamental problems for this task. First, we establish the first lower bounds on the number of decentralized communication rounds and the number of local computations required to find an $\\epsilon$-accurate solution. Second, we design two optimal algorithms that attain these lower bounds: (i) a variant of the recently proposed algorithm ADOM (Kovalev et al., 2021) enhanced via a m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04469","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/2106.04469/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":"2106.04469","created_at":"2026-07-05T02:47:15.753427+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.04469v1","created_at":"2026-07-05T02:47:15.753427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04469","created_at":"2026-07-05T02:47:15.753427+00:00"},{"alias_kind":"pith_short_12","alias_value":"R27A5SSFFOOL","created_at":"2026-07-05T02:47:15.753427+00:00"},{"alias_kind":"pith_short_16","alias_value":"R27A5SSFFOOLEPA4","created_at":"2026-07-05T02:47:15.753427+00:00"},{"alias_kind":"pith_short_8","alias_value":"R27A5SSF","created_at":"2026-07-05T02:47:15.753427+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R27A5SSFFOOLEPA4GDQML2AWAK","json":"https://pith.science/pith/R27A5SSFFOOLEPA4GDQML2AWAK.json","graph_json":"https://pith.science/api/pith-number/R27A5SSFFOOLEPA4GDQML2AWAK/graph.json","events_json":"https://pith.science/api/pith-number/R27A5SSFFOOLEPA4GDQML2AWAK/events.json","paper":"https://pith.science/paper/R27A5SSF"},"agent_actions":{"view_html":"https://pith.science/pith/R27A5SSFFOOLEPA4GDQML2AWAK","download_json":"https://pith.science/pith/R27A5SSFFOOLEPA4GDQML2AWAK.json","view_paper":"https://pith.science/paper/R27A5SSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.04469&json=true","fetch_graph":"https://pith.science/api/pith-number/R27A5SSFFOOLEPA4GDQML2AWAK/graph.json","fetch_events":"https://pith.science/api/pith-number/R27A5SSFFOOLEPA4GDQML2AWAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R27A5SSFFOOLEPA4GDQML2AWAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R27A5SSFFOOLEPA4GDQML2AWAK/action/storage_attestation","attest_author":"https://pith.science/pith/R27A5SSFFOOLEPA4GDQML2AWAK/action/author_attestation","sign_citation":"https://pith.science/pith/R27A5SSFFOOLEPA4GDQML2AWAK/action/citation_signature","submit_replication":"https://pith.science/pith/R27A5SSFFOOLEPA4GDQML2AWAK/action/replication_record"}},"created_at":"2026-07-05T02:47:15.753427+00:00","updated_at":"2026-07-05T02:47:15.753427+00:00"}