{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SJKIMKKUROPGFGJFEQX4KM3PQI","short_pith_number":"pith:SJKIMKKU","schema_version":"1.0","canonical_sha256":"92548629548b9e629925242fc5336f82087f71785325a4edde473a73f0dc0a0a","source":{"kind":"arxiv","id":"1706.02803","version":4},"attestation_state":"computed","paper":{"title":"Scalable Kernel K-Means Clustering with Nystrom Approximation: Relative-Error Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Gittens, Michael W. Mahoney, Shusen Wang","submitted_at":"2017-06-09T01:17:20Z","abstract_excerpt":"Kernel $k$-means clustering can correctly identify and extract a far more varied collection of cluster structures than the linear $k$-means clustering algorithm. However, kernel $k$-means clustering is computationally expensive when the non-linear feature map is high-dimensional and there are many input points. Kernel approximation, e.g., the Nystr\\\"om method, has been applied in previous works to approximately solve kernel learning problems when both of the above conditions are present. This work analyzes the application of this paradigm to kernel $k$-means clustering, and shows that applying"},"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":"1706.02803","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-09T01:17:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"55b1656238a08f5f9668a49653fcff03431830fe1f4c878fefc9160f153cde21","abstract_canon_sha256":"864bbbf53f4a8913897dc6e8e452c64878e763fb7fdae78f4129864a7dc6df9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:26.747141Z","signature_b64":"QwmvsJEMzdNm4Xw/7CaAkq3x1uvqSBCQY266S7DrMRKD+PKMt0kUVWk4HszEdTMf+aZpSUZsfRx/1aT+w+B6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92548629548b9e629925242fc5336f82087f71785325a4edde473a73f0dc0a0a","last_reissued_at":"2026-05-17T23:54:26.746653Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:26.746653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Kernel K-Means Clustering with Nystrom Approximation: Relative-Error Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Gittens, Michael W. Mahoney, Shusen Wang","submitted_at":"2017-06-09T01:17:20Z","abstract_excerpt":"Kernel $k$-means clustering can correctly identify and extract a far more varied collection of cluster structures than the linear $k$-means clustering algorithm. However, kernel $k$-means clustering is computationally expensive when the non-linear feature map is high-dimensional and there are many input points. Kernel approximation, e.g., the Nystr\\\"om method, has been applied in previous works to approximately solve kernel learning problems when both of the above conditions are present. This work analyzes the application of this paradigm to kernel $k$-means clustering, and shows that applying"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02803","kind":"arxiv","version":4},"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":"1706.02803","created_at":"2026-05-17T23:54:26.746739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02803v4","created_at":"2026-05-17T23:54:26.746739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02803","created_at":"2026-05-17T23:54:26.746739+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJKIMKKUROPG","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJKIMKKUROPGFGJF","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJKIMKKU","created_at":"2026-05-18T12:31:43.269735+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/SJKIMKKUROPGFGJFEQX4KM3PQI","json":"https://pith.science/pith/SJKIMKKUROPGFGJFEQX4KM3PQI.json","graph_json":"https://pith.science/api/pith-number/SJKIMKKUROPGFGJFEQX4KM3PQI/graph.json","events_json":"https://pith.science/api/pith-number/SJKIMKKUROPGFGJFEQX4KM3PQI/events.json","paper":"https://pith.science/paper/SJKIMKKU"},"agent_actions":{"view_html":"https://pith.science/pith/SJKIMKKUROPGFGJFEQX4KM3PQI","download_json":"https://pith.science/pith/SJKIMKKUROPGFGJFEQX4KM3PQI.json","view_paper":"https://pith.science/paper/SJKIMKKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02803&json=true","fetch_graph":"https://pith.science/api/pith-number/SJKIMKKUROPGFGJFEQX4KM3PQI/graph.json","fetch_events":"https://pith.science/api/pith-number/SJKIMKKUROPGFGJFEQX4KM3PQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJKIMKKUROPGFGJFEQX4KM3PQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJKIMKKUROPGFGJFEQX4KM3PQI/action/storage_attestation","attest_author":"https://pith.science/pith/SJKIMKKUROPGFGJFEQX4KM3PQI/action/author_attestation","sign_citation":"https://pith.science/pith/SJKIMKKUROPGFGJFEQX4KM3PQI/action/citation_signature","submit_replication":"https://pith.science/pith/SJKIMKKUROPGFGJFEQX4KM3PQI/action/replication_record"}},"created_at":"2026-05-17T23:54:26.746739+00:00","updated_at":"2026-05-17T23:54:26.746739+00:00"}