{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WJXNSYUYKE7LMSWIB57TQPPVIK","short_pith_number":"pith:WJXNSYUY","canonical_record":{"source":{"id":"1011.0688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-02T18:01:15Z","cross_cats_sorted":[],"title_canon_sha256":"ac9f2e58cd959b640b9e23226bc384002fcf96c5f43ef203b6c4f5ec396e330c","abstract_canon_sha256":"4c087428a1853be71853ebbc2919799b24f200551e90766b9b77d6c02525978d"},"schema_version":"1.0"},"canonical_sha256":"b26ed96298513eb64ac80f7f383df542b3a6d91fc3f87b87e3d0589c090fd526","source":{"kind":"arxiv","id":"1011.0688","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0688","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0688v2","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0688","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"WJXNSYUYKE7L","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WJXNSYUYKE7LMSWI","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WJXNSYUY","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WJXNSYUYKE7LMSWIB57TQPPVIK","target":"record","payload":{"canonical_record":{"source":{"id":"1011.0688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-02T18:01:15Z","cross_cats_sorted":[],"title_canon_sha256":"ac9f2e58cd959b640b9e23226bc384002fcf96c5f43ef203b6c4f5ec396e330c","abstract_canon_sha256":"4c087428a1853be71853ebbc2919799b24f200551e90766b9b77d6c02525978d"},"schema_version":"1.0"},"canonical_sha256":"b26ed96298513eb64ac80f7f383df542b3a6d91fc3f87b87e3d0589c090fd526","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.132385Z","signature_b64":"SZ4QZk+Ai0kD33L3BZAsoTNLZ/mNGua/axqjyIKTS9WOknQex7JxOfZvKRwSVUBq3vRrNbB3zbsqCwUBzrusDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b26ed96298513eb64ac80f7f383df542b3a6d91fc3f87b87e3d0589c090fd526","last_reissued_at":"2026-05-17T23:51:24.131789Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.131789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.0688","source_version":2,"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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37CWp3kt7YN4MT1otiICQkzsbMfcykxAXimgCssTU7XytOakDnX6LO1ZkhLyhaFA2i5qXc0WvzWxuP+hLzaeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:38:03.200302Z"},"content_sha256":"56d12b74def4503c543a2b6eb6205d1bfdaea98e26b450fe1e35ab050bb46d50","schema_version":"1.0","event_id":"sha256:56d12b74def4503c543a2b6eb6205d1bfdaea98e26b450fe1e35ab050bb46d50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WJXNSYUYKE7LMSWIB57TQPPVIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Timed Parity Games: Complexity and Robustness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu","submitted_at":"2010-11-02T18:01:15Z","abstract_excerpt":"We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \\emph{concurrent} in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to \\emph{turn-based} (i.e., not concurrent) \\emph{finite-st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0688","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":""},"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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Xf+kH/zRYkyRTgfUJs3HaNkYGScqZ5LgOWSIzzWPYvxh6ui7Wai6evsxT8st0mpzfsEC9tKdAg87Jwgat83Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:38:03.200975Z"},"content_sha256":"85bcd966dde83b15dc6865abe7f6ab4bbfc88ccb7254b714adedf82ea93e87ee","schema_version":"1.0","event_id":"sha256:85bcd966dde83b15dc6865abe7f6ab4bbfc88ccb7254b714adedf82ea93e87ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/bundle.json","state_url":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/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-26T07:38:03Z","links":{"resolver":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK","bundle":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/bundle.json","state":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WJXNSYUYKE7LMSWIB57TQPPVIK","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":"4c087428a1853be71853ebbc2919799b24f200551e90766b9b77d6c02525978d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-02T18:01:15Z","title_canon_sha256":"ac9f2e58cd959b640b9e23226bc384002fcf96c5f43ef203b6c4f5ec396e330c"},"schema_version":"1.0","source":{"id":"1011.0688","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0688","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0688v2","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0688","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"WJXNSYUYKE7L","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WJXNSYUYKE7LMSWI","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WJXNSYUY","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:85bcd966dde83b15dc6865abe7f6ab4bbfc88ccb7254b714adedf82ea93e87ee","target":"graph","created_at":"2026-05-17T23:51: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":"We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \\emph{concurrent} in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to \\emph{turn-based} (i.e., not concurrent) \\emph{finite-st","authors_text":"Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-02T18:01:15Z","title":"Timed Parity Games: Complexity and Robustness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0688","kind":"arxiv","version":2},"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:56d12b74def4503c543a2b6eb6205d1bfdaea98e26b450fe1e35ab050bb46d50","target":"record","created_at":"2026-05-17T23:51: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":"4c087428a1853be71853ebbc2919799b24f200551e90766b9b77d6c02525978d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-02T18:01:15Z","title_canon_sha256":"ac9f2e58cd959b640b9e23226bc384002fcf96c5f43ef203b6c4f5ec396e330c"},"schema_version":"1.0","source":{"id":"1011.0688","kind":"arxiv","version":2}},"canonical_sha256":"b26ed96298513eb64ac80f7f383df542b3a6d91fc3f87b87e3d0589c090fd526","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b26ed96298513eb64ac80f7f383df542b3a6d91fc3f87b87e3d0589c090fd526","first_computed_at":"2026-05-17T23:51:24.131789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:24.131789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SZ4QZk+Ai0kD33L3BZAsoTNLZ/mNGua/axqjyIKTS9WOknQex7JxOfZvKRwSVUBq3vRrNbB3zbsqCwUBzrusDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:24.132385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0688","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56d12b74def4503c543a2b6eb6205d1bfdaea98e26b450fe1e35ab050bb46d50","sha256:85bcd966dde83b15dc6865abe7f6ab4bbfc88ccb7254b714adedf82ea93e87ee"],"state_sha256":"c7b999de298fed5567fa58b4e3bed4d072cba7e80c553f2f212c5d758f0e09f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+K6o6wGI96h0NP77jciOt1ZImIOsI3Qyr2tJDEB3XMZabtZwDwLeg8LhQjdIQuQjc7d1frYtJW9g9UJpb/wIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:38:03.204053Z","bundle_sha256":"1490baf0c6183dfb5c69658c50f6f6d34c30fbe134bab4975de487a05806bdef"}}