{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VHQWYSK6KCFTCAD4E327PJM2MG","short_pith_number":"pith:VHQWYSK6","schema_version":"1.0","canonical_sha256":"a9e16c495e508b31007c26f5f7a59a618b8eb60f4536580a0f886bc9a071c618","source":{"kind":"arxiv","id":"1805.10749","version":3},"attestation_state":"computed","paper":{"title":"Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ichiro Hasuo, Natsuki Urabe, Toru Takisaka, Yuichiro Oyabu","submitted_at":"2018-05-28T03:08:48Z","abstract_excerpt":"Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating reachability probabilities. Based on the existing works that stretch across different communities (formal verification, control theory, etc.), we offer a unifying account. In particular, we emphasize the role of order-theoretic fixed points---a classic topic in computer science---in the analysis of probabilistic programs. This leads us to two new martingale-based "},"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":"1805.10749","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-28T03:08:48Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f7d3a43f1e93dc31021b0dbd066f215a40d57192494e29fbd16adbdc1457ab6d","abstract_canon_sha256":"205ccaa2ebe21a55b777b1ea5be140a121da1b17ceacdfa15aaa3916640fe1ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:39.557233Z","signature_b64":"ZKv9M8goFS4Vt3d26r3+RGbtb0fL0141fl93cmuechLfgf8AqLeBpwovFkEAz8PBrFMYl8Tx/FDCzOCdUQIOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e16c495e508b31007c26f5f7a59a618b8eb60f4536580a0f886bc9a071c618","last_reissued_at":"2026-05-18T00:00:39.556708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:39.556708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ichiro Hasuo, Natsuki Urabe, Toru Takisaka, Yuichiro Oyabu","submitted_at":"2018-05-28T03:08:48Z","abstract_excerpt":"Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating reachability probabilities. Based on the existing works that stretch across different communities (formal verification, control theory, etc.), we offer a unifying account. In particular, we emphasize the role of order-theoretic fixed points---a classic topic in computer science---in the analysis of probabilistic programs. This leads us to two new martingale-based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10749","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":""},"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":"1805.10749","created_at":"2026-05-18T00:00:39.556795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10749v3","created_at":"2026-05-18T00:00:39.556795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10749","created_at":"2026-05-18T00:00:39.556795+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHQWYSK6KCFT","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHQWYSK6KCFTCAD4","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHQWYSK6","created_at":"2026-05-18T12:32:59.047623+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/VHQWYSK6KCFTCAD4E327PJM2MG","json":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG.json","graph_json":"https://pith.science/api/pith-number/VHQWYSK6KCFTCAD4E327PJM2MG/graph.json","events_json":"https://pith.science/api/pith-number/VHQWYSK6KCFTCAD4E327PJM2MG/events.json","paper":"https://pith.science/paper/VHQWYSK6"},"agent_actions":{"view_html":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG","download_json":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG.json","view_paper":"https://pith.science/paper/VHQWYSK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10749&json=true","fetch_graph":"https://pith.science/api/pith-number/VHQWYSK6KCFTCAD4E327PJM2MG/graph.json","fetch_events":"https://pith.science/api/pith-number/VHQWYSK6KCFTCAD4E327PJM2MG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG/action/storage_attestation","attest_author":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG/action/author_attestation","sign_citation":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG/action/citation_signature","submit_replication":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG/action/replication_record"}},"created_at":"2026-05-18T00:00:39.556795+00:00","updated_at":"2026-05-18T00:00:39.556795+00:00"}