{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BXYKIGVT3KMBXXSZFRUF3Z6KZ2","short_pith_number":"pith:BXYKIGVT","schema_version":"1.0","canonical_sha256":"0df0a41ab3da981bde592c685de7caceb63e63ded25655cec983d508220c8b10","source":{"kind":"arxiv","id":"1410.7225","version":1},"attestation_state":"computed","paper":{"title":"Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Benjamin Lucien Kaminski, Joost-Pieter Katoen","submitted_at":"2014-10-27T13:31:45Z","abstract_excerpt":"This paper considers the computational hardness of computing expected outcomes and deciding almost-sure termination of probabilistic programs. We show that deciding almost-sure termination and deciding whether the expected outcome of a program equals a given rational value is $\\Pi^0_2$-complete. Computing lower and upper bounds on the expected outcome is shown to be recursively enumerable and $\\Sigma^0_2$-complete, respectively."},"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":"1410.7225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-27T13:31:45Z","cross_cats_sorted":[],"title_canon_sha256":"4c0fe5434122b2ecd3234efd53a8aeb413b78eb7c645ec9a9d62ccd80204b6be","abstract_canon_sha256":"973a392c09a74b3e8a3cf09d4bad47e84c6fdb20381225896367171635046881"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:17.781338Z","signature_b64":"E7eO0w3jdJgEJjPdftYkZMVTasdPsFgYxPTJzg2spKXd4ZCwscfIeUe7tmzQ06qjqso7kM5OWrar1/p7f63nCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0df0a41ab3da981bde592c685de7caceb63e63ded25655cec983d508220c8b10","last_reissued_at":"2026-05-18T02:39:17.780842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:17.780842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Benjamin Lucien Kaminski, Joost-Pieter Katoen","submitted_at":"2014-10-27T13:31:45Z","abstract_excerpt":"This paper considers the computational hardness of computing expected outcomes and deciding almost-sure termination of probabilistic programs. We show that deciding almost-sure termination and deciding whether the expected outcome of a program equals a given rational value is $\\Pi^0_2$-complete. Computing lower and upper bounds on the expected outcome is shown to be recursively enumerable and $\\Sigma^0_2$-complete, respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7225","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":"1410.7225","created_at":"2026-05-18T02:39:17.780916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7225v1","created_at":"2026-05-18T02:39:17.780916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7225","created_at":"2026-05-18T02:39:17.780916+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXYKIGVT3KMB","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXYKIGVT3KMBXXSZ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXYKIGVT","created_at":"2026-05-18T12:28:22.404517+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/BXYKIGVT3KMBXXSZFRUF3Z6KZ2","json":"https://pith.science/pith/BXYKIGVT3KMBXXSZFRUF3Z6KZ2.json","graph_json":"https://pith.science/api/pith-number/BXYKIGVT3KMBXXSZFRUF3Z6KZ2/graph.json","events_json":"https://pith.science/api/pith-number/BXYKIGVT3KMBXXSZFRUF3Z6KZ2/events.json","paper":"https://pith.science/paper/BXYKIGVT"},"agent_actions":{"view_html":"https://pith.science/pith/BXYKIGVT3KMBXXSZFRUF3Z6KZ2","download_json":"https://pith.science/pith/BXYKIGVT3KMBXXSZFRUF3Z6KZ2.json","view_paper":"https://pith.science/paper/BXYKIGVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7225&json=true","fetch_graph":"https://pith.science/api/pith-number/BXYKIGVT3KMBXXSZFRUF3Z6KZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/BXYKIGVT3KMBXXSZFRUF3Z6KZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXYKIGVT3KMBXXSZFRUF3Z6KZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXYKIGVT3KMBXXSZFRUF3Z6KZ2/action/storage_attestation","attest_author":"https://pith.science/pith/BXYKIGVT3KMBXXSZFRUF3Z6KZ2/action/author_attestation","sign_citation":"https://pith.science/pith/BXYKIGVT3KMBXXSZFRUF3Z6KZ2/action/citation_signature","submit_replication":"https://pith.science/pith/BXYKIGVT3KMBXXSZFRUF3Z6KZ2/action/replication_record"}},"created_at":"2026-05-18T02:39:17.780916+00:00","updated_at":"2026-05-18T02:39:17.780916+00:00"}