{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FSGDHSVLB7TDFIXIYHHZJDNXJW","short_pith_number":"pith:FSGDHSVL","schema_version":"1.0","canonical_sha256":"2c8c33caab0fe632a2e8c1cf948db74d98f8c5793722049b2e1b892db24c4ffb","source":{"kind":"arxiv","id":"1401.3289","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Laurent Doyen, Moshe Y. Vardi, Sumit Nain","submitted_at":"2014-01-14T19:14:27Z","abstract_excerpt":"We consider two-player partial-observation stochastic games on finite-state graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are \\omega-regular conditions specified as parity objectives. The qualitative-analysis problem given a partial-observation stochastic game and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability~1 (resp. positive probability). These qualtitative-analysis problems are known to be undecidable. However in many applications the relevant question is the"},"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":"1401.3289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-14T19:14:27Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"8a04bc1e2ebe667aefb7fa83b2d349069adcd4f190f8e36f326868fd8c95fa72","abstract_canon_sha256":"6990f558b01559d54ce41b46301563836d8a54f79d6e05064c2ab0c38c57e079"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:18.953533Z","signature_b64":"xYXn+KyBRpD+GLCVCWbUDA8U8m5MyHPPIOgaDEAB8gdhw2JVvRv+Q2DwduZYU18lqMARN7Mk0q734PtBIOsUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c8c33caab0fe632a2e8c1cf948db74d98f8c5793722049b2e1b892db24c4ffb","last_reissued_at":"2026-05-18T03:02:18.952590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:18.952590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Laurent Doyen, Moshe Y. Vardi, Sumit Nain","submitted_at":"2014-01-14T19:14:27Z","abstract_excerpt":"We consider two-player partial-observation stochastic games on finite-state graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are \\omega-regular conditions specified as parity objectives. The qualitative-analysis problem given a partial-observation stochastic game and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability~1 (resp. positive probability). These qualtitative-analysis problems are known to be undecidable. However in many applications the relevant question is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3289","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":"1401.3289","created_at":"2026-05-18T03:02:18.952744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3289v1","created_at":"2026-05-18T03:02:18.952744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3289","created_at":"2026-05-18T03:02:18.952744+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSGDHSVLB7TD","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSGDHSVLB7TDFIXI","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSGDHSVL","created_at":"2026-05-18T12:28:28.263976+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/FSGDHSVLB7TDFIXIYHHZJDNXJW","json":"https://pith.science/pith/FSGDHSVLB7TDFIXIYHHZJDNXJW.json","graph_json":"https://pith.science/api/pith-number/FSGDHSVLB7TDFIXIYHHZJDNXJW/graph.json","events_json":"https://pith.science/api/pith-number/FSGDHSVLB7TDFIXIYHHZJDNXJW/events.json","paper":"https://pith.science/paper/FSGDHSVL"},"agent_actions":{"view_html":"https://pith.science/pith/FSGDHSVLB7TDFIXIYHHZJDNXJW","download_json":"https://pith.science/pith/FSGDHSVLB7TDFIXIYHHZJDNXJW.json","view_paper":"https://pith.science/paper/FSGDHSVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3289&json=true","fetch_graph":"https://pith.science/api/pith-number/FSGDHSVLB7TDFIXIYHHZJDNXJW/graph.json","fetch_events":"https://pith.science/api/pith-number/FSGDHSVLB7TDFIXIYHHZJDNXJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSGDHSVLB7TDFIXIYHHZJDNXJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSGDHSVLB7TDFIXIYHHZJDNXJW/action/storage_attestation","attest_author":"https://pith.science/pith/FSGDHSVLB7TDFIXIYHHZJDNXJW/action/author_attestation","sign_citation":"https://pith.science/pith/FSGDHSVLB7TDFIXIYHHZJDNXJW/action/citation_signature","submit_replication":"https://pith.science/pith/FSGDHSVLB7TDFIXIYHHZJDNXJW/action/replication_record"}},"created_at":"2026-05-18T03:02:18.952744+00:00","updated_at":"2026-05-18T03:02:18.952744+00:00"}