{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:MNL2SHDUWU3FF6ADC3RFYAI23T","short_pith_number":"pith:MNL2SHDU","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"},"canonical_sha256":"6357a91c74b53652f80316e25c011adcdc2bb8bbeafa1135d8f5420d38404071","source":{"kind":"arxiv","id":"2401.07389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.07389","created_at":"2026-07-05T07:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"2401.07389v1","created_at":"2026-07-05T07:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07389","created_at":"2026-07-05T07:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"MNL2SHDUWU3F","created_at":"2026-07-05T07:33:36Z"},{"alias_kind":"pith_short_16","alias_value":"MNL2SHDUWU3FF6AD","created_at":"2026-07-05T07:33:36Z"},{"alias_kind":"pith_short_8","alias_value":"MNL2SHDU","created_at":"2026-07-05T07:33:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:MNL2SHDUWU3FF6ADC3RFYAI23T","target":"record","payload":{"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"},"canonical_sha256":"6357a91c74b53652f80316e25c011adcdc2bb8bbeafa1135d8f5420d38404071","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"},"source_kind":"arxiv","source_id":"2401.07389","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSr146q9Hijrz6+mT5aaX2gqlH16LvVbcyHWYpFEHahzi0T7D70Yb+pbx/xABWiky6jomEnH4/vJ0XIcmOxHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:22:05.437080Z"},"content_sha256":"893fb68582a963974f3316bd23e79f6160ff3ca270cc8a71083d2a9af65c3b08","schema_version":"1.0","event_id":"sha256:893fb68582a963974f3316bd23e79f6160ff3ca270cc8a71083d2a9af65c3b08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:MNL2SHDUWU3FF6ADC3RFYAI23T","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+i/6pghYVqkBTQXrhk8+T7NHkBRRrzGzlw62/+ThGvQkeJWCnrV/8O3FX0wGBQG2aeZTBJPpGtyseAdSjyYpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:22:05.437473Z"},"content_sha256":"de70e978ea94fb4ca698aab6d0fc2e5fd487a222ddb3a27a0cfc5372fd06e80d","schema_version":"1.0","event_id":"sha256:de70e978ea94fb4ca698aab6d0fc2e5fd487a222ddb3a27a0cfc5372fd06e80d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/bundle.json","state_url":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T17:22:05Z","links":{"resolver":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T","bundle":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/bundle.json","state":"https://pith.science/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNL2SHDUWU3FF6ADC3RFYAI23T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MNL2SHDUWU3FF6ADC3RFYAI23T","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9ca55fdf4154f35f6d46b12dbd629142205a60ef4c0844d19e3aedcde1d466e5","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-01-14T23:19:53Z","title_canon_sha256":"19f9c60e3a4e168a67a23c31a1dd3c6607e4c91194cbf78145d01faf9e3d15f0"},"schema_version":"1.0","source":{"id":"2401.07389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.07389","created_at":"2026-07-05T07:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"2401.07389v1","created_at":"2026-07-05T07:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07389","created_at":"2026-07-05T07:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"MNL2SHDUWU3F","created_at":"2026-07-05T07:33:36Z"},{"alias_kind":"pith_short_16","alias_value":"MNL2SHDUWU3FF6AD","created_at":"2026-07-05T07:33:36Z"},{"alias_kind":"pith_short_8","alias_value":"MNL2SHDU","created_at":"2026-07-05T07:33:36Z"}],"graph_snapshots":[{"event_id":"sha256:de70e978ea94fb4ca698aab6d0fc2e5fd487a222ddb3a27a0cfc5372fd06e80d","target":"graph","created_at":"2026-07-05T07:33:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.07389/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aishwarya Nambissan, Aland Astudillo, Amir Aryani, Hui Yin, Shengyuan Cao, Stephen Petrie","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-01-14T23:19:53Z","title":"A Rapid Review of Clustering Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07389","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:893fb68582a963974f3316bd23e79f6160ff3ca270cc8a71083d2a9af65c3b08","target":"record","created_at":"2026-07-05T07:33:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9ca55fdf4154f35f6d46b12dbd629142205a60ef4c0844d19e3aedcde1d466e5","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-01-14T23:19:53Z","title_canon_sha256":"19f9c60e3a4e168a67a23c31a1dd3c6607e4c91194cbf78145d01faf9e3d15f0"},"schema_version":"1.0","source":{"id":"2401.07389","kind":"arxiv","version":1}},"canonical_sha256":"6357a91c74b53652f80316e25c011adcdc2bb8bbeafa1135d8f5420d38404071","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6357a91c74b53652f80316e25c011adcdc2bb8bbeafa1135d8f5420d38404071","first_computed_at":"2026-07-05T07:33:36.332360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:33:36.332360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1N6Dcmlyl7tvRasNbh99ACFNzhYXPYEipirCmOXKNS+QFl6JeSliYEqUFDXwWUupNoCctAKx3PJ27ZIFPtszCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:33:36.332842Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.07389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:893fb68582a963974f3316bd23e79f6160ff3ca270cc8a71083d2a9af65c3b08","sha256:de70e978ea94fb4ca698aab6d0fc2e5fd487a222ddb3a27a0cfc5372fd06e80d"],"state_sha256":"3f5082ef5b25a7335c624a53b8f44bf0568bfab0cd9ad8b2a4f30afb48e50a15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tx6ENp6yTrQpw8pqOYgReAPU6FuWtI1rSd+AzjLBhurD5d8nZWSq5gGgS0Xf+uy0vic8RFuFppmyvJbDC6X0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:22:05.439420Z","bundle_sha256":"51916e9d2fe02b0db7d1a39baa110e817ef3c7ffaea17c87d66789fa60a85723"}}