{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CZRWHPXMOOYPEFAFIZ24Z2XFTY","short_pith_number":"pith:CZRWHPXM","schema_version":"1.0","canonical_sha256":"166363beec73b0f214054675cceae59e0171a92699004b8e9521b64ea1d53c48","source":{"kind":"arxiv","id":"2404.05424","version":2},"attestation_state":"computed","paper":{"title":"What Are the Odds? Improving the foundations of Statistical Model Checking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.AI","authors_text":"Maximilian Weininger, Patrick Wienh\\\"oft, Tobias Meggendorfer","submitted_at":"2024-04-08T11:47:46Z","abstract_excerpt":"Markov decision processes (MDPs) are a fundamental model for decision making under uncertainty. They exhibit non-deterministic choice as well as probabilistic uncertainty. Traditionally, verification algorithms assume exact knowledge of the probabilities that govern the behaviour of an MDP. As this assumption is often unrealistic in practice, statistical model checking (SMC) was developed in the past two decades. It allows to analyse MDPs with unknown transition probabilities and provide probably approximately correct (PAC) guarantees on the result. Model-based SMC algorithms sample the MDP an"},"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":"2404.05424","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-04-08T11:47:46Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"cc6302ba97b0733fbbe9286bac6375a43c0df8643538885fe57674b8623c4fd3","abstract_canon_sha256":"5a4df01a47249fd52d81eca88b8a78af6011707d088b24484c02c978232e4ec6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:50:29.563098Z","signature_b64":"wwR3PG7Xt2wwi311V+AgtqOsA8UfyzJFhTWm9wKIRVZS5z9Ma7tReua3P0Vnn6Z6nuK9iu7bdsz3EL5XBZU9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"166363beec73b0f214054675cceae59e0171a92699004b8e9521b64ea1d53c48","last_reissued_at":"2026-07-05T10:50:29.562596Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:50:29.562596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What Are the Odds? Improving the foundations of Statistical Model Checking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.AI","authors_text":"Maximilian Weininger, Patrick Wienh\\\"oft, Tobias Meggendorfer","submitted_at":"2024-04-08T11:47:46Z","abstract_excerpt":"Markov decision processes (MDPs) are a fundamental model for decision making under uncertainty. They exhibit non-deterministic choice as well as probabilistic uncertainty. Traditionally, verification algorithms assume exact knowledge of the probabilities that govern the behaviour of an MDP. As this assumption is often unrealistic in practice, statistical model checking (SMC) was developed in the past two decades. It allows to analyse MDPs with unknown transition probabilities and provide probably approximately correct (PAC) guarantees on the result. Model-based SMC algorithms sample the MDP an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05424","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.05424/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":"2404.05424","created_at":"2026-07-05T10:50:29.562661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.05424v2","created_at":"2026-07-05T10:50:29.562661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05424","created_at":"2026-07-05T10:50:29.562661+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZRWHPXMOOYP","created_at":"2026-07-05T10:50:29.562661+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZRWHPXMOOYPEFAF","created_at":"2026-07-05T10:50:29.562661+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZRWHPXM","created_at":"2026-07-05T10:50:29.562661+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10293","citing_title":"Robust Probabilistic Shielding for Safe Offline Reinforcement Learning","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06087","citing_title":"Safety Certification is Classification","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CZRWHPXMOOYPEFAFIZ24Z2XFTY","json":"https://pith.science/pith/CZRWHPXMOOYPEFAFIZ24Z2XFTY.json","graph_json":"https://pith.science/api/pith-number/CZRWHPXMOOYPEFAFIZ24Z2XFTY/graph.json","events_json":"https://pith.science/api/pith-number/CZRWHPXMOOYPEFAFIZ24Z2XFTY/events.json","paper":"https://pith.science/paper/CZRWHPXM"},"agent_actions":{"view_html":"https://pith.science/pith/CZRWHPXMOOYPEFAFIZ24Z2XFTY","download_json":"https://pith.science/pith/CZRWHPXMOOYPEFAFIZ24Z2XFTY.json","view_paper":"https://pith.science/paper/CZRWHPXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.05424&json=true","fetch_graph":"https://pith.science/api/pith-number/CZRWHPXMOOYPEFAFIZ24Z2XFTY/graph.json","fetch_events":"https://pith.science/api/pith-number/CZRWHPXMOOYPEFAFIZ24Z2XFTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZRWHPXMOOYPEFAFIZ24Z2XFTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZRWHPXMOOYPEFAFIZ24Z2XFTY/action/storage_attestation","attest_author":"https://pith.science/pith/CZRWHPXMOOYPEFAFIZ24Z2XFTY/action/author_attestation","sign_citation":"https://pith.science/pith/CZRWHPXMOOYPEFAFIZ24Z2XFTY/action/citation_signature","submit_replication":"https://pith.science/pith/CZRWHPXMOOYPEFAFIZ24Z2XFTY/action/replication_record"}},"created_at":"2026-07-05T10:50:29.562661+00:00","updated_at":"2026-07-05T10:50:29.562661+00:00"}