{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JFMBWJLQ56T37HVZHB22JWTFWD","short_pith_number":"pith:JFMBWJLQ","schema_version":"1.0","canonical_sha256":"49581b2570efa7bf9eb93875a4da65b0ef91d0663aa810a9e83134cda3cd4726","source":{"kind":"arxiv","id":"2502.19388","version":1},"attestation_state":"computed","paper":{"title":"Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Francesca Randone, Joost-Pieter Katoen, Kevin Batz, Tobias Winkler","submitted_at":"2025-02-26T18:33:32Z","abstract_excerpt":"We lay out novel foundations for the computer-aided verification of guaranteed bounds on expected outcomes of imperative probabilistic programs featuring (i) general loops, (ii) continuous distributions, and (iii) conditioning. To handle loops we rely on user-provided quantitative invariants, as is well established. However, in the realm of continuous distributions, invariant verification becomes extremely challenging due to the presence of integrals in expectation-based program semantics. Our key idea is to soundly under- or over-approximate these integrals via Riemann sums. We show that this"},"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":"2502.19388","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-02-26T18:33:32Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"a653f92178321cbccb787e7e48a5d014f98e565e9da7795c539119112b5337ce","abstract_canon_sha256":"e0f6f084d610b488bea58c487b566f665d657065891c9c4215e934a39f9e5ea2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:31.391352Z","signature_b64":"T89zmjK6yT2OiKAbPlqdOw98WMd1z5fO6ZJPbDY+e6A9dwS7cwDW5M0yrjS/fWepS6D5SlsKw9NX+SuvnfHlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49581b2570efa7bf9eb93875a4da65b0ef91d0663aa810a9e83134cda3cd4726","last_reissued_at":"2026-07-05T10:20:31.390850Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:31.390850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Francesca Randone, Joost-Pieter Katoen, Kevin Batz, Tobias Winkler","submitted_at":"2025-02-26T18:33:32Z","abstract_excerpt":"We lay out novel foundations for the computer-aided verification of guaranteed bounds on expected outcomes of imperative probabilistic programs featuring (i) general loops, (ii) continuous distributions, and (iii) conditioning. To handle loops we rely on user-provided quantitative invariants, as is well established. However, in the realm of continuous distributions, invariant verification becomes extremely challenging due to the presence of integrals in expectation-based program semantics. Our key idea is to soundly under- or over-approximate these integrals via Riemann sums. We show that this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.19388","kind":"arxiv","version":1},"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/2502.19388/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":"2502.19388","created_at":"2026-07-05T10:20:31.390905+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.19388v1","created_at":"2026-07-05T10:20:31.390905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.19388","created_at":"2026-07-05T10:20:31.390905+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFMBWJLQ56T3","created_at":"2026-07-05T10:20:31.390905+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFMBWJLQ56T37HVZ","created_at":"2026-07-05T10:20:31.390905+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFMBWJLQ","created_at":"2026-07-05T10:20:31.390905+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/JFMBWJLQ56T37HVZHB22JWTFWD","json":"https://pith.science/pith/JFMBWJLQ56T37HVZHB22JWTFWD.json","graph_json":"https://pith.science/api/pith-number/JFMBWJLQ56T37HVZHB22JWTFWD/graph.json","events_json":"https://pith.science/api/pith-number/JFMBWJLQ56T37HVZHB22JWTFWD/events.json","paper":"https://pith.science/paper/JFMBWJLQ"},"agent_actions":{"view_html":"https://pith.science/pith/JFMBWJLQ56T37HVZHB22JWTFWD","download_json":"https://pith.science/pith/JFMBWJLQ56T37HVZHB22JWTFWD.json","view_paper":"https://pith.science/paper/JFMBWJLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.19388&json=true","fetch_graph":"https://pith.science/api/pith-number/JFMBWJLQ56T37HVZHB22JWTFWD/graph.json","fetch_events":"https://pith.science/api/pith-number/JFMBWJLQ56T37HVZHB22JWTFWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFMBWJLQ56T37HVZHB22JWTFWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFMBWJLQ56T37HVZHB22JWTFWD/action/storage_attestation","attest_author":"https://pith.science/pith/JFMBWJLQ56T37HVZHB22JWTFWD/action/author_attestation","sign_citation":"https://pith.science/pith/JFMBWJLQ56T37HVZHB22JWTFWD/action/citation_signature","submit_replication":"https://pith.science/pith/JFMBWJLQ56T37HVZHB22JWTFWD/action/replication_record"}},"created_at":"2026-07-05T10:20:31.390905+00:00","updated_at":"2026-07-05T10:20:31.390905+00:00"}