{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G2KQUG7NB5LR36ERVVTEXFWQQE","short_pith_number":"pith:G2KQUG7N","schema_version":"1.0","canonical_sha256":"36950a1bed0f571df891ad664b96d0812970f07ab57af751bf189b9fe09b555d","source":{"kind":"arxiv","id":"2510.01168","version":3},"attestation_state":"computed","paper":{"title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Xiangyuan Wang, Zhaosong Lu","submitted_at":"2025-10-01T17:54:27Z","abstract_excerpt":"We study a class of constrained nonconvex-nonconcave minimax optimization problems in which the inner maximization involves potentially complex constraints. Under the assumption that the inner problem of a novel lifted minimax reformulation satisfies a local Kurdyka-Lojasiewicz (KL) condition, we show that the maximal function of the original problem enjoys a local generalized H\\\"{o}lder smoothness property. We also propose a sequential convex programming (SCP) method for solving constrained optimization problems and establish its convergence rate under a local KL condition. Leveraging these r"},"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":"2510.01168","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-10-01T17:54:27Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"78ade3c61fea01ab5eb51ebc0dc3ade882ac4a5e95ddd1cd5eb5f495fde4b02e","abstract_canon_sha256":"355e0817a05a3b656dd9a5b98a8000f327f7d96f925c30bbfce9815afc892cfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T02:05:06.207923Z","signature_b64":"qDtueutcr1fG+XCaxn80hKITnrSocZ83t5hKW27qWkTXSM5vNFGAfNwYrYngNG907pGlDY7SbhxO32HPOnarBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36950a1bed0f571df891ad664b96d0812970f07ab57af751bf189b9fe09b555d","last_reissued_at":"2026-05-27T02:05:06.206975Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T02:05:06.206975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Xiangyuan Wang, Zhaosong Lu","submitted_at":"2025-10-01T17:54:27Z","abstract_excerpt":"We study a class of constrained nonconvex-nonconcave minimax optimization problems in which the inner maximization involves potentially complex constraints. Under the assumption that the inner problem of a novel lifted minimax reformulation satisfies a local Kurdyka-Lojasiewicz (KL) condition, we show that the maximal function of the original problem enjoys a local generalized H\\\"{o}lder smoothness property. We also propose a sequential convex programming (SCP) method for solving constrained optimization problems and establish its convergence rate under a local KL condition. Leveraging these r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.01168","kind":"arxiv","version":3},"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/2510.01168/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":"2510.01168","created_at":"2026-05-27T02:05:06.207099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.01168v3","created_at":"2026-05-27T02:05:06.207099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.01168","created_at":"2026-05-27T02:05:06.207099+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2KQUG7NB5LR","created_at":"2026-05-27T02:05:06.207099+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2KQUG7NB5LR36ER","created_at":"2026-05-27T02:05:06.207099+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2KQUG7N","created_at":"2026-05-27T02:05:06.207099+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/G2KQUG7NB5LR36ERVVTEXFWQQE","json":"https://pith.science/pith/G2KQUG7NB5LR36ERVVTEXFWQQE.json","graph_json":"https://pith.science/api/pith-number/G2KQUG7NB5LR36ERVVTEXFWQQE/graph.json","events_json":"https://pith.science/api/pith-number/G2KQUG7NB5LR36ERVVTEXFWQQE/events.json","paper":"https://pith.science/paper/G2KQUG7N"},"agent_actions":{"view_html":"https://pith.science/pith/G2KQUG7NB5LR36ERVVTEXFWQQE","download_json":"https://pith.science/pith/G2KQUG7NB5LR36ERVVTEXFWQQE.json","view_paper":"https://pith.science/paper/G2KQUG7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.01168&json=true","fetch_graph":"https://pith.science/api/pith-number/G2KQUG7NB5LR36ERVVTEXFWQQE/graph.json","fetch_events":"https://pith.science/api/pith-number/G2KQUG7NB5LR36ERVVTEXFWQQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2KQUG7NB5LR36ERVVTEXFWQQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2KQUG7NB5LR36ERVVTEXFWQQE/action/storage_attestation","attest_author":"https://pith.science/pith/G2KQUG7NB5LR36ERVVTEXFWQQE/action/author_attestation","sign_citation":"https://pith.science/pith/G2KQUG7NB5LR36ERVVTEXFWQQE/action/citation_signature","submit_replication":"https://pith.science/pith/G2KQUG7NB5LR36ERVVTEXFWQQE/action/replication_record"}},"created_at":"2026-05-27T02:05:06.207099+00:00","updated_at":"2026-05-27T02:05:06.207099+00:00"}