{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4K5EOCDJDE3JZZPICUOPDKJELE","short_pith_number":"pith:4K5EOCDJ","schema_version":"1.0","canonical_sha256":"e2ba47086919369ce5e8151cf1a92459374c6bb5ee9b676c5db0a9591cf9a606","source":{"kind":"arxiv","id":"1506.01930","version":1},"attestation_state":"computed","paper":{"title":"On the Hardness of Almost-Sure Termination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Benjamin Lucien Kaminski, Joost-Pieter Katoen","submitted_at":"2015-06-05T14:52:51Z","abstract_excerpt":"This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is $\\Sigma_1^0$- and $\\Sigma_2^0$-complete, respectively. Deciding (universal) almost-sure termination as well as deciding whether the expected outcome of a program equals a given rational value is shown to be $\\Pi^0_2$-complete. Finally, it is shown that deciding (universal) positive almost-sure termination is $\\Sigma_2^0$-complete ($\\Pi_3^0$-complete)."},"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":"1506.01930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-05T14:52:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f561696590e29e441f395522c61c25a0bcadcd0dcfe46dd0cb8adb1f9b860acf","abstract_canon_sha256":"19a1972d364d397f306a11a93e6fbebc7e6ac5264ecce92ead297cbde5b6a9c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:58.898986Z","signature_b64":"YWMA1kaRnp//HqyEcdCbOpUh8O52abSdZR3+rKIRfX+d17+JouD4WKEDA4RDwFwUwuYUEvvi6lU77BPlO/j7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2ba47086919369ce5e8151cf1a92459374c6bb5ee9b676c5db0a9591cf9a606","last_reissued_at":"2026-05-18T01:55:58.898600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:58.898600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Hardness of Almost-Sure Termination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Benjamin Lucien Kaminski, Joost-Pieter Katoen","submitted_at":"2015-06-05T14:52:51Z","abstract_excerpt":"This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is $\\Sigma_1^0$- and $\\Sigma_2^0$-complete, respectively. Deciding (universal) almost-sure termination as well as deciding whether the expected outcome of a program equals a given rational value is shown to be $\\Pi^0_2$-complete. Finally, it is shown that deciding (universal) positive almost-sure termination is $\\Sigma_2^0$-complete ($\\Pi_3^0$-complete)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01930","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":"1506.01930","created_at":"2026-05-18T01:55:58.898657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01930v1","created_at":"2026-05-18T01:55:58.898657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01930","created_at":"2026-05-18T01:55:58.898657+00:00"},{"alias_kind":"pith_short_12","alias_value":"4K5EOCDJDE3J","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4K5EOCDJDE3JZZPI","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4K5EOCDJ","created_at":"2026-05-18T12:29:05.191682+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/4K5EOCDJDE3JZZPICUOPDKJELE","json":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE.json","graph_json":"https://pith.science/api/pith-number/4K5EOCDJDE3JZZPICUOPDKJELE/graph.json","events_json":"https://pith.science/api/pith-number/4K5EOCDJDE3JZZPICUOPDKJELE/events.json","paper":"https://pith.science/paper/4K5EOCDJ"},"agent_actions":{"view_html":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE","download_json":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE.json","view_paper":"https://pith.science/paper/4K5EOCDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01930&json=true","fetch_graph":"https://pith.science/api/pith-number/4K5EOCDJDE3JZZPICUOPDKJELE/graph.json","fetch_events":"https://pith.science/api/pith-number/4K5EOCDJDE3JZZPICUOPDKJELE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE/action/storage_attestation","attest_author":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE/action/author_attestation","sign_citation":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE/action/citation_signature","submit_replication":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE/action/replication_record"}},"created_at":"2026-05-18T01:55:58.898657+00:00","updated_at":"2026-05-18T01:55:58.898657+00:00"}