{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:55HIW2P5R26AB5SNP65R4SK4AU","short_pith_number":"pith:55HIW2P5","canonical_record":{"source":{"id":"1802.05639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-15T16:25:47Z","cross_cats_sorted":[],"title_canon_sha256":"f88da97dfb92f7a848ad8d8abb6102edebac7d568ab460021825816244c11ad2","abstract_canon_sha256":"af0b405ea2b9572a347598536119524210cc969a03b7ff7473d33199f29b2238"},"schema_version":"1.0"},"canonical_sha256":"ef4e8b69fd8ebc00f64d7fbb1e495c050fea8d6e07616181704e0d38e10504ae","source":{"kind":"arxiv","id":"1802.05639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05639","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05639v1","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05639","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"55HIW2P5R26A","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"55HIW2P5R26AB5SN","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"55HIW2P5","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:55HIW2P5R26AB5SNP65R4SK4AU","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-15T16:25:47Z","cross_cats_sorted":[],"title_canon_sha256":"f88da97dfb92f7a848ad8d8abb6102edebac7d568ab460021825816244c11ad2","abstract_canon_sha256":"af0b405ea2b9572a347598536119524210cc969a03b7ff7473d33199f29b2238"},"schema_version":"1.0"},"canonical_sha256":"ef4e8b69fd8ebc00f64d7fbb1e495c050fea8d6e07616181704e0d38e10504ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:15.021890Z","signature_b64":"IAa+6kmaIWQETjW6CKK/kl/LJcXm8yPbcyCaNTwyWrv7U7/3IhrhBzPg3TSg4T5fiACYEMtSf0ZijURAlB3UDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef4e8b69fd8ebc00f64d7fbb1e495c050fea8d6e07616181704e0d38e10504ae","last_reissued_at":"2026-05-18T00:23:15.021303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:15.021303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05639","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:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnmh6zDqZtN48t9DIOlh+B95zC+hm6CXMLQGpqpqzG+HF8aSwC9TbeAo4WcMtsrv0ijxH9pRP2gZBEXVITvgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:32:45.683120Z"},"content_sha256":"dd92f29ce485902b78c47a00ed21623239225a5e523bb030da7d08ac587dd0af","schema_version":"1.0","event_id":"sha256:dd92f29ce485902b78c47a00ed21623239225a5e523bb030da7d08ac587dd0af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:55HIW2P5R26AB5SNP65R4SK4AU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliable Uncertain Evidence Modeling in Bayesian Networks by Credal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alessandro Antonucci, Sabina Marchetti","submitted_at":"2018-02-15T16:25:47Z","abstract_excerpt":"A reliable modeling of uncertain evidence in Bayesian networks based on a set-valued quantification is proposed. Both soft and virtual evidences are considered. We show that evidence propagation in this setup can be reduced to standard updating in an augmented credal network, equivalent to a set of consistent Bayesian networks. A characterization of the computational complexity for this task is derived together with an efficient exact procedure for a subclass of instances. In the case of multiple uncertain evidences over the same variable, the proposed procedure can provide a set-valued versio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05639","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:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sm34+YL0lmzHbfAV+ykcs3ixGHRYej9+U8sjbrtoF+g2z0WKKFdE2LrzU9Hrx2ovncBAn7LgtFzXObVXiD1VBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:32:45.683811Z"},"content_sha256":"d5f4c1d7da26a8f231ed0cec2f7e9beb17c0e31d0108f86946607b8ada04f9fa","schema_version":"1.0","event_id":"sha256:d5f4c1d7da26a8f231ed0cec2f7e9beb17c0e31d0108f86946607b8ada04f9fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55HIW2P5R26AB5SNP65R4SK4AU/bundle.json","state_url":"https://pith.science/pith/55HIW2P5R26AB5SNP65R4SK4AU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55HIW2P5R26AB5SNP65R4SK4AU/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-06T10:32:45Z","links":{"resolver":"https://pith.science/pith/55HIW2P5R26AB5SNP65R4SK4AU","bundle":"https://pith.science/pith/55HIW2P5R26AB5SNP65R4SK4AU/bundle.json","state":"https://pith.science/pith/55HIW2P5R26AB5SNP65R4SK4AU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55HIW2P5R26AB5SNP65R4SK4AU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:55HIW2P5R26AB5SNP65R4SK4AU","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":"af0b405ea2b9572a347598536119524210cc969a03b7ff7473d33199f29b2238","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-15T16:25:47Z","title_canon_sha256":"f88da97dfb92f7a848ad8d8abb6102edebac7d568ab460021825816244c11ad2"},"schema_version":"1.0","source":{"id":"1802.05639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05639","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05639v1","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05639","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"55HIW2P5R26A","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"55HIW2P5R26AB5SN","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"55HIW2P5","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:d5f4c1d7da26a8f231ed0cec2f7e9beb17c0e31d0108f86946607b8ada04f9fa","target":"graph","created_at":"2026-05-18T00:23:15Z","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":"A reliable modeling of uncertain evidence in Bayesian networks based on a set-valued quantification is proposed. Both soft and virtual evidences are considered. We show that evidence propagation in this setup can be reduced to standard updating in an augmented credal network, equivalent to a set of consistent Bayesian networks. A characterization of the computational complexity for this task is derived together with an efficient exact procedure for a subclass of instances. In the case of multiple uncertain evidences over the same variable, the proposed procedure can provide a set-valued versio","authors_text":"Alessandro Antonucci, Sabina Marchetti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-15T16:25:47Z","title":"Reliable Uncertain Evidence Modeling in Bayesian Networks by Credal Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05639","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:dd92f29ce485902b78c47a00ed21623239225a5e523bb030da7d08ac587dd0af","target":"record","created_at":"2026-05-18T00:23:15Z","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":"af0b405ea2b9572a347598536119524210cc969a03b7ff7473d33199f29b2238","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-15T16:25:47Z","title_canon_sha256":"f88da97dfb92f7a848ad8d8abb6102edebac7d568ab460021825816244c11ad2"},"schema_version":"1.0","source":{"id":"1802.05639","kind":"arxiv","version":1}},"canonical_sha256":"ef4e8b69fd8ebc00f64d7fbb1e495c050fea8d6e07616181704e0d38e10504ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef4e8b69fd8ebc00f64d7fbb1e495c050fea8d6e07616181704e0d38e10504ae","first_computed_at":"2026-05-18T00:23:15.021303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:15.021303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IAa+6kmaIWQETjW6CKK/kl/LJcXm8yPbcyCaNTwyWrv7U7/3IhrhBzPg3TSg4T5fiACYEMtSf0ZijURAlB3UDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:15.021890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd92f29ce485902b78c47a00ed21623239225a5e523bb030da7d08ac587dd0af","sha256:d5f4c1d7da26a8f231ed0cec2f7e9beb17c0e31d0108f86946607b8ada04f9fa"],"state_sha256":"9bbd2c07e6a35c5ae78ec8740bdea518e891f968ad04fb2f892c2bbaa734b839"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OBEH5T3iIl3MY1OmR7AyW8GinYfbV2KT3EF55MjW19BX9I8hQ1DQ0e8DuiCGkqireZ76cSu+RKWlNixcEalCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T10:32:45.687163Z","bundle_sha256":"5c6494dcfc8063ec6b33caf3a1171977c89c24128486d7c5f6f7d7593b3365f9"}}