{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ISXLPC5TGLZFNOKBBTNRGVGEFV","short_pith_number":"pith:ISXLPC5T","schema_version":"1.0","canonical_sha256":"44aeb78bb332f256b9410cdb1354c42d6f59e741b12641770f2618ba5acc5f0d","source":{"kind":"arxiv","id":"1810.12396","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.12396","created_at":"2026-05-18T00:02:02.799518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.12396v1","created_at":"2026-05-18T00:02:02.799518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12396","created_at":"2026-05-18T00:02:02.799518+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISXLPC5TGLZF","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISXLPC5TGLZFNOKB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISXLPC5T","created_at":"2026-05-18T12:32:31.084164+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/ISXLPC5TGLZFNOKBBTNRGVGEFV","json":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV.json","graph_json":"https://pith.science/api/pith-number/ISXLPC5TGLZFNOKBBTNRGVGEFV/graph.json","events_json":"https://pith.science/api/pith-number/ISXLPC5TGLZFNOKBBTNRGVGEFV/events.json","paper":"https://pith.science/paper/ISXLPC5T"},"agent_actions":{"view_html":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV","download_json":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV.json","view_paper":"https://pith.science/paper/ISXLPC5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.12396&json=true","fetch_graph":"https://pith.science/api/pith-number/ISXLPC5TGLZFNOKBBTNRGVGEFV/graph.json","fetch_events":"https://pith.science/api/pith-number/ISXLPC5TGLZFNOKBBTNRGVGEFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/action/storage_attestation","attest_author":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/action/author_attestation","sign_citation":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/action/citation_signature","submit_replication":"https://pith.science/pith/ISXLPC5TGLZFNOKBBTNRGVGEFV/action/replication_record"}},"created_at":"2026-05-18T00:02:02.799518+00:00","updated_at":"2026-05-18T00:02:02.799518+00:00"}