{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ENYRFZNRCXDQ7U2RYZH4U23TL2","short_pith_number":"pith:ENYRFZNR","schema_version":"1.0","canonical_sha256":"237112e5b115c70fd351c64fca6b735e8eacbed0e2b346b9d97414bb707a31da","source":{"kind":"arxiv","id":"1507.05086","version":2},"attestation_state":"computed","paper":{"title":"Parallel Correlation Clustering on Big Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.DC","authors_text":"Benjamin Recht, Dimitris Papailiopoulos, Kannan Ramchandran, Michael I. Jordan, Samet Oymak, Xinghao Pan","submitted_at":"2015-07-17T19:48:32Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1507.05086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-17T19:48:32Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"c50e2ecc1d52b417e7d5b2962dd5166ba0dbf4a502187fb94f0c34b2e965e3e3","abstract_canon_sha256":"ed830ffb60654fd486d3330828e8db4d0a18f560e21011a314db94457b87b045"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:37.642651Z","signature_b64":"1ebQuXsVfpDxS/lddp9fhedSBwkSyOF/9UoYSnQmhL7mcKIrZG3q1haWJzGmneNjXD/03bshZJPfEWKjMpprBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"237112e5b115c70fd351c64fca6b735e8eacbed0e2b346b9d97414bb707a31da","last_reissued_at":"2026-05-18T01:36:37.641910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:37.641910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Correlation Clustering on Big Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.DC","authors_text":"Benjamin Recht, Dimitris Papailiopoulos, Kannan Ramchandran, Michael I. Jordan, Samet Oymak, Xinghao Pan","submitted_at":"2015-07-17T19:48:32Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05086","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.05086","created_at":"2026-05-18T01:36:37.642008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05086v2","created_at":"2026-05-18T01:36:37.642008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05086","created_at":"2026-05-18T01:36:37.642008+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENYRFZNRCXDQ","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENYRFZNRCXDQ7U2R","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENYRFZNR","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ENYRFZNRCXDQ7U2RYZH4U23TL2","json":"https://pith.science/pith/ENYRFZNRCXDQ7U2RYZH4U23TL2.json","graph_json":"https://pith.science/api/pith-number/ENYRFZNRCXDQ7U2RYZH4U23TL2/graph.json","events_json":"https://pith.science/api/pith-number/ENYRFZNRCXDQ7U2RYZH4U23TL2/events.json","paper":"https://pith.science/paper/ENYRFZNR"},"agent_actions":{"view_html":"https://pith.science/pith/ENYRFZNRCXDQ7U2RYZH4U23TL2","download_json":"https://pith.science/pith/ENYRFZNRCXDQ7U2RYZH4U23TL2.json","view_paper":"https://pith.science/paper/ENYRFZNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05086&json=true","fetch_graph":"https://pith.science/api/pith-number/ENYRFZNRCXDQ7U2RYZH4U23TL2/graph.json","fetch_events":"https://pith.science/api/pith-number/ENYRFZNRCXDQ7U2RYZH4U23TL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENYRFZNRCXDQ7U2RYZH4U23TL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENYRFZNRCXDQ7U2RYZH4U23TL2/action/storage_attestation","attest_author":"https://pith.science/pith/ENYRFZNRCXDQ7U2RYZH4U23TL2/action/author_attestation","sign_citation":"https://pith.science/pith/ENYRFZNRCXDQ7U2RYZH4U23TL2/action/citation_signature","submit_replication":"https://pith.science/pith/ENYRFZNRCXDQ7U2RYZH4U23TL2/action/replication_record"}},"created_at":"2026-05-18T01:36:37.642008+00:00","updated_at":"2026-05-18T01:36:37.642008+00:00"}