{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YPMAD2I4ZQTBQBNNHZKXVTXNAV","short_pith_number":"pith:YPMAD2I4","schema_version":"1.0","canonical_sha256":"c3d801e91ccc261805ad3e557aceed054b5e7c04187e38299b70126679302df0","source":{"kind":"arxiv","id":"1107.2146","version":4},"attestation_state":"computed","paper":{"title":"Bounded Rationality in Concurrent Parity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee","submitted_at":"2011-07-11T21:03:13Z","abstract_excerpt":"We consider 2-player games played on a finite state space for infinite rounds. The games are concurrent: in each round, the two players choose their moves simultaneously; the current state and the moves determine the successor. We consider omega-regular winning conditions given as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require"},"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":"1107.2146","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-11T21:03:13Z","cross_cats_sorted":[],"title_canon_sha256":"c37a695c1588105978ecb130a4cd6c6b46ec82cfd019b57327a627654fed4d11","abstract_canon_sha256":"5f74d5908ae4a2c36212c0752e2bb34187a5486dee327991335b61915512b369"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:33.116718Z","signature_b64":"HFeZUN7L5wA4Y0FOkqsCuGYuSt1xHy+1UxaImHovwSswSazxRtM9c5TDvFkiKpj8wUVcY91jES2svyId+01iAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3d801e91ccc261805ad3e557aceed054b5e7c04187e38299b70126679302df0","last_reissued_at":"2026-05-18T03:20:33.115772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:33.115772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Rationality in Concurrent Parity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee","submitted_at":"2011-07-11T21:03:13Z","abstract_excerpt":"We consider 2-player games played on a finite state space for infinite rounds. The games are concurrent: in each round, the two players choose their moves simultaneously; the current state and the moves determine the successor. We consider omega-regular winning conditions given as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2146","kind":"arxiv","version":4},"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":"1107.2146","created_at":"2026-05-18T03:20:33.115913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2146v4","created_at":"2026-05-18T03:20:33.115913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2146","created_at":"2026-05-18T03:20:33.115913+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPMAD2I4ZQTB","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPMAD2I4ZQTBQBNN","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPMAD2I4","created_at":"2026-05-18T12:26:47.523578+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/YPMAD2I4ZQTBQBNNHZKXVTXNAV","json":"https://pith.science/pith/YPMAD2I4ZQTBQBNNHZKXVTXNAV.json","graph_json":"https://pith.science/api/pith-number/YPMAD2I4ZQTBQBNNHZKXVTXNAV/graph.json","events_json":"https://pith.science/api/pith-number/YPMAD2I4ZQTBQBNNHZKXVTXNAV/events.json","paper":"https://pith.science/paper/YPMAD2I4"},"agent_actions":{"view_html":"https://pith.science/pith/YPMAD2I4ZQTBQBNNHZKXVTXNAV","download_json":"https://pith.science/pith/YPMAD2I4ZQTBQBNNHZKXVTXNAV.json","view_paper":"https://pith.science/paper/YPMAD2I4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2146&json=true","fetch_graph":"https://pith.science/api/pith-number/YPMAD2I4ZQTBQBNNHZKXVTXNAV/graph.json","fetch_events":"https://pith.science/api/pith-number/YPMAD2I4ZQTBQBNNHZKXVTXNAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPMAD2I4ZQTBQBNNHZKXVTXNAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPMAD2I4ZQTBQBNNHZKXVTXNAV/action/storage_attestation","attest_author":"https://pith.science/pith/YPMAD2I4ZQTBQBNNHZKXVTXNAV/action/author_attestation","sign_citation":"https://pith.science/pith/YPMAD2I4ZQTBQBNNHZKXVTXNAV/action/citation_signature","submit_replication":"https://pith.science/pith/YPMAD2I4ZQTBQBNNHZKXVTXNAV/action/replication_record"}},"created_at":"2026-05-18T03:20:33.115913+00:00","updated_at":"2026-05-18T03:20:33.115913+00:00"}