{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LTRLVHJA62MQCJ4QGT4TIG5XCT","short_pith_number":"pith:LTRLVHJA","canonical_record":{"source":{"id":"1707.01199","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-07-05T02:54:48Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"6f37af95dfa0a0a7b308678e1d4be70c23ac50dfc3bc83e340bf0276f68f55cd","abstract_canon_sha256":"614acba9538341f704b79bc878f0df9a67e2d1822007b1a4ecb12eb865b2df41"},"schema_version":"1.0"},"canonical_sha256":"5ce2ba9d20f69901279034f9341bb714d5709a49f94a466bcb868c80d6f22a3f","source":{"kind":"arxiv","id":"1707.01199","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01199","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01199v2","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01199","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"LTRLVHJA62MQ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LTRLVHJA62MQCJ4Q","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LTRLVHJA","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LTRLVHJA62MQCJ4QGT4TIG5XCT","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01199","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-07-05T02:54:48Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"6f37af95dfa0a0a7b308678e1d4be70c23ac50dfc3bc83e340bf0276f68f55cd","abstract_canon_sha256":"614acba9538341f704b79bc878f0df9a67e2d1822007b1a4ecb12eb865b2df41"},"schema_version":"1.0"},"canonical_sha256":"5ce2ba9d20f69901279034f9341bb714d5709a49f94a466bcb868c80d6f22a3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:30.343031Z","signature_b64":"5wnl+/A+y9LqEB+a9E1hB3hHOlWBLTKiEnnHUpfP0SMAsFSU9GWUeh/zfcvfpjsuB9dnb3g6FI8xYJZ+sEsVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ce2ba9d20f69901279034f9341bb714d5709a49f94a466bcb868c80d6f22a3f","last_reissued_at":"2026-05-18T00:27:30.342173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:30.342173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01199","source_version":2,"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-18T00:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSfTVLMAlQ1aSVdBW50sxkgTFXOBGiBxsw6dtdAZwWTS3TIe7hjduVq74O7JIoUDB11AvWLrtQswoLUDVZ/0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:54:28.282348Z"},"content_sha256":"c61e24d22fad553ec624e16e88de3739810e4303900712e2afb1fd026f682a4b","schema_version":"1.0","event_id":"sha256:c61e24d22fad553ec624e16e88de3739810e4303900712e2afb1fd026f682a4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LTRLVHJA62MQCJ4QGT4TIG5XCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A clustering algorithm for multivariate data streams with correlated components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.AP","authors_text":"Alessandra Micheletti, Giacomo Aletti","submitted_at":"2017-07-05T02:54:48Z","abstract_excerpt":"Common clustering algorithms require multiple scans of all the data to achieve convergence, and this is prohibitive when large databases, with data arriving in streams, must be processed. Some algorithms to extend the popular K-means method to the analysis of streaming data are present in literature since 1998 (Bradley et al. in Scaling clustering algorithms to large databases. In: KDD. p. 9-15, 1998; O'Callaghan et al. in Streaming-data algorithms for high-quality clustering. In: Proceedings of IEEE international conference on data engineering. p. 685, 2001), based on the memorization and rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01199","kind":"arxiv","version":2},"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-18T00:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZXGmnvE5pgqr+ntA8/x1vWFC2D/AP73l2Sn4hiNW0XRZuNecL80hUyIjUPMeD/+KYE0/WFUba8YEEcxISLzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:54:28.282700Z"},"content_sha256":"8ebfb61b7ab8ae956472408a16b26c8a5d33eb84fc69ad299bc181e00dda9c27","schema_version":"1.0","event_id":"sha256:8ebfb61b7ab8ae956472408a16b26c8a5d33eb84fc69ad299bc181e00dda9c27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTRLVHJA62MQCJ4QGT4TIG5XCT/bundle.json","state_url":"https://pith.science/pith/LTRLVHJA62MQCJ4QGT4TIG5XCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTRLVHJA62MQCJ4QGT4TIG5XCT/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-06-03T07:54:28Z","links":{"resolver":"https://pith.science/pith/LTRLVHJA62MQCJ4QGT4TIG5XCT","bundle":"https://pith.science/pith/LTRLVHJA62MQCJ4QGT4TIG5XCT/bundle.json","state":"https://pith.science/pith/LTRLVHJA62MQCJ4QGT4TIG5XCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTRLVHJA62MQCJ4QGT4TIG5XCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LTRLVHJA62MQCJ4QGT4TIG5XCT","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":"614acba9538341f704b79bc878f0df9a67e2d1822007b1a4ecb12eb865b2df41","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-07-05T02:54:48Z","title_canon_sha256":"6f37af95dfa0a0a7b308678e1d4be70c23ac50dfc3bc83e340bf0276f68f55cd"},"schema_version":"1.0","source":{"id":"1707.01199","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01199","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01199v2","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01199","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"LTRLVHJA62MQ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LTRLVHJA62MQCJ4Q","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LTRLVHJA","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:8ebfb61b7ab8ae956472408a16b26c8a5d33eb84fc69ad299bc181e00dda9c27","target":"graph","created_at":"2026-05-18T00:27:30Z","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":"Common clustering algorithms require multiple scans of all the data to achieve convergence, and this is prohibitive when large databases, with data arriving in streams, must be processed. Some algorithms to extend the popular K-means method to the analysis of streaming data are present in literature since 1998 (Bradley et al. in Scaling clustering algorithms to large databases. In: KDD. p. 9-15, 1998; O'Callaghan et al. in Streaming-data algorithms for high-quality clustering. In: Proceedings of IEEE international conference on data engineering. p. 685, 2001), based on the memorization and rec","authors_text":"Alessandra Micheletti, Giacomo Aletti","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-07-05T02:54:48Z","title":"A clustering algorithm for multivariate data streams with correlated components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01199","kind":"arxiv","version":2},"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:c61e24d22fad553ec624e16e88de3739810e4303900712e2afb1fd026f682a4b","target":"record","created_at":"2026-05-18T00:27:30Z","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":"614acba9538341f704b79bc878f0df9a67e2d1822007b1a4ecb12eb865b2df41","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-07-05T02:54:48Z","title_canon_sha256":"6f37af95dfa0a0a7b308678e1d4be70c23ac50dfc3bc83e340bf0276f68f55cd"},"schema_version":"1.0","source":{"id":"1707.01199","kind":"arxiv","version":2}},"canonical_sha256":"5ce2ba9d20f69901279034f9341bb714d5709a49f94a466bcb868c80d6f22a3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ce2ba9d20f69901279034f9341bb714d5709a49f94a466bcb868c80d6f22a3f","first_computed_at":"2026-05-18T00:27:30.342173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:30.342173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5wnl+/A+y9LqEB+a9E1hB3hHOlWBLTKiEnnHUpfP0SMAsFSU9GWUeh/zfcvfpjsuB9dnb3g6FI8xYJZ+sEsVAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:30.343031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01199","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c61e24d22fad553ec624e16e88de3739810e4303900712e2afb1fd026f682a4b","sha256:8ebfb61b7ab8ae956472408a16b26c8a5d33eb84fc69ad299bc181e00dda9c27"],"state_sha256":"5734dbca3267fb527332f48518b8e1daae3590a81a4637e0099cfa4831ef134a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2ZEYmLhHHJSovhH4bz1KGZtxnbOMLEoEspI6dAwNRiFXweZrW203IvXCM9ABZx7ppC73E49jsfWwFgMOGU/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:54:28.285013Z","bundle_sha256":"1475a52c8b60507e2761c12f25dbba24829da0824bf192913e8d5fbe89f10828"}}