{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZUPVTTU5XNRWIU3WN553F5NYUS","short_pith_number":"pith:ZUPVTTU5","canonical_record":{"source":{"id":"1402.3849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-16T22:19:40Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"96ccf65cccd933548bc06f6bf4c2ccc2d38af67c85c9caf1128e4a855fa5217b","abstract_canon_sha256":"21af4d3edea3150f56ac45ecb3a1dd04d0f542295f77097fe26f08d527f7941e"},"schema_version":"1.0"},"canonical_sha256":"cd1f59ce9dbb636453766f7bb2f5b8a4abb0594cb818f7253a3061d20846d9f8","source":{"kind":"arxiv","id":"1402.3849","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3849","created_at":"2026-05-18T02:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3849v1","created_at":"2026-05-18T02:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3849","created_at":"2026-05-18T02:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZUPVTTU5XNRW","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZUPVTTU5XNRWIU3W","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZUPVTTU5","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZUPVTTU5XNRWIU3WN553F5NYUS","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-16T22:19:40Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"96ccf65cccd933548bc06f6bf4c2ccc2d38af67c85c9caf1128e4a855fa5217b","abstract_canon_sha256":"21af4d3edea3150f56ac45ecb3a1dd04d0f542295f77097fe26f08d527f7941e"},"schema_version":"1.0"},"canonical_sha256":"cd1f59ce9dbb636453766f7bb2f5b8a4abb0594cb818f7253a3061d20846d9f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:47.018952Z","signature_b64":"S2qdeBPVTM3J+u93jXJTpQkU/yXJ2Ybv2Lg4HsHKPF7xsptTp+QSFDtiUq8OFrC4OjPvA9bPHWbpv7fflhtGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd1f59ce9dbb636453766f7bb2f5b8a4abb0594cb818f7253a3061d20846d9f8","last_reissued_at":"2026-05-18T02:58:47.018128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:47.018128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3849","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-05-18T02:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1qJJoZnUlmpNx+Veqe8tHJxtcukVcQdTDNlR6LDW2uUBFpOtxZGfhNC0Vs0Rf8juonCitYDkCHtRjYZv6Nw1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T18:45:54.546558Z"},"content_sha256":"c67259ffe2d531f878f1ddad8af1bce438c91e99a481a228dd2b25b3bb15bdb5","schema_version":"1.0","event_id":"sha256:c67259ffe2d531f878f1ddad8af1bce438c91e99a481a228dd2b25b3bb15bdb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZUPVTTU5XNRWIU3WN553F5NYUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Kernel Clustering: Approximate Kernel k-means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CV","authors_text":"Anil K. Jain, Radha Chitta, Rong Jin, Timothy C. Havens","submitted_at":"2014-02-16T22:19:40Z","abstract_excerpt":"Kernel-based clustering algorithms have the ability to capture the non-linear structure in real world data. Among various kernel-based clustering algorithms, kernel k-means has gained popularity due to its simple iterative nature and ease of implementation. However, its run-time complexity and memory footprint increase quadratically in terms of the size of the data set, and hence, large data sets cannot be clustered efficiently. In this paper, we propose an approximation scheme based on randomization, called the Approximate Kernel k-means. We approximate the cluster centers using the kernel si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3849","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"},"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-05-18T02:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDcJ7PSGroCEI+1rtpAy98QgSviSnIkaHgTDf+OTCmMWOhGlSuFvlGnYCzf3sESTDEHJer9Ec5VZMib/uEE6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T18:45:54.547254Z"},"content_sha256":"2eacb06e7dac3e20937e24aca7d9d6bdacc219022df3fa0a30ae5dcd14e4972c","schema_version":"1.0","event_id":"sha256:2eacb06e7dac3e20937e24aca7d9d6bdacc219022df3fa0a30ae5dcd14e4972c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUPVTTU5XNRWIU3WN553F5NYUS/bundle.json","state_url":"https://pith.science/pith/ZUPVTTU5XNRWIU3WN553F5NYUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUPVTTU5XNRWIU3WN553F5NYUS/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-05-23T18:45:54Z","links":{"resolver":"https://pith.science/pith/ZUPVTTU5XNRWIU3WN553F5NYUS","bundle":"https://pith.science/pith/ZUPVTTU5XNRWIU3WN553F5NYUS/bundle.json","state":"https://pith.science/pith/ZUPVTTU5XNRWIU3WN553F5NYUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUPVTTU5XNRWIU3WN553F5NYUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZUPVTTU5XNRWIU3WN553F5NYUS","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":"21af4d3edea3150f56ac45ecb3a1dd04d0f542295f77097fe26f08d527f7941e","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-16T22:19:40Z","title_canon_sha256":"96ccf65cccd933548bc06f6bf4c2ccc2d38af67c85c9caf1128e4a855fa5217b"},"schema_version":"1.0","source":{"id":"1402.3849","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3849","created_at":"2026-05-18T02:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3849v1","created_at":"2026-05-18T02:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3849","created_at":"2026-05-18T02:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZUPVTTU5XNRW","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZUPVTTU5XNRWIU3W","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZUPVTTU5","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:2eacb06e7dac3e20937e24aca7d9d6bdacc219022df3fa0a30ae5dcd14e4972c","target":"graph","created_at":"2026-05-18T02:58:47Z","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"},"paper":{"abstract_excerpt":"Kernel-based clustering algorithms have the ability to capture the non-linear structure in real world data. Among various kernel-based clustering algorithms, kernel k-means has gained popularity due to its simple iterative nature and ease of implementation. However, its run-time complexity and memory footprint increase quadratically in terms of the size of the data set, and hence, large data sets cannot be clustered efficiently. In this paper, we propose an approximation scheme based on randomization, called the Approximate Kernel k-means. We approximate the cluster centers using the kernel si","authors_text":"Anil K. Jain, Radha Chitta, Rong Jin, Timothy C. Havens","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-16T22:19:40Z","title":"Scalable Kernel Clustering: Approximate Kernel k-means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3849","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:c67259ffe2d531f878f1ddad8af1bce438c91e99a481a228dd2b25b3bb15bdb5","target":"record","created_at":"2026-05-18T02:58:47Z","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":"21af4d3edea3150f56ac45ecb3a1dd04d0f542295f77097fe26f08d527f7941e","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-16T22:19:40Z","title_canon_sha256":"96ccf65cccd933548bc06f6bf4c2ccc2d38af67c85c9caf1128e4a855fa5217b"},"schema_version":"1.0","source":{"id":"1402.3849","kind":"arxiv","version":1}},"canonical_sha256":"cd1f59ce9dbb636453766f7bb2f5b8a4abb0594cb818f7253a3061d20846d9f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd1f59ce9dbb636453766f7bb2f5b8a4abb0594cb818f7253a3061d20846d9f8","first_computed_at":"2026-05-18T02:58:47.018128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:47.018128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S2qdeBPVTM3J+u93jXJTpQkU/yXJ2Ybv2Lg4HsHKPF7xsptTp+QSFDtiUq8OFrC4OjPvA9bPHWbpv7fflhtGBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:47.018952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3849","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c67259ffe2d531f878f1ddad8af1bce438c91e99a481a228dd2b25b3bb15bdb5","sha256:2eacb06e7dac3e20937e24aca7d9d6bdacc219022df3fa0a30ae5dcd14e4972c"],"state_sha256":"6ada79c71b70af79ebd74a10195e80fc145c79db048a695feca9fcbd6cade93a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GtWVRgPO+Sh3KXa8HRx0XdNZQ7gIN8/iy8n/YZCGrWe4vGWvHpTkZKoDulm0xMUBY9ZntaPRhFp+PF7hsQqBCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T18:45:54.553501Z","bundle_sha256":"010d618b3b0b03ac52e522d0eb5483a444468ff48f96615cc27a6b199b5c2af6"}}