{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QERD4A7AYHVWYZ4MS6RYATJGWE","short_pith_number":"pith:QERD4A7A","schema_version":"1.0","canonical_sha256":"81223e03e0c1eb6c678c97a3804d26b109fb11aaa387282fff3f429f2bfcaa0e","source":{"kind":"arxiv","id":"1711.01863","version":2},"attestation_state":"computed","paper":{"title":"Probabilistic Model Checking for Continuous Time Markov Chains via Sequential Bayesian Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Schnoerr, Dimitrios Milios, Guido Sanguinetti","submitted_at":"2017-11-06T12:44:18Z","abstract_excerpt":"Probabilistic model checking for systems with large or unbounded state space is a challenging computational problem in formal modelling and its applications. Numerical algorithms require an explicit representation of the state space, while statistical approaches require a large number of samples to estimate the desired properties with high confidence. Here, we show how model checking of time-bounded path properties can be recast exactly as a Bayesian inference problem. In this novel formulation the problem can be efficiently approximated using techniques from machine learning. Our approach is "},"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":"1711.01863","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-06T12:44:18Z","cross_cats_sorted":[],"title_canon_sha256":"00b28b68ec2e431110ffd91ed36879d60eeeded9b1a3b67c4b3781beddcc98ba","abstract_canon_sha256":"3e43d393ed8cb97d9cf99ccc9a4f0e46d68234b80448ffb264ebe482c3de0dcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:47.350081Z","signature_b64":"iCFjdossAT3rIojhY3iPznWHVPbOgao3xE0vupNY2DguAN9ZwKChufc4ISz62MqJ2GpwPQ8/u2P2CMdbBj30AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81223e03e0c1eb6c678c97a3804d26b109fb11aaa387282fff3f429f2bfcaa0e","last_reissued_at":"2026-05-18T00:13:47.349253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:47.349253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Model Checking for Continuous Time Markov Chains via Sequential Bayesian Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Schnoerr, Dimitrios Milios, Guido Sanguinetti","submitted_at":"2017-11-06T12:44:18Z","abstract_excerpt":"Probabilistic model checking for systems with large or unbounded state space is a challenging computational problem in formal modelling and its applications. Numerical algorithms require an explicit representation of the state space, while statistical approaches require a large number of samples to estimate the desired properties with high confidence. Here, we show how model checking of time-bounded path properties can be recast exactly as a Bayesian inference problem. In this novel formulation the problem can be efficiently approximated using techniques from machine learning. Our approach is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01863","kind":"arxiv","version":2},"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":"1711.01863","created_at":"2026-05-18T00:13:47.349405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01863v2","created_at":"2026-05-18T00:13:47.349405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01863","created_at":"2026-05-18T00:13:47.349405+00:00"},{"alias_kind":"pith_short_12","alias_value":"QERD4A7AYHVW","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QERD4A7AYHVWYZ4M","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QERD4A7A","created_at":"2026-05-18T12:31:37.085036+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/QERD4A7AYHVWYZ4MS6RYATJGWE","json":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE.json","graph_json":"https://pith.science/api/pith-number/QERD4A7AYHVWYZ4MS6RYATJGWE/graph.json","events_json":"https://pith.science/api/pith-number/QERD4A7AYHVWYZ4MS6RYATJGWE/events.json","paper":"https://pith.science/paper/QERD4A7A"},"agent_actions":{"view_html":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE","download_json":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE.json","view_paper":"https://pith.science/paper/QERD4A7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01863&json=true","fetch_graph":"https://pith.science/api/pith-number/QERD4A7AYHVWYZ4MS6RYATJGWE/graph.json","fetch_events":"https://pith.science/api/pith-number/QERD4A7AYHVWYZ4MS6RYATJGWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/action/storage_attestation","attest_author":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/action/author_attestation","sign_citation":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/action/citation_signature","submit_replication":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/action/replication_record"}},"created_at":"2026-05-18T00:13:47.349405+00:00","updated_at":"2026-05-18T00:13:47.349405+00:00"}