{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WQV3LEQAXCCWSX575ZP3SBAJEX","short_pith_number":"pith:WQV3LEQA","schema_version":"1.0","canonical_sha256":"b42bb59200b885695fbfee5fb9040925eb87688f195202a6fcba43036ac21702","source":{"kind":"arxiv","id":"1702.05472","version":2},"attestation_state":"computed","paper":{"title":"Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.FL","cs.GT","math.PR"],"primary_cat":"cs.LO","authors_text":"Jean-Fran\\c{c}ois Raskin, Mickael Randour, Rapha\\\"el Berthon","submitted_at":"2017-02-17T18:52:11Z","abstract_excerpt":"The beyond worst-case synthesis problem was introduced recently by Bruy\\`ere et al. [BFRR14]: it aims at building system controllers that provide strict worst-case performance guarantees against an antagonistic environment while ensuring higher expected performance against a stochastic model of the environment. Our work extends the framework of [BFRR14] and follow-up papers, which focused on quantitative objectives, by addressing the case of $\\omega$-regular conditions encoded as parity objectives, a natural way to represent functional requirements of systems.\n  We build strategies that satisf"},"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":"1702.05472","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-17T18:52:11Z","cross_cats_sorted":["cs.AI","cs.FL","cs.GT","math.PR"],"title_canon_sha256":"d74319325fc112ec84941653f59e08ac790644e9660b3596ce0b928118816b13","abstract_canon_sha256":"bf164192255b09cd11bd8f23b6e3e93c1e893685f97794c9f95ceee6698c77ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:30.024226Z","signature_b64":"0SxWOa//wWSdKc3XC1Kji732boWbiGhLt3iuQqLphqHtSMFfAzKB4y/KNetDb2j/+oyq3sYeGnzDOBWnEzb5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b42bb59200b885695fbfee5fb9040925eb87688f195202a6fcba43036ac21702","last_reissued_at":"2026-05-18T00:45:30.023742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:30.023742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.FL","cs.GT","math.PR"],"primary_cat":"cs.LO","authors_text":"Jean-Fran\\c{c}ois Raskin, Mickael Randour, Rapha\\\"el Berthon","submitted_at":"2017-02-17T18:52:11Z","abstract_excerpt":"The beyond worst-case synthesis problem was introduced recently by Bruy\\`ere et al. [BFRR14]: it aims at building system controllers that provide strict worst-case performance guarantees against an antagonistic environment while ensuring higher expected performance against a stochastic model of the environment. Our work extends the framework of [BFRR14] and follow-up papers, which focused on quantitative objectives, by addressing the case of $\\omega$-regular conditions encoded as parity objectives, a natural way to represent functional requirements of systems.\n  We build strategies that satisf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05472","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":"1702.05472","created_at":"2026-05-18T00:45:30.023811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05472v2","created_at":"2026-05-18T00:45:30.023811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05472","created_at":"2026-05-18T00:45:30.023811+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQV3LEQAXCCW","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQV3LEQAXCCWSX57","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQV3LEQA","created_at":"2026-05-18T12:31:53.515858+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/WQV3LEQAXCCWSX575ZP3SBAJEX","json":"https://pith.science/pith/WQV3LEQAXCCWSX575ZP3SBAJEX.json","graph_json":"https://pith.science/api/pith-number/WQV3LEQAXCCWSX575ZP3SBAJEX/graph.json","events_json":"https://pith.science/api/pith-number/WQV3LEQAXCCWSX575ZP3SBAJEX/events.json","paper":"https://pith.science/paper/WQV3LEQA"},"agent_actions":{"view_html":"https://pith.science/pith/WQV3LEQAXCCWSX575ZP3SBAJEX","download_json":"https://pith.science/pith/WQV3LEQAXCCWSX575ZP3SBAJEX.json","view_paper":"https://pith.science/paper/WQV3LEQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05472&json=true","fetch_graph":"https://pith.science/api/pith-number/WQV3LEQAXCCWSX575ZP3SBAJEX/graph.json","fetch_events":"https://pith.science/api/pith-number/WQV3LEQAXCCWSX575ZP3SBAJEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQV3LEQAXCCWSX575ZP3SBAJEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQV3LEQAXCCWSX575ZP3SBAJEX/action/storage_attestation","attest_author":"https://pith.science/pith/WQV3LEQAXCCWSX575ZP3SBAJEX/action/author_attestation","sign_citation":"https://pith.science/pith/WQV3LEQAXCCWSX575ZP3SBAJEX/action/citation_signature","submit_replication":"https://pith.science/pith/WQV3LEQAXCCWSX575ZP3SBAJEX/action/replication_record"}},"created_at":"2026-05-18T00:45:30.023811+00:00","updated_at":"2026-05-18T00:45:30.023811+00:00"}