{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RV4OLAL72DDIGJM2PELBO4ZRBP","short_pith_number":"pith:RV4OLAL7","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"},"canonical_sha256":"8d78e5817fd0c683259a79161773310bec4493d8352a14c4958f66e924fc3d94","source":{"kind":"arxiv","id":"1412.3701","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3701","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3701v5","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3701","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"pith_short_12","alias_value":"RV4OLAL72DDI","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RV4OLAL72DDIGJM2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RV4OLAL7","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RV4OLAL72DDIGJM2PELBO4ZRBP","target":"record","payload":{"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"},"canonical_sha256":"8d78e5817fd0c683259a79161773310bec4493d8352a14c4958f66e924fc3d94","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"},"source_kind":"arxiv","source_id":"1412.3701","source_version":5,"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-18T00:19:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ep6I+ONwWJmMfRsRcTyhnU+Yoo3D7im1gAQogriCZAOVkzTWBtrRQ/cgerawJgYyVe9BFlT4j7DI2WU4+ZgQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:47:09.889767Z"},"content_sha256":"d66dbe5a9fb43505eebdbe087cdb5b828527fcbf8d163d484041048aa2e60b37","schema_version":"1.0","event_id":"sha256:d66dbe5a9fb43505eebdbe087cdb5b828527fcbf8d163d484041048aa2e60b37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RV4OLAL72DDIGJM2PELBO4ZRBP","target":"graph","payload":{"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"},"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-18T00:19:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkJat/DquZTsyiGvmtmXilE/7QW8x5B/JlCQBAksDy2IyjiefPe+bSwGSX5d5dxY5e7/jySD2bfOYuRCu5kiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:47:09.890115Z"},"content_sha256":"73c028cd175bc1665187d3c726b7ff20c17a9ea53f2142a517a46b120b10d39b","schema_version":"1.0","event_id":"sha256:73c028cd175bc1665187d3c726b7ff20c17a9ea53f2142a517a46b120b10d39b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/bundle.json","state_url":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/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-07-04T22:47:09Z","links":{"resolver":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP","bundle":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/bundle.json","state":"https://pith.science/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RV4OLAL72DDIGJM2PELBO4ZRBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RV4OLAL72DDIGJM2PELBO4ZRBP","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":"928fcc88a226a7edb16e098fddb7c8a4f40fb5f6eac9a84ccc5fc55bf6c38b0f","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-11T16:13:12Z","title_canon_sha256":"9d5183c4340e1c6d69580ac3043a4ef2ceedd64cef3299d180f0f548d66ae0b9"},"schema_version":"1.0","source":{"id":"1412.3701","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3701","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3701v5","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3701","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"pith_short_12","alias_value":"RV4OLAL72DDI","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RV4OLAL72DDIGJM2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RV4OLAL7","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:73c028cd175bc1665187d3c726b7ff20c17a9ea53f2142a517a46b120b10d39b","target":"graph","created_at":"2026-05-18T00:19:49Z","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":"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","authors_text":"Felix Klein (1), Germany), Martin Zimmermann (1) ((1) Reactive Systems Group, Saarland University","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-11T16:13:12Z","title":"How Much Lookahead is Needed to Win Infinite Games?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3701","kind":"arxiv","version":5},"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:d66dbe5a9fb43505eebdbe087cdb5b828527fcbf8d163d484041048aa2e60b37","target":"record","created_at":"2026-05-18T00:19:49Z","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":"928fcc88a226a7edb16e098fddb7c8a4f40fb5f6eac9a84ccc5fc55bf6c38b0f","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-11T16:13:12Z","title_canon_sha256":"9d5183c4340e1c6d69580ac3043a4ef2ceedd64cef3299d180f0f548d66ae0b9"},"schema_version":"1.0","source":{"id":"1412.3701","kind":"arxiv","version":5}},"canonical_sha256":"8d78e5817fd0c683259a79161773310bec4493d8352a14c4958f66e924fc3d94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d78e5817fd0c683259a79161773310bec4493d8352a14c4958f66e924fc3d94","first_computed_at":"2026-05-18T00:19:49.354842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:49.354842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3tJ+mLjfMrastwRk5vGAXdamYrKVwl7gYK6bOHJK2Qm5/4G1SGwqQeVspbgHM/zJqz1J5Z0p7p08dSgoC0xICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:49.355522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3701","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d66dbe5a9fb43505eebdbe087cdb5b828527fcbf8d163d484041048aa2e60b37","sha256:73c028cd175bc1665187d3c726b7ff20c17a9ea53f2142a517a46b120b10d39b"],"state_sha256":"ba94c92f655002d9fb679859f4e5fb9b7a94ed656449032965afd1ea9b7be49b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXysI0wQ3nTcGhZv8bx77ZcENf4LVIEiKv8y1DEVJh3zKdMhkELZu67nJGQnq3zarDjJqDMhOGa6b3l9O052Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T22:47:09.892101Z","bundle_sha256":"cfea62ed12b31c62b71a047453637c1a0fbd1b7a6285638b3fccbab439dfd101"}}