{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QERD4A7AYHVWYZ4MS6RYATJGWE","short_pith_number":"pith:QERD4A7A","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"},"canonical_sha256":"81223e03e0c1eb6c678c97a3804d26b109fb11aaa387282fff3f429f2bfcaa0e","source":{"kind":"arxiv","id":"1711.01863","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01863","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01863v2","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01863","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"QERD4A7AYHVW","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QERD4A7AYHVWYZ4M","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QERD4A7A","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QERD4A7AYHVWYZ4MS6RYATJGWE","target":"record","payload":{"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"},"canonical_sha256":"81223e03e0c1eb6c678c97a3804d26b109fb11aaa387282fff3f429f2bfcaa0e","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"},"source_kind":"arxiv","source_id":"1711.01863","source_version":2,"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-18T00:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N5mZ23rMJi0dHG6X59g0bPX8td/SnREq9J151r24XIv0p7yujk22x6n8zB8JoQv+ICdViyJSgVTH7fTeQKc8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:22:45.502094Z"},"content_sha256":"9878325261b7e42de7f8a52f981853a1e1468e479986fc254b07517264b3fc40","schema_version":"1.0","event_id":"sha256:9878325261b7e42de7f8a52f981853a1e1468e479986fc254b07517264b3fc40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QERD4A7AYHVWYZ4MS6RYATJGWE","target":"graph","payload":{"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"},"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-18T00:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/W9lZEO6VEuRCJal76LkJP7KcDYXeuikIsGRAUKBVjh9M/33WPZwYuLbNrIVGkaz8U5cIUpt1XJq5FzWnh9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:22:45.502465Z"},"content_sha256":"91421f36fc7a002f1265410b602c4f74a8cf35f16f4bfc10ea26dc12d198e885","schema_version":"1.0","event_id":"sha256:91421f36fc7a002f1265410b602c4f74a8cf35f16f4bfc10ea26dc12d198e885"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/bundle.json","state_url":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/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-28T06:22:45Z","links":{"resolver":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE","bundle":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/bundle.json","state":"https://pith.science/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QERD4A7AYHVWYZ4MS6RYATJGWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QERD4A7AYHVWYZ4MS6RYATJGWE","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":"3e43d393ed8cb97d9cf99ccc9a4f0e46d68234b80448ffb264ebe482c3de0dcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-06T12:44:18Z","title_canon_sha256":"00b28b68ec2e431110ffd91ed36879d60eeeded9b1a3b67c4b3781beddcc98ba"},"schema_version":"1.0","source":{"id":"1711.01863","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01863","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01863v2","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01863","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"QERD4A7AYHVW","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QERD4A7AYHVWYZ4M","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QERD4A7A","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:91421f36fc7a002f1265410b602c4f74a8cf35f16f4bfc10ea26dc12d198e885","target":"graph","created_at":"2026-05-18T00:13:47Z","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":"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 ","authors_text":"David Schnoerr, Dimitrios Milios, Guido Sanguinetti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-06T12:44:18Z","title":"Probabilistic Model Checking for Continuous Time Markov Chains via Sequential Bayesian Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01863","kind":"arxiv","version":2},"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:9878325261b7e42de7f8a52f981853a1e1468e479986fc254b07517264b3fc40","target":"record","created_at":"2026-05-18T00:13:47Z","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":"3e43d393ed8cb97d9cf99ccc9a4f0e46d68234b80448ffb264ebe482c3de0dcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-06T12:44:18Z","title_canon_sha256":"00b28b68ec2e431110ffd91ed36879d60eeeded9b1a3b67c4b3781beddcc98ba"},"schema_version":"1.0","source":{"id":"1711.01863","kind":"arxiv","version":2}},"canonical_sha256":"81223e03e0c1eb6c678c97a3804d26b109fb11aaa387282fff3f429f2bfcaa0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81223e03e0c1eb6c678c97a3804d26b109fb11aaa387282fff3f429f2bfcaa0e","first_computed_at":"2026-05-18T00:13:47.349253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:47.349253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iCFjdossAT3rIojhY3iPznWHVPbOgao3xE0vupNY2DguAN9ZwKChufc4ISz62MqJ2GpwPQ8/u2P2CMdbBj30AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:47.350081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01863","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9878325261b7e42de7f8a52f981853a1e1468e479986fc254b07517264b3fc40","sha256:91421f36fc7a002f1265410b602c4f74a8cf35f16f4bfc10ea26dc12d198e885"],"state_sha256":"310cd0775ec4c4ce2aa0612a64dba4d1128c81adbdf6ae31520d867165fb2eec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyfIAl5lYFAeSHz1tGPmSf3Awl2PKcTxybNoNHG5GsBC/fsixDmbjFlhp6MKErtuk/aMN3mQT7ldbaqVj54iCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:22:45.504512Z","bundle_sha256":"2f5a3f3603ccd09ab244f6ae220fee553e69a92728b4e1066e1d32f5d376acb7"}}