{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:T22E7MAVQ3BK5CXIW5F3CZTXKF","short_pith_number":"pith:T22E7MAV","canonical_record":{"source":{"id":"1109.6220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T14:24:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4af552dd92661af64efef79c06be5e87e47e5152cdd5948547a45c58a1dc016e","abstract_canon_sha256":"8b1a6701f2677a8238229b1853928e641cb5a23189dbbb20265b2c7be2d0faf6"},"schema_version":"1.0"},"canonical_sha256":"9eb44fb01586c2ae8ae8b74bb1667751738587864020ecd17d2259fb8b544e46","source":{"kind":"arxiv","id":"1109.6220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6220","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6220v1","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6220","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"T22E7MAVQ3BK","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T22E7MAVQ3BK5CXI","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T22E7MAV","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:T22E7MAVQ3BK5CXIW5F3CZTXKF","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T14:24:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4af552dd92661af64efef79c06be5e87e47e5152cdd5948547a45c58a1dc016e","abstract_canon_sha256":"8b1a6701f2677a8238229b1853928e641cb5a23189dbbb20265b2c7be2d0faf6"},"schema_version":"1.0"},"canonical_sha256":"9eb44fb01586c2ae8ae8b74bb1667751738587864020ecd17d2259fb8b544e46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:09.542558Z","signature_b64":"jwSo0u94JXHzrC6oyVbHJ61IYMbG5YTYw7eMTmMVhuLH2fLuG/Gsn5N3yT0mQUYCS9ujClRjanB+ag/XymAgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eb44fb01586c2ae8ae8b74bb1667751738587864020ecd17d2259fb8b544e46","last_reissued_at":"2026-05-18T04:12:09.542075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:09.542075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6220","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmbetbBvk7GA1jIRjhjW3WKMyx2uVMYRESlx3x2KQEVQCDKkujeM6YS+ckRXiM75vc0sgmFm6gP71Jf5rlp7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:35:30.070702Z"},"content_sha256":"229e8be08aecb8a49858fc74229cd7348d28c6249db46db14c5cc1b03cc09e00","schema_version":"1.0","event_id":"sha256:229e8be08aecb8a49858fc74229cd7348d28c6249db46db14c5cc1b03cc09e00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:T22E7MAVQ3BK5CXIW5F3CZTXKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Nash Equilibria in Limit-Average Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Dominik Wojtczak, Michael Ummels","submitted_at":"2011-09-28T14:24:00Z","abstract_excerpt":"We study the computational complexity of Nash equilibria in concurrent games with limit-average objectives. In particular, we prove that the existence of a Nash equilibrium in randomised strategies is undecidable, while the existence of a Nash equilibrium in pure strategies is decidable, even if we put a constraint on the payoff of the equilibrium. Our undecidability result holds even for a restricted class of concurrent games, where nonzero rewards occur only on terminal states. Moreover, we show that the constrained existence problem is undecidable not only for concurrent games but for turn-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6220","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBuLe3qMzFpojqsDlxbBZC9kdFx2GMBo8S3sOF5msIpxt0vQJLycDOXgftQwBSOQNaKbTFJUsSD55ghGLNtbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:35:30.071402Z"},"content_sha256":"558d0f108838a0b945dd9836fc28fea6055710936a413eb5f02760e8957ba666","schema_version":"1.0","event_id":"sha256:558d0f108838a0b945dd9836fc28fea6055710936a413eb5f02760e8957ba666"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T22E7MAVQ3BK5CXIW5F3CZTXKF/bundle.json","state_url":"https://pith.science/pith/T22E7MAVQ3BK5CXIW5F3CZTXKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T22E7MAVQ3BK5CXIW5F3CZTXKF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T14:35:30Z","links":{"resolver":"https://pith.science/pith/T22E7MAVQ3BK5CXIW5F3CZTXKF","bundle":"https://pith.science/pith/T22E7MAVQ3BK5CXIW5F3CZTXKF/bundle.json","state":"https://pith.science/pith/T22E7MAVQ3BK5CXIW5F3CZTXKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T22E7MAVQ3BK5CXIW5F3CZTXKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:T22E7MAVQ3BK5CXIW5F3CZTXKF","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":"8b1a6701f2677a8238229b1853928e641cb5a23189dbbb20265b2c7be2d0faf6","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T14:24:00Z","title_canon_sha256":"4af552dd92661af64efef79c06be5e87e47e5152cdd5948547a45c58a1dc016e"},"schema_version":"1.0","source":{"id":"1109.6220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6220","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6220v1","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6220","created_at":"2026-05-18T04:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"T22E7MAVQ3BK","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T22E7MAVQ3BK5CXI","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T22E7MAV","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:558d0f108838a0b945dd9836fc28fea6055710936a413eb5f02760e8957ba666","target":"graph","created_at":"2026-05-18T04:12:09Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the computational complexity of Nash equilibria in concurrent games with limit-average objectives. In particular, we prove that the existence of a Nash equilibrium in randomised strategies is undecidable, while the existence of a Nash equilibrium in pure strategies is decidable, even if we put a constraint on the payoff of the equilibrium. Our undecidability result holds even for a restricted class of concurrent games, where nonzero rewards occur only on terminal states. Moreover, we show that the constrained existence problem is undecidable not only for concurrent games but for turn-","authors_text":"Dominik Wojtczak, Michael Ummels","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T14:24:00Z","title":"The Complexity of Nash Equilibria in Limit-Average Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6220","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:229e8be08aecb8a49858fc74229cd7348d28c6249db46db14c5cc1b03cc09e00","target":"record","created_at":"2026-05-18T04:12:09Z","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":"8b1a6701f2677a8238229b1853928e641cb5a23189dbbb20265b2c7be2d0faf6","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T14:24:00Z","title_canon_sha256":"4af552dd92661af64efef79c06be5e87e47e5152cdd5948547a45c58a1dc016e"},"schema_version":"1.0","source":{"id":"1109.6220","kind":"arxiv","version":1}},"canonical_sha256":"9eb44fb01586c2ae8ae8b74bb1667751738587864020ecd17d2259fb8b544e46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eb44fb01586c2ae8ae8b74bb1667751738587864020ecd17d2259fb8b544e46","first_computed_at":"2026-05-18T04:12:09.542075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:09.542075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jwSo0u94JXHzrC6oyVbHJ61IYMbG5YTYw7eMTmMVhuLH2fLuG/Gsn5N3yT0mQUYCS9ujClRjanB+ag/XymAgDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:09.542558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:229e8be08aecb8a49858fc74229cd7348d28c6249db46db14c5cc1b03cc09e00","sha256:558d0f108838a0b945dd9836fc28fea6055710936a413eb5f02760e8957ba666"],"state_sha256":"092832cbd228bf82bc6cda367302aa38aa02f37f1ab861c9b5ffa304c2056124"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jp0l2b9NonLNPsAMLQAjBLsuBpMNzg5awAgbVf4m7CC1s2faSVXu2iHuIDZJ5CLaxqoje1Tr2julKSvO/T46Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:35:30.075230Z","bundle_sha256":"06e773b1a04638cd512ede5a5a5eb2c8a503c54beeb767565861d18f14fc266f"}}