{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:U4PVKTS5PNCGSWNDGJBKWDBAKN","short_pith_number":"pith:U4PVKTS5","schema_version":"1.0","canonical_sha256":"a71f554e5d7b446959a33242ab0c20535d435aea74f31cbe8765ab2ab89e1096","source":{"kind":"arxiv","id":"2205.02618","version":1},"attestation_state":"computed","paper":{"title":"Contrastive Multi-view Hyperbolic Hierarchical Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bing Bai, Fangfei Lin, Kun Bai, Peng Zhao, Yazhou Ren, Zenglin Xu","submitted_at":"2022-05-05T12:56:55Z","abstract_excerpt":"Hierarchical clustering recursively partitions data at an increasingly finer granularity. In real-world applications, multi-view data have become increasingly important. This raises a less investigated problem, i.e., multi-view hierarchical clustering, to better understand the hierarchical structure of multi-view data. To this end, we propose a novel neural network-based model, namely Contrastive Multi-view Hyperbolic Hierarchical Clustering (CMHHC). It consists of three components, i.e., multi-view alignment learning, aligned feature similarity learning, and continuous hyperbolic hierarchical"},"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":"2205.02618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-05T12:56:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e2338360877ea88d408f1e98917670798a77c451d4c51fd2be65fcb882f7a174","abstract_canon_sha256":"a34fa9e5aafc2981db2713dd2a5adc7246daa806f739fc03f9dfb81db9760262"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:20:39.373543Z","signature_b64":"J0dE+Uz98xTLnXiKvvxGQLcmhtpiogMSjywUjM2lsBAzStl0+ngWZQtBTiFxzSJCUgmv4rTbWA2ij/MhoCv2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a71f554e5d7b446959a33242ab0c20535d435aea74f31cbe8765ab2ab89e1096","last_reissued_at":"2026-07-05T04:20:39.373150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:20:39.373150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contrastive Multi-view Hyperbolic Hierarchical Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bing Bai, Fangfei Lin, Kun Bai, Peng Zhao, Yazhou Ren, Zenglin Xu","submitted_at":"2022-05-05T12:56:55Z","abstract_excerpt":"Hierarchical clustering recursively partitions data at an increasingly finer granularity. In real-world applications, multi-view data have become increasingly important. This raises a less investigated problem, i.e., multi-view hierarchical clustering, to better understand the hierarchical structure of multi-view data. To this end, we propose a novel neural network-based model, namely Contrastive Multi-view Hyperbolic Hierarchical Clustering (CMHHC). It consists of three components, i.e., multi-view alignment learning, aligned feature similarity learning, and continuous hyperbolic hierarchical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.02618","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.02618/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.02618","created_at":"2026-07-05T04:20:39.373205+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.02618v1","created_at":"2026-07-05T04:20:39.373205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.02618","created_at":"2026-07-05T04:20:39.373205+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4PVKTS5PNCG","created_at":"2026-07-05T04:20:39.373205+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4PVKTS5PNCGSWND","created_at":"2026-07-05T04:20:39.373205+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4PVKTS5","created_at":"2026-07-05T04:20:39.373205+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10128","citing_title":"On the Universal Statistical Consistency of Expansive Hyperbolic Deep Convolutional Neural Networks","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U4PVKTS5PNCGSWNDGJBKWDBAKN","json":"https://pith.science/pith/U4PVKTS5PNCGSWNDGJBKWDBAKN.json","graph_json":"https://pith.science/api/pith-number/U4PVKTS5PNCGSWNDGJBKWDBAKN/graph.json","events_json":"https://pith.science/api/pith-number/U4PVKTS5PNCGSWNDGJBKWDBAKN/events.json","paper":"https://pith.science/paper/U4PVKTS5"},"agent_actions":{"view_html":"https://pith.science/pith/U4PVKTS5PNCGSWNDGJBKWDBAKN","download_json":"https://pith.science/pith/U4PVKTS5PNCGSWNDGJBKWDBAKN.json","view_paper":"https://pith.science/paper/U4PVKTS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.02618&json=true","fetch_graph":"https://pith.science/api/pith-number/U4PVKTS5PNCGSWNDGJBKWDBAKN/graph.json","fetch_events":"https://pith.science/api/pith-number/U4PVKTS5PNCGSWNDGJBKWDBAKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4PVKTS5PNCGSWNDGJBKWDBAKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4PVKTS5PNCGSWNDGJBKWDBAKN/action/storage_attestation","attest_author":"https://pith.science/pith/U4PVKTS5PNCGSWNDGJBKWDBAKN/action/author_attestation","sign_citation":"https://pith.science/pith/U4PVKTS5PNCGSWNDGJBKWDBAKN/action/citation_signature","submit_replication":"https://pith.science/pith/U4PVKTS5PNCGSWNDGJBKWDBAKN/action/replication_record"}},"created_at":"2026-07-05T04:20:39.373205+00:00","updated_at":"2026-07-05T04:20:39.373205+00:00"}