{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:DEXKNEAZZKRMHPF2VFYDWPGKNV","short_pith_number":"pith:DEXKNEAZ","schema_version":"1.0","canonical_sha256":"192ea69019caa2c3bcbaa9703b3cca6d4aee9dc37b1801a85d3a93b288800586","source":{"kind":"arxiv","id":"2205.08300","version":3},"attestation_state":"computed","paper":{"title":"Sampling-Based Verification of CTMCs with Uncertain Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LO","authors_text":"Marielle Stoelinga, Matthias Volk, Nils Jansen, Sebastian Junges, Thom S. Badings","submitted_at":"2022-05-17T12:56:51Z","abstract_excerpt":"We employ uncertain parametric CTMCs with parametric transition rates and a prior on the parameter values. The prior encodes uncertainty about the actual transition rates, while the parameters allow dependencies between transition rates. Sampling the parameter values from the prior distribution then yields a standard CTMC, for which we may compute relevant reachability probabilities. We provide a principled solution, based on a technique called scenario-optimization, to the following problem: From a finite set of parameter samples and a user-specified confidence level, compute prediction regio"},"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":"2205.08300","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2022-05-17T12:56:51Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"286b03fd2bf4b1710969751924b49ceaf2fea48229cdfc3e0df98089663b8878","abstract_canon_sha256":"e4e23eaf3b949acdfc96c2fd0861ff834f3f588b4837125c38f22b1822b703c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:09.435155Z","signature_b64":"lVTPW54m00xfL2L7f5g6rJqBojJwvGwFajWVMXK0dJxuWYLdxbN18FfoxKaj6htGRg6ZBdvJ73UeXZtn5EZ8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"192ea69019caa2c3bcbaa9703b3cca6d4aee9dc37b1801a85d3a93b288800586","last_reissued_at":"2026-07-05T05:23:09.434696Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:09.434696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling-Based Verification of CTMCs with Uncertain Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LO","authors_text":"Marielle Stoelinga, Matthias Volk, Nils Jansen, Sebastian Junges, Thom S. Badings","submitted_at":"2022-05-17T12:56:51Z","abstract_excerpt":"We employ uncertain parametric CTMCs with parametric transition rates and a prior on the parameter values. The prior encodes uncertainty about the actual transition rates, while the parameters allow dependencies between transition rates. Sampling the parameter values from the prior distribution then yields a standard CTMC, for which we may compute relevant reachability probabilities. We provide a principled solution, based on a technique called scenario-optimization, to the following problem: From a finite set of parameter samples and a user-specified confidence level, compute prediction regio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08300","kind":"arxiv","version":3},"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/2205.08300/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2205.08300","created_at":"2026-07-05T05:23:09.434763+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.08300v3","created_at":"2026-07-05T05:23:09.434763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08300","created_at":"2026-07-05T05:23:09.434763+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEXKNEAZZKRM","created_at":"2026-07-05T05:23:09.434763+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEXKNEAZZKRMHPF2","created_at":"2026-07-05T05:23:09.434763+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEXKNEAZ","created_at":"2026-07-05T05:23:09.434763+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/DEXKNEAZZKRMHPF2VFYDWPGKNV","json":"https://pith.science/pith/DEXKNEAZZKRMHPF2VFYDWPGKNV.json","graph_json":"https://pith.science/api/pith-number/DEXKNEAZZKRMHPF2VFYDWPGKNV/graph.json","events_json":"https://pith.science/api/pith-number/DEXKNEAZZKRMHPF2VFYDWPGKNV/events.json","paper":"https://pith.science/paper/DEXKNEAZ"},"agent_actions":{"view_html":"https://pith.science/pith/DEXKNEAZZKRMHPF2VFYDWPGKNV","download_json":"https://pith.science/pith/DEXKNEAZZKRMHPF2VFYDWPGKNV.json","view_paper":"https://pith.science/paper/DEXKNEAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.08300&json=true","fetch_graph":"https://pith.science/api/pith-number/DEXKNEAZZKRMHPF2VFYDWPGKNV/graph.json","fetch_events":"https://pith.science/api/pith-number/DEXKNEAZZKRMHPF2VFYDWPGKNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEXKNEAZZKRMHPF2VFYDWPGKNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEXKNEAZZKRMHPF2VFYDWPGKNV/action/storage_attestation","attest_author":"https://pith.science/pith/DEXKNEAZZKRMHPF2VFYDWPGKNV/action/author_attestation","sign_citation":"https://pith.science/pith/DEXKNEAZZKRMHPF2VFYDWPGKNV/action/citation_signature","submit_replication":"https://pith.science/pith/DEXKNEAZZKRMHPF2VFYDWPGKNV/action/replication_record"}},"created_at":"2026-07-05T05:23:09.434763+00:00","updated_at":"2026-07-05T05:23:09.434763+00:00"}