{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5BJTYEZQLKI7U2HCZYVHMVGPOZ","short_pith_number":"pith:5BJTYEZQ","schema_version":"1.0","canonical_sha256":"e8533c13305a91fa68e2ce2a7654cf7649b2dcf068ff10bcbefb72c38f10e3b0","source":{"kind":"arxiv","id":"2411.03248","version":3},"attestation_state":"computed","paper":{"title":"Improved Hardness Results for Min-Max Optimization with Coupled Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Andrea Celli, Gabriele Farina, Martino Bernasconi, Matteo Castiglioni","submitted_at":"2024-11-05T16:46:23Z","abstract_excerpt":"We investigate the computational complexity of min-max optimization under coupled constraints. The work of Daskalakis, Skoulakis, and Zampetakis [DSZ21] was the first to study min-max optimization through the lens of computational complexity, showing that min-max problems with nonconvex-nonconcave objectives are PPAD-hard under coupled constraints. By carefully exploiting the coupled constraints rather than the structure of the objective function, we are able to significantly simplify and strengthen the proof of the hardness result. More precisely, the first contribution of this paper is a fun"},"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":"2411.03248","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-11-05T16:46:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f5d71c2a12e4ed707011d17a344e8017a4abd6b586cba9c3acbea48e63d7a0f5","abstract_canon_sha256":"b6d637e4a85bc147e352ec0c458ba2be65b686c5d9795ee2b3d6fbba115c57f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:39.380213Z","signature_b64":"Sx7oIjpBkUQzGlxvPBRDzZHO17kY+vx7u0WsQHa1D9CHn6JhR8j8FNzOCMzfx2nmWZJRvBGwx76CZTC0ShirAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8533c13305a91fa68e2ce2a7654cf7649b2dcf068ff10bcbefb72c38f10e3b0","last_reissued_at":"2026-05-28T02:04:39.379689Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:39.379689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Hardness Results for Min-Max Optimization with Coupled Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Andrea Celli, Gabriele Farina, Martino Bernasconi, Matteo Castiglioni","submitted_at":"2024-11-05T16:46:23Z","abstract_excerpt":"We investigate the computational complexity of min-max optimization under coupled constraints. The work of Daskalakis, Skoulakis, and Zampetakis [DSZ21] was the first to study min-max optimization through the lens of computational complexity, showing that min-max problems with nonconvex-nonconcave objectives are PPAD-hard under coupled constraints. By carefully exploiting the coupled constraints rather than the structure of the objective function, we are able to significantly simplify and strengthen the proof of the hardness result. More precisely, the first contribution of this paper is a fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03248","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/2411.03248/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":"2411.03248","created_at":"2026-05-28T02:04:39.379753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03248v3","created_at":"2026-05-28T02:04:39.379753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03248","created_at":"2026-05-28T02:04:39.379753+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BJTYEZQLKI7","created_at":"2026-05-28T02:04:39.379753+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BJTYEZQLKI7U2HC","created_at":"2026-05-28T02:04:39.379753+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BJTYEZQ","created_at":"2026-05-28T02:04:39.379753+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.13806","citing_title":"Min-Max Optimization Requires Exponentially Many Queries","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5BJTYEZQLKI7U2HCZYVHMVGPOZ","json":"https://pith.science/pith/5BJTYEZQLKI7U2HCZYVHMVGPOZ.json","graph_json":"https://pith.science/api/pith-number/5BJTYEZQLKI7U2HCZYVHMVGPOZ/graph.json","events_json":"https://pith.science/api/pith-number/5BJTYEZQLKI7U2HCZYVHMVGPOZ/events.json","paper":"https://pith.science/paper/5BJTYEZQ"},"agent_actions":{"view_html":"https://pith.science/pith/5BJTYEZQLKI7U2HCZYVHMVGPOZ","download_json":"https://pith.science/pith/5BJTYEZQLKI7U2HCZYVHMVGPOZ.json","view_paper":"https://pith.science/paper/5BJTYEZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03248&json=true","fetch_graph":"https://pith.science/api/pith-number/5BJTYEZQLKI7U2HCZYVHMVGPOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5BJTYEZQLKI7U2HCZYVHMVGPOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BJTYEZQLKI7U2HCZYVHMVGPOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BJTYEZQLKI7U2HCZYVHMVGPOZ/action/storage_attestation","attest_author":"https://pith.science/pith/5BJTYEZQLKI7U2HCZYVHMVGPOZ/action/author_attestation","sign_citation":"https://pith.science/pith/5BJTYEZQLKI7U2HCZYVHMVGPOZ/action/citation_signature","submit_replication":"https://pith.science/pith/5BJTYEZQLKI7U2HCZYVHMVGPOZ/action/replication_record"}},"created_at":"2026-05-28T02:04:39.379753+00:00","updated_at":"2026-05-28T02:04:39.379753+00:00"}