{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LYZDMTU7CKNNDBHOMSOHNHOLVU","short_pith_number":"pith:LYZDMTU7","canonical_record":{"source":{"id":"1303.5440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:56:16Z","cross_cats_sorted":[],"title_canon_sha256":"b6807c333adf6ec7d3b26bb7282543571831f25acdf0adcc8448765f536ab13f","abstract_canon_sha256":"eb9d79838ed5d19d861bc078aabe8f194029c4287ba4220aad0aca9e27aa6414"},"schema_version":"1.0"},"canonical_sha256":"5e32364e9f129ad184ee649c769dcbad30b04ab3cc19c617d584933b93eb38f5","source":{"kind":"arxiv","id":"1303.5440","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5440","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5440v1","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5440","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"LYZDMTU7CKNN","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LYZDMTU7CKNNDBHO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LYZDMTU7","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LYZDMTU7CKNNDBHOMSOHNHOLVU","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:56:16Z","cross_cats_sorted":[],"title_canon_sha256":"b6807c333adf6ec7d3b26bb7282543571831f25acdf0adcc8448765f536ab13f","abstract_canon_sha256":"eb9d79838ed5d19d861bc078aabe8f194029c4287ba4220aad0aca9e27aa6414"},"schema_version":"1.0"},"canonical_sha256":"5e32364e9f129ad184ee649c769dcbad30b04ab3cc19c617d584933b93eb38f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:04.130779Z","signature_b64":"6xABNJJWrD0/QSAl/5rpxzOKXRk9QWY6ySPiT4LYyB+QzTmp/sAoH5cwpbTCoGdg0I/j7snLwigmM1BDQICwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e32364e9f129ad184ee649c769dcbad30b04ab3cc19c617d584933b93eb38f5","last_reissued_at":"2026-05-18T03:30:04.130202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:04.130202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5440","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:30:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8igw2WxHIt6GgC+W5GzADrF9PvxXCdMEIdFbEva7vM7kR4A5B/MmtM+/OxE5SzORJu/EtheJRfX+tKEiN+OsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:49:34.745274Z"},"content_sha256":"fc56be0b6506e4bae1721d1e61aaa912952d98b15b9d06d5284d1e8a85baa96e","schema_version":"1.0","event_id":"sha256:fc56be0b6506e4bae1721d1e61aaa912952d98b15b9d06d5284d1e8a85baa96e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LYZDMTU7CKNNDBHOMSOHNHOLVU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sidestepping the Triangulation Problem in Bayesian Net Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David L. Poole, Nevin Lianwen Zhang","submitted_at":"2013-03-13T12:56:16Z","abstract_excerpt":"This paper presents a new approach for computing posterior probabilities in Bayesian nets, which sidesteps the triangulation problem.  The current state of art is the clique tree propagation approach.  When the underlying graph of a Bayesian net is triangulated, this approach arranges its cliques into a tree and computes posterior probabilities by appropriately passing around messages in that tree.  The computation in each clique is simply direct marginalization.  When the underlying graph is not triangulated, one has to first triangulated it by adding edges.  Referred to as the triangulation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5440","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:30:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmNTTZTI6zvJUnMda/PG0hwzFvp3UD7QjHyuJygb1tE/VufSa4yo/xYDNmyvdm4z9T3HwALK+cref/XGZWPYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:49:34.745647Z"},"content_sha256":"0147521cae57e477b4fc47a356171ba7b866fcf6f75ae60e9b568c9b53108ae0","schema_version":"1.0","event_id":"sha256:0147521cae57e477b4fc47a356171ba7b866fcf6f75ae60e9b568c9b53108ae0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYZDMTU7CKNNDBHOMSOHNHOLVU/bundle.json","state_url":"https://pith.science/pith/LYZDMTU7CKNNDBHOMSOHNHOLVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYZDMTU7CKNNDBHOMSOHNHOLVU/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-27T04:49:34Z","links":{"resolver":"https://pith.science/pith/LYZDMTU7CKNNDBHOMSOHNHOLVU","bundle":"https://pith.science/pith/LYZDMTU7CKNNDBHOMSOHNHOLVU/bundle.json","state":"https://pith.science/pith/LYZDMTU7CKNNDBHOMSOHNHOLVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYZDMTU7CKNNDBHOMSOHNHOLVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LYZDMTU7CKNNDBHOMSOHNHOLVU","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":"eb9d79838ed5d19d861bc078aabe8f194029c4287ba4220aad0aca9e27aa6414","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:56:16Z","title_canon_sha256":"b6807c333adf6ec7d3b26bb7282543571831f25acdf0adcc8448765f536ab13f"},"schema_version":"1.0","source":{"id":"1303.5440","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5440","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5440v1","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5440","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"LYZDMTU7CKNN","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LYZDMTU7CKNNDBHO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LYZDMTU7","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:0147521cae57e477b4fc47a356171ba7b866fcf6f75ae60e9b568c9b53108ae0","target":"graph","created_at":"2026-05-18T03:30:04Z","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":"This paper presents a new approach for computing posterior probabilities in Bayesian nets, which sidesteps the triangulation problem.  The current state of art is the clique tree propagation approach.  When the underlying graph of a Bayesian net is triangulated, this approach arranges its cliques into a tree and computes posterior probabilities by appropriately passing around messages in that tree.  The computation in each clique is simply direct marginalization.  When the underlying graph is not triangulated, one has to first triangulated it by adding edges.  Referred to as the triangulation ","authors_text":"David L. Poole, Nevin Lianwen Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:56:16Z","title":"Sidestepping the Triangulation Problem in Bayesian Net Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5440","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:fc56be0b6506e4bae1721d1e61aaa912952d98b15b9d06d5284d1e8a85baa96e","target":"record","created_at":"2026-05-18T03:30:04Z","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":"eb9d79838ed5d19d861bc078aabe8f194029c4287ba4220aad0aca9e27aa6414","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:56:16Z","title_canon_sha256":"b6807c333adf6ec7d3b26bb7282543571831f25acdf0adcc8448765f536ab13f"},"schema_version":"1.0","source":{"id":"1303.5440","kind":"arxiv","version":1}},"canonical_sha256":"5e32364e9f129ad184ee649c769dcbad30b04ab3cc19c617d584933b93eb38f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e32364e9f129ad184ee649c769dcbad30b04ab3cc19c617d584933b93eb38f5","first_computed_at":"2026-05-18T03:30:04.130202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:04.130202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6xABNJJWrD0/QSAl/5rpxzOKXRk9QWY6ySPiT4LYyB+QzTmp/sAoH5cwpbTCoGdg0I/j7snLwigmM1BDQICwBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:04.130779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5440","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc56be0b6506e4bae1721d1e61aaa912952d98b15b9d06d5284d1e8a85baa96e","sha256:0147521cae57e477b4fc47a356171ba7b866fcf6f75ae60e9b568c9b53108ae0"],"state_sha256":"be4f869fda2110d56d1a7fb0390c2500397ce629a5c65d38a79bdcfe0d2f8954"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yObvQLY9ZsD3NaASfC+7ZJpsHI+3CARQ7yZcbGEA14xSjz5loAseeDqjEiusQ8lhdnENUSItkKHKLJsxeZMWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:49:34.747540Z","bundle_sha256":"f42d58a9583d32ac3529df0b0134a8234b48e9e49697796225cb6cb4c3c37112"}}