{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CFKX2FSNE7BGXQORCCT4ARBAH3","short_pith_number":"pith:CFKX2FSN","canonical_record":{"source":{"id":"1202.3777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"82a60c9b6091ecd3184e97f5cb42df4643dd134178c537238408484c3bd778c8","abstract_canon_sha256":"932c849d90214845d0b3f6931de24505a2573c106da3582a8ff0f0869aa6a11c"},"schema_version":"1.0"},"canonical_sha256":"11557d164d27c26bc1d110a7c044203efdf5e92c0829e95d86cd9cca023387bc","source":{"kind":"arxiv","id":"1202.3777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3777","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3777v1","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3777","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"CFKX2FSNE7BG","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CFKX2FSNE7BGXQOR","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CFKX2FSN","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CFKX2FSNE7BGXQORCCT4ARBAH3","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"82a60c9b6091ecd3184e97f5cb42df4643dd134178c537238408484c3bd778c8","abstract_canon_sha256":"932c849d90214845d0b3f6931de24505a2573c106da3582a8ff0f0869aa6a11c"},"schema_version":"1.0"},"canonical_sha256":"11557d164d27c26bc1d110a7c044203efdf5e92c0829e95d86cd9cca023387bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:02.827636Z","signature_b64":"k0rLzwj3yOz6VXsocszA+UhLZBgLwcmOGeEu3Wcb6R4xeYYENvTrvX4Q5aijwb1NkFq7UvrxZg8ilK89Y8CjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11557d164d27c26bc1d110a7c044203efdf5e92c0829e95d86cd9cca023387bc","last_reissued_at":"2026-05-18T04:02:02.827058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:02.827058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3777","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:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2LhkNIeQ6mN9CIXmYy+xs0vDzFe7qKK+9brYQKYDM2kveui8zBRDO2t1ofRoVIg0GVxCJdMpr3SpeRduEAGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:01:04.177422Z"},"content_sha256":"3f9e76e8d1fa0ff67d50ae982a110ab66f1a1ba5296b44afe1ac4d66e7ddb376","schema_version":"1.0","event_id":"sha256:3f9e76e8d1fa0ff67d50ae982a110ab66f1a1ba5296b44afe1ac4d66e7ddb376"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CFKX2FSNE7BGXQORCCT4ARBAH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AI","authors_text":"Jike Chong, Lu Zheng, Ole Mengshoel","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, belief propagation over junction tree is known to be computationally intensive in the general case. Its complexity may increase dramatically with the connectivity and state space cardinality of Bayesian network nodes. In this paper, we address this computational challenge using GPU parallelization. We develop data structures and algorithms that extend existing junction tree techniques, and specifically develop a novel ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3777","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:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77e4+ySl1qx2tmBI5x00DIfhtL7C3UB0rWiEQTAX4xw5iWloZ2HaLyICITCp3qzOJSI3IAe64MyF7TdyE/24Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:01:04.178169Z"},"content_sha256":"e2f3d93dee6362685df44f906bc5b0e977bfcab2e6328cf0429ec641654a7f7c","schema_version":"1.0","event_id":"sha256:e2f3d93dee6362685df44f906bc5b0e977bfcab2e6328cf0429ec641654a7f7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFKX2FSNE7BGXQORCCT4ARBAH3/bundle.json","state_url":"https://pith.science/pith/CFKX2FSNE7BGXQORCCT4ARBAH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFKX2FSNE7BGXQORCCT4ARBAH3/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-11T06:01:04Z","links":{"resolver":"https://pith.science/pith/CFKX2FSNE7BGXQORCCT4ARBAH3","bundle":"https://pith.science/pith/CFKX2FSNE7BGXQORCCT4ARBAH3/bundle.json","state":"https://pith.science/pith/CFKX2FSNE7BGXQORCCT4ARBAH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFKX2FSNE7BGXQORCCT4ARBAH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CFKX2FSNE7BGXQORCCT4ARBAH3","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":"932c849d90214845d0b3f6931de24505a2573c106da3582a8ff0f0869aa6a11c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"82a60c9b6091ecd3184e97f5cb42df4643dd134178c537238408484c3bd778c8"},"schema_version":"1.0","source":{"id":"1202.3777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3777","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3777v1","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3777","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"CFKX2FSNE7BG","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CFKX2FSNE7BGXQOR","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CFKX2FSN","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:e2f3d93dee6362685df44f906bc5b0e977bfcab2e6328cf0429ec641654a7f7c","target":"graph","created_at":"2026-05-18T04:02:02Z","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":"Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, belief propagation over junction tree is known to be computationally intensive in the general case. Its complexity may increase dramatically with the connectivity and state space cardinality of Bayesian network nodes. In this paper, we address this computational challenge using GPU parallelization. We develop data structures and algorithms that extend existing junction tree techniques, and specifically develop a novel ap","authors_text":"Jike Chong, Lu Zheng, Ole Mengshoel","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title":"Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3777","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:3f9e76e8d1fa0ff67d50ae982a110ab66f1a1ba5296b44afe1ac4d66e7ddb376","target":"record","created_at":"2026-05-18T04:02:02Z","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":"932c849d90214845d0b3f6931de24505a2573c106da3582a8ff0f0869aa6a11c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"82a60c9b6091ecd3184e97f5cb42df4643dd134178c537238408484c3bd778c8"},"schema_version":"1.0","source":{"id":"1202.3777","kind":"arxiv","version":1}},"canonical_sha256":"11557d164d27c26bc1d110a7c044203efdf5e92c0829e95d86cd9cca023387bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11557d164d27c26bc1d110a7c044203efdf5e92c0829e95d86cd9cca023387bc","first_computed_at":"2026-05-18T04:02:02.827058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:02.827058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k0rLzwj3yOz6VXsocszA+UhLZBgLwcmOGeEu3Wcb6R4xeYYENvTrvX4Q5aijwb1NkFq7UvrxZg8ilK89Y8CjBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:02.827636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f9e76e8d1fa0ff67d50ae982a110ab66f1a1ba5296b44afe1ac4d66e7ddb376","sha256:e2f3d93dee6362685df44f906bc5b0e977bfcab2e6328cf0429ec641654a7f7c"],"state_sha256":"bc4b257256cc2317fa73f1a7052ae05b7612715ade5680edfbedc6604ac74bae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fgyKWfz8q0Y5htj0EELCa+lTJUClCQ/pOsoo9RaAwDtihyGBKL4xy2yUJ8AKNLovxNiFqHbgYVAr69FRQsDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:01:04.182628Z","bundle_sha256":"d78abfc29048f9259a5b72569b94fe414a7bf1429b57a6b1bd83784baf19095c"}}