{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ISXLPC5TGLZFNOKBBTNRGVGEFV","short_pith_number":"pith:ISXLPC5T","canonical_record":{"source":{"id":"1810.12396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-10-29T20:36:12Z","cross_cats_sorted":[],"title_canon_sha256":"a43280e60009b9c30087462fa86aa72da7a48b007b2622af80b03f3dca2f873a","abstract_canon_sha256":"25937a12ab1989a037b941bb741bb6cd187b578d78c29bec1175cd77b6fdc8ef"},"schema_version":"1.0"},"canonical_sha256":"44aeb78bb332f256b9410cdb1354c42d6f59e741b12641770f2618ba5acc5f0d","source":{"kind":"arxiv","id":"1810.12396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12396","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12396v1","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12396","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"ISXLPC5TGLZF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"ISXLPC5TGLZFNOKB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"ISXLPC5T","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ISXLPC5TGLZFNOKBBTNRGVGEFV","target":"record","payload":{"canonical_record":{"source":{"id":"1810.12396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-10-29T20:36:12Z","cross_cats_sorted":[],"title_canon_sha256":"a43280e60009b9c30087462fa86aa72da7a48b007b2622af80b03f3dca2f873a","abstract_canon_sha256":"25937a12ab1989a037b941bb741bb6cd187b578d78c29bec1175cd77b6fdc8ef"},"schema_version":"1.0"},"canonical_sha256":"44aeb78bb332f256b9410cdb1354c42d6f59e741b12641770f2618ba5acc5f0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:02.799993Z","signature_b64":"WOir2UtKilOVQYH1dv8ZjKGnvPywI+NLpIt35MkSlwcfU1YGJJEDIrND1VLKZd8YgqyUPGPxvGu17QxH31NMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44aeb78bb332f256b9410cdb1354c42d6f59e741b12641770f2618ba5acc5f0d","last_reissued_at":"2026-05-18T00:02:02.799427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:02.799427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.12396","source_version":1,"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:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+J7wkidX2H1MYjjryu8FQMVqAQDAHVMkeaakCe+pea7eMXvrQ1IxbzsKnUasYkZGH3uCkmUauYJ5go8fQ64oCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:23:03.885349Z"},"content_sha256":"a11f0b50f984d559c3b9937b2e0c3bb9a67e813491e27377a905a2b541e6eaca","schema_version":"1.0","event_id":"sha256:a11f0b50f984d559c3b9937b2e0c3bb9a67e813491e27377a905a2b541e6eaca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ISXLPC5TGLZFNOKBBTNRGVGEFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trace Abstraction Modulo Probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aws Albarghouthi, Calvin Smith, Justin Hsu","submitted_at":"2018-10-29T20:36:12Z","abstract_excerpt":"We propose trace abstraction modulo probability, a proof technique for verifying high-probability accuracy guarantees of probabilistic programs. Our proofs overapproximate the set of program traces using failure automata, finite-state automata that upper bound the probability of failing to satisfy a target specification. We automate proof construction by reducing probabilistic reasoning to logical reasoning: we use program synthesis methods to select axioms for sampling instructions, and then apply Craig interpolation to prove that traces fail the target specification with only a small probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12396","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"},"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:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoiAxikldJfmiM0w56OpbIp2wlNSMbsflXZAED2oo3BlNjkL81OCNjp+cIC6puvPPFHYNMhJCNA/V7uRrWHRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:23:03.885910Z"},"content_sha256":"efeb950010a3bb9a8061e7eff78dd55ad701d8f97bf907a6b20a07e541d113b2","schema_version":"1.0","event_id":"sha256:efeb950010a3bb9a8061e7eff78dd55ad701d8f97bf907a6b20a07e541d113b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/bundle.json","state_url":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/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-26T07:23:03Z","links":{"resolver":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV","bundle":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/bundle.json","state":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ISXLPC5TGLZFNOKBBTNRGVGEFV","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":"25937a12ab1989a037b941bb741bb6cd187b578d78c29bec1175cd77b6fdc8ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-10-29T20:36:12Z","title_canon_sha256":"a43280e60009b9c30087462fa86aa72da7a48b007b2622af80b03f3dca2f873a"},"schema_version":"1.0","source":{"id":"1810.12396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12396","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12396v1","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12396","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"ISXLPC5TGLZF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"ISXLPC5TGLZFNOKB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"ISXLPC5T","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:efeb950010a3bb9a8061e7eff78dd55ad701d8f97bf907a6b20a07e541d113b2","target":"graph","created_at":"2026-05-18T00:02:02Z","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":"We propose trace abstraction modulo probability, a proof technique for verifying high-probability accuracy guarantees of probabilistic programs. Our proofs overapproximate the set of program traces using failure automata, finite-state automata that upper bound the probability of failing to satisfy a target specification. We automate proof construction by reducing probabilistic reasoning to logical reasoning: we use program synthesis methods to select axioms for sampling instructions, and then apply Craig interpolation to prove that traces fail the target specification with only a small probabi","authors_text":"Aws Albarghouthi, Calvin Smith, Justin Hsu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-10-29T20:36:12Z","title":"Trace Abstraction Modulo Probability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12396","kind":"arxiv","version":1},"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:a11f0b50f984d559c3b9937b2e0c3bb9a67e813491e27377a905a2b541e6eaca","target":"record","created_at":"2026-05-18T00:02:02Z","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":"25937a12ab1989a037b941bb741bb6cd187b578d78c29bec1175cd77b6fdc8ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-10-29T20:36:12Z","title_canon_sha256":"a43280e60009b9c30087462fa86aa72da7a48b007b2622af80b03f3dca2f873a"},"schema_version":"1.0","source":{"id":"1810.12396","kind":"arxiv","version":1}},"canonical_sha256":"44aeb78bb332f256b9410cdb1354c42d6f59e741b12641770f2618ba5acc5f0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44aeb78bb332f256b9410cdb1354c42d6f59e741b12641770f2618ba5acc5f0d","first_computed_at":"2026-05-18T00:02:02.799427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:02.799427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WOir2UtKilOVQYH1dv8ZjKGnvPywI+NLpIt35MkSlwcfU1YGJJEDIrND1VLKZd8YgqyUPGPxvGu17QxH31NMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:02.799993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a11f0b50f984d559c3b9937b2e0c3bb9a67e813491e27377a905a2b541e6eaca","sha256:efeb950010a3bb9a8061e7eff78dd55ad701d8f97bf907a6b20a07e541d113b2"],"state_sha256":"d56e990c8185a1f57b2f5fafa0352d568065083b2ebe27de4213895af219ef4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYFi5rR9MzAlhZMaTvXuYSSrxp8jR25Igt4ltjscSK9Li+s5IBAG6iXKFOP4N0mWyXJwQbmwreUXSuoNaHLCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:23:03.889499Z","bundle_sha256":"48c272c886f6dfd65d6a2b4d5715b013299d5391c12f6f664390d4c1051db973"}}