{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RH3YSNZ57SMIFH4LVHV3U5TI4M","short_pith_number":"pith:RH3YSNZ5","canonical_record":{"source":{"id":"1709.04037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-12T19:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"c461d045c1441303fc27be74878f4c63beb3b868984d9aeddd35d44c60155103","abstract_canon_sha256":"aed9a5ce380039e059101615dd6b3383b47046517b0d372d2ee0b66bf8dd54ac"},"schema_version":"1.0"},"canonical_sha256":"89f789373dfc98829f8ba9ebba7668e331aea904f90098aa8e9b454d3f631472","source":{"kind":"arxiv","id":"1709.04037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04037","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04037v1","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04037","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"RH3YSNZ57SMI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RH3YSNZ57SMIFH4L","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RH3YSNZ5","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RH3YSNZ57SMIFH4LVHV3U5TI4M","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-12T19:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"c461d045c1441303fc27be74878f4c63beb3b868984d9aeddd35d44c60155103","abstract_canon_sha256":"aed9a5ce380039e059101615dd6b3383b47046517b0d372d2ee0b66bf8dd54ac"},"schema_version":"1.0"},"canonical_sha256":"89f789373dfc98829f8ba9ebba7668e331aea904f90098aa8e9b454d3f631472","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:15.643774Z","signature_b64":"ak2KDkcw4qmxk33EkooZ9pGXynnpREQPw4Z1Jm74AymSupVPkb6VOYwt3EXZYhJBo82IVQteYyBejZg0UkXxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89f789373dfc98829f8ba9ebba7668e331aea904f90098aa8e9b454d3f631472","last_reissued_at":"2026-05-18T00:35:15.643061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:15.643061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04037","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:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWP3Tz2FOVgzRk2XcAiAUnCQG3+zxKAlUgupcRcUDs9sM3//AJlyZ3USWVNDmhVoMEusStyy5y7gvN6ChZC0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:28:15.115747Z"},"content_sha256":"88d5b4953e2afca8e49918ae151f3f7b4b29758aa8520ade0ea2e4b31609b369","schema_version":"1.0","event_id":"sha256:88d5b4953e2afca8e49918ae151f3f7b4b29758aa8520ade0ea2e4b31609b369"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RH3YSNZ57SMIFH4LVHV3U5TI4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Krishnendu Chatterjee, Petr Novotn\\'y, Sheshansh Agrawal","submitted_at":"2017-09-12T19:35:47Z","abstract_excerpt":"Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem given a probabilistic program asks whether the program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). While deep theoretical results have been established about RSMs, their appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04037","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:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hl7mFxzFf7IUXmoI9yFwJPNZTPbxtLU8Hp2I+A47nOsezvuiEsEhc8q6FDGMhKxP4yr2pb8SZTLA9uQTtqJlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:28:15.116428Z"},"content_sha256":"7ede3aa679e15ac929e7a6f4f298c86d472119d5dc3c94b92cd77154f9cd9a06","schema_version":"1.0","event_id":"sha256:7ede3aa679e15ac929e7a6f4f298c86d472119d5dc3c94b92cd77154f9cd9a06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/bundle.json","state_url":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/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-26T02:28:15Z","links":{"resolver":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M","bundle":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/bundle.json","state":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RH3YSNZ57SMIFH4LVHV3U5TI4M","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":"aed9a5ce380039e059101615dd6b3383b47046517b0d372d2ee0b66bf8dd54ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-12T19:35:47Z","title_canon_sha256":"c461d045c1441303fc27be74878f4c63beb3b868984d9aeddd35d44c60155103"},"schema_version":"1.0","source":{"id":"1709.04037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04037","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04037v1","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04037","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"RH3YSNZ57SMI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RH3YSNZ57SMIFH4L","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RH3YSNZ5","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:7ede3aa679e15ac929e7a6f4f298c86d472119d5dc3c94b92cd77154f9cd9a06","target":"graph","created_at":"2026-05-18T00:35:15Z","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":"Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem given a probabilistic program asks whether the program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). While deep theoretical results have been established about RSMs, their appl","authors_text":"Krishnendu Chatterjee, Petr Novotn\\'y, Sheshansh Agrawal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-12T19:35:47Z","title":"Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04037","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:88d5b4953e2afca8e49918ae151f3f7b4b29758aa8520ade0ea2e4b31609b369","target":"record","created_at":"2026-05-18T00:35:15Z","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":"aed9a5ce380039e059101615dd6b3383b47046517b0d372d2ee0b66bf8dd54ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-12T19:35:47Z","title_canon_sha256":"c461d045c1441303fc27be74878f4c63beb3b868984d9aeddd35d44c60155103"},"schema_version":"1.0","source":{"id":"1709.04037","kind":"arxiv","version":1}},"canonical_sha256":"89f789373dfc98829f8ba9ebba7668e331aea904f90098aa8e9b454d3f631472","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89f789373dfc98829f8ba9ebba7668e331aea904f90098aa8e9b454d3f631472","first_computed_at":"2026-05-18T00:35:15.643061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:15.643061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ak2KDkcw4qmxk33EkooZ9pGXynnpREQPw4Z1Jm74AymSupVPkb6VOYwt3EXZYhJBo82IVQteYyBejZg0UkXxDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:15.643774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88d5b4953e2afca8e49918ae151f3f7b4b29758aa8520ade0ea2e4b31609b369","sha256:7ede3aa679e15ac929e7a6f4f298c86d472119d5dc3c94b92cd77154f9cd9a06"],"state_sha256":"7a517a0c61ff396b85cea10a7608db5d65b472d960bd2d3058dc2ff978450410"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kwf9i8ccp+zsVIIP2EcenTm+pZUVURrOGV+mMGtr85BoVgYCJYpbT6CEjvCbl3vGFqxUwnel9EWc7qsZu+UPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:28:15.119776Z","bundle_sha256":"c2754ca8ef111a24909143f179c84cab472cede6b138b0505c4d1f012571cd82"}}