{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SZNGHO2VBRDBWSVBXJE2V3CFRU","short_pith_number":"pith:SZNGHO2V","schema_version":"1.0","canonical_sha256":"965a63bb550c461b4aa1ba49aaec458d0111f0376b073582b4e254ad9d8aff88","source":{"kind":"arxiv","id":"2305.10051","version":1},"attestation_state":"computed","paper":{"title":"Finding an $\\epsilon$-close Variation of Parameters in Bayesian Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bahare Salmani, Joost-Pieter Katoen","submitted_at":"2023-05-17T08:46:53Z","abstract_excerpt":"This paper addresses the $\\epsilon$-close parameter tuning problem for Bayesian Networks (BNs): find a minimal $\\epsilon$-close amendment of probability entries in a given set of (rows in) conditional probability tables that make a given quantitative constraint on the BN valid. Based on the state-of-the-art \"region verification\" techniques for parametric Markov chains, we propose an algorithm whose capabilities go beyond any existing techniques. Our experiments show that $\\epsilon$-close tuning of large BN benchmarks with up to 8 parameters is feasible. In particular, by allowing (i) varied pa"},"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":"2305.10051","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-05-17T08:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"e3144d2ff156687f954f59bbd7a17eddaf348b964b23d5d11befbae24cdcda56","abstract_canon_sha256":"92b1e38ba28fbdbb27dc7dd5b3624a1463b1dd259bd57e1e8f11ba5f1df8f896"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:08.983035Z","signature_b64":"mROXtUlc0qoICiYkwkUC4MUW9HmBSQzv3P5Yjsyh0AtKJA2MVO+oEOyNWUljHi9G1tLI5BW5x73HSMmR9E08CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"965a63bb550c461b4aa1ba49aaec458d0111f0376b073582b4e254ad9d8aff88","last_reissued_at":"2026-07-05T06:11:08.982573Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:08.982573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding an $\\epsilon$-close Variation of Parameters in Bayesian Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bahare Salmani, Joost-Pieter Katoen","submitted_at":"2023-05-17T08:46:53Z","abstract_excerpt":"This paper addresses the $\\epsilon$-close parameter tuning problem for Bayesian Networks (BNs): find a minimal $\\epsilon$-close amendment of probability entries in a given set of (rows in) conditional probability tables that make a given quantitative constraint on the BN valid. Based on the state-of-the-art \"region verification\" techniques for parametric Markov chains, we propose an algorithm whose capabilities go beyond any existing techniques. Our experiments show that $\\epsilon$-close tuning of large BN benchmarks with up to 8 parameters is feasible. In particular, by allowing (i) varied pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.10051","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/2305.10051/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":"2305.10051","created_at":"2026-07-05T06:11:08.982634+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.10051v1","created_at":"2026-07-05T06:11:08.982634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.10051","created_at":"2026-07-05T06:11:08.982634+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZNGHO2VBRDB","created_at":"2026-07-05T06:11:08.982634+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZNGHO2VBRDBWSVB","created_at":"2026-07-05T06:11:08.982634+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZNGHO2V","created_at":"2026-07-05T06:11:08.982634+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/SZNGHO2VBRDBWSVBXJE2V3CFRU","json":"https://pith.science/pith/SZNGHO2VBRDBWSVBXJE2V3CFRU.json","graph_json":"https://pith.science/api/pith-number/SZNGHO2VBRDBWSVBXJE2V3CFRU/graph.json","events_json":"https://pith.science/api/pith-number/SZNGHO2VBRDBWSVBXJE2V3CFRU/events.json","paper":"https://pith.science/paper/SZNGHO2V"},"agent_actions":{"view_html":"https://pith.science/pith/SZNGHO2VBRDBWSVBXJE2V3CFRU","download_json":"https://pith.science/pith/SZNGHO2VBRDBWSVBXJE2V3CFRU.json","view_paper":"https://pith.science/paper/SZNGHO2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.10051&json=true","fetch_graph":"https://pith.science/api/pith-number/SZNGHO2VBRDBWSVBXJE2V3CFRU/graph.json","fetch_events":"https://pith.science/api/pith-number/SZNGHO2VBRDBWSVBXJE2V3CFRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZNGHO2VBRDBWSVBXJE2V3CFRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZNGHO2VBRDBWSVBXJE2V3CFRU/action/storage_attestation","attest_author":"https://pith.science/pith/SZNGHO2VBRDBWSVBXJE2V3CFRU/action/author_attestation","sign_citation":"https://pith.science/pith/SZNGHO2VBRDBWSVBXJE2V3CFRU/action/citation_signature","submit_replication":"https://pith.science/pith/SZNGHO2VBRDBWSVBXJE2V3CFRU/action/replication_record"}},"created_at":"2026-07-05T06:11:08.982634+00:00","updated_at":"2026-07-05T06:11:08.982634+00:00"}