{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YVGSOPIFDY3IREZBMUZPMPYJ36","short_pith_number":"pith:YVGSOPIF","canonical_record":{"source":{"id":"2606.21444","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-19T14:04:51Z","cross_cats_sorted":[],"title_canon_sha256":"a06f70a40100c40e82e484f41823640c4d7c1a306f4c4c0d9c299dca11b9a734","abstract_canon_sha256":"fb0b1803a4fd29f23145f856326cc8114c9c02a9211a36e47373497f206e9334"},"schema_version":"1.0"},"canonical_sha256":"c54d273d051e368893216532f63f09dfb1b8f227dcb4ff8f49b215844559a2cf","source":{"kind":"arxiv","id":"2606.21444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21444","created_at":"2026-06-23T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21444v1","created_at":"2026-06-23T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21444","created_at":"2026-06-23T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"YVGSOPIFDY3I","created_at":"2026-06-23T01:13:10Z"},{"alias_kind":"pith_short_16","alias_value":"YVGSOPIFDY3IREZB","created_at":"2026-06-23T01:13:10Z"},{"alias_kind":"pith_short_8","alias_value":"YVGSOPIF","created_at":"2026-06-23T01:13:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YVGSOPIFDY3IREZBMUZPMPYJ36","target":"record","payload":{"canonical_record":{"source":{"id":"2606.21444","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-19T14:04:51Z","cross_cats_sorted":[],"title_canon_sha256":"a06f70a40100c40e82e484f41823640c4d7c1a306f4c4c0d9c299dca11b9a734","abstract_canon_sha256":"fb0b1803a4fd29f23145f856326cc8114c9c02a9211a36e47373497f206e9334"},"schema_version":"1.0"},"canonical_sha256":"c54d273d051e368893216532f63f09dfb1b8f227dcb4ff8f49b215844559a2cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:13:10.548079Z","signature_b64":"G/QE+VUX+SONK+G9Ifab2NZL+sV61QzqZLoLbJykbTmZanJ3JVukFhXgy66NDmA3BWWBEjpVG5JmNqu/bag4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c54d273d051e368893216532f63f09dfb1b8f227dcb4ff8f49b215844559a2cf","last_reissued_at":"2026-06-23T01:13:10.547559Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:13:10.547559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.21444","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-06-23T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DvXpgBLt/LdL07zaicGRjK+H01Wrzq9WEbHO43E+ED+zuMrK8Y/i1AsR7LeiDKEjRgr+B4+L8DLcvkNulN67AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:16:23.512675Z"},"content_sha256":"7f7c75ae270f3abf9fc671277eeea8f564ef33730e740b1f615f6cd3410491d7","schema_version":"1.0","event_id":"sha256:7f7c75ae270f3abf9fc671277eeea8f564ef33730e740b1f615f6cd3410491d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YVGSOPIFDY3IREZBMUZPMPYJ36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verification of Parametric Markov Automata under Time-bounded Reachability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Kevin van de Glind, Matthias Volk, Tim Willemse","submitted_at":"2026-06-19T14:04:51Z","abstract_excerpt":"Analysis of Markov models is of high importance for formal verification. Until now, analysis of Markov Automata required them to be fully specified, which is a considerable restriction as rates may be unknown or influenced by uncertainty of the environment. We introduce parametric Markov Automata (pMA) to capture this uncertainty with parametric transition functions. On these parametrized models, two different synthesis problems for time-bounded reachability properties are considered: I) Does there exist a valuation in the parameter space such that the instantiated model satisfies/violates the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21444","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.21444/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"},"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-06-23T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"no+J4bsW56YaCzHPvgcplgXmfLp2ey3Z6Xd+VFEgBWJRV8z3Ib89PZAE/HhRUSMis63pnptw+H3Yn5gbWnnKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:16:23.513082Z"},"content_sha256":"e23e5edff0c53c81c59043c31bc739b0660f8c16a88ee13ca8e7c2825829ea10","schema_version":"1.0","event_id":"sha256:e23e5edff0c53c81c59043c31bc739b0660f8c16a88ee13ca8e7c2825829ea10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVGSOPIFDY3IREZBMUZPMPYJ36/bundle.json","state_url":"https://pith.science/pith/YVGSOPIFDY3IREZBMUZPMPYJ36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVGSOPIFDY3IREZBMUZPMPYJ36/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-06-29T07:16:23Z","links":{"resolver":"https://pith.science/pith/YVGSOPIFDY3IREZBMUZPMPYJ36","bundle":"https://pith.science/pith/YVGSOPIFDY3IREZBMUZPMPYJ36/bundle.json","state":"https://pith.science/pith/YVGSOPIFDY3IREZBMUZPMPYJ36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVGSOPIFDY3IREZBMUZPMPYJ36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YVGSOPIFDY3IREZBMUZPMPYJ36","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":"fb0b1803a4fd29f23145f856326cc8114c9c02a9211a36e47373497f206e9334","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-19T14:04:51Z","title_canon_sha256":"a06f70a40100c40e82e484f41823640c4d7c1a306f4c4c0d9c299dca11b9a734"},"schema_version":"1.0","source":{"id":"2606.21444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21444","created_at":"2026-06-23T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21444v1","created_at":"2026-06-23T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21444","created_at":"2026-06-23T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"YVGSOPIFDY3I","created_at":"2026-06-23T01:13:10Z"},{"alias_kind":"pith_short_16","alias_value":"YVGSOPIFDY3IREZB","created_at":"2026-06-23T01:13:10Z"},{"alias_kind":"pith_short_8","alias_value":"YVGSOPIF","created_at":"2026-06-23T01:13:10Z"}],"graph_snapshots":[{"event_id":"sha256:e23e5edff0c53c81c59043c31bc739b0660f8c16a88ee13ca8e7c2825829ea10","target":"graph","created_at":"2026-06-23T01:13:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.21444/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Analysis of Markov models is of high importance for formal verification. Until now, analysis of Markov Automata required them to be fully specified, which is a considerable restriction as rates may be unknown or influenced by uncertainty of the environment. We introduce parametric Markov Automata (pMA) to capture this uncertainty with parametric transition functions. On these parametrized models, two different synthesis problems for time-bounded reachability properties are considered: I) Does there exist a valuation in the parameter space such that the instantiated model satisfies/violates the","authors_text":"Kevin van de Glind, Matthias Volk, Tim Willemse","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-19T14:04:51Z","title":"Verification of Parametric Markov Automata under Time-bounded Reachability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21444","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:7f7c75ae270f3abf9fc671277eeea8f564ef33730e740b1f615f6cd3410491d7","target":"record","created_at":"2026-06-23T01:13:10Z","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":"fb0b1803a4fd29f23145f856326cc8114c9c02a9211a36e47373497f206e9334","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-19T14:04:51Z","title_canon_sha256":"a06f70a40100c40e82e484f41823640c4d7c1a306f4c4c0d9c299dca11b9a734"},"schema_version":"1.0","source":{"id":"2606.21444","kind":"arxiv","version":1}},"canonical_sha256":"c54d273d051e368893216532f63f09dfb1b8f227dcb4ff8f49b215844559a2cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c54d273d051e368893216532f63f09dfb1b8f227dcb4ff8f49b215844559a2cf","first_computed_at":"2026-06-23T01:13:10.547559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T01:13:10.547559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G/QE+VUX+SONK+G9Ifab2NZL+sV61QzqZLoLbJykbTmZanJ3JVukFhXgy66NDmA3BWWBEjpVG5JmNqu/bag4Dg==","signature_status":"signed_v1","signed_at":"2026-06-23T01:13:10.548079Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.21444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f7c75ae270f3abf9fc671277eeea8f564ef33730e740b1f615f6cd3410491d7","sha256:e23e5edff0c53c81c59043c31bc739b0660f8c16a88ee13ca8e7c2825829ea10"],"state_sha256":"0c4c272c0f410dc0a0ee83e813349f8ca0f9937986416be94c0cba5e418996cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWWXeFqYVtE4k35f+PEwLcY6J+VSqdu2qtDpIO/M4mI0sHSqy+qhngLK3+C0w4ajBqCkpzlCtrK8+M3BNFAJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T07:16:23.515232Z","bundle_sha256":"910af9a9a752282def6762fb8d124e7133db12f501c5b51299b4ee677321d595"}}