{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XILQDT7FTXTMZ3FX4LH4TKUX5O","short_pith_number":"pith:XILQDT7F","schema_version":"1.0","canonical_sha256":"ba1701cfe59de6ccecb7e2cfc9aa97ebafa9ccd3e1936d74f8e0c211b180a91d","source":{"kind":"arxiv","id":"1710.03013","version":1},"attestation_state":"computed","paper":{"title":"Distributed Kernel K-Means for Large Scale Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DC","authors_text":"Marco Jacopo Ferrarotti, Sergio Decherchi, Walter Rocchia","submitted_at":"2017-10-09T09:55:24Z","abstract_excerpt":"Clustering samples according to an effective metric and/or vector space representation is a challenging unsupervised learning task with a wide spectrum of applications. Among several clustering algorithms, k-means and its kernelized version have still a wide audience because of their conceptual simplicity and efficacy. However, the systematic application of the kernelized version of k-means is hampered by its inherent square scaling in memory with the number of samples. In this contribution, we devise an approximate strategy to minimize the kernel k-means cost function in which the trade-off b"},"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":"1710.03013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-09T09:55:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c0c079eb445c2c8edcf35670d6cefef02eff0b9d2cb30dade0944d0948c840e4","abstract_canon_sha256":"57fc8997b1c0543e93516772ee81eb62b03a4ac1d6a16ae8571cb8e1b0d040ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:28.215488Z","signature_b64":"WD+dxOe1g6NfDq/AZ+Dri8fD558K8wZ0r9hNwA1BO2H5gen5Bzq+Q9QhUbSCfZkjlysv8YJgjjtG76lS744OAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba1701cfe59de6ccecb7e2cfc9aa97ebafa9ccd3e1936d74f8e0c211b180a91d","last_reissued_at":"2026-05-18T00:33:28.214870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:28.214870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Kernel K-Means for Large Scale Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DC","authors_text":"Marco Jacopo Ferrarotti, Sergio Decherchi, Walter Rocchia","submitted_at":"2017-10-09T09:55:24Z","abstract_excerpt":"Clustering samples according to an effective metric and/or vector space representation is a challenging unsupervised learning task with a wide spectrum of applications. Among several clustering algorithms, k-means and its kernelized version have still a wide audience because of their conceptual simplicity and efficacy. However, the systematic application of the kernelized version of k-means is hampered by its inherent square scaling in memory with the number of samples. In this contribution, we devise an approximate strategy to minimize the kernel k-means cost function in which the trade-off b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03013","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":"1710.03013","created_at":"2026-05-18T00:33:28.214949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03013v1","created_at":"2026-05-18T00:33:28.214949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03013","created_at":"2026-05-18T00:33:28.214949+00:00"},{"alias_kind":"pith_short_12","alias_value":"XILQDT7FTXTM","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XILQDT7FTXTMZ3FX","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XILQDT7F","created_at":"2026-05-18T12:31:53.515858+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/XILQDT7FTXTMZ3FX4LH4TKUX5O","json":"https://pith.science/pith/XILQDT7FTXTMZ3FX4LH4TKUX5O.json","graph_json":"https://pith.science/api/pith-number/XILQDT7FTXTMZ3FX4LH4TKUX5O/graph.json","events_json":"https://pith.science/api/pith-number/XILQDT7FTXTMZ3FX4LH4TKUX5O/events.json","paper":"https://pith.science/paper/XILQDT7F"},"agent_actions":{"view_html":"https://pith.science/pith/XILQDT7FTXTMZ3FX4LH4TKUX5O","download_json":"https://pith.science/pith/XILQDT7FTXTMZ3FX4LH4TKUX5O.json","view_paper":"https://pith.science/paper/XILQDT7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03013&json=true","fetch_graph":"https://pith.science/api/pith-number/XILQDT7FTXTMZ3FX4LH4TKUX5O/graph.json","fetch_events":"https://pith.science/api/pith-number/XILQDT7FTXTMZ3FX4LH4TKUX5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XILQDT7FTXTMZ3FX4LH4TKUX5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XILQDT7FTXTMZ3FX4LH4TKUX5O/action/storage_attestation","attest_author":"https://pith.science/pith/XILQDT7FTXTMZ3FX4LH4TKUX5O/action/author_attestation","sign_citation":"https://pith.science/pith/XILQDT7FTXTMZ3FX4LH4TKUX5O/action/citation_signature","submit_replication":"https://pith.science/pith/XILQDT7FTXTMZ3FX4LH4TKUX5O/action/replication_record"}},"created_at":"2026-05-18T00:33:28.214949+00:00","updated_at":"2026-05-18T00:33:28.214949+00:00"}