{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WRQXJKYBRVYQFAK5DFMRXYALTP","short_pith_number":"pith:WRQXJKYB","schema_version":"1.0","canonical_sha256":"b46174ab018d7102815d19591be00b9bc7545ba493635be52471d87fb23063e8","source":{"kind":"arxiv","id":"2505.04539","version":1},"attestation_state":"computed","paper":{"title":"Qualitative Analysis of $\\omega$-Regular Objectives on Robust MDPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ali Asadi, Ali Shafiee, Ehsan Kafshdar Goharshady, Krishnendu Chatterjee, Mehrdad Karrabi","submitted_at":"2025-05-07T16:15:40Z","abstract_excerpt":"Robust Markov Decision Processes (RMDPs) generalize classical MDPs that consider uncertainties in transition probabilities by defining a set of possible transition functions. An objective is a set of runs (or infinite trajectories) of the RMDP, and the value for an objective is the maximal probability that the agent can guarantee against the adversarial environment. We consider (a) reachability objectives, where given a target set of states, the goal is to eventually arrive at one of them; and (b) parity objectives, which are a canonical representation for $\\omega$-regular objectives. The qual"},"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":"2505.04539","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-07T16:15:40Z","cross_cats_sorted":[],"title_canon_sha256":"485c0b41c75f9e340398134e016375c8c11f6587249eb47c154d13c1ddb31477","abstract_canon_sha256":"415e8c75df2b5bff07f7b873cb969eb508e13cc9db650fb0846486413c144587"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:53.547957Z","signature_b64":"/NscCXB1nOCmodIuuVYB2HkN8yjbxrpFRtoPWsg2zjF/c3HJQFFo61ZP/CrZSubteQcJk8So89I/UGVp0w4lCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b46174ab018d7102815d19591be00b9bc7545ba493635be52471d87fb23063e8","last_reissued_at":"2026-07-05T10:59:53.547446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:53.547446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Qualitative Analysis of $\\omega$-Regular Objectives on Robust MDPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ali Asadi, Ali Shafiee, Ehsan Kafshdar Goharshady, Krishnendu Chatterjee, Mehrdad Karrabi","submitted_at":"2025-05-07T16:15:40Z","abstract_excerpt":"Robust Markov Decision Processes (RMDPs) generalize classical MDPs that consider uncertainties in transition probabilities by defining a set of possible transition functions. An objective is a set of runs (or infinite trajectories) of the RMDP, and the value for an objective is the maximal probability that the agent can guarantee against the adversarial environment. We consider (a) reachability objectives, where given a target set of states, the goal is to eventually arrive at one of them; and (b) parity objectives, which are a canonical representation for $\\omega$-regular objectives. The qual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04539","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/2505.04539/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":"2505.04539","created_at":"2026-07-05T10:59:53.547512+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.04539v1","created_at":"2026-07-05T10:59:53.547512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04539","created_at":"2026-07-05T10:59:53.547512+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRQXJKYBRVYQ","created_at":"2026-07-05T10:59:53.547512+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRQXJKYBRVYQFAK5","created_at":"2026-07-05T10:59:53.547512+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRQXJKYB","created_at":"2026-07-05T10:59:53.547512+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/WRQXJKYBRVYQFAK5DFMRXYALTP","json":"https://pith.science/pith/WRQXJKYBRVYQFAK5DFMRXYALTP.json","graph_json":"https://pith.science/api/pith-number/WRQXJKYBRVYQFAK5DFMRXYALTP/graph.json","events_json":"https://pith.science/api/pith-number/WRQXJKYBRVYQFAK5DFMRXYALTP/events.json","paper":"https://pith.science/paper/WRQXJKYB"},"agent_actions":{"view_html":"https://pith.science/pith/WRQXJKYBRVYQFAK5DFMRXYALTP","download_json":"https://pith.science/pith/WRQXJKYBRVYQFAK5DFMRXYALTP.json","view_paper":"https://pith.science/paper/WRQXJKYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.04539&json=true","fetch_graph":"https://pith.science/api/pith-number/WRQXJKYBRVYQFAK5DFMRXYALTP/graph.json","fetch_events":"https://pith.science/api/pith-number/WRQXJKYBRVYQFAK5DFMRXYALTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRQXJKYBRVYQFAK5DFMRXYALTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRQXJKYBRVYQFAK5DFMRXYALTP/action/storage_attestation","attest_author":"https://pith.science/pith/WRQXJKYBRVYQFAK5DFMRXYALTP/action/author_attestation","sign_citation":"https://pith.science/pith/WRQXJKYBRVYQFAK5DFMRXYALTP/action/citation_signature","submit_replication":"https://pith.science/pith/WRQXJKYBRVYQFAK5DFMRXYALTP/action/replication_record"}},"created_at":"2026-07-05T10:59:53.547512+00:00","updated_at":"2026-07-05T10:59:53.547512+00:00"}