{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ENYRFZNRCXDQ7U2RYZH4U23TL2","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":"ed830ffb60654fd486d3330828e8db4d0a18f560e21011a314db94457b87b045","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-17T19:48:32Z","title_canon_sha256":"c50e2ecc1d52b417e7d5b2962dd5166ba0dbf4a502187fb94f0c34b2e965e3e3"},"schema_version":"1.0","source":{"id":"1507.05086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05086","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05086v2","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05086","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"ENYRFZNRCXDQ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ENYRFZNRCXDQ7U2R","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ENYRFZNR","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:aa3573207bf83a1046b5031531bd3866ca2f266c2f125bc0a032a1e421c3ee51","target":"graph","created_at":"2026-05-18T01:36:37Z","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":"Given a similarity graph between items, correlation clustering (CC) groups similar items together and dissimilar ones apart. One of the most popular CC algorithms is KwikCluster: an algorithm that serially clusters neighborhoods of vertices, and obtains a 3-approximation ratio. Unfortunately, KwikCluster in practice requires a large number of clustering rounds, a potential bottleneck for large graphs.\n  We present C4 and ClusterWild!, two algorithms for parallel correlation clustering that run in a polylogarithmic number of rounds and achieve nearly linear speedups, provably. C4 uses concurren","authors_text":"Benjamin Recht, Dimitris Papailiopoulos, Kannan Ramchandran, Michael I. Jordan, Samet Oymak, Xinghao Pan","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-17T19:48:32Z","title":"Parallel Correlation Clustering on Big Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05086","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:7bdb0a97c5bfab46a0097089bc2c818254268999ebfb2865c86c2606b789740d","target":"record","created_at":"2026-05-18T01:36:37Z","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":"ed830ffb60654fd486d3330828e8db4d0a18f560e21011a314db94457b87b045","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-17T19:48:32Z","title_canon_sha256":"c50e2ecc1d52b417e7d5b2962dd5166ba0dbf4a502187fb94f0c34b2e965e3e3"},"schema_version":"1.0","source":{"id":"1507.05086","kind":"arxiv","version":2}},"canonical_sha256":"237112e5b115c70fd351c64fca6b735e8eacbed0e2b346b9d97414bb707a31da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"237112e5b115c70fd351c64fca6b735e8eacbed0e2b346b9d97414bb707a31da","first_computed_at":"2026-05-18T01:36:37.641910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:37.641910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ebQuXsVfpDxS/lddp9fhedSBwkSyOF/9UoYSnQmhL7mcKIrZG3q1haWJzGmneNjXD/03bshZJPfEWKjMpprBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:37.642651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bdb0a97c5bfab46a0097089bc2c818254268999ebfb2865c86c2606b789740d","sha256:aa3573207bf83a1046b5031531bd3866ca2f266c2f125bc0a032a1e421c3ee51"],"state_sha256":"b6e87b761f053d382f7681d7196e4a4bfd05fc3dddf2995e82601e3b497e8915"}