{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3APMAXFMDO5KYTQZYW6WOCFTX4","short_pith_number":"pith:3APMAXFM","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"},"canonical_sha256":"d81ec05cac1bbaac4e19c5bd6708b3bf191ea959a0df70c37b8b7ade3b0db709","source":{"kind":"arxiv","id":"1907.08491","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08491","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08491v1","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08491","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"3APMAXFMDO5K","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3APMAXFMDO5KYTQZ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3APMAXFM","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3APMAXFMDO5KYTQZYW6WOCFTX4","target":"record","payload":{"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"},"canonical_sha256":"d81ec05cac1bbaac4e19c5bd6708b3bf191ea959a0df70c37b8b7ade3b0db709","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"},"source_kind":"arxiv","source_id":"1907.08491","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:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ahz0iqf9MDuR0gJk1s0OiAe4hhZru9I3QesGVRGsIHKLz7VNWkNpIKs6rUo3+LowVSp4YB63MQC2n8KmDpZ5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T16:05:44.800277Z"},"content_sha256":"497a1254176f727f64cfa9bda9045c71ded267c8001e003b5e3db125446ea52f","schema_version":"1.0","event_id":"sha256:497a1254176f727f64cfa9bda9045c71ded267c8001e003b5e3db125446ea52f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3APMAXFMDO5KYTQZYW6WOCFTX4","target":"graph","payload":{"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"},"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:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heSyMbuhVChk/hLfmtqfPTC9trMUYbXXkepp4HWGTKYlHP+i9UfLwh9fBtyI8CwKgtzwDo2cDHoGUu/P1F7IBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T16:05:44.800970Z"},"content_sha256":"ef902446a9f06983e2568c242c4418c793fc5f2c2d812c899ebab7ff5b4716cd","schema_version":"1.0","event_id":"sha256:ef902446a9f06983e2568c242c4418c793fc5f2c2d812c899ebab7ff5b4716cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/bundle.json","state_url":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/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-23T16:05:44Z","links":{"resolver":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4","bundle":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/bundle.json","state":"https://pith.science/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3APMAXFMDO5KYTQZYW6WOCFTX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3APMAXFMDO5KYTQZYW6WOCFTX4","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":"bc58eed708de6c6540d78fc75a971051fd218609754595d2ccde32b25a6887a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-19T12:52:39Z","title_canon_sha256":"8f70d83b00d44780684aaee8a9083047657652f379d370a65c83aecd5ffc78a6"},"schema_version":"1.0","source":{"id":"1907.08491","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08491","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08491v1","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08491","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"3APMAXFMDO5K","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3APMAXFMDO5KYTQZ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3APMAXFM","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:ef902446a9f06983e2568c242c4418c793fc5f2c2d812c899ebab7ff5b4716cd","target":"graph","created_at":"2026-05-17T23:40:09Z","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 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.","authors_text":"Jip Spel, Joost-Pieter Katoen, Sebastian Junges","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-19T12:52:39Z","title":"Are Parametric Markov Chains Monotonic?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08491","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:497a1254176f727f64cfa9bda9045c71ded267c8001e003b5e3db125446ea52f","target":"record","created_at":"2026-05-17T23:40:09Z","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":"bc58eed708de6c6540d78fc75a971051fd218609754595d2ccde32b25a6887a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-19T12:52:39Z","title_canon_sha256":"8f70d83b00d44780684aaee8a9083047657652f379d370a65c83aecd5ffc78a6"},"schema_version":"1.0","source":{"id":"1907.08491","kind":"arxiv","version":1}},"canonical_sha256":"d81ec05cac1bbaac4e19c5bd6708b3bf191ea959a0df70c37b8b7ade3b0db709","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d81ec05cac1bbaac4e19c5bd6708b3bf191ea959a0df70c37b8b7ade3b0db709","first_computed_at":"2026-05-17T23:40:09.676304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:09.676304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UR/fCToXAckheMOUsdmpxPLwqJ9jtroPmEKysK7sIibIF4Nfwh1OfNRIN8N2n0tPkgbi+Xrcq0Y6ZD1ftG74BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:09.676975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08491","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:497a1254176f727f64cfa9bda9045c71ded267c8001e003b5e3db125446ea52f","sha256:ef902446a9f06983e2568c242c4418c793fc5f2c2d812c899ebab7ff5b4716cd"],"state_sha256":"e7c8ced615f0c758202f3c573a6bcce16c245e7e1df1e988d08900fadee566bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esHAKTba3OH4IOjgvyot47qmPnFbWYu327ZbnRoBS0nB+qb/IlfM1ms0eBFAyyhVqMjBw9VnQyQNP99RGPZaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T16:05:44.804380Z","bundle_sha256":"2bbe4aaf0f4b452233dc8fc170fc82d770fc3b6235e42a5bd7eedc1762d65acc"}}