{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BCPWBVGMNRCBCPNCQAQAIDBBZC","short_pith_number":"pith:BCPWBVGM","schema_version":"1.0","canonical_sha256":"089f60d4cc6c44113da28020040c21c8be9ede589bafcbc207238300096c4f11","source":{"kind":"arxiv","id":"2501.05587","version":1},"attestation_state":"computed","paper":{"title":"Popcorn: Accelerating Kernel K-means on GPUs through Sparse Linear Algebra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Flavio Vella, Giulia Guidi, Julian Bellavita, Laura Del Rio Martin, Thomas Pasquali","submitted_at":"2025-01-09T21:43:16Z","abstract_excerpt":"K-means is a popular clustering algorithm with significant applications in numerous scientific and engineering areas. One drawback of K-means is its inability to identify non-linearly separable clusters, which may lead to inaccurate solutions in certain cases. Kernel K-means is a variant of classical K-means that can find non-linearly separable clusters. However, it scales quadratically with respect to the size of the dataset, taking several minutes to cluster even medium-sized datasets on traditional CPU-based machines. In this paper, we present a formulation of Kernel K-means using sparse-de"},"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":"2501.05587","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-09T21:43:16Z","cross_cats_sorted":[],"title_canon_sha256":"87819b4ddaee62ebcba97b5071f3d07f36808340cebae35fb88913d454bfa186","abstract_canon_sha256":"aacf56799a3529d0cf378f977ee8559874786035c2da0bf7335b6af6ca464fbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:25.619045Z","signature_b64":"/3Xekev0pHGSqfRN+KDMVvYMK/wIAXugRc3UPDiYwerGhrgilbzosLc23LAlxhDWNriffau5CK+lMTOFwPysCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"089f60d4cc6c44113da28020040c21c8be9ede589bafcbc207238300096c4f11","last_reissued_at":"2026-07-05T09:59:25.618575Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:25.618575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Popcorn: Accelerating Kernel K-means on GPUs through Sparse Linear Algebra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Flavio Vella, Giulia Guidi, Julian Bellavita, Laura Del Rio Martin, Thomas Pasquali","submitted_at":"2025-01-09T21:43:16Z","abstract_excerpt":"K-means is a popular clustering algorithm with significant applications in numerous scientific and engineering areas. One drawback of K-means is its inability to identify non-linearly separable clusters, which may lead to inaccurate solutions in certain cases. Kernel K-means is a variant of classical K-means that can find non-linearly separable clusters. However, it scales quadratically with respect to the size of the dataset, taking several minutes to cluster even medium-sized datasets on traditional CPU-based machines. In this paper, we present a formulation of Kernel K-means using sparse-de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05587","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/2501.05587/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":"2501.05587","created_at":"2026-07-05T09:59:25.618633+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.05587v1","created_at":"2026-07-05T09:59:25.618633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05587","created_at":"2026-07-05T09:59:25.618633+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCPWBVGMNRCB","created_at":"2026-07-05T09:59:25.618633+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCPWBVGMNRCBCPNC","created_at":"2026-07-05T09:59:25.618633+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCPWBVGM","created_at":"2026-07-05T09:59:25.618633+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/BCPWBVGMNRCBCPNCQAQAIDBBZC","json":"https://pith.science/pith/BCPWBVGMNRCBCPNCQAQAIDBBZC.json","graph_json":"https://pith.science/api/pith-number/BCPWBVGMNRCBCPNCQAQAIDBBZC/graph.json","events_json":"https://pith.science/api/pith-number/BCPWBVGMNRCBCPNCQAQAIDBBZC/events.json","paper":"https://pith.science/paper/BCPWBVGM"},"agent_actions":{"view_html":"https://pith.science/pith/BCPWBVGMNRCBCPNCQAQAIDBBZC","download_json":"https://pith.science/pith/BCPWBVGMNRCBCPNCQAQAIDBBZC.json","view_paper":"https://pith.science/paper/BCPWBVGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.05587&json=true","fetch_graph":"https://pith.science/api/pith-number/BCPWBVGMNRCBCPNCQAQAIDBBZC/graph.json","fetch_events":"https://pith.science/api/pith-number/BCPWBVGMNRCBCPNCQAQAIDBBZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCPWBVGMNRCBCPNCQAQAIDBBZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCPWBVGMNRCBCPNCQAQAIDBBZC/action/storage_attestation","attest_author":"https://pith.science/pith/BCPWBVGMNRCBCPNCQAQAIDBBZC/action/author_attestation","sign_citation":"https://pith.science/pith/BCPWBVGMNRCBCPNCQAQAIDBBZC/action/citation_signature","submit_replication":"https://pith.science/pith/BCPWBVGMNRCBCPNCQAQAIDBBZC/action/replication_record"}},"created_at":"2026-07-05T09:59:25.618633+00:00","updated_at":"2026-07-05T09:59:25.618633+00:00"}