{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WXWH3UZUM2OOFDRKJUSXVUZ7UT","short_pith_number":"pith:WXWH3UZU","canonical_record":{"source":{"id":"1205.2665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T14:40:39Z","cross_cats_sorted":[],"title_canon_sha256":"cac937d1ecd265480724017520da081d2d6461da228acf6cbe3821c58faf1222","abstract_canon_sha256":"5846556c24d83d26757b591d2d05db583e02474f433399c7479626012ff5dcc0"},"schema_version":"1.0"},"canonical_sha256":"b5ec7dd334669ce28e2a4d257ad33fa4f82eef1790ac0529ab1b68906181e819","source":{"kind":"arxiv","id":"1205.2665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2665","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2665v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2665","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"WXWH3UZUM2OO","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WXWH3UZUM2OOFDRK","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WXWH3UZU","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WXWH3UZUM2OOFDRKJUSXVUZ7UT","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T14:40:39Z","cross_cats_sorted":[],"title_canon_sha256":"cac937d1ecd265480724017520da081d2d6461da228acf6cbe3821c58faf1222","abstract_canon_sha256":"5846556c24d83d26757b591d2d05db583e02474f433399c7479626012ff5dcc0"},"schema_version":"1.0"},"canonical_sha256":"b5ec7dd334669ce28e2a4d257ad33fa4f82eef1790ac0529ab1b68906181e819","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.533880Z","signature_b64":"96QPGp0KRsArgJ9fvohCG6RqalzoCnUdoadX7zoZwXq1yUOZNQJo1WsgfQ/FQbVhWRD3adXQ5Fra1sod/zMkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5ec7dd334669ce28e2a4d257ad33fa4f82eef1790ac0529ab1b68906181e819","last_reissued_at":"2026-05-18T03:55:47.533162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.533162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2665","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-18T03:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNbdaYJ8HzYAiJMoWLG7RibMwRvhwn3iQxL89Go98Ky/fueibN0TqEkdWLS+V4OAVTEqSKxQ1dc7QvXo6L3tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T15:37:59.626235Z"},"content_sha256":"9825ca61582867406fa57600441be89e092388a4910c93af29155fe7d2b4f9ea","schema_version":"1.0","event_id":"sha256:9825ca61582867406fa57600441be89e092388a4910c93af29155fe7d2b4f9ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WXWH3UZUM2OOFDRKJUSXVUZ7UT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bound Bayesian Networks - An Efficient Inference of Lower Bounds on Probability Distributions in Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bernhard Sick, Daniel Andrade","submitted_at":"2012-05-09T14:40:39Z","abstract_excerpt":"We present a new method to propagate lower bounds on conditional probability distributions in conventional Bayesian networks. Our method guarantees to provide outer approximations of the exact lower bounds. A key advantage is that we can use any available algorithms and tools for Bayesian networks in order to represent and infer lower bounds. This new method yields results that are provable exact for trees with binary variables, and results which are competitive to existing approximations in credal networks for all other network structures. Our method is not limited to a specific kind of netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2665","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-18T03:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vr7bRx+d9iVVmdjU3wYCRn0+iHFUhB93vF5uXtj8ysr2RPWhecpN/nE/e/iHahFLyPK+RQqTc09PlpZJlp/mAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T15:37:59.626592Z"},"content_sha256":"a64c6f9c7a5131b130971331a53d3b16070ddeaa204e229b40a41a44c27f01e0","schema_version":"1.0","event_id":"sha256:a64c6f9c7a5131b130971331a53d3b16070ddeaa204e229b40a41a44c27f01e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXWH3UZUM2OOFDRKJUSXVUZ7UT/bundle.json","state_url":"https://pith.science/pith/WXWH3UZUM2OOFDRKJUSXVUZ7UT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXWH3UZUM2OOFDRKJUSXVUZ7UT/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-06-28T15:37:59Z","links":{"resolver":"https://pith.science/pith/WXWH3UZUM2OOFDRKJUSXVUZ7UT","bundle":"https://pith.science/pith/WXWH3UZUM2OOFDRKJUSXVUZ7UT/bundle.json","state":"https://pith.science/pith/WXWH3UZUM2OOFDRKJUSXVUZ7UT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXWH3UZUM2OOFDRKJUSXVUZ7UT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WXWH3UZUM2OOFDRKJUSXVUZ7UT","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":"5846556c24d83d26757b591d2d05db583e02474f433399c7479626012ff5dcc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T14:40:39Z","title_canon_sha256":"cac937d1ecd265480724017520da081d2d6461da228acf6cbe3821c58faf1222"},"schema_version":"1.0","source":{"id":"1205.2665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2665","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2665v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2665","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"WXWH3UZUM2OO","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WXWH3UZUM2OOFDRK","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WXWH3UZU","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:a64c6f9c7a5131b130971331a53d3b16070ddeaa204e229b40a41a44c27f01e0","target":"graph","created_at":"2026-05-18T03:55:47Z","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 present a new method to propagate lower bounds on conditional probability distributions in conventional Bayesian networks. Our method guarantees to provide outer approximations of the exact lower bounds. A key advantage is that we can use any available algorithms and tools for Bayesian networks in order to represent and infer lower bounds. This new method yields results that are provable exact for trees with binary variables, and results which are competitive to existing approximations in credal networks for all other network structures. Our method is not limited to a specific kind of netwo","authors_text":"Bernhard Sick, Daniel Andrade","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T14:40:39Z","title":"Lower Bound Bayesian Networks - An Efficient Inference of Lower Bounds on Probability Distributions in Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2665","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:9825ca61582867406fa57600441be89e092388a4910c93af29155fe7d2b4f9ea","target":"record","created_at":"2026-05-18T03:55:47Z","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":"5846556c24d83d26757b591d2d05db583e02474f433399c7479626012ff5dcc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T14:40:39Z","title_canon_sha256":"cac937d1ecd265480724017520da081d2d6461da228acf6cbe3821c58faf1222"},"schema_version":"1.0","source":{"id":"1205.2665","kind":"arxiv","version":1}},"canonical_sha256":"b5ec7dd334669ce28e2a4d257ad33fa4f82eef1790ac0529ab1b68906181e819","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5ec7dd334669ce28e2a4d257ad33fa4f82eef1790ac0529ab1b68906181e819","first_computed_at":"2026-05-18T03:55:47.533162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:47.533162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"96QPGp0KRsArgJ9fvohCG6RqalzoCnUdoadX7zoZwXq1yUOZNQJo1WsgfQ/FQbVhWRD3adXQ5Fra1sod/zMkDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:47.533880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9825ca61582867406fa57600441be89e092388a4910c93af29155fe7d2b4f9ea","sha256:a64c6f9c7a5131b130971331a53d3b16070ddeaa204e229b40a41a44c27f01e0"],"state_sha256":"542875c97cb52400f6cb4a7d58ca1df483be0751bb65dc5acf3f04de6536a04a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3IecXLyW5CNsKZYGpBvU4Hw0Jf1tSBEp39IGjGLIT10AAuhnCmeV5nrjtndQcx8d8O1WTdY0eO+r4Zi2rF2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T15:37:59.628418Z","bundle_sha256":"155aebed83a10b479fd1dc2e6c548de5195ae52b8e95d1376cb9c22e46807bc0"}}