{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ODPAVNBUILOCN5OGOTN7PMIYCJ","short_pith_number":"pith:ODPAVNBU","schema_version":"1.0","canonical_sha256":"70de0ab43442dc26f5c674dbf7b118124ff6bbf1a8ee47a6606b4b621b23cd80","source":{"kind":"arxiv","id":"2408.01212","version":1},"attestation_state":"computed","paper":{"title":"Markov Decision Processes with Sure Parity and Multiple Reachability Objectives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Joost-Pieter Katoen, Rapha\\\"el Berthon, Tobias Winkler","submitted_at":"2024-08-02T11:55:44Z","abstract_excerpt":"This paper considers the problem of finding strategies that satisfy a mixture of sure and threshold objectives in Markov decision processes. We focus on a single $\\omega$-regular objective expressed as parity that must be surely met while satisfying $n$ reachability objectives towards sink states with some probability thresholds too. We consider three variants of the problem: (a) strict and (b) non-strict thresholds on all reachability objectives, and (c) maximizing the thresholds with respect to a lexicographic order. We show that (a) and (c) can be reduced to solving parity games, and (b) ca"},"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":"2408.01212","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-08-02T11:55:44Z","cross_cats_sorted":[],"title_canon_sha256":"4514b8e407253364d644fd2ad90b494429d93a4487f2f6550a17719dbef0942c","abstract_canon_sha256":"f4d9cabf9c54cbce6ae96bb5ee4bac0ef94d145d17086d0b7973b19e03953b46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:51:28.750523Z","signature_b64":"oAM3E9VGiKT1r+dMYxtgLr9d3HkuHdN3pzep5N8cVl1j8WbgT9TZDpN89CmAQZHt0QPt/U+ZckCZJy2Ex5C/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70de0ab43442dc26f5c674dbf7b118124ff6bbf1a8ee47a6606b4b621b23cd80","last_reissued_at":"2026-07-05T08:51:28.750117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:51:28.750117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov Decision Processes with Sure Parity and Multiple Reachability Objectives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Joost-Pieter Katoen, Rapha\\\"el Berthon, Tobias Winkler","submitted_at":"2024-08-02T11:55:44Z","abstract_excerpt":"This paper considers the problem of finding strategies that satisfy a mixture of sure and threshold objectives in Markov decision processes. We focus on a single $\\omega$-regular objective expressed as parity that must be surely met while satisfying $n$ reachability objectives towards sink states with some probability thresholds too. We consider three variants of the problem: (a) strict and (b) non-strict thresholds on all reachability objectives, and (c) maximizing the thresholds with respect to a lexicographic order. We show that (a) and (c) can be reduced to solving parity games, and (b) ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.01212","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.01212/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2408.01212","created_at":"2026-07-05T08:51:28.750174+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.01212v1","created_at":"2026-07-05T08:51:28.750174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.01212","created_at":"2026-07-05T08:51:28.750174+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODPAVNBUILOC","created_at":"2026-07-05T08:51:28.750174+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODPAVNBUILOCN5OG","created_at":"2026-07-05T08:51:28.750174+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODPAVNBU","created_at":"2026-07-05T08:51:28.750174+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/ODPAVNBUILOCN5OGOTN7PMIYCJ","json":"https://pith.science/pith/ODPAVNBUILOCN5OGOTN7PMIYCJ.json","graph_json":"https://pith.science/api/pith-number/ODPAVNBUILOCN5OGOTN7PMIYCJ/graph.json","events_json":"https://pith.science/api/pith-number/ODPAVNBUILOCN5OGOTN7PMIYCJ/events.json","paper":"https://pith.science/paper/ODPAVNBU"},"agent_actions":{"view_html":"https://pith.science/pith/ODPAVNBUILOCN5OGOTN7PMIYCJ","download_json":"https://pith.science/pith/ODPAVNBUILOCN5OGOTN7PMIYCJ.json","view_paper":"https://pith.science/paper/ODPAVNBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.01212&json=true","fetch_graph":"https://pith.science/api/pith-number/ODPAVNBUILOCN5OGOTN7PMIYCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ODPAVNBUILOCN5OGOTN7PMIYCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODPAVNBUILOCN5OGOTN7PMIYCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODPAVNBUILOCN5OGOTN7PMIYCJ/action/storage_attestation","attest_author":"https://pith.science/pith/ODPAVNBUILOCN5OGOTN7PMIYCJ/action/author_attestation","sign_citation":"https://pith.science/pith/ODPAVNBUILOCN5OGOTN7PMIYCJ/action/citation_signature","submit_replication":"https://pith.science/pith/ODPAVNBUILOCN5OGOTN7PMIYCJ/action/replication_record"}},"created_at":"2026-07-05T08:51:28.750174+00:00","updated_at":"2026-07-05T08:51:28.750174+00:00"}