{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MNL2SHDUWU3FF6ADC3RFYAI23T","short_pith_number":"pith:MNL2SHDU","schema_version":"1.0","canonical_sha256":"6357a91c74b53652f80316e25c011adcdc2bb8bbeafa1135d8f5420d38404071","source":{"kind":"arxiv","id":"2401.07389","version":1},"attestation_state":"computed","paper":{"title":"A Rapid Review of Clustering Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Aishwarya Nambissan, Aland Astudillo, Amir Aryani, Hui Yin, Shengyuan Cao, Stephen Petrie","submitted_at":"2024-01-14T23:19:53Z","abstract_excerpt":"Clustering algorithms aim to organize data into groups or clusters based on the inherent patterns and similarities within the data. They play an important role in today's life, such as in marketing and e-commerce, healthcare, data organization and analysis, and social media. Numerous clustering algorithms exist, with ongoing developments introducing new ones. Each algorithm possesses its own set of strengths and weaknesses, and as of now, there is no universally applicable algorithm for all tasks. In this work, we analyzed existing clustering algorithms and classify mainstream algorithms acros"},"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":"2401.07389","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-01-14T23:19:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"19f9c60e3a4e168a67a23c31a1dd3c6607e4c91194cbf78145d01faf9e3d15f0","abstract_canon_sha256":"9ca55fdf4154f35f6d46b12dbd629142205a60ef4c0844d19e3aedcde1d466e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:36.332842Z","signature_b64":"1N6Dcmlyl7tvRasNbh99ACFNzhYXPYEipirCmOXKNS+QFl6JeSliYEqUFDXwWUupNoCctAKx3PJ27ZIFPtszCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6357a91c74b53652f80316e25c011adcdc2bb8bbeafa1135d8f5420d38404071","last_reissued_at":"2026-07-05T07:33:36.332360Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:36.332360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Rapid Review of Clustering Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Aishwarya Nambissan, Aland Astudillo, Amir Aryani, Hui Yin, Shengyuan Cao, Stephen Petrie","submitted_at":"2024-01-14T23:19:53Z","abstract_excerpt":"Clustering algorithms aim to organize data into groups or clusters based on the inherent patterns and similarities within the data. They play an important role in today's life, such as in marketing and e-commerce, healthcare, data organization and analysis, and social media. Numerous clustering algorithms exist, with ongoing developments introducing new ones. Each algorithm possesses its own set of strengths and weaknesses, and as of now, there is no universally applicable algorithm for all tasks. In this work, we analyzed existing clustering algorithms and classify mainstream algorithms acros"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07389","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.07389/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":"2401.07389","created_at":"2026-07-05T07:33:36.332425+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07389v1","created_at":"2026-07-05T07:33:36.332425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07389","created_at":"2026-07-05T07:33:36.332425+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNL2SHDUWU3F","created_at":"2026-07-05T07:33:36.332425+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNL2SHDUWU3FF6AD","created_at":"2026-07-05T07:33:36.332425+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNL2SHDU","created_at":"2026-07-05T07:33:36.332425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.06268","citing_title":"Clustering with Uniformity- and Neighbor-Based Random Geometric Graphs","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2507.09983","citing_title":"Gradient boosted multi-population mortality modelling with high-frequency data","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10384","citing_title":"Context-KG: Context-Aware Knowledge Graph Visualization with User Preferences and Ontological Guidance","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07379","citing_title":"Quasicrystal Architected Nanomechanical Resonators via Data-Driven Design","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T","json":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T.json","graph_json":"https://pith.science/api/pith-number/MNL2SHDUWU3FF6ADC3RFYAI23T/graph.json","events_json":"https://pith.science/api/pith-number/MNL2SHDUWU3FF6ADC3RFYAI23T/events.json","paper":"https://pith.science/paper/MNL2SHDU"},"agent_actions":{"view_html":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T","download_json":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T.json","view_paper":"https://pith.science/paper/MNL2SHDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07389&json=true","fetch_graph":"https://pith.science/api/pith-number/MNL2SHDUWU3FF6ADC3RFYAI23T/graph.json","fetch_events":"https://pith.science/api/pith-number/MNL2SHDUWU3FF6ADC3RFYAI23T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/action/storage_attestation","attest_author":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/action/author_attestation","sign_citation":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/action/citation_signature","submit_replication":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/action/replication_record"}},"created_at":"2026-07-05T07:33:36.332425+00:00","updated_at":"2026-07-05T07:33:36.332425+00:00"}