{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FSQBKACNHNY5F73T7VMH47KXYN","short_pith_number":"pith:FSQBKACN","schema_version":"1.0","canonical_sha256":"2ca015004d3b71d2ff73fd587e7d57c373214fd4310053373c3ebd60c2aa10f6","source":{"kind":"arxiv","id":"1204.2932","version":1},"attestation_state":"computed","paper":{"title":"Proving Termination of Probabilistic Programs Using Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Gaiser, Javier Esparza, Stefan Kiefer","submitted_at":"2012-04-13T09:41:08Z","abstract_excerpt":"Proving programs terminating is a fundamental computer science challenge. Recent research has produced powerful tools that can check a wide range of programs for termination. The analog for probabilistic programs, namely termination with probability one (\"almost-sure termination\"), is an equally important property for randomized algorithms and probabilistic protocols. We suggest a novel algorithm for proving almost-sure termination of probabilistic programs. Our algorithm exploits the power of state-of-the-art model checkers and termination provers for nonprobabilistic programs: it calls such "},"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":"1204.2932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-13T09:41:08Z","cross_cats_sorted":[],"title_canon_sha256":"84ed83580febc1077ecb9a01ce8b0ee07d38269425cc2264845dadae461ee7cd","abstract_canon_sha256":"6806a50bed1b5b628869daac1e0946c841f35f119f8c9e091c5b84e8260aa94c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:02.517311Z","signature_b64":"uPQqBDwgs4LcYkXIOT0YXLoecgcyCGUhM6DfOR3Z7dj/tZD46XvUEwh4iisX3/thgoB48l4eZGWmNfcE6I2YAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ca015004d3b71d2ff73fd587e7d57c373214fd4310053373c3ebd60c2aa10f6","last_reissued_at":"2026-05-18T03:58:02.516579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:02.516579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proving Termination of Probabilistic Programs Using Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Gaiser, Javier Esparza, Stefan Kiefer","submitted_at":"2012-04-13T09:41:08Z","abstract_excerpt":"Proving programs terminating is a fundamental computer science challenge. Recent research has produced powerful tools that can check a wide range of programs for termination. The analog for probabilistic programs, namely termination with probability one (\"almost-sure termination\"), is an equally important property for randomized algorithms and probabilistic protocols. We suggest a novel algorithm for proving almost-sure termination of probabilistic programs. Our algorithm exploits the power of state-of-the-art model checkers and termination provers for nonprobabilistic programs: it calls such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2932","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":""},"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":"1204.2932","created_at":"2026-05-18T03:58:02.516702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2932v1","created_at":"2026-05-18T03:58:02.516702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2932","created_at":"2026-05-18T03:58:02.516702+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSQBKACNHNY5","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSQBKACNHNY5F73T","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSQBKACN","created_at":"2026-05-18T12:27:06.952714+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/FSQBKACNHNY5F73T7VMH47KXYN","json":"https://pith.science/pith/FSQBKACNHNY5F73T7VMH47KXYN.json","graph_json":"https://pith.science/api/pith-number/FSQBKACNHNY5F73T7VMH47KXYN/graph.json","events_json":"https://pith.science/api/pith-number/FSQBKACNHNY5F73T7VMH47KXYN/events.json","paper":"https://pith.science/paper/FSQBKACN"},"agent_actions":{"view_html":"https://pith.science/pith/FSQBKACNHNY5F73T7VMH47KXYN","download_json":"https://pith.science/pith/FSQBKACNHNY5F73T7VMH47KXYN.json","view_paper":"https://pith.science/paper/FSQBKACN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2932&json=true","fetch_graph":"https://pith.science/api/pith-number/FSQBKACNHNY5F73T7VMH47KXYN/graph.json","fetch_events":"https://pith.science/api/pith-number/FSQBKACNHNY5F73T7VMH47KXYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSQBKACNHNY5F73T7VMH47KXYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSQBKACNHNY5F73T7VMH47KXYN/action/storage_attestation","attest_author":"https://pith.science/pith/FSQBKACNHNY5F73T7VMH47KXYN/action/author_attestation","sign_citation":"https://pith.science/pith/FSQBKACNHNY5F73T7VMH47KXYN/action/citation_signature","submit_replication":"https://pith.science/pith/FSQBKACNHNY5F73T7VMH47KXYN/action/replication_record"}},"created_at":"2026-05-18T03:58:02.516702+00:00","updated_at":"2026-05-18T03:58:02.516702+00:00"}