{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IGNEKWS5JHL4MFSDV5QT3B74CH","short_pith_number":"pith:IGNEKWS5","schema_version":"1.0","canonical_sha256":"419a455a5d49d7c61643af613d87fc11c6e854bb45a5e337370e6a30237e914c","source":{"kind":"arxiv","id":"2302.06082","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for Possibly Divergent Probabilistic Programs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.LO","authors_text":"Benjamin Lucien Kaminski, Han Su, Joost-Pieter Katoen, Mingshuai Chen, Naijun Zhan, Shenghua Feng","submitted_at":"2023-02-13T03:39:45Z","abstract_excerpt":"We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish non-trivial lower bounds on, e.g., termination probabilities and expected values, for possibly divergent probabilistic loops, e.g., the well-known three-dimensional random walk on a lattice."},"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":"2302.06082","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2023-02-13T03:39:45Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"23f3b7f5e45b3b9ad2b4cb6a4bf2ac9e344d5ec47d3a43c1f02f37307d045f26","abstract_canon_sha256":"5c5f2178bd0f6bd5c25bdfed1e050575a8075255268b36e9ce35dff97a47eea3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:41:01.802612Z","signature_b64":"Hq/fjOFRNhu+eOehCgBDGrvZX6mUekK3JZRYOSJ6gAjARnZXIGQ+5SFUX81CgCiJ0POG2gqdMRzmrQPB8eGqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"419a455a5d49d7c61643af613d87fc11c6e854bb45a5e337370e6a30237e914c","last_reissued_at":"2026-07-05T05:41:01.802189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:41:01.802189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Possibly Divergent Probabilistic Programs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.LO","authors_text":"Benjamin Lucien Kaminski, Han Su, Joost-Pieter Katoen, Mingshuai Chen, Naijun Zhan, Shenghua Feng","submitted_at":"2023-02-13T03:39:45Z","abstract_excerpt":"We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish non-trivial lower bounds on, e.g., termination probabilities and expected values, for possibly divergent probabilistic loops, e.g., the well-known three-dimensional random walk on a lattice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06082","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/2302.06082/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":"2302.06082","created_at":"2026-07-05T05:41:01.802247+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06082v1","created_at":"2026-07-05T05:41:01.802247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06082","created_at":"2026-07-05T05:41:01.802247+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGNEKWS5JHL4","created_at":"2026-07-05T05:41:01.802247+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGNEKWS5JHL4MFSD","created_at":"2026-07-05T05:41:01.802247+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGNEKWS5","created_at":"2026-07-05T05:41:01.802247+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/IGNEKWS5JHL4MFSDV5QT3B74CH","json":"https://pith.science/pith/IGNEKWS5JHL4MFSDV5QT3B74CH.json","graph_json":"https://pith.science/api/pith-number/IGNEKWS5JHL4MFSDV5QT3B74CH/graph.json","events_json":"https://pith.science/api/pith-number/IGNEKWS5JHL4MFSDV5QT3B74CH/events.json","paper":"https://pith.science/paper/IGNEKWS5"},"agent_actions":{"view_html":"https://pith.science/pith/IGNEKWS5JHL4MFSDV5QT3B74CH","download_json":"https://pith.science/pith/IGNEKWS5JHL4MFSDV5QT3B74CH.json","view_paper":"https://pith.science/paper/IGNEKWS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06082&json=true","fetch_graph":"https://pith.science/api/pith-number/IGNEKWS5JHL4MFSDV5QT3B74CH/graph.json","fetch_events":"https://pith.science/api/pith-number/IGNEKWS5JHL4MFSDV5QT3B74CH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGNEKWS5JHL4MFSDV5QT3B74CH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGNEKWS5JHL4MFSDV5QT3B74CH/action/storage_attestation","attest_author":"https://pith.science/pith/IGNEKWS5JHL4MFSDV5QT3B74CH/action/author_attestation","sign_citation":"https://pith.science/pith/IGNEKWS5JHL4MFSDV5QT3B74CH/action/citation_signature","submit_replication":"https://pith.science/pith/IGNEKWS5JHL4MFSDV5QT3B74CH/action/replication_record"}},"created_at":"2026-07-05T05:41:01.802247+00:00","updated_at":"2026-07-05T05:41:01.802247+00:00"}