{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SLWABH6XL6FCMHPQKBQQ53KFTM","short_pith_number":"pith:SLWABH6X","schema_version":"1.0","canonical_sha256":"92ec009fd75f8a261df050610eed459b3ec57bd6c2ed90a2a4bea8baac049584","source":{"kind":"arxiv","id":"1106.1232","version":1},"attestation_state":"computed","paper":{"title":"A reduction from parity games to simple stochastic games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee (Institute of Science, Nathana\\\"el Fijalkow (Institute of Science, Technology (IST Austria))","submitted_at":"2011-06-07T01:06:10Z","abstract_excerpt":"Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turn-based or concurrent moves, and deterministic or stochastic transitions.  In this paper, we are interested in turn-based games, and specifically in deterministic parity games and stochastic reachability games (also known as simple stochastic games). We present a simple, direct and efficient reduction"},"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":"1106.1232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-06-07T01:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"bb5c780b759bd82acc3be6d9ab8fdee5295e551aec6cf51fa028deeddfc3cebe","abstract_canon_sha256":"0c1614bf591e40dc23baea1b96df4199b4ef013ccd178b6eb43d44194f141615"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:24.253737Z","signature_b64":"++pCbZLogpQmw+/u4knKRROXwX7Z270UR4OsG0YdT/HCBniVjypt8+95K78Vq2ex7/AsHDqIcgKJNpnfAANxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92ec009fd75f8a261df050610eed459b3ec57bd6c2ed90a2a4bea8baac049584","last_reissued_at":"2026-05-18T04:20:24.253031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:24.253031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A reduction from parity games to simple stochastic games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee (Institute of Science, Nathana\\\"el Fijalkow (Institute of Science, Technology (IST Austria))","submitted_at":"2011-06-07T01:06:10Z","abstract_excerpt":"Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turn-based or concurrent moves, and deterministic or stochastic transitions.  In this paper, we are interested in turn-based games, and specifically in deterministic parity games and stochastic reachability games (also known as simple stochastic games). We present a simple, direct and efficient reduction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1232","kind":"arxiv","version":1},"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":"1106.1232","created_at":"2026-05-18T04:20:24.253114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1232v1","created_at":"2026-05-18T04:20:24.253114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1232","created_at":"2026-05-18T04:20:24.253114+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLWABH6XL6FC","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLWABH6XL6FCMHPQ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLWABH6X","created_at":"2026-05-18T12:26:41.206345+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/SLWABH6XL6FCMHPQKBQQ53KFTM","json":"https://pith.science/pith/SLWABH6XL6FCMHPQKBQQ53KFTM.json","graph_json":"https://pith.science/api/pith-number/SLWABH6XL6FCMHPQKBQQ53KFTM/graph.json","events_json":"https://pith.science/api/pith-number/SLWABH6XL6FCMHPQKBQQ53KFTM/events.json","paper":"https://pith.science/paper/SLWABH6X"},"agent_actions":{"view_html":"https://pith.science/pith/SLWABH6XL6FCMHPQKBQQ53KFTM","download_json":"https://pith.science/pith/SLWABH6XL6FCMHPQKBQQ53KFTM.json","view_paper":"https://pith.science/paper/SLWABH6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1232&json=true","fetch_graph":"https://pith.science/api/pith-number/SLWABH6XL6FCMHPQKBQQ53KFTM/graph.json","fetch_events":"https://pith.science/api/pith-number/SLWABH6XL6FCMHPQKBQQ53KFTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLWABH6XL6FCMHPQKBQQ53KFTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLWABH6XL6FCMHPQKBQQ53KFTM/action/storage_attestation","attest_author":"https://pith.science/pith/SLWABH6XL6FCMHPQKBQQ53KFTM/action/author_attestation","sign_citation":"https://pith.science/pith/SLWABH6XL6FCMHPQKBQQ53KFTM/action/citation_signature","submit_replication":"https://pith.science/pith/SLWABH6XL6FCMHPQKBQQ53KFTM/action/replication_record"}},"created_at":"2026-05-18T04:20:24.253114+00:00","updated_at":"2026-05-18T04:20:24.253114+00:00"}