{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3APMAXFMDO5KYTQZYW6WOCFTX4","short_pith_number":"pith:3APMAXFM","schema_version":"1.0","canonical_sha256":"d81ec05cac1bbaac4e19c5bd6708b3bf191ea959a0df70c37b8b7ade3b0db709","source":{"kind":"arxiv","id":"1907.08491","version":1},"attestation_state":"computed","paper":{"title":"Are Parametric Markov Chains Monotonic?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jip Spel, Joost-Pieter Katoen, Sebastian Junges","submitted_at":"2019-07-19T12:52:39Z","abstract_excerpt":"This paper presents a simple algorithm to check whether reachability probabilities in parametric Markov chains are monotonic in (some of) the parameters. The idea is to construct - only using the graph structure of the Markov chain and local transition probabilities - a pre-order on the states. Our algorithm cheaply checks a sufficient condition for monotonicity. Experiments show that monotonicity in several benchmarks is automatically detected, and monotonicity can speed up parameter synthesis up to orders of magnitude faster than a symbolic baseline."},"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":"1907.08491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-19T12:52:39Z","cross_cats_sorted":[],"title_canon_sha256":"8f70d83b00d44780684aaee8a9083047657652f379d370a65c83aecd5ffc78a6","abstract_canon_sha256":"bc58eed708de6c6540d78fc75a971051fd218609754595d2ccde32b25a6887a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:09.676975Z","signature_b64":"UR/fCToXAckheMOUsdmpxPLwqJ9jtroPmEKysK7sIibIF4Nfwh1OfNRIN8N2n0tPkgbi+Xrcq0Y6ZD1ftG74BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d81ec05cac1bbaac4e19c5bd6708b3bf191ea959a0df70c37b8b7ade3b0db709","last_reissued_at":"2026-05-17T23:40:09.676304Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:09.676304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Are Parametric Markov Chains Monotonic?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jip Spel, Joost-Pieter Katoen, Sebastian Junges","submitted_at":"2019-07-19T12:52:39Z","abstract_excerpt":"This paper presents a simple algorithm to check whether reachability probabilities in parametric Markov chains are monotonic in (some of) the parameters. The idea is to construct - only using the graph structure of the Markov chain and local transition probabilities - a pre-order on the states. Our algorithm cheaply checks a sufficient condition for monotonicity. Experiments show that monotonicity in several benchmarks is automatically detected, and monotonicity can speed up parameter synthesis up to orders of magnitude faster than a symbolic baseline."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08491","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":"1907.08491","created_at":"2026-05-17T23:40:09.676392+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08491v1","created_at":"2026-05-17T23:40:09.676392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08491","created_at":"2026-05-17T23:40:09.676392+00:00"},{"alias_kind":"pith_short_12","alias_value":"3APMAXFMDO5K","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3APMAXFMDO5KYTQZ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3APMAXFM","created_at":"2026-05-18T12:33:07.085635+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/3APMAXFMDO5KYTQZYW6WOCFTX4","json":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4.json","graph_json":"https://pith.science/api/pith-number/3APMAXFMDO5KYTQZYW6WOCFTX4/graph.json","events_json":"https://pith.science/api/pith-number/3APMAXFMDO5KYTQZYW6WOCFTX4/events.json","paper":"https://pith.science/paper/3APMAXFM"},"agent_actions":{"view_html":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4","download_json":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4.json","view_paper":"https://pith.science/paper/3APMAXFM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08491&json=true","fetch_graph":"https://pith.science/api/pith-number/3APMAXFMDO5KYTQZYW6WOCFTX4/graph.json","fetch_events":"https://pith.science/api/pith-number/3APMAXFMDO5KYTQZYW6WOCFTX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/action/storage_attestation","attest_author":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/action/author_attestation","sign_citation":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/action/citation_signature","submit_replication":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/action/replication_record"}},"created_at":"2026-05-17T23:40:09.676392+00:00","updated_at":"2026-05-17T23:40:09.676392+00:00"}