{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IDG37Q3ZIQQJFYWF45XC5RZ4DP","short_pith_number":"pith:IDG37Q3Z","schema_version":"1.0","canonical_sha256":"40cdbfc379442092e2c5e76e2ec73c1bcd1ccf71e07b794451564bcd2e1f2fcf","source":{"kind":"arxiv","id":"1808.09144","version":1},"attestation_state":"computed","paper":{"title":"Weighted total variation based convex clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Guodong Xu, Hui Ji, Yu Xia","submitted_at":"2018-08-28T07:19:43Z","abstract_excerpt":"Data clustering is a fundamental problem with a wide range of applications. Standard methods, eg the $k$-means method, usually require solving a non-convex optimization problem. Recently, total variation based convex relaxation to the $k$-means model has emerged as an attractive alternative for data clustering. However, the existing results on its exact clustering property, ie, the condition imposed on data so that the method can provably give correct identification of all cluster memberships, is only applicable to very specific data and is also much more restrictive than that of some other me"},"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":"1808.09144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-28T07:19:43Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e8dba5f1444136768fb1c2da1861bfabd9ded3d293a63d923ff3b0d4ea7df1b4","abstract_canon_sha256":"f9d05f2cded74ff83c6575601ceafb54cb3d6633c8d67667e97b26633ea83af6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:04.359415Z","signature_b64":"kjDJ6DFPwFYVAE+ECFNZo92a/R66Gcib+ZuRh4FvN+ik/QXMshJs58YUEOjDF1VB4kmqscUirinZeETAfvl9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40cdbfc379442092e2c5e76e2ec73c1bcd1ccf71e07b794451564bcd2e1f2fcf","last_reissued_at":"2026-05-18T00:07:04.358700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:04.358700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted total variation based convex clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Guodong Xu, Hui Ji, Yu Xia","submitted_at":"2018-08-28T07:19:43Z","abstract_excerpt":"Data clustering is a fundamental problem with a wide range of applications. Standard methods, eg the $k$-means method, usually require solving a non-convex optimization problem. Recently, total variation based convex relaxation to the $k$-means model has emerged as an attractive alternative for data clustering. However, the existing results on its exact clustering property, ie, the condition imposed on data so that the method can provably give correct identification of all cluster memberships, is only applicable to very specific data and is also much more restrictive than that of some other me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09144","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":"1808.09144","created_at":"2026-05-18T00:07:04.358805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.09144v1","created_at":"2026-05-18T00:07:04.358805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09144","created_at":"2026-05-18T00:07:04.358805+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDG37Q3ZIQQJ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDG37Q3ZIQQJFYWF","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDG37Q3Z","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19313","citing_title":"A Unified Framework for Structure-Aware Clustering and Heterogeneous Causal Graph Learning","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IDG37Q3ZIQQJFYWF45XC5RZ4DP","json":"https://pith.science/pith/IDG37Q3ZIQQJFYWF45XC5RZ4DP.json","graph_json":"https://pith.science/api/pith-number/IDG37Q3ZIQQJFYWF45XC5RZ4DP/graph.json","events_json":"https://pith.science/api/pith-number/IDG37Q3ZIQQJFYWF45XC5RZ4DP/events.json","paper":"https://pith.science/paper/IDG37Q3Z"},"agent_actions":{"view_html":"https://pith.science/pith/IDG37Q3ZIQQJFYWF45XC5RZ4DP","download_json":"https://pith.science/pith/IDG37Q3ZIQQJFYWF45XC5RZ4DP.json","view_paper":"https://pith.science/paper/IDG37Q3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.09144&json=true","fetch_graph":"https://pith.science/api/pith-number/IDG37Q3ZIQQJFYWF45XC5RZ4DP/graph.json","fetch_events":"https://pith.science/api/pith-number/IDG37Q3ZIQQJFYWF45XC5RZ4DP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDG37Q3ZIQQJFYWF45XC5RZ4DP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDG37Q3ZIQQJFYWF45XC5RZ4DP/action/storage_attestation","attest_author":"https://pith.science/pith/IDG37Q3ZIQQJFYWF45XC5RZ4DP/action/author_attestation","sign_citation":"https://pith.science/pith/IDG37Q3ZIQQJFYWF45XC5RZ4DP/action/citation_signature","submit_replication":"https://pith.science/pith/IDG37Q3ZIQQJFYWF45XC5RZ4DP/action/replication_record"}},"created_at":"2026-05-18T00:07:04.358805+00:00","updated_at":"2026-05-18T00:07:04.358805+00:00"}