{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KXBUVYCMXGZQEBQTNTBFPYHQQN","short_pith_number":"pith:KXBUVYCM","canonical_record":{"source":{"id":"1011.2624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-11T12:12:56Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"ede483759ac62124a7826c153d35749c0a534ce26f618e6f76b20e622a39586e","abstract_canon_sha256":"be02c25000bc69a90e9eda8bcb4f2299da2758af8fd49a5256f97770c248d771"},"schema_version":"1.0"},"canonical_sha256":"55c34ae04cb9b30206136cc257e0f08361ab3b2208dc6401c1fb7cd096335c9f","source":{"kind":"arxiv","id":"1011.2624","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2624","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2624v2","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2624","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"KXBUVYCMXGZQ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KXBUVYCMXGZQEBQT","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KXBUVYCM","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KXBUVYCMXGZQEBQTNTBFPYHQQN","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-11T12:12:56Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"ede483759ac62124a7826c153d35749c0a534ce26f618e6f76b20e622a39586e","abstract_canon_sha256":"be02c25000bc69a90e9eda8bcb4f2299da2758af8fd49a5256f97770c248d771"},"schema_version":"1.0"},"canonical_sha256":"55c34ae04cb9b30206136cc257e0f08361ab3b2208dc6401c1fb7cd096335c9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:10.557390Z","signature_b64":"EqaCMtULdHpN7ukwClOEkK5HHUFiW0WIsY7PxWN2EoooWTH5/STdtIPvbAIPEQlocpDS91m0oS370J9Qppg/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55c34ae04cb9b30206136cc257e0f08361ab3b2208dc6401c1fb7cd096335c9f","last_reissued_at":"2026-05-18T04:10:10.556534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:10.556534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2624","source_version":2,"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:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePVLf4Aw74D5mujoK3OjKn68cTKxqVsvE5QY7orFBH9ffBN8S+GH0QKZKu8IV4EA4AToABfMDY4DgW4K4s75Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:10:57.256070Z"},"content_sha256":"9e496adeffa734503f2049d71da0693fb51b407acfb87925f1a590d0508b2da1","schema_version":"1.0","event_id":"sha256:9e496adeffa734503f2049d71da0693fb51b407acfb87925f1a590d0508b2da1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KXBUVYCMXGZQEBQTNTBFPYHQQN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering using Unsupervised Binary Trees: CUBT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ME","authors_text":"Badih Ghattas, Marcela Svarc, Ricardo Fraiman","submitted_at":"2010-11-11T12:12:56Z","abstract_excerpt":"We herein introduce a new method of interpretable clustering that uses unsupervised binary trees. It is a three-stage procedure, the first stage of which entails a series of recursive binary splits to reduce  the heterogeneity of the data within the new subsamples. During the second stage (pruning), consideration is given to whether adjacent nodes can be aggregated. Finally, during the third stage (joining), similar clusters are joined together, even if they do not share the same parent originally. Consistency results are obtained, and the procedure is used on simulated and real data sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2624","kind":"arxiv","version":2},"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:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aiIHn4pT7QwSKbGdIbFWpljs21JtTo9aWACQFtiao9dIGt+HXeyqrJhb0cTfZvwtzsDb3bhaIyBtzRykGKMjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:10:57.256754Z"},"content_sha256":"05ea3f3d0e9944acc8eb13243f46eb191d7b1899ec02596497b3612eeb48d7b2","schema_version":"1.0","event_id":"sha256:05ea3f3d0e9944acc8eb13243f46eb191d7b1899ec02596497b3612eeb48d7b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXBUVYCMXGZQEBQTNTBFPYHQQN/bundle.json","state_url":"https://pith.science/pith/KXBUVYCMXGZQEBQTNTBFPYHQQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXBUVYCMXGZQEBQTNTBFPYHQQN/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-06T11:10:57Z","links":{"resolver":"https://pith.science/pith/KXBUVYCMXGZQEBQTNTBFPYHQQN","bundle":"https://pith.science/pith/KXBUVYCMXGZQEBQTNTBFPYHQQN/bundle.json","state":"https://pith.science/pith/KXBUVYCMXGZQEBQTNTBFPYHQQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXBUVYCMXGZQEBQTNTBFPYHQQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KXBUVYCMXGZQEBQTNTBFPYHQQN","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":"be02c25000bc69a90e9eda8bcb4f2299da2758af8fd49a5256f97770c248d771","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-11T12:12:56Z","title_canon_sha256":"ede483759ac62124a7826c153d35749c0a534ce26f618e6f76b20e622a39586e"},"schema_version":"1.0","source":{"id":"1011.2624","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2624","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2624v2","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2624","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"KXBUVYCMXGZQ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KXBUVYCMXGZQEBQT","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KXBUVYCM","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:05ea3f3d0e9944acc8eb13243f46eb191d7b1899ec02596497b3612eeb48d7b2","target":"graph","created_at":"2026-05-18T04:10:10Z","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":"We herein introduce a new method of interpretable clustering that uses unsupervised binary trees. It is a three-stage procedure, the first stage of which entails a series of recursive binary splits to reduce  the heterogeneity of the data within the new subsamples. During the second stage (pruning), consideration is given to whether adjacent nodes can be aggregated. Finally, during the third stage (joining), similar clusters are joined together, even if they do not share the same parent originally. Consistency results are obtained, and the procedure is used on simulated and real data sets.","authors_text":"Badih Ghattas, Marcela Svarc, Ricardo Fraiman","cross_cats":["cs.LG","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-11T12:12:56Z","title":"Clustering using Unsupervised Binary Trees: CUBT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2624","kind":"arxiv","version":2},"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:9e496adeffa734503f2049d71da0693fb51b407acfb87925f1a590d0508b2da1","target":"record","created_at":"2026-05-18T04:10:10Z","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":"be02c25000bc69a90e9eda8bcb4f2299da2758af8fd49a5256f97770c248d771","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-11T12:12:56Z","title_canon_sha256":"ede483759ac62124a7826c153d35749c0a534ce26f618e6f76b20e622a39586e"},"schema_version":"1.0","source":{"id":"1011.2624","kind":"arxiv","version":2}},"canonical_sha256":"55c34ae04cb9b30206136cc257e0f08361ab3b2208dc6401c1fb7cd096335c9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55c34ae04cb9b30206136cc257e0f08361ab3b2208dc6401c1fb7cd096335c9f","first_computed_at":"2026-05-18T04:10:10.556534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:10.556534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EqaCMtULdHpN7ukwClOEkK5HHUFiW0WIsY7PxWN2EoooWTH5/STdtIPvbAIPEQlocpDS91m0oS370J9Qppg/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:10.557390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2624","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e496adeffa734503f2049d71da0693fb51b407acfb87925f1a590d0508b2da1","sha256:05ea3f3d0e9944acc8eb13243f46eb191d7b1899ec02596497b3612eeb48d7b2"],"state_sha256":"2dbbe7d0b27ff1c10a47c06ebe83164a87be79fb70b57092871a8f8844125053"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MO81qo43sUyLAS44kGCeaJSM6a58ArvZKtPrOo/myYRsXwabdUq2h8R+cYfr+cwT13qvK8efW8hJUe4jpUVZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:10:57.260470Z","bundle_sha256":"94a9d00d50c2ad2fd38171c53b76d2121075713e1831d726ea8cf20640da2eff"}}