{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ABLKV5WOJZFJJO6FJCZHTZ2CVA","short_pith_number":"pith:ABLKV5WO","schema_version":"1.0","canonical_sha256":"0056aaf6ce4e4a94bbc548b279e742a81d2364e3d4ce0a2ca7107485d5393d20","source":{"kind":"arxiv","id":"1806.06683","version":2},"attestation_state":"computed","paper":{"title":"New Approaches for Almost-Sure Termination of Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hongfei Fu, Krishnendu Chatterjee, Mingzhang Huang","submitted_at":"2018-06-14T05:42:18Z","abstract_excerpt":"We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover, using this approach we can obtain explicit optimal bounds on tail probabilities of non-termination within a given number of steps. Second, we present a new approach based on Central Limit Theorem for the almost-sure termination problem, and show that this approach can establish almost-sure termination of programs which none of the existing approaches can hand"},"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":"1806.06683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-14T05:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"69c3444d4ac12933b395edc17d51d52a80e622c7b0e11f2e9c172e5a549d24df","abstract_canon_sha256":"4f6b5fe1ea0dbc62473d6c9b83b16ce0875e8f8d4be6bc29f0521cc2fbce9afc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:27.505851Z","signature_b64":"Pt8P4M7aWjoD+EiP3W0KMrJ/OPWChQ+a8l2IfCTU4vLgBWuAKgWUHSdl/z6e6K0kokTUvIvdqUZ9+qy3ZInCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0056aaf6ce4e4a94bbc548b279e742a81d2364e3d4ce0a2ca7107485d5393d20","last_reissued_at":"2026-05-18T00:07:27.505358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:27.505358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Approaches for Almost-Sure Termination of Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hongfei Fu, Krishnendu Chatterjee, Mingzhang Huang","submitted_at":"2018-06-14T05:42:18Z","abstract_excerpt":"We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover, using this approach we can obtain explicit optimal bounds on tail probabilities of non-termination within a given number of steps. Second, we present a new approach based on Central Limit Theorem for the almost-sure termination problem, and show that this approach can establish almost-sure termination of programs which none of the existing approaches can hand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06683","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":"1806.06683","created_at":"2026-05-18T00:07:27.505427+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.06683v2","created_at":"2026-05-18T00:07:27.505427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06683","created_at":"2026-05-18T00:07:27.505427+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABLKV5WOJZFJ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABLKV5WOJZFJJO6F","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABLKV5WO","created_at":"2026-05-18T12:32:13.499390+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/ABLKV5WOJZFJJO6FJCZHTZ2CVA","json":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA.json","graph_json":"https://pith.science/api/pith-number/ABLKV5WOJZFJJO6FJCZHTZ2CVA/graph.json","events_json":"https://pith.science/api/pith-number/ABLKV5WOJZFJJO6FJCZHTZ2CVA/events.json","paper":"https://pith.science/paper/ABLKV5WO"},"agent_actions":{"view_html":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA","download_json":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA.json","view_paper":"https://pith.science/paper/ABLKV5WO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.06683&json=true","fetch_graph":"https://pith.science/api/pith-number/ABLKV5WOJZFJJO6FJCZHTZ2CVA/graph.json","fetch_events":"https://pith.science/api/pith-number/ABLKV5WOJZFJJO6FJCZHTZ2CVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/action/storage_attestation","attest_author":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/action/author_attestation","sign_citation":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/action/citation_signature","submit_replication":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/action/replication_record"}},"created_at":"2026-05-18T00:07:27.505427+00:00","updated_at":"2026-05-18T00:07:27.505427+00:00"}