{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3UJT6RAHU3CYOJD45K7BSWT62Y","short_pith_number":"pith:3UJT6RAH","schema_version":"1.0","canonical_sha256":"dd133f4407a6c587247ceabe195a7ed6364d8bcf7ef9272782aa5148b7e10551","source":{"kind":"arxiv","id":"1406.3895","version":1},"attestation_state":"computed","paper":{"title":"The Laplacian K-modes algorithm for clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Weiran Wang","submitted_at":"2014-06-16T03:29:48Z","abstract_excerpt":"In addition to finding meaningful clusters, centroid-based clustering algorithms such as K-means or mean-shift should ideally find centroids that are valid patterns in the input space, representative of data in their cluster. This is challenging with data having a nonconvex or manifold structure, as with images or text. We introduce a new algorithm, Laplacian K-modes, which naturally combines three powerful ideas in clustering: the explicit use of assignment variables (as in K-means); the estimation of cluster centroids which are modes of each cluster's density estimate (as in mean-shift); and"},"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":"1406.3895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-16T03:29:48Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"6ffc0240db158c466ed49e8d7f36714d8341178fa4a9df1df41683289b4af46b","abstract_canon_sha256":"9373e3d19d3d77a6498c9c71c4458503d517da40a044e0f19d8e22c803b50cda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.545180Z","signature_b64":"6IZsSHxd4rRADpVrmhQY9EzLW39jPF0SsZE0JQ5SpC+7vRKSrsUVnZu7RkVuNRuoJ5if3f51RLtMMrBWuesCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd133f4407a6c587247ceabe195a7ed6364d8bcf7ef9272782aa5148b7e10551","last_reissued_at":"2026-05-18T02:49:39.544859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.544859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Laplacian K-modes algorithm for clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Weiran Wang","submitted_at":"2014-06-16T03:29:48Z","abstract_excerpt":"In addition to finding meaningful clusters, centroid-based clustering algorithms such as K-means or mean-shift should ideally find centroids that are valid patterns in the input space, representative of data in their cluster. This is challenging with data having a nonconvex or manifold structure, as with images or text. We introduce a new algorithm, Laplacian K-modes, which naturally combines three powerful ideas in clustering: the explicit use of assignment variables (as in K-means); the estimation of cluster centroids which are modes of each cluster's density estimate (as in mean-shift); and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3895","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":"1406.3895","created_at":"2026-05-18T02:49:39.544908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3895v1","created_at":"2026-05-18T02:49:39.544908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3895","created_at":"2026-05-18T02:49:39.544908+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UJT6RAHU3CY","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UJT6RAHU3CYOJD4","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UJT6RAH","created_at":"2026-05-18T12:28:11.866339+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/3UJT6RAHU3CYOJD45K7BSWT62Y","json":"https://pith.science/pith/3UJT6RAHU3CYOJD45K7BSWT62Y.json","graph_json":"https://pith.science/api/pith-number/3UJT6RAHU3CYOJD45K7BSWT62Y/graph.json","events_json":"https://pith.science/api/pith-number/3UJT6RAHU3CYOJD45K7BSWT62Y/events.json","paper":"https://pith.science/paper/3UJT6RAH"},"agent_actions":{"view_html":"https://pith.science/pith/3UJT6RAHU3CYOJD45K7BSWT62Y","download_json":"https://pith.science/pith/3UJT6RAHU3CYOJD45K7BSWT62Y.json","view_paper":"https://pith.science/paper/3UJT6RAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3895&json=true","fetch_graph":"https://pith.science/api/pith-number/3UJT6RAHU3CYOJD45K7BSWT62Y/graph.json","fetch_events":"https://pith.science/api/pith-number/3UJT6RAHU3CYOJD45K7BSWT62Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UJT6RAHU3CYOJD45K7BSWT62Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UJT6RAHU3CYOJD45K7BSWT62Y/action/storage_attestation","attest_author":"https://pith.science/pith/3UJT6RAHU3CYOJD45K7BSWT62Y/action/author_attestation","sign_citation":"https://pith.science/pith/3UJT6RAHU3CYOJD45K7BSWT62Y/action/citation_signature","submit_replication":"https://pith.science/pith/3UJT6RAHU3CYOJD45K7BSWT62Y/action/replication_record"}},"created_at":"2026-05-18T02:49:39.544908+00:00","updated_at":"2026-05-18T02:49:39.544908+00:00"}