{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FAWZLLILAZARJGGDB2YL665XWZ","short_pith_number":"pith:FAWZLLIL","canonical_record":{"source":{"id":"1008.2514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-08-15T12:26:24Z","cross_cats_sorted":["math.PR","stat.ML"],"title_canon_sha256":"8ee913dc75cb5fedbfb62df0b44253962392132c608a08e558a3de4127f5f930","abstract_canon_sha256":"5725f65a1b685d8a7c23d39d3dc1d48606ff3369b5c253c9f7b0104daa0b4a16"},"schema_version":"1.0"},"canonical_sha256":"282d95ad0b06411498c30eb0bf7bb7b6418473ee23a81d1582920421d2f9815b","source":{"kind":"arxiv","id":"1008.2514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2514","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2514v1","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2514","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"FAWZLLILAZAR","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"FAWZLLILAZARJGGD","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"FAWZLLIL","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FAWZLLILAZARJGGDB2YL665XWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1008.2514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-08-15T12:26:24Z","cross_cats_sorted":["math.PR","stat.ML"],"title_canon_sha256":"8ee913dc75cb5fedbfb62df0b44253962392132c608a08e558a3de4127f5f930","abstract_canon_sha256":"5725f65a1b685d8a7c23d39d3dc1d48606ff3369b5c253c9f7b0104daa0b4a16"},"schema_version":"1.0"},"canonical_sha256":"282d95ad0b06411498c30eb0bf7bb7b6418473ee23a81d1582920421d2f9815b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:13.137394Z","signature_b64":"NiX3ys0bo2g1T9eHkMGc2/PznabM555LDATM+S3+WtH/PIXzQrFnjUBabaRatI0yazIOZuP9ux/N4zX7+Bi2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"282d95ad0b06411498c30eb0bf7bb7b6418473ee23a81d1582920421d2f9815b","last_reissued_at":"2026-05-18T04:42:13.136593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:13.136593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.2514","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-18T04:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Vr5h1PisZG9SXbr7fHFI8AC3T3zamruxfIQefp9JEYgWd9R1f+7CcLnItA1XYLHGH4lo6gvQK7iC345LsXNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:54.463361Z"},"content_sha256":"957c8fda0a34bc7c171268442cf592a8e2eb192bdd99736bbaca7031dc823795","schema_version":"1.0","event_id":"sha256:957c8fda0a34bc7c171268442cf592a8e2eb192bdd99736bbaca7031dc823795"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FAWZLLILAZARJGGDB2YL665XWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Epistemic irrelevance in credal nets: the case of imprecise Markov trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"cs.AI","authors_text":"Alessandro Antonucci, Filip Hermans, Gert de Cooman, Marco Zaffalon","submitted_at":"2010-08-15T12:26:24Z","abstract_excerpt":"We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal nets with the weaker notion of epistemic irrelevance, which is arguably more suited for a behavioural theory of probability. Focusing on directed trees, we show how to combine the given local uncertainty models in the nodes of the graph into a global model, and we use this to construct and justify an exact message-passing algorithm that computes updated beliefs for a variable in the tree. The algorithm, which is linear "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2514","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-18T04:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GzsddolHMmwM96a2fZOjIJ/JDC1imKKGLNO1ds0gxd4oDGgZBUk8TYnKyydfVeRiRiGY+Ily5oV7/VoelhdPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:54.464025Z"},"content_sha256":"3299a17daf4017210511ad95ce82cadaa8f01c26f47df4a2369d5e8864870a45","schema_version":"1.0","event_id":"sha256:3299a17daf4017210511ad95ce82cadaa8f01c26f47df4a2369d5e8864870a45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAWZLLILAZARJGGDB2YL665XWZ/bundle.json","state_url":"https://pith.science/pith/FAWZLLILAZARJGGDB2YL665XWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAWZLLILAZARJGGDB2YL665XWZ/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-05-27T13:49:54Z","links":{"resolver":"https://pith.science/pith/FAWZLLILAZARJGGDB2YL665XWZ","bundle":"https://pith.science/pith/FAWZLLILAZARJGGDB2YL665XWZ/bundle.json","state":"https://pith.science/pith/FAWZLLILAZARJGGDB2YL665XWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAWZLLILAZARJGGDB2YL665XWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FAWZLLILAZARJGGDB2YL665XWZ","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":"5725f65a1b685d8a7c23d39d3dc1d48606ff3369b5c253c9f7b0104daa0b4a16","cross_cats_sorted":["math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-08-15T12:26:24Z","title_canon_sha256":"8ee913dc75cb5fedbfb62df0b44253962392132c608a08e558a3de4127f5f930"},"schema_version":"1.0","source":{"id":"1008.2514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2514","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2514v1","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2514","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"FAWZLLILAZAR","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"FAWZLLILAZARJGGD","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"FAWZLLIL","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:3299a17daf4017210511ad95ce82cadaa8f01c26f47df4a2369d5e8864870a45","target":"graph","created_at":"2026-05-18T04:42:13Z","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 focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal nets with the weaker notion of epistemic irrelevance, which is arguably more suited for a behavioural theory of probability. Focusing on directed trees, we show how to combine the given local uncertainty models in the nodes of the graph into a global model, and we use this to construct and justify an exact message-passing algorithm that computes updated beliefs for a variable in the tree. The algorithm, which is linear ","authors_text":"Alessandro Antonucci, Filip Hermans, Gert de Cooman, Marco Zaffalon","cross_cats":["math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-08-15T12:26:24Z","title":"Epistemic irrelevance in credal nets: the case of imprecise Markov trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2514","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:957c8fda0a34bc7c171268442cf592a8e2eb192bdd99736bbaca7031dc823795","target":"record","created_at":"2026-05-18T04:42:13Z","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":"5725f65a1b685d8a7c23d39d3dc1d48606ff3369b5c253c9f7b0104daa0b4a16","cross_cats_sorted":["math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-08-15T12:26:24Z","title_canon_sha256":"8ee913dc75cb5fedbfb62df0b44253962392132c608a08e558a3de4127f5f930"},"schema_version":"1.0","source":{"id":"1008.2514","kind":"arxiv","version":1}},"canonical_sha256":"282d95ad0b06411498c30eb0bf7bb7b6418473ee23a81d1582920421d2f9815b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"282d95ad0b06411498c30eb0bf7bb7b6418473ee23a81d1582920421d2f9815b","first_computed_at":"2026-05-18T04:42:13.136593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:13.136593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NiX3ys0bo2g1T9eHkMGc2/PznabM555LDATM+S3+WtH/PIXzQrFnjUBabaRatI0yazIOZuP9ux/N4zX7+Bi2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:13.137394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:957c8fda0a34bc7c171268442cf592a8e2eb192bdd99736bbaca7031dc823795","sha256:3299a17daf4017210511ad95ce82cadaa8f01c26f47df4a2369d5e8864870a45"],"state_sha256":"a2a8d11554d1fb1e7097e1f5f0797fe79ff35aa4e9387e52cf01688549aecd68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V53yhQ/MsOCAk/IFyRmfOeyA3bpI7qc0XVCWPZLGBkfYx9lyWTAGuEOMVSvVxxjIpKmwr3vApygjaCbDadrSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:49:54.467095Z","bundle_sha256":"7146acc7ed5d647366cfd7f102016f49c0565d2c4a9f27fa97a135205c05d4d0"}}