{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WEY3MJM4M334QG2TMXM7FYKJUX","short_pith_number":"pith:WEY3MJM4","schema_version":"1.0","canonical_sha256":"b131b6259c66f7c81b5365d9f2e149a5cb770a9eb92696c1ca29b1561f5dc4a6","source":{"kind":"arxiv","id":"2606.19050","version":1},"attestation_state":"computed","paper":{"title":"First-Order Methods for Solving Convex (Strongly) Concave Minimax Problems with Functional Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xinhao Ying, Yangyang Xu","submitted_at":"2026-06-17T13:17:06Z","abstract_excerpt":"Minimax problems arise in many applications, including robust learning and Stackelberg models. Most existing methods for minimax problems address unconstrained or projection-friendly settings, while functional constrained minimax problems remain far less explored. We study a class of convex-(strongly-)concave minimax problems with functional constraints. By exploiting strong duality, we incorporate the inner-maximization functional constraints into the objective. This allows us to efficiently obtain inexact gradients of the primal function of the reformulation and to design a proximal augmente"},"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":"2606.19050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-17T13:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"ec20a9b70314826f738fdefddb5c290862e0cefe22bc90e0f28caf95170d6560","abstract_canon_sha256":"53148c9dedff88b498661e5efbcaaeb97e41a927c5a9ddfbc610d26f9d28ff44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:55.404972Z","signature_b64":"14DUkUA3IL3N4Ph4QeVEJfg3zzh60ecQgq5xYSZOFFdrugDWSIlUVe0zEvsgR/RZFkZK0x6H/Sn7R56BviuMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b131b6259c66f7c81b5365d9f2e149a5cb770a9eb92696c1ca29b1561f5dc4a6","last_reissued_at":"2026-06-19T16:11:55.404619Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:55.404619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-Order Methods for Solving Convex (Strongly) Concave Minimax Problems with Functional Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xinhao Ying, Yangyang Xu","submitted_at":"2026-06-17T13:17:06Z","abstract_excerpt":"Minimax problems arise in many applications, including robust learning and Stackelberg models. Most existing methods for minimax problems address unconstrained or projection-friendly settings, while functional constrained minimax problems remain far less explored. We study a class of convex-(strongly-)concave minimax problems with functional constraints. By exploiting strong duality, we incorporate the inner-maximization functional constraints into the objective. This allows us to efficiently obtain inexact gradients of the primal function of the reformulation and to design a proximal augmente"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19050","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/2606.19050/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":"2606.19050","created_at":"2026-06-19T16:11:55.404683+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.19050v1","created_at":"2026-06-19T16:11:55.404683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19050","created_at":"2026-06-19T16:11:55.404683+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEY3MJM4M334","created_at":"2026-06-19T16:11:55.404683+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEY3MJM4M334QG2T","created_at":"2026-06-19T16:11:55.404683+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEY3MJM4","created_at":"2026-06-19T16:11:55.404683+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/WEY3MJM4M334QG2TMXM7FYKJUX","json":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX.json","graph_json":"https://pith.science/api/pith-number/WEY3MJM4M334QG2TMXM7FYKJUX/graph.json","events_json":"https://pith.science/api/pith-number/WEY3MJM4M334QG2TMXM7FYKJUX/events.json","paper":"https://pith.science/paper/WEY3MJM4"},"agent_actions":{"view_html":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX","download_json":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX.json","view_paper":"https://pith.science/paper/WEY3MJM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.19050&json=true","fetch_graph":"https://pith.science/api/pith-number/WEY3MJM4M334QG2TMXM7FYKJUX/graph.json","fetch_events":"https://pith.science/api/pith-number/WEY3MJM4M334QG2TMXM7FYKJUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX/action/storage_attestation","attest_author":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX/action/author_attestation","sign_citation":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX/action/citation_signature","submit_replication":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX/action/replication_record"}},"created_at":"2026-06-19T16:11:55.404683+00:00","updated_at":"2026-06-19T16:11:55.404683+00:00"}