{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VHQWYSK6KCFTCAD4E327PJM2MG","short_pith_number":"pith:VHQWYSK6","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"},"canonical_sha256":"a9e16c495e508b31007c26f5f7a59a618b8eb60f4536580a0f886bc9a071c618","source":{"kind":"arxiv","id":"1805.10749","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10749","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10749v3","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10749","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"VHQWYSK6KCFT","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VHQWYSK6KCFTCAD4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VHQWYSK6","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VHQWYSK6KCFTCAD4E327PJM2MG","target":"record","payload":{"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"},"canonical_sha256":"a9e16c495e508b31007c26f5f7a59a618b8eb60f4536580a0f886bc9a071c618","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"},"source_kind":"arxiv","source_id":"1805.10749","source_version":3,"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:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z9A3lVj7b8riLZ+SN93ollywmNzhMAnmZKAQlzFCXgO3XyPHIryUO0CW2K0uw9TS42rKX15dyZg6TX39yiLNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:10:08.213636Z"},"content_sha256":"dcf0998e02c13588653c9b8bd22e5abe11b253f5770d3b36bc2a084e60243138","schema_version":"1.0","event_id":"sha256:dcf0998e02c13588653c9b8bd22e5abe11b253f5770d3b36bc2a084e60243138"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VHQWYSK6KCFTCAD4E327PJM2MG","target":"graph","payload":{"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"},"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:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQl93mp0EV3qhiejM2712s54Hoz9903Jk1Ve/Fnm4Bw7VV7nNZOqz3WH9eJUfuDrKnN5Ko9VXoKJZ3kTRd7+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:10:08.214148Z"},"content_sha256":"c580cfc5f44b854ae380e91317e5f3199c3963638ba0a889f911a5a4378bed92","schema_version":"1.0","event_id":"sha256:c580cfc5f44b854ae380e91317e5f3199c3963638ba0a889f911a5a4378bed92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG/bundle.json","state_url":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHQWYSK6KCFTCAD4E327PJM2MG/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-30T21:10:08Z","links":{"resolver":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG","bundle":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG/bundle.json","state":"https://pith.science/pith/VHQWYSK6KCFTCAD4E327PJM2MG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHQWYSK6KCFTCAD4E327PJM2MG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VHQWYSK6KCFTCAD4E327PJM2MG","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":"205ccaa2ebe21a55b777b1ea5be140a121da1b17ceacdfa15aaa3916640fe1ae","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-28T03:08:48Z","title_canon_sha256":"f7d3a43f1e93dc31021b0dbd066f215a40d57192494e29fbd16adbdc1457ab6d"},"schema_version":"1.0","source":{"id":"1805.10749","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10749","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10749v3","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10749","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"VHQWYSK6KCFT","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VHQWYSK6KCFTCAD4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VHQWYSK6","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:c580cfc5f44b854ae380e91317e5f3199c3963638ba0a889f911a5a4378bed92","target":"graph","created_at":"2026-05-18T00:00:39Z","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":"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 ","authors_text":"Ichiro Hasuo, Natsuki Urabe, Toru Takisaka, Yuichiro Oyabu","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-28T03:08:48Z","title":"Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10749","kind":"arxiv","version":3},"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:dcf0998e02c13588653c9b8bd22e5abe11b253f5770d3b36bc2a084e60243138","target":"record","created_at":"2026-05-18T00:00:39Z","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":"205ccaa2ebe21a55b777b1ea5be140a121da1b17ceacdfa15aaa3916640fe1ae","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-28T03:08:48Z","title_canon_sha256":"f7d3a43f1e93dc31021b0dbd066f215a40d57192494e29fbd16adbdc1457ab6d"},"schema_version":"1.0","source":{"id":"1805.10749","kind":"arxiv","version":3}},"canonical_sha256":"a9e16c495e508b31007c26f5f7a59a618b8eb60f4536580a0f886bc9a071c618","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9e16c495e508b31007c26f5f7a59a618b8eb60f4536580a0f886bc9a071c618","first_computed_at":"2026-05-18T00:00:39.556708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:39.556708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZKv9M8goFS4Vt3d26r3+RGbtb0fL0141fl93cmuechLfgf8AqLeBpwovFkEAz8PBrFMYl8Tx/FDCzOCdUQIOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:39.557233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10749","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcf0998e02c13588653c9b8bd22e5abe11b253f5770d3b36bc2a084e60243138","sha256:c580cfc5f44b854ae380e91317e5f3199c3963638ba0a889f911a5a4378bed92"],"state_sha256":"4c76d7ca447e67e143b3e06d312664c307ef03e0af91ff50934adf13af2257e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQ3wI3k+NwUUMbcroLleYOQjrOOvRU7jGfkskCOeivibHrzQbUaZKJZcDDnrDFiuzMXGr5julWCGSs+BPIyWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:10:08.216877Z","bundle_sha256":"a8fd68c664566664649c8e1889302e1cd6faf59365d1c062a99cec15bfd0665b"}}