{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5KM6CTMLQSKIHSQTJ6OJ2NJAXP","short_pith_number":"pith:5KM6CTML","schema_version":"1.0","canonical_sha256":"ea99e14d8b849483ca134f9c9d3520bbef81e49c3123dd30688fcc6b56f4eb79","source":{"kind":"arxiv","id":"1410.4448","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Parity Games on Lossy Channel Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Lorenzo Clemente, Parosh Aziz Abdulla, Richard Mayr, Sven Sandberg","submitted_at":"2014-10-15T14:20:00Z","abstract_excerpt":"We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies. First, we describe a general framework, where we consider the class of 2 1/2-player games with almost-sure parity winning conditions on possibly infinite game graphs, assuming that the game contains a {\\it finite attractor}. An attractor is a set of states (not necessarily absorbing) that is almost surely re-visited regardless of the players' decisions. We present a scheme that characteriz"},"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":"1410.4448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-15T14:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"558d07ec1fcadff1955486c2100fb58a1f4c431606b01f9bad07c71fd17f6399","abstract_canon_sha256":"3ef1a4f5addf07cbef82f857b3431b55e80587e43d73324e2c899d0747bc6363"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:23.981217Z","signature_b64":"xHsjMyiNSPyOHyg78x08JugfTN/KmS3F/DjgYDC6NHm8MlDQXCe9MybYp/KCs4fsxWBawJwhLwnS2N723UEvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea99e14d8b849483ca134f9c9d3520bbef81e49c3123dd30688fcc6b56f4eb79","last_reissued_at":"2026-05-17T23:51:23.980618Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:23.980618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Parity Games on Lossy Channel Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Lorenzo Clemente, Parosh Aziz Abdulla, Richard Mayr, Sven Sandberg","submitted_at":"2014-10-15T14:20:00Z","abstract_excerpt":"We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies. First, we describe a general framework, where we consider the class of 2 1/2-player games with almost-sure parity winning conditions on possibly infinite game graphs, assuming that the game contains a {\\it finite attractor}. An attractor is a set of states (not necessarily absorbing) that is almost surely re-visited regardless of the players' decisions. We present a scheme that characteriz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4448","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":"1410.4448","created_at":"2026-05-17T23:51:23.980688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4448v2","created_at":"2026-05-17T23:51:23.980688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4448","created_at":"2026-05-17T23:51:23.980688+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KM6CTMLQSKI","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KM6CTMLQSKIHSQT","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KM6CTML","created_at":"2026-05-18T12:28:14.216126+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/5KM6CTMLQSKIHSQTJ6OJ2NJAXP","json":"https://pith.science/pith/5KM6CTMLQSKIHSQTJ6OJ2NJAXP.json","graph_json":"https://pith.science/api/pith-number/5KM6CTMLQSKIHSQTJ6OJ2NJAXP/graph.json","events_json":"https://pith.science/api/pith-number/5KM6CTMLQSKIHSQTJ6OJ2NJAXP/events.json","paper":"https://pith.science/paper/5KM6CTML"},"agent_actions":{"view_html":"https://pith.science/pith/5KM6CTMLQSKIHSQTJ6OJ2NJAXP","download_json":"https://pith.science/pith/5KM6CTMLQSKIHSQTJ6OJ2NJAXP.json","view_paper":"https://pith.science/paper/5KM6CTML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4448&json=true","fetch_graph":"https://pith.science/api/pith-number/5KM6CTMLQSKIHSQTJ6OJ2NJAXP/graph.json","fetch_events":"https://pith.science/api/pith-number/5KM6CTMLQSKIHSQTJ6OJ2NJAXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KM6CTMLQSKIHSQTJ6OJ2NJAXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KM6CTMLQSKIHSQTJ6OJ2NJAXP/action/storage_attestation","attest_author":"https://pith.science/pith/5KM6CTMLQSKIHSQTJ6OJ2NJAXP/action/author_attestation","sign_citation":"https://pith.science/pith/5KM6CTMLQSKIHSQTJ6OJ2NJAXP/action/citation_signature","submit_replication":"https://pith.science/pith/5KM6CTMLQSKIHSQTJ6OJ2NJAXP/action/replication_record"}},"created_at":"2026-05-17T23:51:23.980688+00:00","updated_at":"2026-05-17T23:51:23.980688+00:00"}