{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4K5EOCDJDE3JZZPICUOPDKJELE","short_pith_number":"pith:4K5EOCDJ","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"},"canonical_sha256":"e2ba47086919369ce5e8151cf1a92459374c6bb5ee9b676c5db0a9591cf9a606","source":{"kind":"arxiv","id":"1506.01930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01930","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01930v1","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01930","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"4K5EOCDJDE3J","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4K5EOCDJDE3JZZPI","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4K5EOCDJ","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4K5EOCDJDE3JZZPICUOPDKJELE","target":"record","payload":{"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"},"canonical_sha256":"e2ba47086919369ce5e8151cf1a92459374c6bb5ee9b676c5db0a9591cf9a606","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"},"source_kind":"arxiv","source_id":"1506.01930","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUTKBE+3+dSoE2Utw+mqpyVFUa5+mZgx0A7m2lLsUY0WiD1W8cRp8j3HUgPHkC/l5P5Hf8vrZwM+i/QKMy+tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:42:38.738965Z"},"content_sha256":"defafa881dedd928448f9eca2e01f7c9a1464de72ff5a1768afe410883f5d689","schema_version":"1.0","event_id":"sha256:defafa881dedd928448f9eca2e01f7c9a1464de72ff5a1768afe410883f5d689"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4K5EOCDJDE3JZZPICUOPDKJELE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rL6vFr7/Gzvtm6+Nuz9odsw9oiXDsEljvi/Fir70Yt8eIhfEhEBMT1pKe9blYpLq5Pk5WFoZz4fetcVd9ChNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:42:38.739349Z"},"content_sha256":"96e757e09f85ab2bd0f651630d19eb8145cc1c3add34fe65823badbe668e0d0d","schema_version":"1.0","event_id":"sha256:96e757e09f85ab2bd0f651630d19eb8145cc1c3add34fe65823badbe668e0d0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE/bundle.json","state_url":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4K5EOCDJDE3JZZPICUOPDKJELE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T02:42:38Z","links":{"resolver":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE","bundle":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE/bundle.json","state":"https://pith.science/pith/4K5EOCDJDE3JZZPICUOPDKJELE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4K5EOCDJDE3JZZPICUOPDKJELE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4K5EOCDJDE3JZZPICUOPDKJELE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"19a1972d364d397f306a11a93e6fbebc7e6ac5264ecce92ead297cbde5b6a9c4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-05T14:52:51Z","title_canon_sha256":"f561696590e29e441f395522c61c25a0bcadcd0dcfe46dd0cb8adb1f9b860acf"},"schema_version":"1.0","source":{"id":"1506.01930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01930","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01930v1","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01930","created_at":"2026-05-18T01:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"4K5EOCDJDE3J","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4K5EOCDJDE3JZZPI","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4K5EOCDJ","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:96e757e09f85ab2bd0f651630d19eb8145cc1c3add34fe65823badbe668e0d0d","target":"graph","created_at":"2026-05-18T01:55:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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).","authors_text":"Benjamin Lucien Kaminski, Joost-Pieter Katoen","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-05T14:52:51Z","title":"On the Hardness of Almost-Sure Termination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01930","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:defafa881dedd928448f9eca2e01f7c9a1464de72ff5a1768afe410883f5d689","target":"record","created_at":"2026-05-18T01:55:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"19a1972d364d397f306a11a93e6fbebc7e6ac5264ecce92ead297cbde5b6a9c4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-05T14:52:51Z","title_canon_sha256":"f561696590e29e441f395522c61c25a0bcadcd0dcfe46dd0cb8adb1f9b860acf"},"schema_version":"1.0","source":{"id":"1506.01930","kind":"arxiv","version":1}},"canonical_sha256":"e2ba47086919369ce5e8151cf1a92459374c6bb5ee9b676c5db0a9591cf9a606","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2ba47086919369ce5e8151cf1a92459374c6bb5ee9b676c5db0a9591cf9a606","first_computed_at":"2026-05-18T01:55:58.898600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:58.898600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YWMA1kaRnp//HqyEcdCbOpUh8O52abSdZR3+rKIRfX+d17+JouD4WKEDA4RDwFwUwuYUEvvi6lU77BPlO/j7Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:58.898986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:defafa881dedd928448f9eca2e01f7c9a1464de72ff5a1768afe410883f5d689","sha256:96e757e09f85ab2bd0f651630d19eb8145cc1c3add34fe65823badbe668e0d0d"],"state_sha256":"693b9dfa434e35ccf4e4866c11ac7e9752ac9dabddefefe66e2fd151bfb9aac1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8I0N9puyM4J3fOyRHY3dKqjvVLK+hR6y7lspA0rRBW2ADbfVRDtWXto6UCdPV0lbfupKl6g0gryyBjhIMX4yBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T02:42:38.741410Z","bundle_sha256":"a682a2906bcdb6abfa9b5d69e160b984813eb4002506f312adc6b063d0ced1d9"}}