{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:73DHL43MTQGSOFFAAGSK3DCNSA","short_pith_number":"pith:73DHL43M","schema_version":"1.0","canonical_sha256":"fec675f36c9c0d2714a001a4ad8c4d900764362d180c56ecafbed3485decb26d","source":{"kind":"arxiv","id":"2605.13806","version":1},"attestation_state":"computed","paper":{"title":"Min-Max Optimization Requires Exponentially Many Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Any algorithm finding an ε-approximate stationary point in nonconvex-nonconcave min-max optimization requires exponentially many queries.","cross_cats":["cs.CC","cs.GT","cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Alexandros Hollender, Andrea Celli, Martino Bernasconi, Matteo Castiglioni","submitted_at":"2026-05-13T17:34:24Z","abstract_excerpt":"We study the query complexity of min-max optimization of a nonconvex-nonconcave function $f$ over $[0,1]^d \\times [0,1]^d$. We show that, given oracle access to $f$ and to its gradient $\\nabla f$, any algorithm that finds an $\\varepsilon$-approximate stationary point must make a number of queries that is exponential in $1/\\varepsilon$ or $d$."},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.13806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T17:34:24Z","cross_cats_sorted":["cs.CC","cs.GT","cs.LG","math.OC"],"title_canon_sha256":"2ef13c8da93afdcabee2615e62d100e3b8e2793b8c0d107cda5c89b227dd56f4","abstract_canon_sha256":"14e8bc0b758d6a616f7e79f8ec5f6c8f633cf6edd69ba18f67fbc11e948a2104"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:15.447248Z","signature_b64":"LUJdasPx+Un0b2q2+s5Uc8YKwqeTI5eLuzV0WJ+hsxZHVgIta9gMqwdqvXhKMnEEXNBbeTvBV+/vboC5Do16Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fec675f36c9c0d2714a001a4ad8c4d900764362d180c56ecafbed3485decb26d","last_reissued_at":"2026-05-18T02:44:15.446729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:15.446729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Min-Max Optimization Requires Exponentially Many Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Any algorithm finding an ε-approximate stationary point in nonconvex-nonconcave min-max optimization requires exponentially many queries.","cross_cats":["cs.CC","cs.GT","cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Alexandros Hollender, Andrea Celli, Martino Bernasconi, Matteo Castiglioni","submitted_at":"2026-05-13T17:34:24Z","abstract_excerpt":"We study the query complexity of min-max optimization of a nonconvex-nonconcave function $f$ over $[0,1]^d \\times [0,1]^d$. We show that, given oracle access to $f$ and to its gradient $\\nabla f$, any algorithm that finds an $\\varepsilon$-approximate stationary point must make a number of queries that is exponential in $1/\\varepsilon$ or $d$."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"any algorithm that finds an ε-approximate stationary point must make a number of queries that is exponential in 1/ε or d","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The function belongs to the nonconvex-nonconcave class and the oracle model provides exact access to f and ∇f; if the class is restricted further or oracles are noisy, the exponential bound may not apply.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Finding an ε-approximate stationary point for nonconvex-nonconcave min-max optimization over [0,1]^d × [0,1]^d requires exponentially many queries in 1/ε or d.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Any algorithm finding an ε-approximate stationary point in nonconvex-nonconcave min-max optimization requires exponentially many queries.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ffda400fef57ede54f7fc7ef63d26a17aabc4e4a165425de83f5282bc9125f1b"},"source":{"id":"2605.13806","kind":"arxiv","version":1},"verdict":{"id":"94b66018-a77a-46f8-927a-4cc78910af11","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:27:58.368989Z","strongest_claim":"any algorithm that finds an ε-approximate stationary point must make a number of queries that is exponential in 1/ε or d","one_line_summary":"Finding an ε-approximate stationary point for nonconvex-nonconcave min-max optimization over [0,1]^d × [0,1]^d requires exponentially many queries in 1/ε or d.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The function belongs to the nonconvex-nonconcave class and the oracle model provides exact access to f and ∇f; if the class is restricted further or oracles are noisy, the exponential bound may not apply.","pith_extraction_headline":"Any algorithm finding an ε-approximate stationary point in nonconvex-nonconcave min-max optimization requires exponentially many queries."},"references":{"count":6,"sample":[{"doi":"","year":1983,"title":"A polynomial-time algorithm for variational inequalities under the Minty condition","work_id":"15f567c2-0b71-4c5e-b450-d81bbd4b8c1e","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"On the Role of Constraints in the Complexity of Min-Max Optimization","work_id":"764b540a-8226-4dc9-90a0-88e6e48c9cb6","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Pure- Circuit: Tight Inapproximability for PPAD","work_id":"79a85b37-7c17-4421-9d69-e633baa8a8cd","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2003,"title":"Playing large games using simple strategies","work_id":"6eb220a3-ad25-49e3-ab05-f828d9a6495d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Cycles in adversarial regularized learning","work_id":"4af6b150-6e68-476b-bbff-d1aca0d4a4c1","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":6,"snapshot_sha256":"5606ff24adf91320a307627312afd1b7e5ae8776ac14d3020a4fd5db84e41ce3","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"60bf2eb6e3c52714a90b37c9a8d03ab603701e62cfb5a90b28d142ec55f949a0"},"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":"2605.13806","created_at":"2026-05-18T02:44:15.446801+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13806v1","created_at":"2026-05-18T02:44:15.446801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13806","created_at":"2026-05-18T02:44:15.446801+00:00"},{"alias_kind":"pith_short_12","alias_value":"73DHL43MTQGS","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"73DHL43MTQGSOFFA","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"73DHL43M","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/73DHL43MTQGSOFFAAGSK3DCNSA","json":"https://pith.science/pith/73DHL43MTQGSOFFAAGSK3DCNSA.json","graph_json":"https://pith.science/api/pith-number/73DHL43MTQGSOFFAAGSK3DCNSA/graph.json","events_json":"https://pith.science/api/pith-number/73DHL43MTQGSOFFAAGSK3DCNSA/events.json","paper":"https://pith.science/paper/73DHL43M"},"agent_actions":{"view_html":"https://pith.science/pith/73DHL43MTQGSOFFAAGSK3DCNSA","download_json":"https://pith.science/pith/73DHL43MTQGSOFFAAGSK3DCNSA.json","view_paper":"https://pith.science/paper/73DHL43M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13806&json=true","fetch_graph":"https://pith.science/api/pith-number/73DHL43MTQGSOFFAAGSK3DCNSA/graph.json","fetch_events":"https://pith.science/api/pith-number/73DHL43MTQGSOFFAAGSK3DCNSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73DHL43MTQGSOFFAAGSK3DCNSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73DHL43MTQGSOFFAAGSK3DCNSA/action/storage_attestation","attest_author":"https://pith.science/pith/73DHL43MTQGSOFFAAGSK3DCNSA/action/author_attestation","sign_citation":"https://pith.science/pith/73DHL43MTQGSOFFAAGSK3DCNSA/action/citation_signature","submit_replication":"https://pith.science/pith/73DHL43MTQGSOFFAAGSK3DCNSA/action/replication_record"}},"created_at":"2026-05-18T02:44:15.446801+00:00","updated_at":"2026-05-18T02:44:15.446801+00:00"}