{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ABLKV5WOJZFJJO6FJCZHTZ2CVA","short_pith_number":"pith:ABLKV5WO","canonical_record":{"source":{"id":"1806.06683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-14T05:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"69c3444d4ac12933b395edc17d51d52a80e622c7b0e11f2e9c172e5a549d24df","abstract_canon_sha256":"4f6b5fe1ea0dbc62473d6c9b83b16ce0875e8f8d4be6bc29f0521cc2fbce9afc"},"schema_version":"1.0"},"canonical_sha256":"0056aaf6ce4e4a94bbc548b279e742a81d2364e3d4ce0a2ca7107485d5393d20","source":{"kind":"arxiv","id":"1806.06683","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06683","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06683v2","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06683","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"pith_short_12","alias_value":"ABLKV5WOJZFJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ABLKV5WOJZFJJO6F","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ABLKV5WO","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ABLKV5WOJZFJJO6FJCZHTZ2CVA","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-14T05:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"69c3444d4ac12933b395edc17d51d52a80e622c7b0e11f2e9c172e5a549d24df","abstract_canon_sha256":"4f6b5fe1ea0dbc62473d6c9b83b16ce0875e8f8d4be6bc29f0521cc2fbce9afc"},"schema_version":"1.0"},"canonical_sha256":"0056aaf6ce4e4a94bbc548b279e742a81d2364e3d4ce0a2ca7107485d5393d20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:27.505851Z","signature_b64":"Pt8P4M7aWjoD+EiP3W0KMrJ/OPWChQ+a8l2IfCTU4vLgBWuAKgWUHSdl/z6e6K0kokTUvIvdqUZ9+qy3ZInCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0056aaf6ce4e4a94bbc548b279e742a81d2364e3d4ce0a2ca7107485d5393d20","last_reissued_at":"2026-05-18T00:07:27.505358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:27.505358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06683","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:07:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlsBwYQEYyUtyVgY1WYFEvqpytSntrxCdKYOlwcgcEyxXcNm6YCreMfeBu64q10PdOXSk9PeXd2pPeB1L2lSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:06:22.802399Z"},"content_sha256":"20490b9a5bac5670be4b56fb03172c6d3b69b122dd8a1c912f6e7e84b949957c","schema_version":"1.0","event_id":"sha256:20490b9a5bac5670be4b56fb03172c6d3b69b122dd8a1c912f6e7e84b949957c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ABLKV5WOJZFJJO6FJCZHTZ2CVA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Approaches for Almost-Sure Termination of Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hongfei Fu, Krishnendu Chatterjee, Mingzhang Huang","submitted_at":"2018-06-14T05:42:18Z","abstract_excerpt":"We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover, using this approach we can obtain explicit optimal bounds on tail probabilities of non-termination within a given number of steps. Second, we present a new approach based on Central Limit Theorem for the almost-sure termination problem, and show that this approach can establish almost-sure termination of programs which none of the existing approaches can hand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06683","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:07:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J8BEL5Q3PoilXq5MHbXv3Ac6KxGwS2cPvSEuJFToc7WdhbbC/D3L4omr4ogdaJNDukJ8pW8LHqrDjKVczvlKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:06:22.803095Z"},"content_sha256":"515203aa4fcd60728f62a3f9c45c7a45306b1546d2c54f4ecf7536781fb8ffe8","schema_version":"1.0","event_id":"sha256:515203aa4fcd60728f62a3f9c45c7a45306b1546d2c54f4ecf7536781fb8ffe8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/bundle.json","state_url":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/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-25T15:06:22Z","links":{"resolver":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA","bundle":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/bundle.json","state":"https://pith.science/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABLKV5WOJZFJJO6FJCZHTZ2CVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ABLKV5WOJZFJJO6FJCZHTZ2CVA","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":"4f6b5fe1ea0dbc62473d6c9b83b16ce0875e8f8d4be6bc29f0521cc2fbce9afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-14T05:42:18Z","title_canon_sha256":"69c3444d4ac12933b395edc17d51d52a80e622c7b0e11f2e9c172e5a549d24df"},"schema_version":"1.0","source":{"id":"1806.06683","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06683","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06683v2","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06683","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"pith_short_12","alias_value":"ABLKV5WOJZFJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ABLKV5WOJZFJJO6F","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ABLKV5WO","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:515203aa4fcd60728f62a3f9c45c7a45306b1546d2c54f4ecf7536781fb8ffe8","target":"graph","created_at":"2026-05-18T00:07:27Z","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":"We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover, using this approach we can obtain explicit optimal bounds on tail probabilities of non-termination within a given number of steps. Second, we present a new approach based on Central Limit Theorem for the almost-sure termination problem, and show that this approach can establish almost-sure termination of programs which none of the existing approaches can hand","authors_text":"Hongfei Fu, Krishnendu Chatterjee, Mingzhang Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-14T05:42:18Z","title":"New Approaches for Almost-Sure Termination of Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06683","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:20490b9a5bac5670be4b56fb03172c6d3b69b122dd8a1c912f6e7e84b949957c","target":"record","created_at":"2026-05-18T00:07:27Z","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":"4f6b5fe1ea0dbc62473d6c9b83b16ce0875e8f8d4be6bc29f0521cc2fbce9afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-14T05:42:18Z","title_canon_sha256":"69c3444d4ac12933b395edc17d51d52a80e622c7b0e11f2e9c172e5a549d24df"},"schema_version":"1.0","source":{"id":"1806.06683","kind":"arxiv","version":2}},"canonical_sha256":"0056aaf6ce4e4a94bbc548b279e742a81d2364e3d4ce0a2ca7107485d5393d20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0056aaf6ce4e4a94bbc548b279e742a81d2364e3d4ce0a2ca7107485d5393d20","first_computed_at":"2026-05-18T00:07:27.505358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:27.505358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pt8P4M7aWjoD+EiP3W0KMrJ/OPWChQ+a8l2IfCTU4vLgBWuAKgWUHSdl/z6e6K0kokTUvIvdqUZ9+qy3ZInCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:27.505851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06683","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20490b9a5bac5670be4b56fb03172c6d3b69b122dd8a1c912f6e7e84b949957c","sha256:515203aa4fcd60728f62a3f9c45c7a45306b1546d2c54f4ecf7536781fb8ffe8"],"state_sha256":"00883348c5f0ae75ce08afa52f696170cc47c9408d07528a7f4ee9a2998a42e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nf6n6igoNfBfkqb5+a1JK6ON+tkETRxBRYaNboaLhSOTQYjB9/LPqPnwWCrB30z+/+XJT/sa5/p8oTGN3rdZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:06:22.806631Z","bundle_sha256":"6194774a82d523fb3eec9139a88f7ed8e6091161a8936a49349bced738aeb918"}}