{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:45M27OQXZNTWK5CVKTDXUYH45A","short_pith_number":"pith:45M27OQX","schema_version":"1.0","canonical_sha256":"e759afba17cb6765745554c77a60fce82704cb484dbd649ffad80fc5bea5ae0a","source":{"kind":"arxiv","id":"2204.04186","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Infinite-Horizon General-Sum Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.OC"],"primary_cat":"cs.GT","authors_text":"Aaron Sidford, Vidya Muthukumar, Yujia Jin","submitted_at":"2022-04-08T17:24:16Z","abstract_excerpt":"We study the complexity of computing stationary Nash equilibrium (NE) in n-player infinite-horizon general-sum stochastic games. We focus on the problem of computing NE in such stochastic games when each player is restricted to choosing a stationary policy and rewards are discounted. First, we prove that computing such NE is in PPAD (in addition to clearly being PPAD-hard). Second, we consider turn-based specializations of such games where at each state there is at most a single player that can take actions and show that these (seemingly-simpler) games remain PPAD-hard. Third, we show that und"},"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":"2204.04186","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-04-08T17:24:16Z","cross_cats_sorted":["cs.CC","cs.DS","math.OC"],"title_canon_sha256":"697b325ee109f39a8922c6f3a463215cd66d506c2600e9590479a4bc1205f495","abstract_canon_sha256":"f4b894723af8f621fbd8241ea0803891763c2fa0d8bb20b4b25d03e44e724f4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:10.875122Z","signature_b64":"HHFBrMcpYRa/rYosrXqShB7+2ecRMPdOiiA37b52qP2kvfvqT+7Ara++3t090qMJ4xhBuq8kuxuDy8dKQQMQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e759afba17cb6765745554c77a60fce82704cb484dbd649ffad80fc5bea5ae0a","last_reissued_at":"2026-07-05T05:20:10.874644Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:10.874644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Infinite-Horizon General-Sum Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.OC"],"primary_cat":"cs.GT","authors_text":"Aaron Sidford, Vidya Muthukumar, Yujia Jin","submitted_at":"2022-04-08T17:24:16Z","abstract_excerpt":"We study the complexity of computing stationary Nash equilibrium (NE) in n-player infinite-horizon general-sum stochastic games. We focus on the problem of computing NE in such stochastic games when each player is restricted to choosing a stationary policy and rewards are discounted. First, we prove that computing such NE is in PPAD (in addition to clearly being PPAD-hard). Second, we consider turn-based specializations of such games where at each state there is at most a single player that can take actions and show that these (seemingly-simpler) games remain PPAD-hard. Third, we show that und"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.04186","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/2204.04186/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":"2204.04186","created_at":"2026-07-05T05:20:10.874706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.04186v2","created_at":"2026-07-05T05:20:10.874706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.04186","created_at":"2026-07-05T05:20:10.874706+00:00"},{"alias_kind":"pith_short_12","alias_value":"45M27OQXZNTW","created_at":"2026-07-05T05:20:10.874706+00:00"},{"alias_kind":"pith_short_16","alias_value":"45M27OQXZNTWK5CV","created_at":"2026-07-05T05:20:10.874706+00:00"},{"alias_kind":"pith_short_8","alias_value":"45M27OQX","created_at":"2026-07-05T05:20:10.874706+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.16120","citing_title":"Solving Zero-Sum Convex Markov Games","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/45M27OQXZNTWK5CVKTDXUYH45A","json":"https://pith.science/pith/45M27OQXZNTWK5CVKTDXUYH45A.json","graph_json":"https://pith.science/api/pith-number/45M27OQXZNTWK5CVKTDXUYH45A/graph.json","events_json":"https://pith.science/api/pith-number/45M27OQXZNTWK5CVKTDXUYH45A/events.json","paper":"https://pith.science/paper/45M27OQX"},"agent_actions":{"view_html":"https://pith.science/pith/45M27OQXZNTWK5CVKTDXUYH45A","download_json":"https://pith.science/pith/45M27OQXZNTWK5CVKTDXUYH45A.json","view_paper":"https://pith.science/paper/45M27OQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.04186&json=true","fetch_graph":"https://pith.science/api/pith-number/45M27OQXZNTWK5CVKTDXUYH45A/graph.json","fetch_events":"https://pith.science/api/pith-number/45M27OQXZNTWK5CVKTDXUYH45A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45M27OQXZNTWK5CVKTDXUYH45A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45M27OQXZNTWK5CVKTDXUYH45A/action/storage_attestation","attest_author":"https://pith.science/pith/45M27OQXZNTWK5CVKTDXUYH45A/action/author_attestation","sign_citation":"https://pith.science/pith/45M27OQXZNTWK5CVKTDXUYH45A/action/citation_signature","submit_replication":"https://pith.science/pith/45M27OQXZNTWK5CVKTDXUYH45A/action/replication_record"}},"created_at":"2026-07-05T05:20:10.874706+00:00","updated_at":"2026-07-05T05:20:10.874706+00:00"}