{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QVMLTLQVHZPLWYL4FEABMHBKJ7","short_pith_number":"pith:QVMLTLQV","schema_version":"1.0","canonical_sha256":"8558b9ae153e5ebb617c2900161c2a4fd4bf5ddf0459e56e4ccbc395689c5184","source":{"kind":"arxiv","id":"1301.3875","version":1},"attestation_state":"computed","paper":{"title":"Tractable Bayesian Learning of Tree Belief Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Marina Meila, Tommi S. Jaakkola","submitted_at":"2013-01-16T15:51:30Z","abstract_excerpt":"In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tractable, in the sense that the posterior is also decomposable and can be completely determined analytically in polynomial time.  This follows from two main results: First, we show that factored distributions over spanning trees in a graph can be integrated in closed form. Second, we examine priors over tree parameters and show that a set of assumptions similar to (Heckerman and al. 1995) constrain the tree parameter prior"},"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":"1301.3875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-16T15:51:30Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"0e5f1ec4d1f9bbdcf07ec7f12ba7605bcb5b0f7c6f1ad5e29401e26b859a1722","abstract_canon_sha256":"ea661d58722db21310f95af8be911729590ed3f3c361613df6d2160d9beb4e3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:15.153009Z","signature_b64":"ZuVGRSaL5oxbS1xEpWCl7Deeq8rQrdxTEuKwQgkv8gK1qxt/biWeDgH6aoVaV3l1OiGb1DGZfMiGD95m0VGpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8558b9ae153e5ebb617c2900161c2a4fd4bf5ddf0459e56e4ccbc395689c5184","last_reissued_at":"2026-05-18T03:36:15.152278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:15.152278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tractable Bayesian Learning of Tree Belief Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Marina Meila, Tommi S. Jaakkola","submitted_at":"2013-01-16T15:51:30Z","abstract_excerpt":"In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tractable, in the sense that the posterior is also decomposable and can be completely determined analytically in polynomial time.  This follows from two main results: First, we show that factored distributions over spanning trees in a graph can be integrated in closed form. Second, we examine priors over tree parameters and show that a set of assumptions similar to (Heckerman and al. 1995) constrain the tree parameter prior"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3875","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.3875","created_at":"2026-05-18T03:36:15.152444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3875v1","created_at":"2026-05-18T03:36:15.152444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3875","created_at":"2026-05-18T03:36:15.152444+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVMLTLQVHZPL","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVMLTLQVHZPLWYL4","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVMLTLQV","created_at":"2026-05-18T12:27:57.521954+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/QVMLTLQVHZPLWYL4FEABMHBKJ7","json":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7.json","graph_json":"https://pith.science/api/pith-number/QVMLTLQVHZPLWYL4FEABMHBKJ7/graph.json","events_json":"https://pith.science/api/pith-number/QVMLTLQVHZPLWYL4FEABMHBKJ7/events.json","paper":"https://pith.science/paper/QVMLTLQV"},"agent_actions":{"view_html":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7","download_json":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7.json","view_paper":"https://pith.science/paper/QVMLTLQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3875&json=true","fetch_graph":"https://pith.science/api/pith-number/QVMLTLQVHZPLWYL4FEABMHBKJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/QVMLTLQVHZPLWYL4FEABMHBKJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/action/storage_attestation","attest_author":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/action/author_attestation","sign_citation":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/action/citation_signature","submit_replication":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/action/replication_record"}},"created_at":"2026-05-18T03:36:15.152444+00:00","updated_at":"2026-05-18T03:36:15.152444+00:00"}