{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OWZ53ZZHLIN3IB2UOWSTLWYIMW","short_pith_number":"pith:OWZ53ZZH","schema_version":"1.0","canonical_sha256":"75b3dde7275a1bb4075475a535db086591f25214b1c67be7de033079fc06bc75","source":{"kind":"arxiv","id":"1605.04477","version":2},"attestation_state":"computed","paper":{"title":"Bounded Model Checking for Probabilistic Programs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Benjamin Lucien Kaminski, Christian Dehnert, Joost-Pieter Katoen, Lukas Westhofen, Nils Jansen","submitted_at":"2016-05-14T22:34:59Z","abstract_excerpt":"In this paper we investigate the applicability of standard model checking approaches to verifying properties in probabilistic programming. As the operational model for a standard probabilistic program is a potentially infinite parametric Markov decision process, no direct adaption of existing techniques is possible. Therefore, we propose an on-the-fly approach where the operational model is successively created and verified via a step-wise execution of the program. This approach enables to take key features of many probabilistic programs into account: nondeterminism and conditioning. We discus"},"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":"1605.04477","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2016-05-14T22:34:59Z","cross_cats_sorted":[],"title_canon_sha256":"b105abc6f57e0d0ade468eb0b629d115a73acfe5aedb28354104b654a4493a14","abstract_canon_sha256":"2388996a9395c7a79e2787a733071ea988661c8b183d67b0386e9b9a7bb18704"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:23.259513Z","signature_b64":"1Ws5UlgfkxL6RrTBxwb19WKtBqD8J6di1o2biRA+TQAguM6ZYf6D4LGyLhr6owoKm6gFSRWPUFlbzNbDiGiACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b3dde7275a1bb4075475a535db086591f25214b1c67be7de033079fc06bc75","last_reissued_at":"2026-05-18T01:10:23.258959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:23.258959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Model Checking for Probabilistic Programs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Benjamin Lucien Kaminski, Christian Dehnert, Joost-Pieter Katoen, Lukas Westhofen, Nils Jansen","submitted_at":"2016-05-14T22:34:59Z","abstract_excerpt":"In this paper we investigate the applicability of standard model checking approaches to verifying properties in probabilistic programming. As the operational model for a standard probabilistic program is a potentially infinite parametric Markov decision process, no direct adaption of existing techniques is possible. Therefore, we propose an on-the-fly approach where the operational model is successively created and verified via a step-wise execution of the program. This approach enables to take key features of many probabilistic programs into account: nondeterminism and conditioning. We discus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04477","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":"1605.04477","created_at":"2026-05-18T01:10:23.259037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04477v2","created_at":"2026-05-18T01:10:23.259037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04477","created_at":"2026-05-18T01:10:23.259037+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWZ53ZZHLIN3","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWZ53ZZHLIN3IB2U","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWZ53ZZH","created_at":"2026-05-18T12:30:36.002864+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/OWZ53ZZHLIN3IB2UOWSTLWYIMW","json":"https://pith.science/pith/OWZ53ZZHLIN3IB2UOWSTLWYIMW.json","graph_json":"https://pith.science/api/pith-number/OWZ53ZZHLIN3IB2UOWSTLWYIMW/graph.json","events_json":"https://pith.science/api/pith-number/OWZ53ZZHLIN3IB2UOWSTLWYIMW/events.json","paper":"https://pith.science/paper/OWZ53ZZH"},"agent_actions":{"view_html":"https://pith.science/pith/OWZ53ZZHLIN3IB2UOWSTLWYIMW","download_json":"https://pith.science/pith/OWZ53ZZHLIN3IB2UOWSTLWYIMW.json","view_paper":"https://pith.science/paper/OWZ53ZZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04477&json=true","fetch_graph":"https://pith.science/api/pith-number/OWZ53ZZHLIN3IB2UOWSTLWYIMW/graph.json","fetch_events":"https://pith.science/api/pith-number/OWZ53ZZHLIN3IB2UOWSTLWYIMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWZ53ZZHLIN3IB2UOWSTLWYIMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWZ53ZZHLIN3IB2UOWSTLWYIMW/action/storage_attestation","attest_author":"https://pith.science/pith/OWZ53ZZHLIN3IB2UOWSTLWYIMW/action/author_attestation","sign_citation":"https://pith.science/pith/OWZ53ZZHLIN3IB2UOWSTLWYIMW/action/citation_signature","submit_replication":"https://pith.science/pith/OWZ53ZZHLIN3IB2UOWSTLWYIMW/action/replication_record"}},"created_at":"2026-05-18T01:10:23.259037+00:00","updated_at":"2026-05-18T01:10:23.259037+00:00"}