{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QVMLTLQVHZPLWYL4FEABMHBKJ7","short_pith_number":"pith:QVMLTLQV","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"},"canonical_sha256":"8558b9ae153e5ebb617c2900161c2a4fd4bf5ddf0459e56e4ccbc395689c5184","source":{"kind":"arxiv","id":"1301.3875","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3875","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3875v1","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3875","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"QVMLTLQVHZPL","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QVMLTLQVHZPLWYL4","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QVMLTLQV","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QVMLTLQVHZPLWYL4FEABMHBKJ7","target":"record","payload":{"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"},"canonical_sha256":"8558b9ae153e5ebb617c2900161c2a4fd4bf5ddf0459e56e4ccbc395689c5184","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"},"source_kind":"arxiv","source_id":"1301.3875","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:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfZc4lToMljBso6VyawrenqfzTiWlwQMT1OQnYzAuDgbZktoQv2EcEJvSGCNbhtQ6XL/FYOzmFUg1G5QXswOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:09:08.347563Z"},"content_sha256":"3a663de67f45f46a02b04a0396f5ba5159299802c84d3fd1aeea6d4eecc61b24","schema_version":"1.0","event_id":"sha256:3a663de67f45f46a02b04a0396f5ba5159299802c84d3fd1aeea6d4eecc61b24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QVMLTLQVHZPLWYL4FEABMHBKJ7","target":"graph","payload":{"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"},"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:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RvgtJ2keAsgCviGrxRudBmp+T80pST2Sl9DP3nonqhS/6AfzbFpuw5FXgYYUmu2OIf6prSQAWn92189/TDb5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:09:08.348140Z"},"content_sha256":"0cad405f12bec88b736a8bc84fbbfe7cd763e966b507407603e40173f24480ae","schema_version":"1.0","event_id":"sha256:0cad405f12bec88b736a8bc84fbbfe7cd763e966b507407603e40173f24480ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/bundle.json","state_url":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/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-06T08:09:08Z","links":{"resolver":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7","bundle":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/bundle.json","state":"https://pith.science/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QVMLTLQVHZPLWYL4FEABMHBKJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QVMLTLQVHZPLWYL4FEABMHBKJ7","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":"ea661d58722db21310f95af8be911729590ed3f3c361613df6d2160d9beb4e3e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-16T15:51:30Z","title_canon_sha256":"0e5f1ec4d1f9bbdcf07ec7f12ba7605bcb5b0f7c6f1ad5e29401e26b859a1722"},"schema_version":"1.0","source":{"id":"1301.3875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3875","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3875v1","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3875","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"QVMLTLQVHZPL","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QVMLTLQVHZPLWYL4","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QVMLTLQV","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:0cad405f12bec88b736a8bc84fbbfe7cd763e966b507407603e40173f24480ae","target":"graph","created_at":"2026-05-18T03:36:15Z","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":"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","authors_text":"Marina Meila, Tommi S. Jaakkola","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-16T15:51:30Z","title":"Tractable Bayesian Learning of Tree Belief Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3875","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:3a663de67f45f46a02b04a0396f5ba5159299802c84d3fd1aeea6d4eecc61b24","target":"record","created_at":"2026-05-18T03:36:15Z","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":"ea661d58722db21310f95af8be911729590ed3f3c361613df6d2160d9beb4e3e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-16T15:51:30Z","title_canon_sha256":"0e5f1ec4d1f9bbdcf07ec7f12ba7605bcb5b0f7c6f1ad5e29401e26b859a1722"},"schema_version":"1.0","source":{"id":"1301.3875","kind":"arxiv","version":1}},"canonical_sha256":"8558b9ae153e5ebb617c2900161c2a4fd4bf5ddf0459e56e4ccbc395689c5184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8558b9ae153e5ebb617c2900161c2a4fd4bf5ddf0459e56e4ccbc395689c5184","first_computed_at":"2026-05-18T03:36:15.152278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:15.152278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZuVGRSaL5oxbS1xEpWCl7Deeq8rQrdxTEuKwQgkv8gK1qxt/biWeDgH6aoVaV3l1OiGb1DGZfMiGD95m0VGpAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:15.153009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a663de67f45f46a02b04a0396f5ba5159299802c84d3fd1aeea6d4eecc61b24","sha256:0cad405f12bec88b736a8bc84fbbfe7cd763e966b507407603e40173f24480ae"],"state_sha256":"7d0459e794a382580261f1def68efc4f21f63ac6c881c63ff40345c3833d0297"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vkM9xbXWFEyvJILw5tztSgA+CY9JqETpgDs4eTL5ECQQC5F2kI7MKjR0lWrILQWOKO+Bji15mKjZ2NWZz0YQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:09:08.352275Z","bundle_sha256":"0d5a54c195da4cf5b51c395c18e62b0f00e7bf5148ad26c7175c32af62fcb2cf"}}