{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2E47SEC6BZ4NHERFBOCG5TOTPO","short_pith_number":"pith:2E47SEC6","schema_version":"1.0","canonical_sha256":"d139f9105e0e78d392250b846ecdd37bab43c040262a96972973228981bb3e36","source":{"kind":"arxiv","id":"1912.11223","version":2},"attestation_state":"computed","paper":{"title":"Scenario-Based Verification of Uncertain MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LO","authors_text":"Joost-Pieter Katoen, Murat Cubuktepe, Nils Jansen, Sebastian Junges, Ufuk Topcu","submitted_at":"2019-12-24T06:41:48Z","abstract_excerpt":"We consider Markov decision processes (MDPs) in which the transition probabilities and rewards belong to an uncertainty set parametrized by a collection of random variables. The probability distributions for these random parameters are unknown. The problem is to compute the probability to satisfy a temporal logic specification within any MDP that corresponds to a sample from these unknown distributions. In general, this problem is undecidable, and we resort to techniques from so-called scenario optimization. Based on a finite number of samples of the uncertain parameters, each of which induces"},"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":"1912.11223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-12-24T06:41:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"655d062703ab2c1292d48ee1133da0c361c11554b6862a3375eb1e79b40676bc","abstract_canon_sha256":"4a7b6a0bdc5dd99feaa7a8155f8ab0530cd5a9a81ff0cd707ec37598088298bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:44.419895Z","signature_b64":"eYIbXnJiJhNPmTpqjX9XF92bd2d/gTxVaqFDkKn2lJnJUXa3lYyyhKkY3AZcop9PvXXKCdbLAQId+aMwzmzwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d139f9105e0e78d392250b846ecdd37bab43c040262a96972973228981bb3e36","last_reissued_at":"2026-07-05T00:43:44.419479Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:44.419479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scenario-Based Verification of Uncertain MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LO","authors_text":"Joost-Pieter Katoen, Murat Cubuktepe, Nils Jansen, Sebastian Junges, Ufuk Topcu","submitted_at":"2019-12-24T06:41:48Z","abstract_excerpt":"We consider Markov decision processes (MDPs) in which the transition probabilities and rewards belong to an uncertainty set parametrized by a collection of random variables. The probability distributions for these random parameters are unknown. The problem is to compute the probability to satisfy a temporal logic specification within any MDP that corresponds to a sample from these unknown distributions. In general, this problem is undecidable, and we resort to techniques from so-called scenario optimization. Based on a finite number of samples of the uncertain parameters, each of which induces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.11223","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.11223/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":"1912.11223","created_at":"2026-07-05T00:43:44.419540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.11223v2","created_at":"2026-07-05T00:43:44.419540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.11223","created_at":"2026-07-05T00:43:44.419540+00:00"},{"alias_kind":"pith_short_12","alias_value":"2E47SEC6BZ4N","created_at":"2026-07-05T00:43:44.419540+00:00"},{"alias_kind":"pith_short_16","alias_value":"2E47SEC6BZ4NHERF","created_at":"2026-07-05T00:43:44.419540+00:00"},{"alias_kind":"pith_short_8","alias_value":"2E47SEC6","created_at":"2026-07-05T00:43:44.419540+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/2E47SEC6BZ4NHERFBOCG5TOTPO","json":"https://pith.science/pith/2E47SEC6BZ4NHERFBOCG5TOTPO.json","graph_json":"https://pith.science/api/pith-number/2E47SEC6BZ4NHERFBOCG5TOTPO/graph.json","events_json":"https://pith.science/api/pith-number/2E47SEC6BZ4NHERFBOCG5TOTPO/events.json","paper":"https://pith.science/paper/2E47SEC6"},"agent_actions":{"view_html":"https://pith.science/pith/2E47SEC6BZ4NHERFBOCG5TOTPO","download_json":"https://pith.science/pith/2E47SEC6BZ4NHERFBOCG5TOTPO.json","view_paper":"https://pith.science/paper/2E47SEC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.11223&json=true","fetch_graph":"https://pith.science/api/pith-number/2E47SEC6BZ4NHERFBOCG5TOTPO/graph.json","fetch_events":"https://pith.science/api/pith-number/2E47SEC6BZ4NHERFBOCG5TOTPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2E47SEC6BZ4NHERFBOCG5TOTPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2E47SEC6BZ4NHERFBOCG5TOTPO/action/storage_attestation","attest_author":"https://pith.science/pith/2E47SEC6BZ4NHERFBOCG5TOTPO/action/author_attestation","sign_citation":"https://pith.science/pith/2E47SEC6BZ4NHERFBOCG5TOTPO/action/citation_signature","submit_replication":"https://pith.science/pith/2E47SEC6BZ4NHERFBOCG5TOTPO/action/replication_record"}},"created_at":"2026-07-05T00:43:44.419540+00:00","updated_at":"2026-07-05T00:43:44.419540+00:00"}