{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:73DHL43MTQGSOFFAAGSK3DCNSA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"14e8bc0b758d6a616f7e79f8ec5f6c8f633cf6edd69ba18f67fbc11e948a2104","cross_cats_sorted":["cs.CC","cs.GT","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T17:34:24Z","title_canon_sha256":"2ef13c8da93afdcabee2615e62d100e3b8e2793b8c0d107cda5c89b227dd56f4"},"schema_version":"1.0","source":{"id":"2605.13806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13806","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13806v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13806","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"73DHL43MTQGS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"73DHL43MTQGSOFFA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"73DHL43M","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2c3f379e4a011c558bfa9e044e6a228748c18bc2b326e4046475e42b682d2bfb","target":"graph","created_at":"2026-05-18T02:44:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"any algorithm that finds an ε-approximate stationary point must make a number of queries that is exponential in 1/ε or d"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Any algorithm finding an ε-approximate stationary point in nonconvex-nonconcave min-max optimization requires exponentially many queries."}],"snapshot_sha256":"ffda400fef57ede54f7fc7ef63d26a17aabc4e4a165425de83f5282bc9125f1b"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"60bf2eb6e3c52714a90b37c9a8d03ab603701e62cfb5a90b28d142ec55f949a0"},"paper":{"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$.","authors_text":"Alexandros Hollender, Andrea Celli, Martino Bernasconi, Matteo Castiglioni","cross_cats":["cs.CC","cs.GT","cs.LG","math.OC"],"headline":"Any algorithm finding an ε-approximate stationary point in nonconvex-nonconcave min-max optimization requires exponentially many queries.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T17:34:24Z","title":"Min-Max Optimization Requires Exponentially Many Queries"},"references":{"count":6,"internal_anchors":0,"resolved_work":6,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A polynomial-time algorithm for variational inequalities under the Minty condition","work_id":"15f567c2-0b71-4c5e-b450-d81bbd4b8c1e","year":1983},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"On the Role of Constraints in the Complexity of Min-Max Optimization","work_id":"764b540a-8226-4dc9-90a0-88e6e48c9cb6","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Pure- Circuit: Tight Inapproximability for PPAD","work_id":"79a85b37-7c17-4421-9d69-e633baa8a8cd","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Playing large games using simple strategies","work_id":"6eb220a3-ad25-49e3-ab05-f828d9a6495d","year":2003},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Cycles in adversarial regularized learning","work_id":"4af6b150-6e68-476b-bbff-d1aca0d4a4c1","year":2018}],"snapshot_sha256":"5606ff24adf91320a307627312afd1b7e5ae8776ac14d3020a4fd5db84e41ce3"},"source":{"id":"2605.13806","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:27:58.368989Z","id":"94b66018-a77a-46f8-927a-4cc78910af11","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Any algorithm finding an ε-approximate stationary point in nonconvex-nonconcave min-max optimization requires exponentially many queries.","strongest_claim":"any algorithm that finds an ε-approximate stationary point must make a number of queries that is exponential in 1/ε or d","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."}},"verdict_id":"94b66018-a77a-46f8-927a-4cc78910af11"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b0c2761e0048bb62c79b046f32222f0ad1cf3f09f432b8263c7c0df0941c3bf7","target":"record","created_at":"2026-05-18T02:44:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"14e8bc0b758d6a616f7e79f8ec5f6c8f633cf6edd69ba18f67fbc11e948a2104","cross_cats_sorted":["cs.CC","cs.GT","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T17:34:24Z","title_canon_sha256":"2ef13c8da93afdcabee2615e62d100e3b8e2793b8c0d107cda5c89b227dd56f4"},"schema_version":"1.0","source":{"id":"2605.13806","kind":"arxiv","version":1}},"canonical_sha256":"fec675f36c9c0d2714a001a4ad8c4d900764362d180c56ecafbed3485decb26d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fec675f36c9c0d2714a001a4ad8c4d900764362d180c56ecafbed3485decb26d","first_computed_at":"2026-05-18T02:44:15.446729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:15.446729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LUJdasPx+Un0b2q2+s5Uc8YKwqeTI5eLuzV0WJ+hsxZHVgIta9gMqwdqvXhKMnEEXNBbeTvBV+/vboC5Do16Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:15.447248Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0c2761e0048bb62c79b046f32222f0ad1cf3f09f432b8263c7c0df0941c3bf7","sha256:2c3f379e4a011c558bfa9e044e6a228748c18bc2b326e4046475e42b682d2bfb"],"state_sha256":"e9e5d243a780aad2f81b9ec7a4c45ac0ca04418f82c75edc9d2f9af5b4d54f67"}