{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AC2DSJWH4BOVH52GVS5IZ7EH53","short_pith_number":"pith:AC2DSJWH","canonical_record":{"source":{"id":"1701.02944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-11T12:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"bc432d3a6eb75346bbf8775e91bebab4a0803ba930b2124b7a4036134569781f","abstract_canon_sha256":"f3ed390986ec59897548909476088c71c70508f21d9de2ef21ef4dab230754f3"},"schema_version":"1.0"},"canonical_sha256":"00b43926c7e05d53f746acba8cfc87eedcc324d95f985c27ebc86571edd96c34","source":{"kind":"arxiv","id":"1701.02944","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02944","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02944v1","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02944","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"pith_short_12","alias_value":"AC2DSJWH4BOV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AC2DSJWH4BOVH52G","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AC2DSJWH","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AC2DSJWH4BOVH52GVS5IZ7EH53","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-11T12:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"bc432d3a6eb75346bbf8775e91bebab4a0803ba930b2124b7a4036134569781f","abstract_canon_sha256":"f3ed390986ec59897548909476088c71c70508f21d9de2ef21ef4dab230754f3"},"schema_version":"1.0"},"canonical_sha256":"00b43926c7e05d53f746acba8cfc87eedcc324d95f985c27ebc86571edd96c34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:59.773514Z","signature_b64":"PP51aJhfrgei5hZ+MxYlDb2096mlxae7EzbUUSgkuyq1qnS9ErIV6cOj23x1Rs8gTGx+zTj2QuobY1Oj3V1rDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00b43926c7e05d53f746acba8cfc87eedcc324d95f985c27ebc86571edd96c34","last_reissued_at":"2026-05-18T00:52:59.773065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:59.773065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02944","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-18T00:52:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBs1XxuCVk9MH2cKUpjX2MxzXRslUfh5N1uPUJQeJ5VDxYvTlgztY2o7/bFxSUILYWM4R7TxIlNVkYy1QHQsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:58:55.149031Z"},"content_sha256":"ad2f7f47a8c9d7dad11e45de9289d091f404b1437ea16205ca33af2237ebbd25","schema_version":"1.0","event_id":"sha256:ad2f7f47a8c9d7dad11e45de9289d091f404b1437ea16205ca33af2237ebbd25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AC2DSJWH4BOVH52GVS5IZ7EH53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Termination of Nondeterministic Recursive Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hongfei Fu, Krishnendu Chatterjee","submitted_at":"2017-01-11T12:14:06Z","abstract_excerpt":"We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination time over all schedulers). Our result also clarifies previous results which claimed that ranking supermartingales are not a complete approach even for nondeterministic probabilistic programs without recursion. Second, we show that conditionally difference-bounded ranking supermartingales provide a sound approach for lower bounds of expected termination time. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02944","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-18T00:52:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpcWa7PexoNEKo0aIA8Isf6gayIPYDV+CuoqpMV7JjuTt6QYZr4J48Q86dY/YcbBszu1ESF4Vf/e0VpHpxQ6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:58:55.149700Z"},"content_sha256":"eb646309abdd98dc613dabe368f90448919fb90e7e825f442d5fd0d8ce52a06a","schema_version":"1.0","event_id":"sha256:eb646309abdd98dc613dabe368f90448919fb90e7e825f442d5fd0d8ce52a06a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AC2DSJWH4BOVH52GVS5IZ7EH53/bundle.json","state_url":"https://pith.science/pith/AC2DSJWH4BOVH52GVS5IZ7EH53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AC2DSJWH4BOVH52GVS5IZ7EH53/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-25T16:58:55Z","links":{"resolver":"https://pith.science/pith/AC2DSJWH4BOVH52GVS5IZ7EH53","bundle":"https://pith.science/pith/AC2DSJWH4BOVH52GVS5IZ7EH53/bundle.json","state":"https://pith.science/pith/AC2DSJWH4BOVH52GVS5IZ7EH53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AC2DSJWH4BOVH52GVS5IZ7EH53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AC2DSJWH4BOVH52GVS5IZ7EH53","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":"f3ed390986ec59897548909476088c71c70508f21d9de2ef21ef4dab230754f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-11T12:14:06Z","title_canon_sha256":"bc432d3a6eb75346bbf8775e91bebab4a0803ba930b2124b7a4036134569781f"},"schema_version":"1.0","source":{"id":"1701.02944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02944","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02944v1","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02944","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"pith_short_12","alias_value":"AC2DSJWH4BOV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AC2DSJWH4BOVH52G","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AC2DSJWH","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:eb646309abdd98dc613dabe368f90448919fb90e7e825f442d5fd0d8ce52a06a","target":"graph","created_at":"2026-05-18T00:52:59Z","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 termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination time over all schedulers). Our result also clarifies previous results which claimed that ranking supermartingales are not a complete approach even for nondeterministic probabilistic programs without recursion. Second, we show that conditionally difference-bounded ranking supermartingales provide a sound approach for lower bounds of expected termination time. F","authors_text":"Hongfei Fu, Krishnendu Chatterjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-11T12:14:06Z","title":"Termination of Nondeterministic Recursive Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02944","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:ad2f7f47a8c9d7dad11e45de9289d091f404b1437ea16205ca33af2237ebbd25","target":"record","created_at":"2026-05-18T00:52:59Z","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":"f3ed390986ec59897548909476088c71c70508f21d9de2ef21ef4dab230754f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-11T12:14:06Z","title_canon_sha256":"bc432d3a6eb75346bbf8775e91bebab4a0803ba930b2124b7a4036134569781f"},"schema_version":"1.0","source":{"id":"1701.02944","kind":"arxiv","version":1}},"canonical_sha256":"00b43926c7e05d53f746acba8cfc87eedcc324d95f985c27ebc86571edd96c34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00b43926c7e05d53f746acba8cfc87eedcc324d95f985c27ebc86571edd96c34","first_computed_at":"2026-05-18T00:52:59.773065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:59.773065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PP51aJhfrgei5hZ+MxYlDb2096mlxae7EzbUUSgkuyq1qnS9ErIV6cOj23x1Rs8gTGx+zTj2QuobY1Oj3V1rDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:59.773514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad2f7f47a8c9d7dad11e45de9289d091f404b1437ea16205ca33af2237ebbd25","sha256:eb646309abdd98dc613dabe368f90448919fb90e7e825f442d5fd0d8ce52a06a"],"state_sha256":"a1433ffe8364084e3aa5ef95e3aac40868d0c61af27d84a1370e3b06637243b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jg96tQTZTz2h/bOtmQQ5S8lL3W85Evnjy+3XuHd9xOYnti881vqQ8SaF9IztZY1fy0RAQkR00nHreyoiNkReCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:58:55.153279Z","bundle_sha256":"23c476f9ee58e45548f3cd3761fe19ab0af16cc46a353667802eb450f076d3ed"}}