{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TPCKRTAOZ7JEUEZNIMQVTTDJQK","short_pith_number":"pith:TPCKRTAO","canonical_record":{"source":{"id":"1506.03425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-10T18:41:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"11ed9958243fe122934363be6f702ed355186fcc4e367cf29bb7c02ace5bb5cc","abstract_canon_sha256":"ccb35b17c8cdd3fbb68e13cb74a895ed50e221478d04410ed81c5415dd79d19a"},"schema_version":"1.0"},"canonical_sha256":"9bc4a8cc0ecfd24a132d432159cc69828fb824626f5c568f8f96515e549bf885","source":{"kind":"arxiv","id":"1506.03425","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03425","created_at":"2026-05-18T01:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03425v1","created_at":"2026-05-18T01:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03425","created_at":"2026-05-18T01:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"TPCKRTAOZ7JE","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TPCKRTAOZ7JEUEZN","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TPCKRTAO","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TPCKRTAOZ7JEUEZNIMQVTTDJQK","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-10T18:41:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"11ed9958243fe122934363be6f702ed355186fcc4e367cf29bb7c02ace5bb5cc","abstract_canon_sha256":"ccb35b17c8cdd3fbb68e13cb74a895ed50e221478d04410ed81c5415dd79d19a"},"schema_version":"1.0"},"canonical_sha256":"9bc4a8cc0ecfd24a132d432159cc69828fb824626f5c568f8f96515e549bf885","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:24.780985Z","signature_b64":"ZR0XFO5UBB6FE+Mg2nOVNVrXyBNYHttDV1cCoHggVspMA1dHhoPOA73TQ4De7LFJT5TwaJLXKr+DqJeO2RCADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bc4a8cc0ecfd24a132d432159cc69828fb824626f5c568f8f96515e549bf885","last_reissued_at":"2026-05-18T01:55:24.780420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:24.780420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03425","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-18T01:55:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3HfssaFmUa8ZBjz7sJsxzRI0xn5gZjJjfh6Rs9KrKgAqwlyvhDJ+tirEU7ZuOqwVsyS9clkr/zXjbEmH6fDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:41:43.893302Z"},"content_sha256":"4a70694562c62df0b5269b7e21854633d112128641f236f73fdb5057dc75cb05","schema_version":"1.0","event_id":"sha256:4a70694562c62df0b5269b7e21854633d112128641f236f73fdb5057dc75cb05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TPCKRTAOZ7JEUEZNIMQVTTDJQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Online Clustering with Randomized Skeleton Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Krzysztof Choromanski, Sanjiv Kumar, Xiaofeng Liu","submitted_at":"2015-06-10T18:41:55Z","abstract_excerpt":"We present a new fast online clustering algorithm that reliably recovers arbitrary-shaped data clusters in high throughout data streams. Unlike the existing state-of-the-art online clustering methods based on k-means or k-medoid, it does not make any restrictive generative assumptions. In addition, in contrast to existing nonparametric clustering techniques such as DBScan or DenStream, it gives provable theoretical guarantees. To achieve fast clustering, we propose to represent each cluster by a skeleton set which is updated continuously as new data is seen. A skeleton set consists of weighted"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03425","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-18T01:55:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iuewoTAUM2b5Mn0FOtESVa3xPJ2qjZkfBWKPSxSgugoTVp2WsHcu5FSuaUaRwhNrW7LDIIGmXIumEjYXc4NHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:41:43.893694Z"},"content_sha256":"1416c3f92530c869baef2645da0ad303b791378757e5bf370d5b1ce9f37c5aca","schema_version":"1.0","event_id":"sha256:1416c3f92530c869baef2645da0ad303b791378757e5bf370d5b1ce9f37c5aca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPCKRTAOZ7JEUEZNIMQVTTDJQK/bundle.json","state_url":"https://pith.science/pith/TPCKRTAOZ7JEUEZNIMQVTTDJQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPCKRTAOZ7JEUEZNIMQVTTDJQK/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-31T11:41:43Z","links":{"resolver":"https://pith.science/pith/TPCKRTAOZ7JEUEZNIMQVTTDJQK","bundle":"https://pith.science/pith/TPCKRTAOZ7JEUEZNIMQVTTDJQK/bundle.json","state":"https://pith.science/pith/TPCKRTAOZ7JEUEZNIMQVTTDJQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPCKRTAOZ7JEUEZNIMQVTTDJQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TPCKRTAOZ7JEUEZNIMQVTTDJQK","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":"ccb35b17c8cdd3fbb68e13cb74a895ed50e221478d04410ed81c5415dd79d19a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-10T18:41:55Z","title_canon_sha256":"11ed9958243fe122934363be6f702ed355186fcc4e367cf29bb7c02ace5bb5cc"},"schema_version":"1.0","source":{"id":"1506.03425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03425","created_at":"2026-05-18T01:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03425v1","created_at":"2026-05-18T01:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03425","created_at":"2026-05-18T01:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"TPCKRTAOZ7JE","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TPCKRTAOZ7JEUEZN","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TPCKRTAO","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:1416c3f92530c869baef2645da0ad303b791378757e5bf370d5b1ce9f37c5aca","target":"graph","created_at":"2026-05-18T01:55:24Z","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":"We present a new fast online clustering algorithm that reliably recovers arbitrary-shaped data clusters in high throughout data streams. Unlike the existing state-of-the-art online clustering methods based on k-means or k-medoid, it does not make any restrictive generative assumptions. In addition, in contrast to existing nonparametric clustering techniques such as DBScan or DenStream, it gives provable theoretical guarantees. To achieve fast clustering, we propose to represent each cluster by a skeleton set which is updated continuously as new data is seen. A skeleton set consists of weighted","authors_text":"Krzysztof Choromanski, Sanjiv Kumar, Xiaofeng Liu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-10T18:41:55Z","title":"Fast Online Clustering with Randomized Skeleton Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03425","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:4a70694562c62df0b5269b7e21854633d112128641f236f73fdb5057dc75cb05","target":"record","created_at":"2026-05-18T01:55:24Z","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":"ccb35b17c8cdd3fbb68e13cb74a895ed50e221478d04410ed81c5415dd79d19a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-10T18:41:55Z","title_canon_sha256":"11ed9958243fe122934363be6f702ed355186fcc4e367cf29bb7c02ace5bb5cc"},"schema_version":"1.0","source":{"id":"1506.03425","kind":"arxiv","version":1}},"canonical_sha256":"9bc4a8cc0ecfd24a132d432159cc69828fb824626f5c568f8f96515e549bf885","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bc4a8cc0ecfd24a132d432159cc69828fb824626f5c568f8f96515e549bf885","first_computed_at":"2026-05-18T01:55:24.780420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:24.780420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZR0XFO5UBB6FE+Mg2nOVNVrXyBNYHttDV1cCoHggVspMA1dHhoPOA73TQ4De7LFJT5TwaJLXKr+DqJeO2RCADA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:24.780985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a70694562c62df0b5269b7e21854633d112128641f236f73fdb5057dc75cb05","sha256:1416c3f92530c869baef2645da0ad303b791378757e5bf370d5b1ce9f37c5aca"],"state_sha256":"c76b7dde2f8137a4fc82999f9e8c493ea14d9d7e380cf58a5783055f0cb6acfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OsRUMtFPtryTViXd3lGtN8snaBwUR8N4q/Ny221cSTONHjYnFR2LDu9ri8d4OAz9tYQCddxohfwHEdAR3zKqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:41:43.895947Z","bundle_sha256":"392ae9a691ccdfd39d4722119e4e5d412e42ce626da15700cb0c7180b6e65e7c"}}