{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SHDNR66JRPTWWBUKI2FC2KYAQO","short_pith_number":"pith:SHDNR66J","schema_version":"1.0","canonical_sha256":"91c6d8fbc98be76b068a468a2d2b0083be76d388bbd447b96af8fd0b091afe60","source":{"kind":"arxiv","id":"1502.01827","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Maximum-Margin Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Greg Mori, Guang-Tong Zhou, Leonid Sigal, Mark Schmidt, Sung Ju Hwang","submitted_at":"2015-02-06T08:37:55Z","abstract_excerpt":"We present a hierarchical maximum-margin clustering method for unsupervised data analysis. Our method extends beyond flat maximum-margin clustering, and performs clustering recursively in a top-down manner. We propose an effective greedy splitting criteria for selecting which cluster to split next, and employ regularizers that enforce feature sharing/competition for capturing data semantics. Experimental results obtained on four standard datasets show that our method outperforms flat and hierarchical clustering baselines, while forming clean and semantically meaningful cluster hierarchies."},"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":"1502.01827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-06T08:37:55Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"313f377a3e18ef1afc9b6d62def611ed848a00a94acb67a70fe51818ee987c4d","abstract_canon_sha256":"6065d2effab1a8d2893a8e1961fce25ae683f86327e07366fd694c8a14bd9ba5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:50.590359Z","signature_b64":"yd1OwV3WBQWpFFoO738Jwl93YAsCWG37RkjJleIXy8MWi6Dw9EofooNWShnL/TDD3Q3rLiYRy8denkBm2VxeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91c6d8fbc98be76b068a468a2d2b0083be76d388bbd447b96af8fd0b091afe60","last_reissued_at":"2026-05-18T02:27:50.589961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:50.589961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Maximum-Margin Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Greg Mori, Guang-Tong Zhou, Leonid Sigal, Mark Schmidt, Sung Ju Hwang","submitted_at":"2015-02-06T08:37:55Z","abstract_excerpt":"We present a hierarchical maximum-margin clustering method for unsupervised data analysis. Our method extends beyond flat maximum-margin clustering, and performs clustering recursively in a top-down manner. We propose an effective greedy splitting criteria for selecting which cluster to split next, and employ regularizers that enforce feature sharing/competition for capturing data semantics. Experimental results obtained on four standard datasets show that our method outperforms flat and hierarchical clustering baselines, while forming clean and semantically meaningful cluster hierarchies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01827","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":"1502.01827","created_at":"2026-05-18T02:27:50.590022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01827v1","created_at":"2026-05-18T02:27:50.590022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01827","created_at":"2026-05-18T02:27:50.590022+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHDNR66JRPTW","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHDNR66JRPTWWBUK","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHDNR66J","created_at":"2026-05-18T12:29:42.218222+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/SHDNR66JRPTWWBUKI2FC2KYAQO","json":"https://pith.science/pith/SHDNR66JRPTWWBUKI2FC2KYAQO.json","graph_json":"https://pith.science/api/pith-number/SHDNR66JRPTWWBUKI2FC2KYAQO/graph.json","events_json":"https://pith.science/api/pith-number/SHDNR66JRPTWWBUKI2FC2KYAQO/events.json","paper":"https://pith.science/paper/SHDNR66J"},"agent_actions":{"view_html":"https://pith.science/pith/SHDNR66JRPTWWBUKI2FC2KYAQO","download_json":"https://pith.science/pith/SHDNR66JRPTWWBUKI2FC2KYAQO.json","view_paper":"https://pith.science/paper/SHDNR66J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01827&json=true","fetch_graph":"https://pith.science/api/pith-number/SHDNR66JRPTWWBUKI2FC2KYAQO/graph.json","fetch_events":"https://pith.science/api/pith-number/SHDNR66JRPTWWBUKI2FC2KYAQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHDNR66JRPTWWBUKI2FC2KYAQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHDNR66JRPTWWBUKI2FC2KYAQO/action/storage_attestation","attest_author":"https://pith.science/pith/SHDNR66JRPTWWBUKI2FC2KYAQO/action/author_attestation","sign_citation":"https://pith.science/pith/SHDNR66JRPTWWBUKI2FC2KYAQO/action/citation_signature","submit_replication":"https://pith.science/pith/SHDNR66JRPTWWBUKI2FC2KYAQO/action/replication_record"}},"created_at":"2026-05-18T02:27:50.590022+00:00","updated_at":"2026-05-18T02:27:50.590022+00:00"}