{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:56C3FMTKSEAO6GATOA64F6JONP","short_pith_number":"pith:56C3FMTK","schema_version":"1.0","canonical_sha256":"ef85b2b26a9100ef1813703dc2f92e6bf4063a29b8fedae7600e40ad18e0c275","source":{"kind":"arxiv","id":"2507.01932","version":2},"attestation_state":"computed","paper":{"title":"A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition","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-07-02T17:45:10Z","abstract_excerpt":"We study a class of nonconvex-nonconcave minimax problems in which the inner maximization problem satisfies a local Kurdyka-Lojasiewicz (KL) condition that may vary with the outer minimization variable. In contrast to the global KL or Polyak-Lojasiewicz (PL) conditions commonly assumed in the literature -- which are significantly stronger and often too restrictive in practice -- this local KL condition accommodates a broader range of practical scenarios. However, it also introduces new analytical challenges. In particular, as an optimization algorithm progresses toward a stationary point of th"},"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":"2507.01932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-02T17:45:10Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"dbdd33360380b7368e482b44c6969fd03ecc99426bd06877711ee487d35229b4","abstract_canon_sha256":"7113073a1544dc9285fcbf0987bd022456c7b22345a6defa6f79d413726d4ded"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:34.037727Z","signature_b64":"WPp8mSW0suEdZYCuPB55jzfuNQh5M23jkacFntrD9OAm0kpkiv7KwltiADgP9xBeE1+rshqMW15VB/wrhplkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef85b2b26a9100ef1813703dc2f92e6bf4063a29b8fedae7600e40ad18e0c275","last_reissued_at":"2026-05-20T02:05:34.036926Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:34.036926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition","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-07-02T17:45:10Z","abstract_excerpt":"We study a class of nonconvex-nonconcave minimax problems in which the inner maximization problem satisfies a local Kurdyka-Lojasiewicz (KL) condition that may vary with the outer minimization variable. In contrast to the global KL or Polyak-Lojasiewicz (PL) conditions commonly assumed in the literature -- which are significantly stronger and often too restrictive in practice -- this local KL condition accommodates a broader range of practical scenarios. However, it also introduces new analytical challenges. In particular, as an optimization algorithm progresses toward a stationary point of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01932","kind":"arxiv","version":2},"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/2507.01932/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":"2507.01932","created_at":"2026-05-20T02:05:34.037028+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.01932v2","created_at":"2026-05-20T02:05:34.037028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01932","created_at":"2026-05-20T02:05:34.037028+00:00"},{"alias_kind":"pith_short_12","alias_value":"56C3FMTKSEAO","created_at":"2026-05-20T02:05:34.037028+00:00"},{"alias_kind":"pith_short_16","alias_value":"56C3FMTKSEAO6GAT","created_at":"2026-05-20T02:05:34.037028+00:00"},{"alias_kind":"pith_short_8","alias_value":"56C3FMTK","created_at":"2026-05-20T02:05:34.037028+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.21371","citing_title":"Nonsmooth Nonconvex-Concave Minimax Optimization: Convergence Criteria and Algorithms","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/56C3FMTKSEAO6GATOA64F6JONP","json":"https://pith.science/pith/56C3FMTKSEAO6GATOA64F6JONP.json","graph_json":"https://pith.science/api/pith-number/56C3FMTKSEAO6GATOA64F6JONP/graph.json","events_json":"https://pith.science/api/pith-number/56C3FMTKSEAO6GATOA64F6JONP/events.json","paper":"https://pith.science/paper/56C3FMTK"},"agent_actions":{"view_html":"https://pith.science/pith/56C3FMTKSEAO6GATOA64F6JONP","download_json":"https://pith.science/pith/56C3FMTKSEAO6GATOA64F6JONP.json","view_paper":"https://pith.science/paper/56C3FMTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.01932&json=true","fetch_graph":"https://pith.science/api/pith-number/56C3FMTKSEAO6GATOA64F6JONP/graph.json","fetch_events":"https://pith.science/api/pith-number/56C3FMTKSEAO6GATOA64F6JONP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56C3FMTKSEAO6GATOA64F6JONP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56C3FMTKSEAO6GATOA64F6JONP/action/storage_attestation","attest_author":"https://pith.science/pith/56C3FMTKSEAO6GATOA64F6JONP/action/author_attestation","sign_citation":"https://pith.science/pith/56C3FMTKSEAO6GATOA64F6JONP/action/citation_signature","submit_replication":"https://pith.science/pith/56C3FMTKSEAO6GATOA64F6JONP/action/replication_record"}},"created_at":"2026-05-20T02:05:34.037028+00:00","updated_at":"2026-05-20T02:05:34.037028+00:00"}