{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VBFA4YTGI5CF2ASE6NHQMWIOMI","short_pith_number":"pith:VBFA4YTG","schema_version":"1.0","canonical_sha256":"a84a0e626647445d0244f34f06590e6231f985435b4089a09947f72584c9ae27","source":{"kind":"arxiv","id":"2108.02188","version":1},"attestation_state":"computed","paper":{"title":"On Lexicographic Proof Rules for Probabilistic Termination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"{\\DJ}or{\\dj}e \\v{Z}ikeli\\'c, Ehsan Kafshdar Goharshady, Ji\\v{r}\\'i Z\\'arev\\'ucky, Krishnendu Chatterjee, Petr Novotn\\'y","submitted_at":"2021-08-04T17:25:53Z","abstract_excerpt":"We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in LexRSM not existing even for"},"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":"2108.02188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-08-04T17:25:53Z","cross_cats_sorted":[],"title_canon_sha256":"c255538b7f74d3ba058ddddaaa4dba5c50d9f2ba0d31b200260a255aa1ce6b8d","abstract_canon_sha256":"4b44656b1e0b1a5e73d6e8b9a7ced61d5d70c54584ab893aada2da968f277a93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:03:22.526450Z","signature_b64":"WwS9fzoLR0SVZAX+YZqmvRFtleQ9UXp87kTZJUHASF43F49zEGyC1T7azFKym0Xmfrdy0U7U/sf0Ff3pn5ZQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a84a0e626647445d0244f34f06590e6231f985435b4089a09947f72584c9ae27","last_reissued_at":"2026-07-05T03:03:22.525906Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:03:22.525906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Lexicographic Proof Rules for Probabilistic Termination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"{\\DJ}or{\\dj}e \\v{Z}ikeli\\'c, Ehsan Kafshdar Goharshady, Ji\\v{r}\\'i Z\\'arev\\'ucky, Krishnendu Chatterjee, Petr Novotn\\'y","submitted_at":"2021-08-04T17:25:53Z","abstract_excerpt":"We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in LexRSM not existing even for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.02188","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.02188/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2108.02188","created_at":"2026-07-05T03:03:22.525967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.02188v1","created_at":"2026-07-05T03:03:22.525967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.02188","created_at":"2026-07-05T03:03:22.525967+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBFA4YTGI5CF","created_at":"2026-07-05T03:03:22.525967+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBFA4YTGI5CF2ASE","created_at":"2026-07-05T03:03:22.525967+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBFA4YTG","created_at":"2026-07-05T03:03:22.525967+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/VBFA4YTGI5CF2ASE6NHQMWIOMI","json":"https://pith.science/pith/VBFA4YTGI5CF2ASE6NHQMWIOMI.json","graph_json":"https://pith.science/api/pith-number/VBFA4YTGI5CF2ASE6NHQMWIOMI/graph.json","events_json":"https://pith.science/api/pith-number/VBFA4YTGI5CF2ASE6NHQMWIOMI/events.json","paper":"https://pith.science/paper/VBFA4YTG"},"agent_actions":{"view_html":"https://pith.science/pith/VBFA4YTGI5CF2ASE6NHQMWIOMI","download_json":"https://pith.science/pith/VBFA4YTGI5CF2ASE6NHQMWIOMI.json","view_paper":"https://pith.science/paper/VBFA4YTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.02188&json=true","fetch_graph":"https://pith.science/api/pith-number/VBFA4YTGI5CF2ASE6NHQMWIOMI/graph.json","fetch_events":"https://pith.science/api/pith-number/VBFA4YTGI5CF2ASE6NHQMWIOMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBFA4YTGI5CF2ASE6NHQMWIOMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBFA4YTGI5CF2ASE6NHQMWIOMI/action/storage_attestation","attest_author":"https://pith.science/pith/VBFA4YTGI5CF2ASE6NHQMWIOMI/action/author_attestation","sign_citation":"https://pith.science/pith/VBFA4YTGI5CF2ASE6NHQMWIOMI/action/citation_signature","submit_replication":"https://pith.science/pith/VBFA4YTGI5CF2ASE6NHQMWIOMI/action/replication_record"}},"created_at":"2026-07-05T03:03:22.525967+00:00","updated_at":"2026-07-05T03:03:22.525967+00:00"}