{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2C7HGT2ATCJ2GFJKT5CS3OSYXR","short_pith_number":"pith:2C7HGT2A","schema_version":"1.0","canonical_sha256":"d0be734f409893a3152a9f452dba58bc62c8123afb82cfae3d7ae0a3c7f9524d","source":{"kind":"arxiv","id":"1712.00232","version":3},"attestation_state":"computed","paper":{"title":"Optimal Algorithms for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.MA","cs.SY","stat.ML"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Angelia Nedi\\'c, C\\'esar A. Uribe, Soomin Lee","submitted_at":"2017-12-01T08:41:28Z","abstract_excerpt":"In this paper, we study the optimal convergence rate for distributed convex optimization problems in networks. We model the communication restrictions imposed by the network as a set of affine constraints and provide optimal complexity bounds for four different setups, namely: the function $F(\\xb) \\triangleq \\sum_{i=1}^{m}f_i(\\xb)$ is strongly convex and smooth, either strongly convex or smooth or just convex. Our results show that Nesterov's accelerated gradient descent on the dual problem can be executed in a distributed manner and obtains the same optimal rates as in the centralized version"},"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":"1712.00232","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-01T08:41:28Z","cross_cats_sorted":["cs.CC","cs.MA","cs.SY","stat.ML"],"title_canon_sha256":"3685cffd0902de90312f161cbcd7c88ee48ea620ce7b6b12e637f7c00d229e87","abstract_canon_sha256":"0ca06d5e39b4de24ec86b0f72ccc0eae4fccdae8093bcad39b3e82b42f51a7c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:39.835960Z","signature_b64":"3NL5DYa0awlqLfVBgpmjGri/fYsrMI80V05UjJNtaP3rx7hvNznaOd0b+wpksykhzlVNpzPJiVPsdqWjSOL2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0be734f409893a3152a9f452dba58bc62c8123afb82cfae3d7ae0a3c7f9524d","last_reissued_at":"2026-05-18T00:00:39.835428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:39.835428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Algorithms for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.MA","cs.SY","stat.ML"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Angelia Nedi\\'c, C\\'esar A. Uribe, Soomin Lee","submitted_at":"2017-12-01T08:41:28Z","abstract_excerpt":"In this paper, we study the optimal convergence rate for distributed convex optimization problems in networks. We model the communication restrictions imposed by the network as a set of affine constraints and provide optimal complexity bounds for four different setups, namely: the function $F(\\xb) \\triangleq \\sum_{i=1}^{m}f_i(\\xb)$ is strongly convex and smooth, either strongly convex or smooth or just convex. Our results show that Nesterov's accelerated gradient descent on the dual problem can be executed in a distributed manner and obtains the same optimal rates as in the centralized version"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00232","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.00232","created_at":"2026-05-18T00:00:39.835501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00232v3","created_at":"2026-05-18T00:00:39.835501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00232","created_at":"2026-05-18T00:00:39.835501+00:00"},{"alias_kind":"pith_short_12","alias_value":"2C7HGT2ATCJ2","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2C7HGT2ATCJ2GFJK","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2C7HGT2A","created_at":"2026-05-18T12:30:55.937587+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/2C7HGT2ATCJ2GFJKT5CS3OSYXR","json":"https://pith.science/pith/2C7HGT2ATCJ2GFJKT5CS3OSYXR.json","graph_json":"https://pith.science/api/pith-number/2C7HGT2ATCJ2GFJKT5CS3OSYXR/graph.json","events_json":"https://pith.science/api/pith-number/2C7HGT2ATCJ2GFJKT5CS3OSYXR/events.json","paper":"https://pith.science/paper/2C7HGT2A"},"agent_actions":{"view_html":"https://pith.science/pith/2C7HGT2ATCJ2GFJKT5CS3OSYXR","download_json":"https://pith.science/pith/2C7HGT2ATCJ2GFJKT5CS3OSYXR.json","view_paper":"https://pith.science/paper/2C7HGT2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00232&json=true","fetch_graph":"https://pith.science/api/pith-number/2C7HGT2ATCJ2GFJKT5CS3OSYXR/graph.json","fetch_events":"https://pith.science/api/pith-number/2C7HGT2ATCJ2GFJKT5CS3OSYXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2C7HGT2ATCJ2GFJKT5CS3OSYXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2C7HGT2ATCJ2GFJKT5CS3OSYXR/action/storage_attestation","attest_author":"https://pith.science/pith/2C7HGT2ATCJ2GFJKT5CS3OSYXR/action/author_attestation","sign_citation":"https://pith.science/pith/2C7HGT2ATCJ2GFJKT5CS3OSYXR/action/citation_signature","submit_replication":"https://pith.science/pith/2C7HGT2ATCJ2GFJKT5CS3OSYXR/action/replication_record"}},"created_at":"2026-05-18T00:00:39.835501+00:00","updated_at":"2026-05-18T00:00:39.835501+00:00"}