{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JQMR6B6Y5JXKXWLHPRWNN66ZAZ","short_pith_number":"pith:JQMR6B6Y","schema_version":"1.0","canonical_sha256":"4c191f07d8ea6eabd9677c6cd6fbd906413f7a5f8334a697239ea495ca4e35b0","source":{"kind":"arxiv","id":"1308.0187","version":9},"attestation_state":"computed","paper":{"title":"A Time and Space Efficient Junction Tree Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Stephen Pasteris","submitted_at":"2013-07-31T16:56:59Z","abstract_excerpt":"The junction tree algorithm is a way of computing marginals of boolean multivariate probability distributions that factorise over sets of random variables. The junction tree algorithm first constructs a tree called a junction tree who's vertices are sets of random variables. The algorithm then performs a generalised version of belief propagation on the junction tree. The Shafer-Shenoy and Hugin architectures are two ways to perform this belief propagation that tradeoff time and space complexities in different ways: Hugin propagation is at least as fast as Shafer-Shenoy propagation and in the c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1308.0187","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-31T16:56:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8269fc364831a4463711b8c6c773b099a24699293296467379de44b23d8993b8","abstract_canon_sha256":"52c65deae69f5d8dfea8e62419bae82dfa17674d3f62844c301a36997f0bef0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:40.585582Z","signature_b64":"gUaagR3TNJ5j++3Yw2VkLwFV0qGY5/AQNdWMK4PHas4G6mHO1X3aewzrdy5qsM7lX1pqgV5EJ3CRYuDF91HiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c191f07d8ea6eabd9677c6cd6fbd906413f7a5f8334a697239ea495ca4e35b0","last_reissued_at":"2026-05-18T02:30:40.585145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:40.585145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Time and Space Efficient Junction Tree Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Stephen Pasteris","submitted_at":"2013-07-31T16:56:59Z","abstract_excerpt":"The junction tree algorithm is a way of computing marginals of boolean multivariate probability distributions that factorise over sets of random variables. The junction tree algorithm first constructs a tree called a junction tree who's vertices are sets of random variables. The algorithm then performs a generalised version of belief propagation on the junction tree. The Shafer-Shenoy and Hugin architectures are two ways to perform this belief propagation that tradeoff time and space complexities in different ways: Hugin propagation is at least as fast as Shafer-Shenoy propagation and in the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0187","kind":"arxiv","version":9},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.0187","created_at":"2026-05-18T02:30:40.585209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0187v9","created_at":"2026-05-18T02:30:40.585209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0187","created_at":"2026-05-18T02:30:40.585209+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQMR6B6Y5JXK","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQMR6B6Y5JXKXWLH","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQMR6B6Y","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JQMR6B6Y5JXKXWLHPRWNN66ZAZ","json":"https://pith.science/pith/JQMR6B6Y5JXKXWLHPRWNN66ZAZ.json","graph_json":"https://pith.science/api/pith-number/JQMR6B6Y5JXKXWLHPRWNN66ZAZ/graph.json","events_json":"https://pith.science/api/pith-number/JQMR6B6Y5JXKXWLHPRWNN66ZAZ/events.json","paper":"https://pith.science/paper/JQMR6B6Y"},"agent_actions":{"view_html":"https://pith.science/pith/JQMR6B6Y5JXKXWLHPRWNN66ZAZ","download_json":"https://pith.science/pith/JQMR6B6Y5JXKXWLHPRWNN66ZAZ.json","view_paper":"https://pith.science/paper/JQMR6B6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0187&json=true","fetch_graph":"https://pith.science/api/pith-number/JQMR6B6Y5JXKXWLHPRWNN66ZAZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JQMR6B6Y5JXKXWLHPRWNN66ZAZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQMR6B6Y5JXKXWLHPRWNN66ZAZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQMR6B6Y5JXKXWLHPRWNN66ZAZ/action/storage_attestation","attest_author":"https://pith.science/pith/JQMR6B6Y5JXKXWLHPRWNN66ZAZ/action/author_attestation","sign_citation":"https://pith.science/pith/JQMR6B6Y5JXKXWLHPRWNN66ZAZ/action/citation_signature","submit_replication":"https://pith.science/pith/JQMR6B6Y5JXKXWLHPRWNN66ZAZ/action/replication_record"}},"created_at":"2026-05-18T02:30:40.585209+00:00","updated_at":"2026-05-18T02:30:40.585209+00:00"}