{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RH3YSNZ57SMIFH4LVHV3U5TI4M","short_pith_number":"pith:RH3YSNZ5","schema_version":"1.0","canonical_sha256":"89f789373dfc98829f8ba9ebba7668e331aea904f90098aa8e9b454d3f631472","source":{"kind":"arxiv","id":"1709.04037","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.04037","created_at":"2026-05-18T00:35:15.643167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04037v1","created_at":"2026-05-18T00:35:15.643167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04037","created_at":"2026-05-18T00:35:15.643167+00:00"},{"alias_kind":"pith_short_12","alias_value":"RH3YSNZ57SMI","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RH3YSNZ57SMIFH4L","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RH3YSNZ5","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M","json":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M.json","graph_json":"https://pith.science/api/pith-number/RH3YSNZ57SMIFH4LVHV3U5TI4M/graph.json","events_json":"https://pith.science/api/pith-number/RH3YSNZ57SMIFH4LVHV3U5TI4M/events.json","paper":"https://pith.science/paper/RH3YSNZ5"},"agent_actions":{"view_html":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M","download_json":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M.json","view_paper":"https://pith.science/paper/RH3YSNZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04037&json=true","fetch_graph":"https://pith.science/api/pith-number/RH3YSNZ57SMIFH4LVHV3U5TI4M/graph.json","fetch_events":"https://pith.science/api/pith-number/RH3YSNZ57SMIFH4LVHV3U5TI4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/action/storage_attestation","attest_author":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/action/author_attestation","sign_citation":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/action/citation_signature","submit_replication":"https://pith.science/pith/RH3YSNZ57SMIFH4LVHV3U5TI4M/action/replication_record"}},"created_at":"2026-05-18T00:35:15.643167+00:00","updated_at":"2026-05-18T00:35:15.643167+00:00"}