{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UFG62OGMO3WU56TBMU7HCZDOEM","short_pith_number":"pith:UFG62OGM","canonical_record":{"source":{"id":"1412.7625","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2014-12-24T08:55:50Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"9bc7e711b5c2f8edbf83de499af896677d27b6d7a1e6829ff4cfb9bfc2b9ee5c","abstract_canon_sha256":"555102ccede87b437ee41853b8bd623c3368ff958fc293fedc92b8f8338003ff"},"schema_version":"1.0"},"canonical_sha256":"a14ded38cc76ed4efa61653e71646e2303147c47fef01a61d46e21f7228323b1","source":{"kind":"arxiv","id":"1412.7625","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7625","created_at":"2026-05-18T02:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7625v2","created_at":"2026-05-18T02:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7625","created_at":"2026-05-18T02:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"UFG62OGMO3WU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UFG62OGMO3WU56TB","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UFG62OGM","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UFG62OGMO3WU56TBMU7HCZDOEM","target":"record","payload":{"canonical_record":{"source":{"id":"1412.7625","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2014-12-24T08:55:50Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"9bc7e711b5c2f8edbf83de499af896677d27b6d7a1e6829ff4cfb9bfc2b9ee5c","abstract_canon_sha256":"555102ccede87b437ee41853b8bd623c3368ff958fc293fedc92b8f8338003ff"},"schema_version":"1.0"},"canonical_sha256":"a14ded38cc76ed4efa61653e71646e2303147c47fef01a61d46e21f7228323b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:00.511289Z","signature_b64":"frAfIeKzzDfKh69Dwxv+SwImAerh+HkJJrrz6IOvYRWQz+hM1kYldomqiRX9YZbsv8o1jNbrlMkchTxXUoLzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a14ded38cc76ed4efa61653e71646e2303147c47fef01a61d46e21f7228323b1","last_reissued_at":"2026-05-18T02:30:00.510852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:00.510852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.7625","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-18T02:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"93FGHsvoKoo9QHhkp7vJts9yl1o1wIvymv9SZKD6/FlJ/tHF4LSniu/69V70/OxKbT1UqYW+xqpgmsF263oxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T00:10:36.661301Z"},"content_sha256":"cc1cdca6b8c625c9a8ed8b621620b222107caa0be5d60733944ee046b5dd6ab4","schema_version":"1.0","event_id":"sha256:cc1cdca6b8c625c9a8ed8b621620b222107caa0be5d60733944ee046b5dd6ab4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UFG62OGMO3WU56TBMU7HCZDOEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Effective Semi-supervised Divisive Clustering Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Teng Qiu, Yongjie Li","submitted_at":"2014-12-24T08:55:50Z","abstract_excerpt":"Nowadays, data are generated massively and rapidly from scientific fields as bioinformatics, neuroscience and astronomy to business and engineering fields. Cluster analysis, as one of the major data analysis tools, is therefore more significant than ever. We propose in this work an effective Semi-supervised Divisive Clustering algorithm (SDC). Data points are first organized by a minimal spanning tree. Next, this tree structure is transitioned to the in-tree structure, and then divided into sub-trees under the supervision of the labeled data, and in the end, all points in the sub-trees are dir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7625","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-18T02:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Ji7hChPKm1cWPOwBn2MX5gm2UrSoV1y43F7yWQMqDa4Q2dF9fGbAKGQZKomwWqs4QCBwRqFuM5A5KzQkYFlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T00:10:36.661673Z"},"content_sha256":"f8e51d483ecf39c4d6223df247f643537467d8fa7e814b6098766629257e341e","schema_version":"1.0","event_id":"sha256:f8e51d483ecf39c4d6223df247f643537467d8fa7e814b6098766629257e341e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFG62OGMO3WU56TBMU7HCZDOEM/bundle.json","state_url":"https://pith.science/pith/UFG62OGMO3WU56TBMU7HCZDOEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFG62OGMO3WU56TBMU7HCZDOEM/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-29T00:10:36Z","links":{"resolver":"https://pith.science/pith/UFG62OGMO3WU56TBMU7HCZDOEM","bundle":"https://pith.science/pith/UFG62OGMO3WU56TBMU7HCZDOEM/bundle.json","state":"https://pith.science/pith/UFG62OGMO3WU56TBMU7HCZDOEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFG62OGMO3WU56TBMU7HCZDOEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UFG62OGMO3WU56TBMU7HCZDOEM","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":"555102ccede87b437ee41853b8bd623c3368ff958fc293fedc92b8f8338003ff","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2014-12-24T08:55:50Z","title_canon_sha256":"9bc7e711b5c2f8edbf83de499af896677d27b6d7a1e6829ff4cfb9bfc2b9ee5c"},"schema_version":"1.0","source":{"id":"1412.7625","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7625","created_at":"2026-05-18T02:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7625v2","created_at":"2026-05-18T02:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7625","created_at":"2026-05-18T02:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"UFG62OGMO3WU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UFG62OGMO3WU56TB","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UFG62OGM","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:f8e51d483ecf39c4d6223df247f643537467d8fa7e814b6098766629257e341e","target":"graph","created_at":"2026-05-18T02:30:00Z","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":"Nowadays, data are generated massively and rapidly from scientific fields as bioinformatics, neuroscience and astronomy to business and engineering fields. Cluster analysis, as one of the major data analysis tools, is therefore more significant than ever. We propose in this work an effective Semi-supervised Divisive Clustering algorithm (SDC). Data points are first organized by a minimal spanning tree. Next, this tree structure is transitioned to the in-tree structure, and then divided into sub-trees under the supervision of the labeled data, and in the end, all points in the sub-trees are dir","authors_text":"Teng Qiu, Yongjie Li","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2014-12-24T08:55:50Z","title":"An Effective Semi-supervised Divisive Clustering Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7625","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:cc1cdca6b8c625c9a8ed8b621620b222107caa0be5d60733944ee046b5dd6ab4","target":"record","created_at":"2026-05-18T02:30:00Z","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":"555102ccede87b437ee41853b8bd623c3368ff958fc293fedc92b8f8338003ff","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2014-12-24T08:55:50Z","title_canon_sha256":"9bc7e711b5c2f8edbf83de499af896677d27b6d7a1e6829ff4cfb9bfc2b9ee5c"},"schema_version":"1.0","source":{"id":"1412.7625","kind":"arxiv","version":2}},"canonical_sha256":"a14ded38cc76ed4efa61653e71646e2303147c47fef01a61d46e21f7228323b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a14ded38cc76ed4efa61653e71646e2303147c47fef01a61d46e21f7228323b1","first_computed_at":"2026-05-18T02:30:00.510852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:00.510852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"frAfIeKzzDfKh69Dwxv+SwImAerh+HkJJrrz6IOvYRWQz+hM1kYldomqiRX9YZbsv8o1jNbrlMkchTxXUoLzBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:00.511289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7625","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc1cdca6b8c625c9a8ed8b621620b222107caa0be5d60733944ee046b5dd6ab4","sha256:f8e51d483ecf39c4d6223df247f643537467d8fa7e814b6098766629257e341e"],"state_sha256":"59d5eab4ad5378cd72d2c6c6b3aeb6203c356137c51c1cb557160e5306bd31b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BrkMgU4tvYXFtdNJ6yeDFqE5Icid66Fh5hR8BLFM2uqK7hwrYZVNcooRdctaV5019iobuzS7tjEnN3R5yzyhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T00:10:36.663619Z","bundle_sha256":"7978fa586b99ca7271c78ccfac6d1b60d05bb456d8e43cd3f24a583952d45b91"}}