{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WJXNSYUYKE7LMSWIB57TQPPVIK","short_pith_number":"pith:WJXNSYUY","schema_version":"1.0","canonical_sha256":"b26ed96298513eb64ac80f7f383df542b3a6d91fc3f87b87e3d0589c090fd526","source":{"kind":"arxiv","id":"1011.0688","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.0688","created_at":"2026-05-17T23:51:24.131887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0688v2","created_at":"2026-05-17T23:51:24.131887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0688","created_at":"2026-05-17T23:51:24.131887+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJXNSYUYKE7L","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJXNSYUYKE7LMSWI","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJXNSYUY","created_at":"2026-05-18T12:26:15.391820+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/WJXNSYUYKE7LMSWIB57TQPPVIK","json":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK.json","graph_json":"https://pith.science/api/pith-number/WJXNSYUYKE7LMSWIB57TQPPVIK/graph.json","events_json":"https://pith.science/api/pith-number/WJXNSYUYKE7LMSWIB57TQPPVIK/events.json","paper":"https://pith.science/paper/WJXNSYUY"},"agent_actions":{"view_html":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK","download_json":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK.json","view_paper":"https://pith.science/paper/WJXNSYUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0688&json=true","fetch_graph":"https://pith.science/api/pith-number/WJXNSYUYKE7LMSWIB57TQPPVIK/graph.json","fetch_events":"https://pith.science/api/pith-number/WJXNSYUYKE7LMSWIB57TQPPVIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/action/storage_attestation","attest_author":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/action/author_attestation","sign_citation":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/action/citation_signature","submit_replication":"https://pith.science/pith/WJXNSYUYKE7LMSWIB57TQPPVIK/action/replication_record"}},"created_at":"2026-05-17T23:51:24.131887+00:00","updated_at":"2026-05-17T23:51:24.131887+00:00"}