{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PCO4ETYWCWCTDTFWGM7VVXXK3F","short_pith_number":"pith:PCO4ETYW","schema_version":"1.0","canonical_sha256":"789dc24f16158531ccb6333f5adeead958537c485c7a2463e1c6858ac25d62aa","source":{"kind":"arxiv","id":"2303.02532","version":1},"attestation_state":"computed","paper":{"title":"PRECISION: Decentralized Constrained Min-Max Learning with Low Communication and Sample Complexities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Jia Liu, Songtao Lu, Xin Zhang, Zhuqing Liu","submitted_at":"2023-03-05T00:26:10Z","abstract_excerpt":"Recently, min-max optimization problems have received increasing attention due to their wide range of applications in machine learning (ML). However, most existing min-max solution techniques are either single-machine or distributed algorithms coordinated by a central server. In this paper, we focus on the decentralized min-max optimization for learning with domain constraints, where multiple agents collectively solve a nonconvex-strongly-concave min-max saddle point problem without coordination from any server. Decentralized min-max optimization problems with domain constraints underpins many"},"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":"2303.02532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-05T00:26:10Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7700fa6bb141410b605c6c3cb4a943b91973728b972ec9e7d466286935bda38e","abstract_canon_sha256":"c1c7ad892978cb3b44c8f60d666c75f0d3308dbb3c57c09027465a7cde59d1a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:12.451908Z","signature_b64":"LkKEBUcw4UStDxguxCCD8leLrt5n2VkxvLh7jlxeTqaO3mNuRVuumav/CSJwEjUsZiq0Ca7Hu7ONoglFr6aFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"789dc24f16158531ccb6333f5adeead958537c485c7a2463e1c6858ac25d62aa","last_reissued_at":"2026-07-05T05:48:12.451519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:12.451519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PRECISION: Decentralized Constrained Min-Max Learning with Low Communication and Sample Complexities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Jia Liu, Songtao Lu, Xin Zhang, Zhuqing Liu","submitted_at":"2023-03-05T00:26:10Z","abstract_excerpt":"Recently, min-max optimization problems have received increasing attention due to their wide range of applications in machine learning (ML). However, most existing min-max solution techniques are either single-machine or distributed algorithms coordinated by a central server. In this paper, we focus on the decentralized min-max optimization for learning with domain constraints, where multiple agents collectively solve a nonconvex-strongly-concave min-max saddle point problem without coordination from any server. Decentralized min-max optimization problems with domain constraints underpins many"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.02532","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/2303.02532/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":"2303.02532","created_at":"2026-07-05T05:48:12.451580+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.02532v1","created_at":"2026-07-05T05:48:12.451580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.02532","created_at":"2026-07-05T05:48:12.451580+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCO4ETYWCWCT","created_at":"2026-07-05T05:48:12.451580+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCO4ETYWCWCTDTFW","created_at":"2026-07-05T05:48:12.451580+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCO4ETYW","created_at":"2026-07-05T05:48:12.451580+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.10631","citing_title":"Decentralized Min-Max Optimization with Gradient Tracking","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F","json":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F.json","graph_json":"https://pith.science/api/pith-number/PCO4ETYWCWCTDTFWGM7VVXXK3F/graph.json","events_json":"https://pith.science/api/pith-number/PCO4ETYWCWCTDTFWGM7VVXXK3F/events.json","paper":"https://pith.science/paper/PCO4ETYW"},"agent_actions":{"view_html":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F","download_json":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F.json","view_paper":"https://pith.science/paper/PCO4ETYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.02532&json=true","fetch_graph":"https://pith.science/api/pith-number/PCO4ETYWCWCTDTFWGM7VVXXK3F/graph.json","fetch_events":"https://pith.science/api/pith-number/PCO4ETYWCWCTDTFWGM7VVXXK3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/action/storage_attestation","attest_author":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/action/author_attestation","sign_citation":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/action/citation_signature","submit_replication":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/action/replication_record"}},"created_at":"2026-07-05T05:48:12.451580+00:00","updated_at":"2026-07-05T05:48:12.451580+00:00"}