{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WZZZEM2MRHVGPZODUEDWJMGPG2","short_pith_number":"pith:WZZZEM2M","schema_version":"1.0","canonical_sha256":"b67392334c89ea67e5c3a10764b0cf368e17e2412abbb5211d53eda8ca5df141","source":{"kind":"arxiv","id":"2507.11509","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Florian Horn, Mahsa Shirmohammadi, Soumyajit Paul, Vincent Cheval","submitted_at":"2025-07-15T17:24:16Z","abstract_excerpt":"A major open question in algorithmic game theory is whether normal-form correlated equilibria (NFCE) can be computed efficiently in succinct games such as extensive-form games [DFF+25,6PR24,FP23,HvS08,VSF08,PR08]. Motivated by this question, we study the associated Threshold problem: deciding whether there exists a correlated equilibrium whose value exceeds a given threshold. We prove that this problem is PSPACE-hard for NFCE in multiplayer extensive-form games with perfect recall, even for fixed thresholds. To contextualize this result, we also establish the complexity of the Threshold proble"},"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.11509","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T17:24:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e26cd7afb8207d49c27d31cca0cf7b584541b5bd80f5e0c8e227eccd8d0adb7a","abstract_canon_sha256":"d2d445358776c13a8ca1dcee4053ff2469b220e635c5184102f09f52cd23c9a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:40.233767Z","signature_b64":"2AQVNBIrYDHQMwYGEW25CphV1sNANLDZ4l6gnkBJo7H8RzUcERp7zkCI1fv+Mb7c2i99Lkkq+uSLGZScnrCKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b67392334c89ea67e5c3a10764b0cf368e17e2412abbb5211d53eda8ca5df141","last_reissued_at":"2026-07-05T11:37:40.233224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:40.233224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Florian Horn, Mahsa Shirmohammadi, Soumyajit Paul, Vincent Cheval","submitted_at":"2025-07-15T17:24:16Z","abstract_excerpt":"A major open question in algorithmic game theory is whether normal-form correlated equilibria (NFCE) can be computed efficiently in succinct games such as extensive-form games [DFF+25,6PR24,FP23,HvS08,VSF08,PR08]. Motivated by this question, we study the associated Threshold problem: deciding whether there exists a correlated equilibrium whose value exceeds a given threshold. We prove that this problem is PSPACE-hard for NFCE in multiplayer extensive-form games with perfect recall, even for fixed thresholds. To contextualize this result, we also establish the complexity of the Threshold proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11509","kind":"arxiv","version":1},"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.11509/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.11509","created_at":"2026-07-05T11:37:40.233283+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11509v1","created_at":"2026-07-05T11:37:40.233283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11509","created_at":"2026-07-05T11:37:40.233283+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZZZEM2MRHVG","created_at":"2026-07-05T11:37:40.233283+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZZZEM2MRHVGPZOD","created_at":"2026-07-05T11:37:40.233283+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZZZEM2M","created_at":"2026-07-05T11:37:40.233283+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.17665","citing_title":"On the Complexity of Correlated Equilibria Beyond Normal-Form Games","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25256","citing_title":"AutoResearchBench: Benchmarking AI Agents on Complex Scientific Literature Discovery","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WZZZEM2MRHVGPZODUEDWJMGPG2","json":"https://pith.science/pith/WZZZEM2MRHVGPZODUEDWJMGPG2.json","graph_json":"https://pith.science/api/pith-number/WZZZEM2MRHVGPZODUEDWJMGPG2/graph.json","events_json":"https://pith.science/api/pith-number/WZZZEM2MRHVGPZODUEDWJMGPG2/events.json","paper":"https://pith.science/paper/WZZZEM2M"},"agent_actions":{"view_html":"https://pith.science/pith/WZZZEM2MRHVGPZODUEDWJMGPG2","download_json":"https://pith.science/pith/WZZZEM2MRHVGPZODUEDWJMGPG2.json","view_paper":"https://pith.science/paper/WZZZEM2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11509&json=true","fetch_graph":"https://pith.science/api/pith-number/WZZZEM2MRHVGPZODUEDWJMGPG2/graph.json","fetch_events":"https://pith.science/api/pith-number/WZZZEM2MRHVGPZODUEDWJMGPG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZZZEM2MRHVGPZODUEDWJMGPG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZZZEM2MRHVGPZODUEDWJMGPG2/action/storage_attestation","attest_author":"https://pith.science/pith/WZZZEM2MRHVGPZODUEDWJMGPG2/action/author_attestation","sign_citation":"https://pith.science/pith/WZZZEM2MRHVGPZODUEDWJMGPG2/action/citation_signature","submit_replication":"https://pith.science/pith/WZZZEM2MRHVGPZODUEDWJMGPG2/action/replication_record"}},"created_at":"2026-07-05T11:37:40.233283+00:00","updated_at":"2026-07-05T11:37:40.233283+00:00"}