{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IN3P2PN2FFVTW4EZG2PG6AK7RT","short_pith_number":"pith:IN3P2PN2","schema_version":"1.0","canonical_sha256":"4376fd3dba296b3b7099369e6f015f8cf07b51e1eeb970713c4ed3b9a31d7b64","source":{"kind":"arxiv","id":"2403.03670","version":2},"attestation_state":"computed","paper":{"title":"CDC: A Simple Framework for Complex Data Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bingheng Li, Erlin Pan, Xuanting Xie, Zhao Kang","submitted_at":"2024-03-06T12:47:14Z","abstract_excerpt":"In today's data-driven digital era, the amount as well as complexity, such as multi-view, non-Euclidean, and multi-relational, of the collected data are growing exponentially or even faster. Clustering, which unsupervisely extracts valid knowledge from data, is extremely useful in practice. However, existing methods are independently developed to handle one particular challenge at the expense of the others. In this work, we propose a simple but effective framework for complex data clustering (CDC) that can efficiently process different types of data with linear complexity. We first utilize gra"},"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":"2403.03670","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-06T12:47:14Z","cross_cats_sorted":[],"title_canon_sha256":"0e1a23788d6747888788eda0dea424c72d2c38cde485747794d2591829bc23d1","abstract_canon_sha256":"da870d616b389aff412113b320a09a251dba56d3df168db9f37ee1786743c618"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:40.893432Z","signature_b64":"GXrU1GF7bawygNOs7jt7RKvy4NSxHsKyr4lJq6zH0T1t70lyQxAG6ce6rijJGyYdXsNEzDE07uOa57a+wTMoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4376fd3dba296b3b7099369e6f015f8cf07b51e1eeb970713c4ed3b9a31d7b64","last_reissued_at":"2026-07-05T09:58:40.892986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:40.892986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CDC: A Simple Framework for Complex Data Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bingheng Li, Erlin Pan, Xuanting Xie, Zhao Kang","submitted_at":"2024-03-06T12:47:14Z","abstract_excerpt":"In today's data-driven digital era, the amount as well as complexity, such as multi-view, non-Euclidean, and multi-relational, of the collected data are growing exponentially or even faster. Clustering, which unsupervisely extracts valid knowledge from data, is extremely useful in practice. However, existing methods are independently developed to handle one particular challenge at the expense of the others. In this work, we propose a simple but effective framework for complex data clustering (CDC) that can efficiently process different types of data with linear complexity. We first utilize gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03670","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.03670/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":"2403.03670","created_at":"2026-07-05T09:58:40.893040+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.03670v2","created_at":"2026-07-05T09:58:40.893040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03670","created_at":"2026-07-05T09:58:40.893040+00:00"},{"alias_kind":"pith_short_12","alias_value":"IN3P2PN2FFVT","created_at":"2026-07-05T09:58:40.893040+00:00"},{"alias_kind":"pith_short_16","alias_value":"IN3P2PN2FFVTW4EZ","created_at":"2026-07-05T09:58:40.893040+00:00"},{"alias_kind":"pith_short_8","alias_value":"IN3P2PN2","created_at":"2026-07-05T09:58:40.893040+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06808","citing_title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","ref_index":2021,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IN3P2PN2FFVTW4EZG2PG6AK7RT","json":"https://pith.science/pith/IN3P2PN2FFVTW4EZG2PG6AK7RT.json","graph_json":"https://pith.science/api/pith-number/IN3P2PN2FFVTW4EZG2PG6AK7RT/graph.json","events_json":"https://pith.science/api/pith-number/IN3P2PN2FFVTW4EZG2PG6AK7RT/events.json","paper":"https://pith.science/paper/IN3P2PN2"},"agent_actions":{"view_html":"https://pith.science/pith/IN3P2PN2FFVTW4EZG2PG6AK7RT","download_json":"https://pith.science/pith/IN3P2PN2FFVTW4EZG2PG6AK7RT.json","view_paper":"https://pith.science/paper/IN3P2PN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.03670&json=true","fetch_graph":"https://pith.science/api/pith-number/IN3P2PN2FFVTW4EZG2PG6AK7RT/graph.json","fetch_events":"https://pith.science/api/pith-number/IN3P2PN2FFVTW4EZG2PG6AK7RT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IN3P2PN2FFVTW4EZG2PG6AK7RT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IN3P2PN2FFVTW4EZG2PG6AK7RT/action/storage_attestation","attest_author":"https://pith.science/pith/IN3P2PN2FFVTW4EZG2PG6AK7RT/action/author_attestation","sign_citation":"https://pith.science/pith/IN3P2PN2FFVTW4EZG2PG6AK7RT/action/citation_signature","submit_replication":"https://pith.science/pith/IN3P2PN2FFVTW4EZG2PG6AK7RT/action/replication_record"}},"created_at":"2026-07-05T09:58:40.893040+00:00","updated_at":"2026-07-05T09:58:40.893040+00:00"}