{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6HZ6WHBKAUCBDXZHFLH4TP6ZHV","short_pith_number":"pith:6HZ6WHBK","schema_version":"1.0","canonical_sha256":"f1f3eb1c2a050411df272acfc9bfd93d426607bd6a0b096c38e5fb6ca9b8edcc","source":{"kind":"arxiv","id":"1802.07091","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Semismooth Newton Based Algorithm for Convex Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Yancheng Yuan","submitted_at":"2018-02-20T12:48:02Z","abstract_excerpt":"Clustering may be the most fundamental problem in unsupervised learning which is still active in machine learning research because its importance in many applications. Popular methods like K-means, may suffer from instability as they are prone to get stuck in its local minima. Recently, the sum-of-norms (SON) model (also known as clustering path), which is a convex relaxation of hierarchical clustering model, has been proposed in [7] and [5] Although numerical algorithms like ADMM and AMA are proposed to solve convex clustering model [2], it is known to be very challenging to solve large-scale"},"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":"1802.07091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-20T12:48:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"becbe6dbc53fe0b4177bf6dc09c85a10dafa60ca3e64f5d9a2e1b87906ea8166","abstract_canon_sha256":"8621acad6baa86b14283222719e63e73adc61bd777485505b08c8fb7fa2dc095"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:53.575170Z","signature_b64":"K5MCVIiFstlyeVurifWKuvSjbssf+G2nnRQlGI4/UinvjX//ZwdvurAVcl4R47b/7ucl13clyXOLUpWUwMZtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1f3eb1c2a050411df272acfc9bfd93d426607bd6a0b096c38e5fb6ca9b8edcc","last_reissued_at":"2026-05-18T00:22:53.574724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:53.574724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Semismooth Newton Based Algorithm for Convex Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Yancheng Yuan","submitted_at":"2018-02-20T12:48:02Z","abstract_excerpt":"Clustering may be the most fundamental problem in unsupervised learning which is still active in machine learning research because its importance in many applications. Popular methods like K-means, may suffer from instability as they are prone to get stuck in its local minima. Recently, the sum-of-norms (SON) model (also known as clustering path), which is a convex relaxation of hierarchical clustering model, has been proposed in [7] and [5] Although numerical algorithms like ADMM and AMA are proposed to solve convex clustering model [2], it is known to be very challenging to solve large-scale"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07091","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":"1802.07091","created_at":"2026-05-18T00:22:53.574799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07091v1","created_at":"2026-05-18T00:22:53.574799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07091","created_at":"2026-05-18T00:22:53.574799+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HZ6WHBKAUCB","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HZ6WHBKAUCBDXZH","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HZ6WHBK","created_at":"2026-05-18T12:32:08.215937+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/6HZ6WHBKAUCBDXZHFLH4TP6ZHV","json":"https://pith.science/pith/6HZ6WHBKAUCBDXZHFLH4TP6ZHV.json","graph_json":"https://pith.science/api/pith-number/6HZ6WHBKAUCBDXZHFLH4TP6ZHV/graph.json","events_json":"https://pith.science/api/pith-number/6HZ6WHBKAUCBDXZHFLH4TP6ZHV/events.json","paper":"https://pith.science/paper/6HZ6WHBK"},"agent_actions":{"view_html":"https://pith.science/pith/6HZ6WHBKAUCBDXZHFLH4TP6ZHV","download_json":"https://pith.science/pith/6HZ6WHBKAUCBDXZHFLH4TP6ZHV.json","view_paper":"https://pith.science/paper/6HZ6WHBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07091&json=true","fetch_graph":"https://pith.science/api/pith-number/6HZ6WHBKAUCBDXZHFLH4TP6ZHV/graph.json","fetch_events":"https://pith.science/api/pith-number/6HZ6WHBKAUCBDXZHFLH4TP6ZHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HZ6WHBKAUCBDXZHFLH4TP6ZHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HZ6WHBKAUCBDXZHFLH4TP6ZHV/action/storage_attestation","attest_author":"https://pith.science/pith/6HZ6WHBKAUCBDXZHFLH4TP6ZHV/action/author_attestation","sign_citation":"https://pith.science/pith/6HZ6WHBKAUCBDXZHFLH4TP6ZHV/action/citation_signature","submit_replication":"https://pith.science/pith/6HZ6WHBKAUCBDXZHFLH4TP6ZHV/action/replication_record"}},"created_at":"2026-05-18T00:22:53.574799+00:00","updated_at":"2026-05-18T00:22:53.574799+00:00"}