{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ANJ2RX5JSJDC2TXGM2CKTI3HKZ","short_pith_number":"pith:ANJ2RX5J","canonical_record":{"source":{"id":"1207.6199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T08:24:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"254c4edeaa5971350484f1a674dfb29c418ab37c0410cfd2869cce87c3296d25","abstract_canon_sha256":"f566df7ae438f85e2015c8f4cd44c7319480862e2e7ba263cf852e4bb30052c5"},"schema_version":"1.0"},"canonical_sha256":"0353a8dfa992462d4ee66684a9a3675669fe82ad6f6077d8f2da1d305252e466","source":{"kind":"arxiv","id":"1207.6199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6199","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6199v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6199","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"ANJ2RX5JSJDC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ANJ2RX5JSJDC2TXG","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ANJ2RX5J","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ANJ2RX5JSJDC2TXGM2CKTI3HKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T08:24:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"254c4edeaa5971350484f1a674dfb29c418ab37c0410cfd2869cce87c3296d25","abstract_canon_sha256":"f566df7ae438f85e2015c8f4cd44c7319480862e2e7ba263cf852e4bb30052c5"},"schema_version":"1.0"},"canonical_sha256":"0353a8dfa992462d4ee66684a9a3675669fe82ad6f6077d8f2da1d305252e466","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.018107Z","signature_b64":"/Jx+E6KFsa90Jc1KvwTKtQQODiAwXgijdqMGhGNRCPlsisdd78mCGa+xaP7dg4JwISQ00rPU2SBRl3dCJ+ZUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0353a8dfa992462d4ee66684a9a3675669fe82ad6f6077d8f2da1d305252e466","last_reissued_at":"2026-05-18T02:21:08.017503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.017503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6199","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:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APyRudFdozNCy8Mph2ks5pXwngzwx95Rv/2rP0g9JkzbNXdbVSC9zsuX4kaYvfK8FIQhsSHHBb5FzO63015QCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:32:55.328964Z"},"content_sha256":"f00bb8d4f27e8dc827721a523bfda584ad806b4a056fce0e477e7464ee575063","schema_version":"1.0","event_id":"sha256:f00bb8d4f27e8dc827721a523bfda584ad806b4a056fce0e477e7464ee575063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ANJ2RX5JSJDC2TXGM2CKTI3HKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving Approximate Soft Clustering in Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Shankar Krishnan, Vaneet Aggarwal","submitted_at":"2012-07-26T08:24:05Z","abstract_excerpt":"In recent years, data streaming has gained prominence due to advances in technologies that enable many applications to generate continuous flows of data. This increases the need to develop algorithms that are able to efficiently process data streams. Additionally, real-time requirements and evolving nature of data streams make stream mining problems, including clustering, challenging research problems.\n  In this paper, we propose a one-pass streaming soft clustering (membership of a point in a cluster is described by a distribution) algorithm which approximates the \"soft\" version of the k-mean"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6199","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:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+gFoSe/4kBuSmgAViM7ZaCm7ozzvmJDy0HjE1EX2kdao9v7CBB6T6Og2lnvvsJ0ZCVOw28rx8gfwSM4+pLKLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:32:55.329310Z"},"content_sha256":"bf2847055254b21e1d4a94a2cfc56ce144a57d037a67b7a3dbfd792a6d2a9fc1","schema_version":"1.0","event_id":"sha256:bf2847055254b21e1d4a94a2cfc56ce144a57d037a67b7a3dbfd792a6d2a9fc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANJ2RX5JSJDC2TXGM2CKTI3HKZ/bundle.json","state_url":"https://pith.science/pith/ANJ2RX5JSJDC2TXGM2CKTI3HKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANJ2RX5JSJDC2TXGM2CKTI3HKZ/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-28T11:32:55Z","links":{"resolver":"https://pith.science/pith/ANJ2RX5JSJDC2TXGM2CKTI3HKZ","bundle":"https://pith.science/pith/ANJ2RX5JSJDC2TXGM2CKTI3HKZ/bundle.json","state":"https://pith.science/pith/ANJ2RX5JSJDC2TXGM2CKTI3HKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANJ2RX5JSJDC2TXGM2CKTI3HKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ANJ2RX5JSJDC2TXGM2CKTI3HKZ","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":"f566df7ae438f85e2015c8f4cd44c7319480862e2e7ba263cf852e4bb30052c5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T08:24:05Z","title_canon_sha256":"254c4edeaa5971350484f1a674dfb29c418ab37c0410cfd2869cce87c3296d25"},"schema_version":"1.0","source":{"id":"1207.6199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6199","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6199v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6199","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"ANJ2RX5JSJDC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ANJ2RX5JSJDC2TXG","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ANJ2RX5J","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:bf2847055254b21e1d4a94a2cfc56ce144a57d037a67b7a3dbfd792a6d2a9fc1","target":"graph","created_at":"2026-05-18T02:21:08Z","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":"In recent years, data streaming has gained prominence due to advances in technologies that enable many applications to generate continuous flows of data. This increases the need to develop algorithms that are able to efficiently process data streams. Additionally, real-time requirements and evolving nature of data streams make stream mining problems, including clustering, challenging research problems.\n  In this paper, we propose a one-pass streaming soft clustering (membership of a point in a cluster is described by a distribution) algorithm which approximates the \"soft\" version of the k-mean","authors_text":"Shankar Krishnan, Vaneet Aggarwal","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T08:24:05Z","title":"Achieving Approximate Soft Clustering in Data Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6199","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:f00bb8d4f27e8dc827721a523bfda584ad806b4a056fce0e477e7464ee575063","target":"record","created_at":"2026-05-18T02:21:08Z","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":"f566df7ae438f85e2015c8f4cd44c7319480862e2e7ba263cf852e4bb30052c5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T08:24:05Z","title_canon_sha256":"254c4edeaa5971350484f1a674dfb29c418ab37c0410cfd2869cce87c3296d25"},"schema_version":"1.0","source":{"id":"1207.6199","kind":"arxiv","version":1}},"canonical_sha256":"0353a8dfa992462d4ee66684a9a3675669fe82ad6f6077d8f2da1d305252e466","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0353a8dfa992462d4ee66684a9a3675669fe82ad6f6077d8f2da1d305252e466","first_computed_at":"2026-05-18T02:21:08.017503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:08.017503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Jx+E6KFsa90Jc1KvwTKtQQODiAwXgijdqMGhGNRCPlsisdd78mCGa+xaP7dg4JwISQ00rPU2SBRl3dCJ+ZUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:08.018107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f00bb8d4f27e8dc827721a523bfda584ad806b4a056fce0e477e7464ee575063","sha256:bf2847055254b21e1d4a94a2cfc56ce144a57d037a67b7a3dbfd792a6d2a9fc1"],"state_sha256":"380c604755d869df5b53575ec81be640c0025fba621b5f327265405ed224a234"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smEhHsv/KNzP2VWbX6n0AnA2ZrnjC4F2cBSJyHJM7M+8sL0cfS2LTg5XQY55fnJAh+SgmylyZl6PQ8LyItwjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:32:55.331237Z","bundle_sha256":"193e87d6eafe6c5c683761f80d56f07ceda47d0de7be9611f3685967adec77a0"}}