{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PHBUNOVM6MOEFLJNXMFTA5DX64","short_pith_number":"pith:PHBUNOVM","canonical_record":{"source":{"id":"1612.01091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-04T09:38:56Z","cross_cats_sorted":[],"title_canon_sha256":"82967028d2b347173385ce91b03b31c2398470be196aeffca75258832ee35952","abstract_canon_sha256":"16db3b9c9f5e0f8ad0e519ffba261f6a90f9997dbd0be39a85a7d4f1de99674f"},"schema_version":"1.0"},"canonical_sha256":"79c346baacf31c42ad2dbb0b307477f721a44ab11c0da40cdae1fa48d6a2f860","source":{"kind":"arxiv","id":"1612.01091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01091","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01091v2","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01091","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"PHBUNOVM6MOE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PHBUNOVM6MOEFLJN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PHBUNOVM","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PHBUNOVM6MOEFLJNXMFTA5DX64","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-04T09:38:56Z","cross_cats_sorted":[],"title_canon_sha256":"82967028d2b347173385ce91b03b31c2398470be196aeffca75258832ee35952","abstract_canon_sha256":"16db3b9c9f5e0f8ad0e519ffba261f6a90f9997dbd0be39a85a7d4f1de99674f"},"schema_version":"1.0"},"canonical_sha256":"79c346baacf31c42ad2dbb0b307477f721a44ab11c0da40cdae1fa48d6a2f860","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:17.038823Z","signature_b64":"9jAWItcCPY0WjLGYLt7+chqG1FKjWwfoFHuEbfKK0/wXDq9DvjkNQsS6xV/H8egY+3lNEtaaiUIAHd8C9bQeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79c346baacf31c42ad2dbb0b307477f721a44ab11c0da40cdae1fa48d6a2f860","last_reissued_at":"2026-05-18T00:53:17.038180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:17.038180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01091","source_version":2,"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-18T00:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOVm8jBjVlNz07pkn56BOAoOK8fB8ztemns4C9xTkiwy4iKgbZEmj268e/SS35ls2L0PmBaX5HkiinoQJH6QAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:48:00.270203Z"},"content_sha256":"71adad5f4635d0bba2e3362d563f42f5f238fc6cffc205ceb99a41c4e026bc13","schema_version":"1.0","event_id":"sha256:71adad5f4635d0bba2e3362d563f42f5f238fc6cffc205ceb99a41c4e026bc13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PHBUNOVM6MOEFLJNXMFTA5DX64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new rule for almost-certain termination of probabilistic- and demonic programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Annabelle McIver, Carroll Morgan","submitted_at":"2016-12-04T09:38:56Z","abstract_excerpt":"Extending our own and others' earlier approaches to reasoning about termination of probabilistic programs, we propose and prove a new rule for termination with probability one, also known as \"almost-certain termination\". The rule uses both (non-strict) super martingales and guarantees of progress, together, and it seems to cover significant cases that earlier methods do not. In particular, it suffices for termination of the unbounded symmetric random walk in both one- and two dimensions: for the first, we give a proof; for the second, we use a theorem of Foster to argue that a proof exists. No"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01091","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"},"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-18T00:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEYJIoVxLER5Zz7p1bKDEriwEoa+FLTVOJkCD2ef+kR0Qo4dmM+fHUMtdn8OtRJ866feTJsjg/vEW1iXf7DqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:48:00.270571Z"},"content_sha256":"843a8492a0a743d978e2413ebf00f7e0c692ef0a39dc107b640c21c63bdd6f3c","schema_version":"1.0","event_id":"sha256:843a8492a0a743d978e2413ebf00f7e0c692ef0a39dc107b640c21c63bdd6f3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHBUNOVM6MOEFLJNXMFTA5DX64/bundle.json","state_url":"https://pith.science/pith/PHBUNOVM6MOEFLJNXMFTA5DX64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHBUNOVM6MOEFLJNXMFTA5DX64/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-06-22T22:48:00Z","links":{"resolver":"https://pith.science/pith/PHBUNOVM6MOEFLJNXMFTA5DX64","bundle":"https://pith.science/pith/PHBUNOVM6MOEFLJNXMFTA5DX64/bundle.json","state":"https://pith.science/pith/PHBUNOVM6MOEFLJNXMFTA5DX64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHBUNOVM6MOEFLJNXMFTA5DX64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PHBUNOVM6MOEFLJNXMFTA5DX64","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":"16db3b9c9f5e0f8ad0e519ffba261f6a90f9997dbd0be39a85a7d4f1de99674f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-04T09:38:56Z","title_canon_sha256":"82967028d2b347173385ce91b03b31c2398470be196aeffca75258832ee35952"},"schema_version":"1.0","source":{"id":"1612.01091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01091","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01091v2","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01091","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"PHBUNOVM6MOE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PHBUNOVM6MOEFLJN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PHBUNOVM","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:843a8492a0a743d978e2413ebf00f7e0c692ef0a39dc107b640c21c63bdd6f3c","target":"graph","created_at":"2026-05-18T00:53:17Z","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":"Extending our own and others' earlier approaches to reasoning about termination of probabilistic programs, we propose and prove a new rule for termination with probability one, also known as \"almost-certain termination\". The rule uses both (non-strict) super martingales and guarantees of progress, together, and it seems to cover significant cases that earlier methods do not. In particular, it suffices for termination of the unbounded symmetric random walk in both one- and two dimensions: for the first, we give a proof; for the second, we use a theorem of Foster to argue that a proof exists. No","authors_text":"Annabelle McIver, Carroll Morgan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-04T09:38:56Z","title":"A new rule for almost-certain termination of probabilistic- and demonic programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01091","kind":"arxiv","version":2},"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:71adad5f4635d0bba2e3362d563f42f5f238fc6cffc205ceb99a41c4e026bc13","target":"record","created_at":"2026-05-18T00:53:17Z","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":"16db3b9c9f5e0f8ad0e519ffba261f6a90f9997dbd0be39a85a7d4f1de99674f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-04T09:38:56Z","title_canon_sha256":"82967028d2b347173385ce91b03b31c2398470be196aeffca75258832ee35952"},"schema_version":"1.0","source":{"id":"1612.01091","kind":"arxiv","version":2}},"canonical_sha256":"79c346baacf31c42ad2dbb0b307477f721a44ab11c0da40cdae1fa48d6a2f860","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79c346baacf31c42ad2dbb0b307477f721a44ab11c0da40cdae1fa48d6a2f860","first_computed_at":"2026-05-18T00:53:17.038180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:17.038180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9jAWItcCPY0WjLGYLt7+chqG1FKjWwfoFHuEbfKK0/wXDq9DvjkNQsS6xV/H8egY+3lNEtaaiUIAHd8C9bQeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:17.038823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71adad5f4635d0bba2e3362d563f42f5f238fc6cffc205ceb99a41c4e026bc13","sha256:843a8492a0a743d978e2413ebf00f7e0c692ef0a39dc107b640c21c63bdd6f3c"],"state_sha256":"9a8d29a70787d722a8a304adfef49211d049503298c52a65c1bf00c924911bff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sIpPPdpmMxriW7s3i1o3/zym94XryYYD5NnCLLaEyPA9hYmyO4osBdIz8pTHZ/ljVyHgbcbSJtSIWMGkWIODCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:48:00.272610Z","bundle_sha256":"a56e5dc004210c79392dd793503541abe91107d631d969d9a17fe011709feac6"}}