{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7RE4E5OGNRL7VTDXY6TNEY37OD","short_pith_number":"pith:7RE4E5OG","canonical_record":{"source":{"id":"1304.1682","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-05T11:23:42Z","cross_cats_sorted":[],"title_canon_sha256":"9a1e0f156da980c098c5895d48afa02300a00dee078e0439f804a1933dc5ed63","abstract_canon_sha256":"2ece917c73b44072193028cf12e97b56b23f4a4d09caf1d23b5e5a4911ab6afe"},"schema_version":"1.0"},"canonical_sha256":"fc49c275c66c57facc77c7a6d2637f70e0248ea64cffa40d84aff04beb0a0298","source":{"kind":"arxiv","id":"1304.1682","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1682","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1682v3","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1682","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"7RE4E5OGNRL7","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7RE4E5OGNRL7VTDX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7RE4E5OG","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7RE4E5OGNRL7VTDXY6TNEY37OD","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1682","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-05T11:23:42Z","cross_cats_sorted":[],"title_canon_sha256":"9a1e0f156da980c098c5895d48afa02300a00dee078e0439f804a1933dc5ed63","abstract_canon_sha256":"2ece917c73b44072193028cf12e97b56b23f4a4d09caf1d23b5e5a4911ab6afe"},"schema_version":"1.0"},"canonical_sha256":"fc49c275c66c57facc77c7a6d2637f70e0248ea64cffa40d84aff04beb0a0298","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:24.371023Z","signature_b64":"nDqnnLRTaZ5Ac7IJYdm7zGkUfdBSIaVoMgXqiH9NU9tJP7tznlnd/AiHjkj89gLa/wB4dUMNLLc1whYVc14kBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc49c275c66c57facc77c7a6d2637f70e0248ea64cffa40d84aff04beb0a0298","last_reissued_at":"2026-05-18T03:01:24.370415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:24.370415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1682","source_version":3,"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-18T03:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYsqCVCrvYmvo0FYQPd9cE0oiVRzvooYCcOjNsU2tzJgyQXK3gwUFKcRFov8OH9HNow1Yjy3InDN1DB55gGrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:03:54.002727Z"},"content_sha256":"c4fb234f64f6ae3825b1418f07996646f73a3159608ddb0cdacfa4143f6c1390","schema_version":"1.0","event_id":"sha256:c4fb234f64f6ae3825b1418f07996646f73a3159608ddb0cdacfa4143f6c1390"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7RE4E5OGNRL7VTDXY6TNEY37OD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Admissibility in Omega-Regular Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jean-Fran\\c{c}ois Raskin, Mathieu Sassolas, Romain Brenguier","submitted_at":"2013-04-05T11:23:42Z","abstract_excerpt":"Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games played on graphs with omega-regular objectives. In this paper, we study the algorithmic properties of this concept for such games. We settle the exact complexity of natural decision problems on the set of strategies that survive iterated elimination of dominated strategies. As a byproduct of our construction, we obtain automata which recognize all the possi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1682","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":""},"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-18T03:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"seAWIcsv5RseQGhRnpWafjeb+HWpI5oq5c/xHAjgQTz6mUUUoQWzmwbUwywdT5xESD4pDimkkTN0xWzr//ayAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:03:54.003297Z"},"content_sha256":"22f7c5a64905186fd213abee5587d8582ad203bca1377f111a3171eb06a7a13a","schema_version":"1.0","event_id":"sha256:22f7c5a64905186fd213abee5587d8582ad203bca1377f111a3171eb06a7a13a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RE4E5OGNRL7VTDXY6TNEY37OD/bundle.json","state_url":"https://pith.science/pith/7RE4E5OGNRL7VTDXY6TNEY37OD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RE4E5OGNRL7VTDXY6TNEY37OD/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-28T00:03:54Z","links":{"resolver":"https://pith.science/pith/7RE4E5OGNRL7VTDXY6TNEY37OD","bundle":"https://pith.science/pith/7RE4E5OGNRL7VTDXY6TNEY37OD/bundle.json","state":"https://pith.science/pith/7RE4E5OGNRL7VTDXY6TNEY37OD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RE4E5OGNRL7VTDXY6TNEY37OD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7RE4E5OGNRL7VTDXY6TNEY37OD","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":"2ece917c73b44072193028cf12e97b56b23f4a4d09caf1d23b5e5a4911ab6afe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-05T11:23:42Z","title_canon_sha256":"9a1e0f156da980c098c5895d48afa02300a00dee078e0439f804a1933dc5ed63"},"schema_version":"1.0","source":{"id":"1304.1682","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1682","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1682v3","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1682","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"7RE4E5OGNRL7","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7RE4E5OGNRL7VTDX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7RE4E5OG","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:22f7c5a64905186fd213abee5587d8582ad203bca1377f111a3171eb06a7a13a","target":"graph","created_at":"2026-05-18T03:01:24Z","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":"Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games played on graphs with omega-regular objectives. In this paper, we study the algorithmic properties of this concept for such games. We settle the exact complexity of natural decision problems on the set of strategies that survive iterated elimination of dominated strategies. As a byproduct of our construction, we obtain automata which recognize all the possi","authors_text":"Jean-Fran\\c{c}ois Raskin, Mathieu Sassolas, Romain Brenguier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-05T11:23:42Z","title":"The Complexity of Admissibility in Omega-Regular Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1682","kind":"arxiv","version":3},"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:c4fb234f64f6ae3825b1418f07996646f73a3159608ddb0cdacfa4143f6c1390","target":"record","created_at":"2026-05-18T03:01:24Z","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":"2ece917c73b44072193028cf12e97b56b23f4a4d09caf1d23b5e5a4911ab6afe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-05T11:23:42Z","title_canon_sha256":"9a1e0f156da980c098c5895d48afa02300a00dee078e0439f804a1933dc5ed63"},"schema_version":"1.0","source":{"id":"1304.1682","kind":"arxiv","version":3}},"canonical_sha256":"fc49c275c66c57facc77c7a6d2637f70e0248ea64cffa40d84aff04beb0a0298","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc49c275c66c57facc77c7a6d2637f70e0248ea64cffa40d84aff04beb0a0298","first_computed_at":"2026-05-18T03:01:24.370415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:24.370415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nDqnnLRTaZ5Ac7IJYdm7zGkUfdBSIaVoMgXqiH9NU9tJP7tznlnd/AiHjkj89gLa/wB4dUMNLLc1whYVc14kBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:24.371023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1682","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4fb234f64f6ae3825b1418f07996646f73a3159608ddb0cdacfa4143f6c1390","sha256:22f7c5a64905186fd213abee5587d8582ad203bca1377f111a3171eb06a7a13a"],"state_sha256":"1d9422b9bbbff86db6cc5905400275759108432b532bbfb15e9e2ce20661a2a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kgh0JIOLy9IyljwTzSDVzRFPNT0EdhiWa7y+epbqFG3x8Ty0OrkdPE4WICj2VsoDEpwwAFaApcUbrFahCY8CCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:03:54.006930Z","bundle_sha256":"158b362b91a763df0049bad8edb1c25a31f82c500efe270d8d2b5c7d2cbb5902"}}