{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LSTA44PHMCL5HANTDTRBRNQFB4","short_pith_number":"pith:LSTA44PH","schema_version":"1.0","canonical_sha256":"5ca60e71e76097d381b31ce218b6050f01ae320cab80997e8fd81193de18e22a","source":{"kind":"arxiv","id":"1203.3468","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Rose Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Charles Blundell, Katherine A. Heller, Yee Whye Teh","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"Hierarchical structure is ubiquitous in data across many domains. There are many hierarchical clustering methods, frequently used by domain experts, which strive to discover this structure. However, most of these methods limit discoverable hierarchies to those with binary branching structure. This limitation, while computationally convenient, is often undesirable. In this paper we explore a Bayesian hierarchical clustering algorithm that can produce trees with arbitrary branching structure at each node, known as rose trees. We interpret these trees as mixtures over partitions of a data set, an"},"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":"1203.3468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b834736202ef6d5fff972d5c844a8aced61225c254c1b266df1f727e4e7633aa","abstract_canon_sha256":"6861b66a3ea7985faad6f4c929264f2826cf59c7df435d97b59eefa831e630e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.510311Z","signature_b64":"6692JbJRURAfyjSYvSl9oRA3myobjOJCkxIx5/xg+nKGeVtx4OB1xB12JA1n5LczQxqgp3E1U9B7SRfEyYj4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ca60e71e76097d381b31ce218b6050f01ae320cab80997e8fd81193de18e22a","last_reissued_at":"2026-05-18T04:00:00.509679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.509679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Rose Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Charles Blundell, Katherine A. Heller, Yee Whye Teh","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"Hierarchical structure is ubiquitous in data across many domains. There are many hierarchical clustering methods, frequently used by domain experts, which strive to discover this structure. However, most of these methods limit discoverable hierarchies to those with binary branching structure. This limitation, while computationally convenient, is often undesirable. In this paper we explore a Bayesian hierarchical clustering algorithm that can produce trees with arbitrary branching structure at each node, known as rose trees. We interpret these trees as mixtures over partitions of a data set, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3468","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":"1203.3468","created_at":"2026-05-18T04:00:00.509786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3468v1","created_at":"2026-05-18T04:00:00.509786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3468","created_at":"2026-05-18T04:00:00.509786+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSTA44PHMCL5","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSTA44PHMCL5HANT","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSTA44PH","created_at":"2026-05-18T12:27:14.488303+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/LSTA44PHMCL5HANTDTRBRNQFB4","json":"https://pith.science/pith/LSTA44PHMCL5HANTDTRBRNQFB4.json","graph_json":"https://pith.science/api/pith-number/LSTA44PHMCL5HANTDTRBRNQFB4/graph.json","events_json":"https://pith.science/api/pith-number/LSTA44PHMCL5HANTDTRBRNQFB4/events.json","paper":"https://pith.science/paper/LSTA44PH"},"agent_actions":{"view_html":"https://pith.science/pith/LSTA44PHMCL5HANTDTRBRNQFB4","download_json":"https://pith.science/pith/LSTA44PHMCL5HANTDTRBRNQFB4.json","view_paper":"https://pith.science/paper/LSTA44PH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3468&json=true","fetch_graph":"https://pith.science/api/pith-number/LSTA44PHMCL5HANTDTRBRNQFB4/graph.json","fetch_events":"https://pith.science/api/pith-number/LSTA44PHMCL5HANTDTRBRNQFB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSTA44PHMCL5HANTDTRBRNQFB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSTA44PHMCL5HANTDTRBRNQFB4/action/storage_attestation","attest_author":"https://pith.science/pith/LSTA44PHMCL5HANTDTRBRNQFB4/action/author_attestation","sign_citation":"https://pith.science/pith/LSTA44PHMCL5HANTDTRBRNQFB4/action/citation_signature","submit_replication":"https://pith.science/pith/LSTA44PHMCL5HANTDTRBRNQFB4/action/replication_record"}},"created_at":"2026-05-18T04:00:00.509786+00:00","updated_at":"2026-05-18T04:00:00.509786+00:00"}