{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NZE5VRE47PJSUK7SF5JDD456AW","short_pith_number":"pith:NZE5VRE4","schema_version":"1.0","canonical_sha256":"6e49dac49cfbd32a2bf22f5231f3be05b28a5dec52d607c87410b847a6ff17b9","source":{"kind":"arxiv","id":"2002.11534","version":2},"attestation_state":"computed","paper":{"title":"Distributed Algorithms for Composite Optimization: Unified Framework and Convergence Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA"],"primary_cat":"math.OC","authors_text":"Gesualdo Scutari, Jinming Xu, Ye Tian, Ying Sun","submitted_at":"2020-02-25T07:34:40Z","abstract_excerpt":"We study distributed composite optimization over networks: agents minimize a sum of smooth (strongly) convex functions, the agents' sum-utility, plus a nonsmooth (extended-valued) convex one. We propose a general unified algorithmic framework for such a class of problems and provide a unified convergence analysis leveraging the theory of operator splitting. Distinguishing features of our scheme are: (i) When the agents' functions are strongly convex, the algorithm converges at a linear rate, whose dependence on the agents' functions and network topology is decoupled, matching the typical rates"},"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":"2002.11534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-25T07:34:40Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"7e1daa14cad7e0c8a66a899c711ad33332a583e90fad6317fd740e3f93c2b185","abstract_canon_sha256":"93733ef8f1c51ea1aacd8f41a4936929755585715b0099dc5f2826cd0db22f53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:02:37.530183Z","signature_b64":"ZzxzcxenW0AGSQqQaHnR/roMsgw2ehDMbQGCyS3u9VeQMn55WgQw5zuEmMUQwgOTxy/lTeY35iIZ77YefAgtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e49dac49cfbd32a2bf22f5231f3be05b28a5dec52d607c87410b847a6ff17b9","last_reissued_at":"2026-07-05T03:02:37.529702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:02:37.529702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Algorithms for Composite Optimization: Unified Framework and Convergence Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA"],"primary_cat":"math.OC","authors_text":"Gesualdo Scutari, Jinming Xu, Ye Tian, Ying Sun","submitted_at":"2020-02-25T07:34:40Z","abstract_excerpt":"We study distributed composite optimization over networks: agents minimize a sum of smooth (strongly) convex functions, the agents' sum-utility, plus a nonsmooth (extended-valued) convex one. We propose a general unified algorithmic framework for such a class of problems and provide a unified convergence analysis leveraging the theory of operator splitting. Distinguishing features of our scheme are: (i) When the agents' functions are strongly convex, the algorithm converges at a linear rate, whose dependence on the agents' functions and network topology is decoupled, matching the typical rates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11534","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/2002.11534/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":"2002.11534","created_at":"2026-07-05T03:02:37.529759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.11534v2","created_at":"2026-07-05T03:02:37.529759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11534","created_at":"2026-07-05T03:02:37.529759+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZE5VRE47PJS","created_at":"2026-07-05T03:02:37.529759+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZE5VRE47PJSUK7S","created_at":"2026-07-05T03:02:37.529759+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZE5VRE4","created_at":"2026-07-05T03:02:37.529759+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/NZE5VRE47PJSUK7SF5JDD456AW","json":"https://pith.science/pith/NZE5VRE47PJSUK7SF5JDD456AW.json","graph_json":"https://pith.science/api/pith-number/NZE5VRE47PJSUK7SF5JDD456AW/graph.json","events_json":"https://pith.science/api/pith-number/NZE5VRE47PJSUK7SF5JDD456AW/events.json","paper":"https://pith.science/paper/NZE5VRE4"},"agent_actions":{"view_html":"https://pith.science/pith/NZE5VRE47PJSUK7SF5JDD456AW","download_json":"https://pith.science/pith/NZE5VRE47PJSUK7SF5JDD456AW.json","view_paper":"https://pith.science/paper/NZE5VRE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.11534&json=true","fetch_graph":"https://pith.science/api/pith-number/NZE5VRE47PJSUK7SF5JDD456AW/graph.json","fetch_events":"https://pith.science/api/pith-number/NZE5VRE47PJSUK7SF5JDD456AW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZE5VRE47PJSUK7SF5JDD456AW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZE5VRE47PJSUK7SF5JDD456AW/action/storage_attestation","attest_author":"https://pith.science/pith/NZE5VRE47PJSUK7SF5JDD456AW/action/author_attestation","sign_citation":"https://pith.science/pith/NZE5VRE47PJSUK7SF5JDD456AW/action/citation_signature","submit_replication":"https://pith.science/pith/NZE5VRE47PJSUK7SF5JDD456AW/action/replication_record"}},"created_at":"2026-07-05T03:02:37.529759+00:00","updated_at":"2026-07-05T03:02:37.529759+00:00"}