{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RISKTKIQNCFDU6GNPQIK4IPEP4","short_pith_number":"pith:RISKTKIQ","schema_version":"1.0","canonical_sha256":"8a24a9a910688a3a78cd7c10ae21e47f175591b6aa56f62d3f852d1f7c0b4f1c","source":{"kind":"arxiv","id":"1910.09817","version":1},"attestation_state":"computed","paper":{"title":"A Unified Contraction Analysis of a Class of Distributed Algorithms for Composite Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gesualdo Scutari, Jinming Xu, Ye Tian, Ying Sun","submitted_at":"2019-10-22T08:13:19Z","abstract_excerpt":"We study distributed composite optimization over networks: agents minimize the sum of a smooth (strongly) convex function, the agents' sum-utility, plus a non-smooth (extended-valued) convex one. We propose a general algorithmic framework for such a class of problems and provide a unified convergence analysis leveraging the theory of operator splitting. Our results unify several approaches proposed in the literature of distributed optimization for special instances of our formulation. Distinguishing features of our scheme are: (i) when the agents' functions are strongly convex, the algorithm c"},"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":"1910.09817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-22T08:13:19Z","cross_cats_sorted":[],"title_canon_sha256":"ebc5261c0210f392b66f75ee555261042eb777ace049b441e28ca4d75a0af38a","abstract_canon_sha256":"b1e98f69ef90fc9d87ca22d32c9c8324d793ccb11119d42fab4db530e88c061a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:14:02.706922Z","signature_b64":"lg2C773yCaq6bSfwpeis8aBon9jPeojAMDxRr8QORiJjakTCUWur7upEvPhd2+KAeBwtxcGOwjS/kYW/CVQDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a24a9a910688a3a78cd7c10ae21e47f175591b6aa56f62d3f852d1f7c0b4f1c","last_reissued_at":"2026-07-05T00:14:02.706581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:14:02.706581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Contraction Analysis of a Class of Distributed Algorithms for Composite Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gesualdo Scutari, Jinming Xu, Ye Tian, Ying Sun","submitted_at":"2019-10-22T08:13:19Z","abstract_excerpt":"We study distributed composite optimization over networks: agents minimize the sum of a smooth (strongly) convex function, the agents' sum-utility, plus a non-smooth (extended-valued) convex one. We propose a general algorithmic framework for such a class of problems and provide a unified convergence analysis leveraging the theory of operator splitting. Our results unify several approaches proposed in the literature of distributed optimization for special instances of our formulation. Distinguishing features of our scheme are: (i) when the agents' functions are strongly convex, the algorithm c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.09817","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/1910.09817/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":"1910.09817","created_at":"2026-07-05T00:14:02.706636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.09817v1","created_at":"2026-07-05T00:14:02.706636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.09817","created_at":"2026-07-05T00:14:02.706636+00:00"},{"alias_kind":"pith_short_12","alias_value":"RISKTKIQNCFD","created_at":"2026-07-05T00:14:02.706636+00:00"},{"alias_kind":"pith_short_16","alias_value":"RISKTKIQNCFDU6GN","created_at":"2026-07-05T00:14:02.706636+00:00"},{"alias_kind":"pith_short_8","alias_value":"RISKTKIQ","created_at":"2026-07-05T00:14:02.706636+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/RISKTKIQNCFDU6GNPQIK4IPEP4","json":"https://pith.science/pith/RISKTKIQNCFDU6GNPQIK4IPEP4.json","graph_json":"https://pith.science/api/pith-number/RISKTKIQNCFDU6GNPQIK4IPEP4/graph.json","events_json":"https://pith.science/api/pith-number/RISKTKIQNCFDU6GNPQIK4IPEP4/events.json","paper":"https://pith.science/paper/RISKTKIQ"},"agent_actions":{"view_html":"https://pith.science/pith/RISKTKIQNCFDU6GNPQIK4IPEP4","download_json":"https://pith.science/pith/RISKTKIQNCFDU6GNPQIK4IPEP4.json","view_paper":"https://pith.science/paper/RISKTKIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.09817&json=true","fetch_graph":"https://pith.science/api/pith-number/RISKTKIQNCFDU6GNPQIK4IPEP4/graph.json","fetch_events":"https://pith.science/api/pith-number/RISKTKIQNCFDU6GNPQIK4IPEP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RISKTKIQNCFDU6GNPQIK4IPEP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RISKTKIQNCFDU6GNPQIK4IPEP4/action/storage_attestation","attest_author":"https://pith.science/pith/RISKTKIQNCFDU6GNPQIK4IPEP4/action/author_attestation","sign_citation":"https://pith.science/pith/RISKTKIQNCFDU6GNPQIK4IPEP4/action/citation_signature","submit_replication":"https://pith.science/pith/RISKTKIQNCFDU6GNPQIK4IPEP4/action/replication_record"}},"created_at":"2026-07-05T00:14:02.706636+00:00","updated_at":"2026-07-05T00:14:02.706636+00:00"}