{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RNYHB7XF7C5QQGZV65VED7UWSF","short_pith_number":"pith:RNYHB7XF","canonical_record":{"source":{"id":"1812.02023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-05T14:47:58Z","cross_cats_sorted":[],"title_canon_sha256":"b4fd128e781c2704b6af7d105f3a01ce88e5b89253dc469bd88300358f6aa526","abstract_canon_sha256":"40d96604e26b223ff5bd9d0ec740f92f325b1c3787ba75de1a6d58b04f7acc51"},"schema_version":"1.0"},"canonical_sha256":"8b7070fee5f8bb081b35f76a41fe969178710b555b4a20bfe7075f5d2f3ba0bf","source":{"kind":"arxiv","id":"1812.02023","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02023","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02023v1","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02023","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"RNYHB7XF7C5Q","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RNYHB7XF7C5QQGZV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RNYHB7XF","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RNYHB7XF7C5QQGZV65VED7UWSF","target":"record","payload":{"canonical_record":{"source":{"id":"1812.02023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-05T14:47:58Z","cross_cats_sorted":[],"title_canon_sha256":"b4fd128e781c2704b6af7d105f3a01ce88e5b89253dc469bd88300358f6aa526","abstract_canon_sha256":"40d96604e26b223ff5bd9d0ec740f92f325b1c3787ba75de1a6d58b04f7acc51"},"schema_version":"1.0"},"canonical_sha256":"8b7070fee5f8bb081b35f76a41fe969178710b555b4a20bfe7075f5d2f3ba0bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:59.936996Z","signature_b64":"iB+Yk2XnFJislJ7J259SLTgxfiVjvyuFholMy+CKh2DEPXa3V3Krdr2EjBhRpT5Wakybz5cEfn9zGKD3QO+wCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b7070fee5f8bb081b35f76a41fe969178710b555b4a20bfe7075f5d2f3ba0bf","last_reissued_at":"2026-05-17T23:58:59.936537Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:59.936537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.02023","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-17T23:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drcS38iWB981wRHyGAWp2f8oqx4mtfW2QoOHYiwE9bG6YTXLNBHXs+3VWOgIZ3DzboI2JcukwXyXHNetjddAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:16:58.475750Z"},"content_sha256":"4a5e72e18756caa5970044e314124a1904d4956e01d4380b3bba4ab63f1540b7","schema_version":"1.0","event_id":"sha256:4a5e72e18756caa5970044e314124a1904d4956e01d4380b3bba4ab63f1540b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RNYHB7XF7C5QQGZV65VED7UWSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Correlation Clustering in Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew McGregor, Anthony Wirth, Graham Cormode, Kook Jin Ahn, Sudipto Guha","submitted_at":"2018-12-05T14:47:58Z","abstract_excerpt":"Clustering is a fundamental tool for analyzing large data sets. A rich body of work has been devoted to designing data-stream algorithms for the relevant optimization problems such as $k$-center, $k$-median, and $k$-means. Such algorithms need to be both time and and space efficient. In this paper, we address the problem of correlation clustering in the dynamic data stream model. The stream consists of updates to the edge weights of a graph on $n$ nodes and the goal is to find a node-partition such that the end-points of negative-weight edges are typically in different clusters whereas the end"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02023","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-17T23:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XM6GulcZPWXOpMhQX5NOoHehOXGZe936a2jtUNwoe3VfhKIGPKxlt9M7b5NIuEPpP1q6AWhUNpilqBkJJNQNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:16:58.476197Z"},"content_sha256":"3041b47eaa1032f2a7254ca382b5b885dc54d1c7c86ef7196fa6167edae28bb7","schema_version":"1.0","event_id":"sha256:3041b47eaa1032f2a7254ca382b5b885dc54d1c7c86ef7196fa6167edae28bb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNYHB7XF7C5QQGZV65VED7UWSF/bundle.json","state_url":"https://pith.science/pith/RNYHB7XF7C5QQGZV65VED7UWSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNYHB7XF7C5QQGZV65VED7UWSF/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-30T15:16:58Z","links":{"resolver":"https://pith.science/pith/RNYHB7XF7C5QQGZV65VED7UWSF","bundle":"https://pith.science/pith/RNYHB7XF7C5QQGZV65VED7UWSF/bundle.json","state":"https://pith.science/pith/RNYHB7XF7C5QQGZV65VED7UWSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNYHB7XF7C5QQGZV65VED7UWSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RNYHB7XF7C5QQGZV65VED7UWSF","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":"40d96604e26b223ff5bd9d0ec740f92f325b1c3787ba75de1a6d58b04f7acc51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-05T14:47:58Z","title_canon_sha256":"b4fd128e781c2704b6af7d105f3a01ce88e5b89253dc469bd88300358f6aa526"},"schema_version":"1.0","source":{"id":"1812.02023","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02023","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02023v1","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02023","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"RNYHB7XF7C5Q","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RNYHB7XF7C5QQGZV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RNYHB7XF","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:3041b47eaa1032f2a7254ca382b5b885dc54d1c7c86ef7196fa6167edae28bb7","target":"graph","created_at":"2026-05-17T23:58:59Z","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":"Clustering is a fundamental tool for analyzing large data sets. A rich body of work has been devoted to designing data-stream algorithms for the relevant optimization problems such as $k$-center, $k$-median, and $k$-means. Such algorithms need to be both time and and space efficient. In this paper, we address the problem of correlation clustering in the dynamic data stream model. The stream consists of updates to the edge weights of a graph on $n$ nodes and the goal is to find a node-partition such that the end-points of negative-weight edges are typically in different clusters whereas the end","authors_text":"Andrew McGregor, Anthony Wirth, Graham Cormode, Kook Jin Ahn, Sudipto Guha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-05T14:47:58Z","title":"Correlation Clustering in Data Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02023","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:4a5e72e18756caa5970044e314124a1904d4956e01d4380b3bba4ab63f1540b7","target":"record","created_at":"2026-05-17T23:58:59Z","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":"40d96604e26b223ff5bd9d0ec740f92f325b1c3787ba75de1a6d58b04f7acc51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-05T14:47:58Z","title_canon_sha256":"b4fd128e781c2704b6af7d105f3a01ce88e5b89253dc469bd88300358f6aa526"},"schema_version":"1.0","source":{"id":"1812.02023","kind":"arxiv","version":1}},"canonical_sha256":"8b7070fee5f8bb081b35f76a41fe969178710b555b4a20bfe7075f5d2f3ba0bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b7070fee5f8bb081b35f76a41fe969178710b555b4a20bfe7075f5d2f3ba0bf","first_computed_at":"2026-05-17T23:58:59.936537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:59.936537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iB+Yk2XnFJislJ7J259SLTgxfiVjvyuFholMy+CKh2DEPXa3V3Krdr2EjBhRpT5Wakybz5cEfn9zGKD3QO+wCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:59.936996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.02023","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a5e72e18756caa5970044e314124a1904d4956e01d4380b3bba4ab63f1540b7","sha256:3041b47eaa1032f2a7254ca382b5b885dc54d1c7c86ef7196fa6167edae28bb7"],"state_sha256":"ac8800204679366aa53634485487e41d882db4c96fe8c24e156d1f5a8ecad42b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4Gj2lOJvpWI87NWos+T1OSAnaE+4JRMIr3bvOKqtyhMgMC3sUOyPHKTWrq3hUKYgppmtHeTMyNANCIrDpOxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:16:58.478310Z","bundle_sha256":"05c754e5a3269d27c95e4fb22e64bbed91f927490d57b394ceff90615c623b32"}}