{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RNVIUKLV7HRRCKGSUMM67OOUEP","short_pith_number":"pith:RNVIUKLV","canonical_record":{"source":{"id":"1804.03453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T11:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"1332ea3e552aedbeadfcdcba54ae44fa40bc6bec85be9896c2ff6d9fee73aa3d","abstract_canon_sha256":"97897e076a2048d1780fec47001b1eca5f170f6bb0d466d6e110edb4514a6083"},"schema_version":"1.0"},"canonical_sha256":"8b6a8a2975f9e31128d2a319efb9d423f27e907a151bbfa8a95c2eccbe220864","source":{"kind":"arxiv","id":"1804.03453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03453","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03453v1","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03453","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"RNVIUKLV7HRR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RNVIUKLV7HRRCKGS","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RNVIUKLV","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RNVIUKLV7HRRCKGSUMM67OOUEP","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T11:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"1332ea3e552aedbeadfcdcba54ae44fa40bc6bec85be9896c2ff6d9fee73aa3d","abstract_canon_sha256":"97897e076a2048d1780fec47001b1eca5f170f6bb0d466d6e110edb4514a6083"},"schema_version":"1.0"},"canonical_sha256":"8b6a8a2975f9e31128d2a319efb9d423f27e907a151bbfa8a95c2eccbe220864","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:48.186128Z","signature_b64":"NwjygUz91R1UTPJIJJm1GBR8CF8dXbWXebzqt4EbO0evcfvLlpneLmfpD05ai26VhZmVvgg326mcNyXl9jxEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b6a8a2975f9e31128d2a319efb9d423f27e907a151bbfa8a95c2eccbe220864","last_reissued_at":"2026-05-18T00:18:48.185308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:48.185308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03453","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJpwRn+Uab1mg6AHAU+Z9LpjCdbO8hXFSEVj6p72g/+i7ffZd+6zLMavcSripmVLd+O81K0WUdvU815ldoPsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:44:59.796126Z"},"content_sha256":"a7434b3c56dee57caaf19f26c13cd223cc13c9fef6e588e3817ef3ca783125a0","schema_version":"1.0","event_id":"sha256:a7434b3c56dee57caaf19f26c13cd223cc13c9fef6e588e3817ef3ca783125a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RNVIUKLV7HRRCKGSUMM67OOUEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinations of Qualitative Winning for Stochastic Parity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Nir Piterman","submitted_at":"2018-04-10T11:12:42Z","abstract_excerpt":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths must satisfy the condition, almost-sure winning, which requires the condition is satisfied with probability~1, and limit-sure winning, which requires the condition is satisfied with probability arbitrarily close to~1. We study the combination of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03453","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oL0sagIsLzXkSy3WWltMZVGo2VHou/czJmj6zBtVu4LVigrKT8aRKGJGJI3XIq6NfpF4F3vZDvcvkO1T3oByCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:44:59.796742Z"},"content_sha256":"7f0b31250febe5971ae1871a53f294b46efda8e005d40872e34a2a5b76eff7c7","schema_version":"1.0","event_id":"sha256:7f0b31250febe5971ae1871a53f294b46efda8e005d40872e34a2a5b76eff7c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNVIUKLV7HRRCKGSUMM67OOUEP/bundle.json","state_url":"https://pith.science/pith/RNVIUKLV7HRRCKGSUMM67OOUEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNVIUKLV7HRRCKGSUMM67OOUEP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T14:44:59Z","links":{"resolver":"https://pith.science/pith/RNVIUKLV7HRRCKGSUMM67OOUEP","bundle":"https://pith.science/pith/RNVIUKLV7HRRCKGSUMM67OOUEP/bundle.json","state":"https://pith.science/pith/RNVIUKLV7HRRCKGSUMM67OOUEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNVIUKLV7HRRCKGSUMM67OOUEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RNVIUKLV7HRRCKGSUMM67OOUEP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"97897e076a2048d1780fec47001b1eca5f170f6bb0d466d6e110edb4514a6083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T11:12:42Z","title_canon_sha256":"1332ea3e552aedbeadfcdcba54ae44fa40bc6bec85be9896c2ff6d9fee73aa3d"},"schema_version":"1.0","source":{"id":"1804.03453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03453","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03453v1","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03453","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"RNVIUKLV7HRR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RNVIUKLV7HRRCKGS","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RNVIUKLV","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:7f0b31250febe5971ae1871a53f294b46efda8e005d40872e34a2a5b76eff7c7","target":"graph","created_at":"2026-05-18T00:18:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths must satisfy the condition, almost-sure winning, which requires the condition is satisfied with probability~1, and limit-sure winning, which requires the condition is satisfied with probability arbitrarily close to~1. We study the combination of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied rec","authors_text":"Krishnendu Chatterjee, Nir Piterman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T11:12:42Z","title":"Combinations of Qualitative Winning for Stochastic Parity Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03453","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a7434b3c56dee57caaf19f26c13cd223cc13c9fef6e588e3817ef3ca783125a0","target":"record","created_at":"2026-05-18T00:18:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"97897e076a2048d1780fec47001b1eca5f170f6bb0d466d6e110edb4514a6083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T11:12:42Z","title_canon_sha256":"1332ea3e552aedbeadfcdcba54ae44fa40bc6bec85be9896c2ff6d9fee73aa3d"},"schema_version":"1.0","source":{"id":"1804.03453","kind":"arxiv","version":1}},"canonical_sha256":"8b6a8a2975f9e31128d2a319efb9d423f27e907a151bbfa8a95c2eccbe220864","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b6a8a2975f9e31128d2a319efb9d423f27e907a151bbfa8a95c2eccbe220864","first_computed_at":"2026-05-18T00:18:48.185308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:48.185308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NwjygUz91R1UTPJIJJm1GBR8CF8dXbWXebzqt4EbO0evcfvLlpneLmfpD05ai26VhZmVvgg326mcNyXl9jxEAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:48.186128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7434b3c56dee57caaf19f26c13cd223cc13c9fef6e588e3817ef3ca783125a0","sha256:7f0b31250febe5971ae1871a53f294b46efda8e005d40872e34a2a5b76eff7c7"],"state_sha256":"b81191744b0468a62022d87d8daf786a15236310d644208c644464815d784199"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tu2uaq6kQoX/B6e8c4DiuEdmrHW8yCMeWoulwOvkpKe9VlAKqDaaxgMLs6NVhZgnOUdumWhDSmvkpnftRNnnAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:44:59.800717Z","bundle_sha256":"8102348b5963eb1e35a15f68dbbf468b077f33ef311450b7b6675a6f6082badc"}}