{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QNM2OISY6JJNP23WGP5RIND663","short_pith_number":"pith:QNM2OISY","schema_version":"1.0","canonical_sha256":"8359a72258f252d7eb7633fb14347ef6c1b5f9bb84f54b14386bdf1ce71eb0fe","source":{"kind":"arxiv","id":"1407.5449","version":1},"attestation_state":"computed","paper":{"title":"Quantitative model-checking of controlled discrete-time Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.SY","math.OC"],"primary_cat":"math.PR","authors_text":"Alessandro Abate, Alexandru Mereacre, Ilya Tkachev, Joost-Pieter Katoen","submitted_at":"2014-07-21T10:28:31Z","abstract_excerpt":"This paper focuses on optimizing probabilities of events of interest defined over general controlled discrete-time Markov processes. It is shown that the optimization over a wide class of $\\omega$-regular properties can be reduced to the solution of one of two fundamental problems: reachability and repeated reachability. We provide a comprehensive study of the former problem and an initial characterisation of the (much more involved) latter problem. A case study elucidates concepts and techniques."},"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":"1407.5449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-21T10:28:31Z","cross_cats_sorted":["cs.FL","cs.SY","math.OC"],"title_canon_sha256":"d7cf2f57b025580fbd89e03cc0a31705fb79de132a2b472ea93de3078d447b9e","abstract_canon_sha256":"fc0fade085199531e77bed1dbe22cb65f211e0295824c4410af67f7003a1fa33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:13.973526Z","signature_b64":"69QIDUGbKPOJCtpn5Qgho840M3KZgwDuFpY0M5lidm2k/B2XINDKbA6nm9t8vdWS9ID0Vwm+jIC5hrOETqK1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8359a72258f252d7eb7633fb14347ef6c1b5f9bb84f54b14386bdf1ce71eb0fe","last_reissued_at":"2026-05-18T02:47:13.972889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:13.972889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantitative model-checking of controlled discrete-time Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.SY","math.OC"],"primary_cat":"math.PR","authors_text":"Alessandro Abate, Alexandru Mereacre, Ilya Tkachev, Joost-Pieter Katoen","submitted_at":"2014-07-21T10:28:31Z","abstract_excerpt":"This paper focuses on optimizing probabilities of events of interest defined over general controlled discrete-time Markov processes. It is shown that the optimization over a wide class of $\\omega$-regular properties can be reduced to the solution of one of two fundamental problems: reachability and repeated reachability. We provide a comprehensive study of the former problem and an initial characterisation of the (much more involved) latter problem. A case study elucidates concepts and techniques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5449","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.5449","created_at":"2026-05-18T02:47:13.972970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5449v1","created_at":"2026-05-18T02:47:13.972970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5449","created_at":"2026-05-18T02:47:13.972970+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNM2OISY6JJN","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNM2OISY6JJNP23W","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNM2OISY","created_at":"2026-05-18T12:28:46.137349+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/QNM2OISY6JJNP23WGP5RIND663","json":"https://pith.science/pith/QNM2OISY6JJNP23WGP5RIND663.json","graph_json":"https://pith.science/api/pith-number/QNM2OISY6JJNP23WGP5RIND663/graph.json","events_json":"https://pith.science/api/pith-number/QNM2OISY6JJNP23WGP5RIND663/events.json","paper":"https://pith.science/paper/QNM2OISY"},"agent_actions":{"view_html":"https://pith.science/pith/QNM2OISY6JJNP23WGP5RIND663","download_json":"https://pith.science/pith/QNM2OISY6JJNP23WGP5RIND663.json","view_paper":"https://pith.science/paper/QNM2OISY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5449&json=true","fetch_graph":"https://pith.science/api/pith-number/QNM2OISY6JJNP23WGP5RIND663/graph.json","fetch_events":"https://pith.science/api/pith-number/QNM2OISY6JJNP23WGP5RIND663/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNM2OISY6JJNP23WGP5RIND663/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNM2OISY6JJNP23WGP5RIND663/action/storage_attestation","attest_author":"https://pith.science/pith/QNM2OISY6JJNP23WGP5RIND663/action/author_attestation","sign_citation":"https://pith.science/pith/QNM2OISY6JJNP23WGP5RIND663/action/citation_signature","submit_replication":"https://pith.science/pith/QNM2OISY6JJNP23WGP5RIND663/action/replication_record"}},"created_at":"2026-05-18T02:47:13.972970+00:00","updated_at":"2026-05-18T02:47:13.972970+00:00"}