{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2TYIJWHCXZ6VPR2WXSELOE66A2","short_pith_number":"pith:2TYIJWHC","schema_version":"1.0","canonical_sha256":"d4f084d8e2be7d57c756bc88b713de0680195362af8862d1551612c45b8d9ec7","source":{"kind":"arxiv","id":"2505.10631","version":1},"attestation_state":"computed","paper":{"title":"Decentralized Min-Max Optimization with Gradient Tracking","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kun Huang, Runze You, Shi Pu","submitted_at":"2025-05-15T18:12:31Z","abstract_excerpt":"This paper presents a novel distributed formulation of the min-max optimization problem. Such a formulation enables enhanced flexibility among agents when optimizing their maximization variables. To address the problem, we propose two distributed gradient methods over networks, termed Distributed Gradient Tracking Ascent (DGTA) and Distributed Stochastic Gradient Tracking Ascent (DSGTA). We demonstrate that DGTA achieves an iteration complexity of $\\mathcal{O}(\\kappa^2\\varepsilon^{-2})$, and DSGTA attains a sample complexity of $\\mathcal{O}(\\kappa^3\\varepsilon^{-4})$ for nonconvex strongly con"},"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":"2505.10631","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T18:12:31Z","cross_cats_sorted":[],"title_canon_sha256":"340f8e2656aa31f0f0865d3bb0bf183b00fd81bdbe6514cccbe4d05d52d29809","abstract_canon_sha256":"08ce3c8a99c1d279bec51ff067f3039c9724d178c60252380d98be8619560dd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:02.514162Z","signature_b64":"KLz6jhtkEkOoZ0nAyjmjwWroTd/oW0ewG5cHQXKYfGMcUjeedldFxFfYDw/Cw1Je7WO5+e1s7KJI9aM6ZLvLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4f084d8e2be7d57c756bc88b713de0680195362af8862d1551612c45b8d9ec7","last_reissued_at":"2026-07-05T11:04:02.513675Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:02.513675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Min-Max Optimization with Gradient Tracking","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kun Huang, Runze You, Shi Pu","submitted_at":"2025-05-15T18:12:31Z","abstract_excerpt":"This paper presents a novel distributed formulation of the min-max optimization problem. Such a formulation enables enhanced flexibility among agents when optimizing their maximization variables. To address the problem, we propose two distributed gradient methods over networks, termed Distributed Gradient Tracking Ascent (DGTA) and Distributed Stochastic Gradient Tracking Ascent (DSGTA). We demonstrate that DGTA achieves an iteration complexity of $\\mathcal{O}(\\kappa^2\\varepsilon^{-2})$, and DSGTA attains a sample complexity of $\\mathcal{O}(\\kappa^3\\varepsilon^{-4})$ for nonconvex strongly con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10631","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/2505.10631/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":"2505.10631","created_at":"2026-07-05T11:04:02.513741+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.10631v1","created_at":"2026-07-05T11:04:02.513741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10631","created_at":"2026-07-05T11:04:02.513741+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TYIJWHCXZ6V","created_at":"2026-07-05T11:04:02.513741+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TYIJWHCXZ6VPR2W","created_at":"2026-07-05T11:04:02.513741+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TYIJWHC","created_at":"2026-07-05T11:04:02.513741+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/2TYIJWHCXZ6VPR2WXSELOE66A2","json":"https://pith.science/pith/2TYIJWHCXZ6VPR2WXSELOE66A2.json","graph_json":"https://pith.science/api/pith-number/2TYIJWHCXZ6VPR2WXSELOE66A2/graph.json","events_json":"https://pith.science/api/pith-number/2TYIJWHCXZ6VPR2WXSELOE66A2/events.json","paper":"https://pith.science/paper/2TYIJWHC"},"agent_actions":{"view_html":"https://pith.science/pith/2TYIJWHCXZ6VPR2WXSELOE66A2","download_json":"https://pith.science/pith/2TYIJWHCXZ6VPR2WXSELOE66A2.json","view_paper":"https://pith.science/paper/2TYIJWHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.10631&json=true","fetch_graph":"https://pith.science/api/pith-number/2TYIJWHCXZ6VPR2WXSELOE66A2/graph.json","fetch_events":"https://pith.science/api/pith-number/2TYIJWHCXZ6VPR2WXSELOE66A2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TYIJWHCXZ6VPR2WXSELOE66A2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TYIJWHCXZ6VPR2WXSELOE66A2/action/storage_attestation","attest_author":"https://pith.science/pith/2TYIJWHCXZ6VPR2WXSELOE66A2/action/author_attestation","sign_citation":"https://pith.science/pith/2TYIJWHCXZ6VPR2WXSELOE66A2/action/citation_signature","submit_replication":"https://pith.science/pith/2TYIJWHCXZ6VPR2WXSELOE66A2/action/replication_record"}},"created_at":"2026-07-05T11:04:02.513741+00:00","updated_at":"2026-07-05T11:04:02.513741+00:00"}