{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OJURV3AHAE2KVVW5SXMTRQQ3FC","short_pith_number":"pith:OJURV3AH","schema_version":"1.0","canonical_sha256":"72691aec070134aad6dd95d938c21b28bcdd14a0e429c97df90942ce56d7569b","source":{"kind":"arxiv","id":"1810.13044","version":2},"attestation_state":"computed","paper":{"title":"Scalable Laplacian K-modes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric Granger, Imtiaz Masud Ziko, Ismail Ben Ayed","submitted_at":"2018-10-31T00:01:31Z","abstract_excerpt":"We advocate Laplacian K-modes for joint clustering and density mode finding, and propose a concave-convex relaxation of the problem, which yields a parallel algorithm that scales up to large datasets and high dimensions. We optimize a tight bound (auxiliary function) of our relaxation, which, at each iteration, amounts to computing an independent update for each cluster-assignment variable, with guaranteed convergence. Therefore, our bound optimizer can be trivially distributed for large-scale data sets. Furthermore, we show that the density modes can be obtained as byproducts of the assignmen"},"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":"1810.13044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-31T00:01:31Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"a2f72ffbeac337ef0324e1003051e19b987251d4495861f6de947b6d05d525f3","abstract_canon_sha256":"4ae70e274f4f649061abaf13f8a252b05f1129853180616fcbe5aa4c804c3a8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:12.701522Z","signature_b64":"xzKM57m7nrmNb9x0UxB9M5fdZG8tV1mXj+PVwaVIT6Bb8+Gvk+M4GaXOtCzCIYFcgXFQMKFh3ZQ8NCGp9vU0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72691aec070134aad6dd95d938c21b28bcdd14a0e429c97df90942ce56d7569b","last_reissued_at":"2026-05-18T00:00:12.700810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:12.700810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Laplacian K-modes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric Granger, Imtiaz Masud Ziko, Ismail Ben Ayed","submitted_at":"2018-10-31T00:01:31Z","abstract_excerpt":"We advocate Laplacian K-modes for joint clustering and density mode finding, and propose a concave-convex relaxation of the problem, which yields a parallel algorithm that scales up to large datasets and high dimensions. We optimize a tight bound (auxiliary function) of our relaxation, which, at each iteration, amounts to computing an independent update for each cluster-assignment variable, with guaranteed convergence. Therefore, our bound optimizer can be trivially distributed for large-scale data sets. Furthermore, we show that the density modes can be obtained as byproducts of the assignmen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13044","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":""},"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":"1810.13044","created_at":"2026-05-18T00:00:12.700930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.13044v2","created_at":"2026-05-18T00:00:12.700930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13044","created_at":"2026-05-18T00:00:12.700930+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJURV3AHAE2K","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJURV3AHAE2KVVW5","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJURV3AH","created_at":"2026-05-18T12:32:43.782077+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/OJURV3AHAE2KVVW5SXMTRQQ3FC","json":"https://pith.science/pith/OJURV3AHAE2KVVW5SXMTRQQ3FC.json","graph_json":"https://pith.science/api/pith-number/OJURV3AHAE2KVVW5SXMTRQQ3FC/graph.json","events_json":"https://pith.science/api/pith-number/OJURV3AHAE2KVVW5SXMTRQQ3FC/events.json","paper":"https://pith.science/paper/OJURV3AH"},"agent_actions":{"view_html":"https://pith.science/pith/OJURV3AHAE2KVVW5SXMTRQQ3FC","download_json":"https://pith.science/pith/OJURV3AHAE2KVVW5SXMTRQQ3FC.json","view_paper":"https://pith.science/paper/OJURV3AH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.13044&json=true","fetch_graph":"https://pith.science/api/pith-number/OJURV3AHAE2KVVW5SXMTRQQ3FC/graph.json","fetch_events":"https://pith.science/api/pith-number/OJURV3AHAE2KVVW5SXMTRQQ3FC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJURV3AHAE2KVVW5SXMTRQQ3FC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJURV3AHAE2KVVW5SXMTRQQ3FC/action/storage_attestation","attest_author":"https://pith.science/pith/OJURV3AHAE2KVVW5SXMTRQQ3FC/action/author_attestation","sign_citation":"https://pith.science/pith/OJURV3AHAE2KVVW5SXMTRQQ3FC/action/citation_signature","submit_replication":"https://pith.science/pith/OJURV3AHAE2KVVW5SXMTRQQ3FC/action/replication_record"}},"created_at":"2026-05-18T00:00:12.700930+00:00","updated_at":"2026-05-18T00:00:12.700930+00:00"}