{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RV4OLAL72DDIGJM2PELBO4ZRBP","short_pith_number":"pith:RV4OLAL7","schema_version":"1.0","canonical_sha256":"8d78e5817fd0c683259a79161773310bec4493d8352a14c4958f66e924fc3d94","source":{"kind":"arxiv","id":"1412.3701","version":5},"attestation_state":"computed","paper":{"title":"How Much Lookahead is Needed to Win Infinite Games?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.GT","authors_text":"Felix Klein (1), Germany), Martin Zimmermann (1) ((1) Reactive Systems Group, Saarland University","submitted_at":"2014-12-11T16:13:12Z","abstract_excerpt":"Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent's moves. For $\\omega$-regular winning conditions it is known that such games can be solved in doubly-exponential time and that doubly-exponential lookahead is sufficient.\n  We improve upon both results by giving an exponential time algorithm and an exponential upper bound on the necessary lookahead. This is complemented by showing EXPTIME-hardness of the solution problem and tight exponential lower bounds on the lookahead. Both lower bounds already hold for safety"},"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":"1412.3701","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-11T16:13:12Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"9d5183c4340e1c6d69580ac3043a4ef2ceedd64cef3299d180f0f548d66ae0b9","abstract_canon_sha256":"928fcc88a226a7edb16e098fddb7c8a4f40fb5f6eac9a84ccc5fc55bf6c38b0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:49.355522Z","signature_b64":"3tJ+mLjfMrastwRk5vGAXdamYrKVwl7gYK6bOHJK2Qm5/4G1SGwqQeVspbgHM/zJqz1J5Z0p7p08dSgoC0xICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d78e5817fd0c683259a79161773310bec4493d8352a14c4958f66e924fc3d94","last_reissued_at":"2026-05-18T00:19:49.354842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:49.354842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Much Lookahead is Needed to Win Infinite Games?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.GT","authors_text":"Felix Klein (1), Germany), Martin Zimmermann (1) ((1) Reactive Systems Group, Saarland University","submitted_at":"2014-12-11T16:13:12Z","abstract_excerpt":"Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent's moves. For $\\omega$-regular winning conditions it is known that such games can be solved in doubly-exponential time and that doubly-exponential lookahead is sufficient.\n  We improve upon both results by giving an exponential time algorithm and an exponential upper bound on the necessary lookahead. This is complemented by showing EXPTIME-hardness of the solution problem and tight exponential lower bounds on the lookahead. Both lower bounds already hold for safety"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3701","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.3701","created_at":"2026-05-18T00:19:49.354941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3701v5","created_at":"2026-05-18T00:19:49.354941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3701","created_at":"2026-05-18T00:19:49.354941+00:00"},{"alias_kind":"pith_short_12","alias_value":"RV4OLAL72DDI","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RV4OLAL72DDIGJM2","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RV4OLAL7","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP","json":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP.json","graph_json":"https://pith.science/api/pith-number/RV4OLAL72DDIGJM2PELBO4ZRBP/graph.json","events_json":"https://pith.science/api/pith-number/RV4OLAL72DDIGJM2PELBO4ZRBP/events.json","paper":"https://pith.science/paper/RV4OLAL7"},"agent_actions":{"view_html":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP","download_json":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP.json","view_paper":"https://pith.science/paper/RV4OLAL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3701&json=true","fetch_graph":"https://pith.science/api/pith-number/RV4OLAL72DDIGJM2PELBO4ZRBP/graph.json","fetch_events":"https://pith.science/api/pith-number/RV4OLAL72DDIGJM2PELBO4ZRBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/action/storage_attestation","attest_author":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/action/author_attestation","sign_citation":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/action/citation_signature","submit_replication":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/action/replication_record"}},"created_at":"2026-05-18T00:19:49.354941+00:00","updated_at":"2026-05-18T00:19:49.354941+00:00"}