{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:N3SA36F5YM6XAHAXC7A73U4IJH","short_pith_number":"pith:N3SA36F5","schema_version":"1.0","canonical_sha256":"6ee40df8bdc33d701c1717c1fdd38849d71aa9154a02f4109d7d2341697b4d12","source":{"kind":"arxiv","id":"1901.06087","version":3},"attestation_state":"computed","paper":{"title":"Modular Verification for Almost-Sure Termination of Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Amir Kafshdar Goharshady, Hongfei Fu, Krishnendu Chatterjee, Mingzhang Huang","submitted_at":"2019-01-18T05:24:37Z","abstract_excerpt":"In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a given probabilistic program terminates with probability 1. Scalable approaches for program analysis often rely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule) of Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure termination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [Fioriti and Hermanns 2015]. While the proposed probabilistic varia"},"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":"1901.06087","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-18T05:24:37Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"bfa33905cf173d30cfb6f5ddbb40da4da18c67ecbef5e89775e4ed23d83ef740","abstract_canon_sha256":"3e86c4ae82c115fed89fa8ae00e98042c10de1b92ec79ca8719fcc289b578bad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:11.617844Z","signature_b64":"8nsG2vwbg0D+Ceptlv9iEXa4fEbdWcCV5pvZ3wM7Nkf+XnR7VSI7/76csHFEgubnhMcTPXTRQw//6y/TdgvcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee40df8bdc33d701c1717c1fdd38849d71aa9154a02f4109d7d2341697b4d12","last_reissued_at":"2026-07-04T23:53:11.617343Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:11.617343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular Verification for Almost-Sure Termination of Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Amir Kafshdar Goharshady, Hongfei Fu, Krishnendu Chatterjee, Mingzhang Huang","submitted_at":"2019-01-18T05:24:37Z","abstract_excerpt":"In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a given probabilistic program terminates with probability 1. Scalable approaches for program analysis often rely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule) of Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure termination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [Fioriti and Hermanns 2015]. While the proposed probabilistic varia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06087","kind":"arxiv","version":3},"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/1901.06087/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":"1901.06087","created_at":"2026-07-04T23:53:11.617401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06087v3","created_at":"2026-07-04T23:53:11.617401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06087","created_at":"2026-07-04T23:53:11.617401+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3SA36F5YM6X","created_at":"2026-07-04T23:53:11.617401+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3SA36F5YM6XAHAX","created_at":"2026-07-04T23:53:11.617401+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3SA36F5","created_at":"2026-07-04T23:53:11.617401+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/N3SA36F5YM6XAHAXC7A73U4IJH","json":"https://pith.science/pith/N3SA36F5YM6XAHAXC7A73U4IJH.json","graph_json":"https://pith.science/api/pith-number/N3SA36F5YM6XAHAXC7A73U4IJH/graph.json","events_json":"https://pith.science/api/pith-number/N3SA36F5YM6XAHAXC7A73U4IJH/events.json","paper":"https://pith.science/paper/N3SA36F5"},"agent_actions":{"view_html":"https://pith.science/pith/N3SA36F5YM6XAHAXC7A73U4IJH","download_json":"https://pith.science/pith/N3SA36F5YM6XAHAXC7A73U4IJH.json","view_paper":"https://pith.science/paper/N3SA36F5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06087&json=true","fetch_graph":"https://pith.science/api/pith-number/N3SA36F5YM6XAHAXC7A73U4IJH/graph.json","fetch_events":"https://pith.science/api/pith-number/N3SA36F5YM6XAHAXC7A73U4IJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3SA36F5YM6XAHAXC7A73U4IJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3SA36F5YM6XAHAXC7A73U4IJH/action/storage_attestation","attest_author":"https://pith.science/pith/N3SA36F5YM6XAHAXC7A73U4IJH/action/author_attestation","sign_citation":"https://pith.science/pith/N3SA36F5YM6XAHAXC7A73U4IJH/action/citation_signature","submit_replication":"https://pith.science/pith/N3SA36F5YM6XAHAXC7A73U4IJH/action/replication_record"}},"created_at":"2026-07-04T23:53:11.617401+00:00","updated_at":"2026-07-04T23:53:11.617401+00:00"}