{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SYT2LF5YAKKVWDAVOVAMVPRYT6","short_pith_number":"pith:SYT2LF5Y","schema_version":"1.0","canonical_sha256":"9627a597b802955b0c157540cabe389fbc0a1f69fb85bd8eca61c04eb7753af7","source":{"kind":"arxiv","id":"2606.15043","version":2},"attestation_state":"computed","paper":{"title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Daniel Basg\\\"oze, Joost-Pieter Katoen, Kevin Batz, Sebastian Junges","submitted_at":"2026-06-13T01:02:26Z","abstract_excerpt":"Weakest pre-expectations are the probabilistic program analogue to weakest preconditions in classical programs. Deductive verification approaches aim to establish bounds on these quantitative expectations. Their automation has been successful in analysing a variety of discrete probabilistic programs. Key routines in that automation require reasoning about (partially unrolled) loops, however, the logical representation of weakest pre-expectations on such unrollings often explodes. In this paper, we develop typed extended decision diagrams (TEDDs), inspired by various extensions to binary decisi"},"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":"2606.15043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-06-13T01:02:26Z","cross_cats_sorted":[],"title_canon_sha256":"ae1f317e4be8c9e0d97d3a9d694eb0780c65ca40c5693e729c43f1ea57aee998","abstract_canon_sha256":"df6abefdb86d57d119fb5450941e45032efa8d1e8cd297178aa960e3899544a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:01.092818Z","signature_b64":"GM7ZiB8gGFHBn7Em6BB4TjQAlGd67Myd3OBuKJt7uSIZqmU/TijM/3X2VOorSAl10micT6alRIrjmlFSHaxZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9627a597b802955b0c157540cabe389fbc0a1f69fb85bd8eca61c04eb7753af7","last_reissued_at":"2026-06-19T16:10:01.092413Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:01.092413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Daniel Basg\\\"oze, Joost-Pieter Katoen, Kevin Batz, Sebastian Junges","submitted_at":"2026-06-13T01:02:26Z","abstract_excerpt":"Weakest pre-expectations are the probabilistic program analogue to weakest preconditions in classical programs. Deductive verification approaches aim to establish bounds on these quantitative expectations. Their automation has been successful in analysing a variety of discrete probabilistic programs. Key routines in that automation require reasoning about (partially unrolled) loops, however, the logical representation of weakest pre-expectations on such unrollings often explodes. In this paper, we develop typed extended decision diagrams (TEDDs), inspired by various extensions to binary decisi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.15043","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/2606.15043/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":"2606.15043","created_at":"2026-06-19T16:10:01.092477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.15043v2","created_at":"2026-06-19T16:10:01.092477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.15043","created_at":"2026-06-19T16:10:01.092477+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYT2LF5YAKKV","created_at":"2026-06-19T16:10:01.092477+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYT2LF5YAKKVWDAV","created_at":"2026-06-19T16:10:01.092477+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYT2LF5Y","created_at":"2026-06-19T16:10:01.092477+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/SYT2LF5YAKKVWDAVOVAMVPRYT6","json":"https://pith.science/pith/SYT2LF5YAKKVWDAVOVAMVPRYT6.json","graph_json":"https://pith.science/api/pith-number/SYT2LF5YAKKVWDAVOVAMVPRYT6/graph.json","events_json":"https://pith.science/api/pith-number/SYT2LF5YAKKVWDAVOVAMVPRYT6/events.json","paper":"https://pith.science/paper/SYT2LF5Y"},"agent_actions":{"view_html":"https://pith.science/pith/SYT2LF5YAKKVWDAVOVAMVPRYT6","download_json":"https://pith.science/pith/SYT2LF5YAKKVWDAVOVAMVPRYT6.json","view_paper":"https://pith.science/paper/SYT2LF5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.15043&json=true","fetch_graph":"https://pith.science/api/pith-number/SYT2LF5YAKKVWDAVOVAMVPRYT6/graph.json","fetch_events":"https://pith.science/api/pith-number/SYT2LF5YAKKVWDAVOVAMVPRYT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYT2LF5YAKKVWDAVOVAMVPRYT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYT2LF5YAKKVWDAVOVAMVPRYT6/action/storage_attestation","attest_author":"https://pith.science/pith/SYT2LF5YAKKVWDAVOVAMVPRYT6/action/author_attestation","sign_citation":"https://pith.science/pith/SYT2LF5YAKKVWDAVOVAMVPRYT6/action/citation_signature","submit_replication":"https://pith.science/pith/SYT2LF5YAKKVWDAVOVAMVPRYT6/action/replication_record"}},"created_at":"2026-06-19T16:10:01.092477+00:00","updated_at":"2026-06-19T16:10:01.092477+00:00"}