{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MLFLJ6XAQMCKD6HRIPOMLI3EJ3","short_pith_number":"pith:MLFLJ6XA","schema_version":"1.0","canonical_sha256":"62cab4fae08304a1f8f143dcc5a3644efe4946fb033e637d76b6b1b06ab706ec","source":{"kind":"arxiv","id":"1910.14380","version":1},"attestation_state":"computed","paper":{"title":"A Decentralized Proximal Point-type Method for Saddle Point Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Aryan Mokhtari, Asuman Ozdaglar, Nenggan Zheng, Sarath Pattathil, Weijie Liu, Zebang Shen","submitted_at":"2019-10-31T11:24:21Z","abstract_excerpt":"In this paper, we focus on solving a class of constrained non-convex non-concave saddle point problems in a decentralized manner by a group of nodes in a network. Specifically, we assume that each node has access to a summand of a global objective function and nodes are allowed to exchange information only with their neighboring nodes. We propose a decentralized variant of the proximal point method for solving this problem. We show that when the objective function is $\\rho$-weakly convex-weakly concave the iterates converge to approximate stationarity with a rate of $\\mathcal{O}(1/\\sqrt{T})$ w"},"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.14380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-31T11:24:21Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"613c057d8e9848b29bb23aa0f6697cf0a740e711e32da271797e2360c63e6cf3","abstract_canon_sha256":"fa78569356cb26c72b9da4ff394005d156da242a8ec6bee0ecfbf86575bf11a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:10.117953Z","signature_b64":"HQG+JejxNf0iEqDxL+LlyCoxzVL2hGkRwF+aAV47L1x9H8C7+olEH9pk8HaSqfVHg9KAoLVInvOqEozL9pjiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62cab4fae08304a1f8f143dcc5a3644efe4946fb033e637d76b6b1b06ab706ec","last_reissued_at":"2026-07-05T00:16:10.117537Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:10.117537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Decentralized Proximal Point-type Method for Saddle Point Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Aryan Mokhtari, Asuman Ozdaglar, Nenggan Zheng, Sarath Pattathil, Weijie Liu, Zebang Shen","submitted_at":"2019-10-31T11:24:21Z","abstract_excerpt":"In this paper, we focus on solving a class of constrained non-convex non-concave saddle point problems in a decentralized manner by a group of nodes in a network. Specifically, we assume that each node has access to a summand of a global objective function and nodes are allowed to exchange information only with their neighboring nodes. We propose a decentralized variant of the proximal point method for solving this problem. We show that when the objective function is $\\rho$-weakly convex-weakly concave the iterates converge to approximate stationarity with a rate of $\\mathcal{O}(1/\\sqrt{T})$ w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.14380","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.14380/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.14380","created_at":"2026-07-05T00:16:10.117598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.14380v1","created_at":"2026-07-05T00:16:10.117598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.14380","created_at":"2026-07-05T00:16:10.117598+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLFLJ6XAQMCK","created_at":"2026-07-05T00:16:10.117598+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLFLJ6XAQMCKD6HR","created_at":"2026-07-05T00:16:10.117598+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLFLJ6XA","created_at":"2026-07-05T00:16:10.117598+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21431","citing_title":"An Optimistic Gradient Tracking Method for Distributed Minimax Optimization","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MLFLJ6XAQMCKD6HRIPOMLI3EJ3","json":"https://pith.science/pith/MLFLJ6XAQMCKD6HRIPOMLI3EJ3.json","graph_json":"https://pith.science/api/pith-number/MLFLJ6XAQMCKD6HRIPOMLI3EJ3/graph.json","events_json":"https://pith.science/api/pith-number/MLFLJ6XAQMCKD6HRIPOMLI3EJ3/events.json","paper":"https://pith.science/paper/MLFLJ6XA"},"agent_actions":{"view_html":"https://pith.science/pith/MLFLJ6XAQMCKD6HRIPOMLI3EJ3","download_json":"https://pith.science/pith/MLFLJ6XAQMCKD6HRIPOMLI3EJ3.json","view_paper":"https://pith.science/paper/MLFLJ6XA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.14380&json=true","fetch_graph":"https://pith.science/api/pith-number/MLFLJ6XAQMCKD6HRIPOMLI3EJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/MLFLJ6XAQMCKD6HRIPOMLI3EJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLFLJ6XAQMCKD6HRIPOMLI3EJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLFLJ6XAQMCKD6HRIPOMLI3EJ3/action/storage_attestation","attest_author":"https://pith.science/pith/MLFLJ6XAQMCKD6HRIPOMLI3EJ3/action/author_attestation","sign_citation":"https://pith.science/pith/MLFLJ6XAQMCKD6HRIPOMLI3EJ3/action/citation_signature","submit_replication":"https://pith.science/pith/MLFLJ6XAQMCKD6HRIPOMLI3EJ3/action/replication_record"}},"created_at":"2026-07-05T00:16:10.117598+00:00","updated_at":"2026-07-05T00:16:10.117598+00:00"}