{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OM4BSIGNDX2HEUKFJ2RO7JX5C6","short_pith_number":"pith:OM4BSIGN","canonical_record":{"source":{"id":"1904.01503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-04-02T15:46:19Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"12455b039e2525432f9f186dd01f251c4fb350250555bab24ef6bc766a1cd375","abstract_canon_sha256":"eba73dc8d89afb27bde8f2b44b2c556c7aad9a8f45c2fc9e3fff77c4a2dc7dfd"},"schema_version":"1.0"},"canonical_sha256":"73381920cd1df47251454ea2efa6fd17b3cad732e40574a807e78f3d5680e7f1","source":{"kind":"arxiv","id":"1904.01503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01503","created_at":"2026-05-17T23:49:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01503v1","created_at":"2026-05-17T23:49:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01503","created_at":"2026-05-17T23:49:34Z"},{"alias_kind":"pith_short_12","alias_value":"OM4BSIGNDX2H","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OM4BSIGNDX2HEUKF","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OM4BSIGN","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OM4BSIGNDX2HEUKFJ2RO7JX5C6","target":"record","payload":{"canonical_record":{"source":{"id":"1904.01503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-04-02T15:46:19Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"12455b039e2525432f9f186dd01f251c4fb350250555bab24ef6bc766a1cd375","abstract_canon_sha256":"eba73dc8d89afb27bde8f2b44b2c556c7aad9a8f45c2fc9e3fff77c4a2dc7dfd"},"schema_version":"1.0"},"canonical_sha256":"73381920cd1df47251454ea2efa6fd17b3cad732e40574a807e78f3d5680e7f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:34.479281Z","signature_b64":"aQlZRDP+Ut3G8NgYrt+aoc/d6pRZL9nmlIOhXY0ObWfi3mBbPKlvS5v0/hDEJN0BUjQ7yrhYd8OaMRmtp0uwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73381920cd1df47251454ea2efa6fd17b3cad732e40574a807e78f3d5680e7f1","last_reissued_at":"2026-05-17T23:49:34.478692Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:34.478692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.01503","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKMWb2bhiASAlX8GMzyjZ65ZpPbQ84iqatKIg/PCBPt+4anOsHIkJlX/lJfwQcRsBaOMXxma2wpQX1zJliHhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:15:48.659837Z"},"content_sha256":"35d3050df595f91c2f2b30732baebc4fb2fdba7e391ef2eee449e953dd703e9b","schema_version":"1.0","event_id":"sha256:35d3050df595f91c2f2b30732baebc4fb2fdba7e391ef2eee449e953dd703e9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OM4BSIGNDX2HEUKFJ2RO7JX5C6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Reachability in Parametric Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Guillermo A. P\\'erez, Joost-Pieter Katoen, Sebastian Junges, Tobias Winkler","submitted_at":"2019-04-02T15:46:19Z","abstract_excerpt":"This paper studies parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over a finite set of parameters. Fixing values for all parameters yields MDPs. In particular, this paper studies the complexity of finding values for these parameters such that the induced MDP satisfies some reachability constraints. We discuss different variants depending on the comparison operator in the constraints and the domain of the parameter values. We improve all known lower bounds for this problem, and notably p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01503","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yz01oODCzpBDXXHotuJKLiBIdjaD4/RzykDfIPTyVgukA2401ZuoAJ+pJ2W2UpAshRplOJh8xxeDYbhW9R2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:15:48.660555Z"},"content_sha256":"01868ba071b2fdfcac2730af6e46cf11003921ca058edecb2207e97e48a155e8","schema_version":"1.0","event_id":"sha256:01868ba071b2fdfcac2730af6e46cf11003921ca058edecb2207e97e48a155e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OM4BSIGNDX2HEUKFJ2RO7JX5C6/bundle.json","state_url":"https://pith.science/pith/OM4BSIGNDX2HEUKFJ2RO7JX5C6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OM4BSIGNDX2HEUKFJ2RO7JX5C6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T15:15:48Z","links":{"resolver":"https://pith.science/pith/OM4BSIGNDX2HEUKFJ2RO7JX5C6","bundle":"https://pith.science/pith/OM4BSIGNDX2HEUKFJ2RO7JX5C6/bundle.json","state":"https://pith.science/pith/OM4BSIGNDX2HEUKFJ2RO7JX5C6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OM4BSIGNDX2HEUKFJ2RO7JX5C6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OM4BSIGNDX2HEUKFJ2RO7JX5C6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eba73dc8d89afb27bde8f2b44b2c556c7aad9a8f45c2fc9e3fff77c4a2dc7dfd","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-04-02T15:46:19Z","title_canon_sha256":"12455b039e2525432f9f186dd01f251c4fb350250555bab24ef6bc766a1cd375"},"schema_version":"1.0","source":{"id":"1904.01503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01503","created_at":"2026-05-17T23:49:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01503v1","created_at":"2026-05-17T23:49:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01503","created_at":"2026-05-17T23:49:34Z"},{"alias_kind":"pith_short_12","alias_value":"OM4BSIGNDX2H","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OM4BSIGNDX2HEUKF","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OM4BSIGN","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:01868ba071b2fdfcac2730af6e46cf11003921ca058edecb2207e97e48a155e8","target":"graph","created_at":"2026-05-17T23:49:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper studies parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over a finite set of parameters. Fixing values for all parameters yields MDPs. In particular, this paper studies the complexity of finding values for these parameters such that the induced MDP satisfies some reachability constraints. We discuss different variants depending on the comparison operator in the constraints and the domain of the parameter values. We improve all known lower bounds for this problem, and notably p","authors_text":"Guillermo A. P\\'erez, Joost-Pieter Katoen, Sebastian Junges, Tobias Winkler","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-04-02T15:46:19Z","title":"On the Complexity of Reachability in Parametric Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01503","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:35d3050df595f91c2f2b30732baebc4fb2fdba7e391ef2eee449e953dd703e9b","target":"record","created_at":"2026-05-17T23:49:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eba73dc8d89afb27bde8f2b44b2c556c7aad9a8f45c2fc9e3fff77c4a2dc7dfd","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-04-02T15:46:19Z","title_canon_sha256":"12455b039e2525432f9f186dd01f251c4fb350250555bab24ef6bc766a1cd375"},"schema_version":"1.0","source":{"id":"1904.01503","kind":"arxiv","version":1}},"canonical_sha256":"73381920cd1df47251454ea2efa6fd17b3cad732e40574a807e78f3d5680e7f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73381920cd1df47251454ea2efa6fd17b3cad732e40574a807e78f3d5680e7f1","first_computed_at":"2026-05-17T23:49:34.478692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:34.478692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aQlZRDP+Ut3G8NgYrt+aoc/d6pRZL9nmlIOhXY0ObWfi3mBbPKlvS5v0/hDEJN0BUjQ7yrhYd8OaMRmtp0uwCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:34.479281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.01503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35d3050df595f91c2f2b30732baebc4fb2fdba7e391ef2eee449e953dd703e9b","sha256:01868ba071b2fdfcac2730af6e46cf11003921ca058edecb2207e97e48a155e8"],"state_sha256":"9f343741b40415a632bdf16397584dcbdd21124663eaf9597baf381f74be0c29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOzkGmMK7BoXBkU+KPHpwWoE0VQm7/39aaYrVvgoFeRrCvRfMmYdhMuUi5fgfhC5JsPaNTW+dJ6vA/MVYftGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T15:15:48.664131Z","bundle_sha256":"d499c1c49fed36edfabe00ce0f0b6539bd9bfeb7a84c413c3c8df80643635e8e"}}