{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VHRHZLPU7GMNK2JCCZAZ563TCS","short_pith_number":"pith:VHRHZLPU","schema_version":"1.0","canonical_sha256":"a9e27cadf4f998d5692216419efb7314b10e0818ed9e14ea4cebd2eebc46b49c","source":{"kind":"arxiv","id":"2408.00986","version":1},"attestation_state":"computed","paper":{"title":"A SAT-based approach to rigorous verification of Bayesian networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Artur Dubrawski, Ignacy St\\k{e}pka, Nicholas Gisolfi","submitted_at":"2024-08-02T03:06:51Z","abstract_excerpt":"Recent advancements in machine learning have accelerated its widespread adoption across various real-world applications. However, in safety-critical domains, the deployment of machine learning models is riddled with challenges due to their complexity, lack of interpretability, and absence of formal guarantees regarding their behavior. In this paper, we introduce a verification framework tailored for Bayesian networks, designed to address these drawbacks. Our framework comprises two key components: (1) a two-step compilation and encoding scheme that translates Bayesian networks into Boolean log"},"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":"2408.00986","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-02T03:06:51Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"8d3bee66ffd828148fb19c4a26e167162a0b107b5eef91fbbd11f38f9fe667ca","abstract_canon_sha256":"3b39c6d3f42175ff3eb5df2fe776513c9afb88f9c84fdd93c5dc8b88cd3da119"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:51:25.097205Z","signature_b64":"2RTGJFKP/NdPlVNmB+YGBNZQzAoPyG3Ea9Y+MOn/gXYSMY9+4l1Cs2nqZvktb3c40qdSB6GwLNWqWAT8+fOJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e27cadf4f998d5692216419efb7314b10e0818ed9e14ea4cebd2eebc46b49c","last_reissued_at":"2026-07-05T08:51:25.096676Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:51:25.096676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A SAT-based approach to rigorous verification of Bayesian networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Artur Dubrawski, Ignacy St\\k{e}pka, Nicholas Gisolfi","submitted_at":"2024-08-02T03:06:51Z","abstract_excerpt":"Recent advancements in machine learning have accelerated its widespread adoption across various real-world applications. However, in safety-critical domains, the deployment of machine learning models is riddled with challenges due to their complexity, lack of interpretability, and absence of formal guarantees regarding their behavior. In this paper, we introduce a verification framework tailored for Bayesian networks, designed to address these drawbacks. Our framework comprises two key components: (1) a two-step compilation and encoding scheme that translates Bayesian networks into Boolean log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00986","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.00986/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":"2408.00986","created_at":"2026-07-05T08:51:25.096736+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.00986v1","created_at":"2026-07-05T08:51:25.096736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00986","created_at":"2026-07-05T08:51:25.096736+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHRHZLPU7GMN","created_at":"2026-07-05T08:51:25.096736+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHRHZLPU7GMNK2JC","created_at":"2026-07-05T08:51:25.096736+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHRHZLPU","created_at":"2026-07-05T08:51:25.096736+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/VHRHZLPU7GMNK2JCCZAZ563TCS","json":"https://pith.science/pith/VHRHZLPU7GMNK2JCCZAZ563TCS.json","graph_json":"https://pith.science/api/pith-number/VHRHZLPU7GMNK2JCCZAZ563TCS/graph.json","events_json":"https://pith.science/api/pith-number/VHRHZLPU7GMNK2JCCZAZ563TCS/events.json","paper":"https://pith.science/paper/VHRHZLPU"},"agent_actions":{"view_html":"https://pith.science/pith/VHRHZLPU7GMNK2JCCZAZ563TCS","download_json":"https://pith.science/pith/VHRHZLPU7GMNK2JCCZAZ563TCS.json","view_paper":"https://pith.science/paper/VHRHZLPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.00986&json=true","fetch_graph":"https://pith.science/api/pith-number/VHRHZLPU7GMNK2JCCZAZ563TCS/graph.json","fetch_events":"https://pith.science/api/pith-number/VHRHZLPU7GMNK2JCCZAZ563TCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHRHZLPU7GMNK2JCCZAZ563TCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHRHZLPU7GMNK2JCCZAZ563TCS/action/storage_attestation","attest_author":"https://pith.science/pith/VHRHZLPU7GMNK2JCCZAZ563TCS/action/author_attestation","sign_citation":"https://pith.science/pith/VHRHZLPU7GMNK2JCCZAZ563TCS/action/citation_signature","submit_replication":"https://pith.science/pith/VHRHZLPU7GMNK2JCCZAZ563TCS/action/replication_record"}},"created_at":"2026-07-05T08:51:25.096736+00:00","updated_at":"2026-07-05T08:51:25.096736+00:00"}