{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2YGDA2M2O4ULZTY4INPNYMW7QN","short_pith_number":"pith:2YGDA2M2","schema_version":"1.0","canonical_sha256":"d60c30699a7728bccf1c435edc32df83737b171c7894f38d88d711b44ad2d04e","source":{"kind":"arxiv","id":"1603.02782","version":1},"attestation_state":"computed","paper":{"title":"Bipartite Correlation Clustering -- Maximizing Agreements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"Alexandros G. Dimakis, Anastasios Kyrillidis, Dimitris Papailiopoulos, Megasthenis Asteris","submitted_at":"2016-03-09T05:18:53Z","abstract_excerpt":"In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph $G$ with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-' edges cut across clusters. BCC is known to be NP-hard.\n  We present a novel approximation algorithm for $k$-BCC, a variant of BCC with an upper bound $k$ on the number of clusters. Our algorithm outputs a $k$-clustering that provably achieves a number of agreements within a multiplicative ${(1-\\delta)}$-factor from the optimal, for any desired accuracy $\\del"},"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":"1603.02782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-09T05:18:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7812ebd2cf0c106dba4d3bd973f1e09e55dc5cbbde5883d321159fd87912077d","abstract_canon_sha256":"4e6cdeb5c84df9f54b47585977753c6528dfa07fa4bcb60faad304cc8236e872"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:19.846209Z","signature_b64":"BOjdo36Ts1bMNYZ/l0koIpajRGugWuOzcvdnRjS6Anak/lv0JFve6v8jpsf41CRars/4QmOCWxdf4u8TWKXBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d60c30699a7728bccf1c435edc32df83737b171c7894f38d88d711b44ad2d04e","last_reissued_at":"2026-05-18T01:19:19.845854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:19.845854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bipartite Correlation Clustering -- Maximizing Agreements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"Alexandros G. Dimakis, Anastasios Kyrillidis, Dimitris Papailiopoulos, Megasthenis Asteris","submitted_at":"2016-03-09T05:18:53Z","abstract_excerpt":"In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph $G$ with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-' edges cut across clusters. BCC is known to be NP-hard.\n  We present a novel approximation algorithm for $k$-BCC, a variant of BCC with an upper bound $k$ on the number of clusters. Our algorithm outputs a $k$-clustering that provably achieves a number of agreements within a multiplicative ${(1-\\delta)}$-factor from the optimal, for any desired accuracy $\\del"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02782","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.02782","created_at":"2026-05-18T01:19:19.845913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.02782v1","created_at":"2026-05-18T01:19:19.845913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02782","created_at":"2026-05-18T01:19:19.845913+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YGDA2M2O4UL","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YGDA2M2O4ULZTY4","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YGDA2M2","created_at":"2026-05-18T12:29:55.572404+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/2YGDA2M2O4ULZTY4INPNYMW7QN","json":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN.json","graph_json":"https://pith.science/api/pith-number/2YGDA2M2O4ULZTY4INPNYMW7QN/graph.json","events_json":"https://pith.science/api/pith-number/2YGDA2M2O4ULZTY4INPNYMW7QN/events.json","paper":"https://pith.science/paper/2YGDA2M2"},"agent_actions":{"view_html":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN","download_json":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN.json","view_paper":"https://pith.science/paper/2YGDA2M2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.02782&json=true","fetch_graph":"https://pith.science/api/pith-number/2YGDA2M2O4ULZTY4INPNYMW7QN/graph.json","fetch_events":"https://pith.science/api/pith-number/2YGDA2M2O4ULZTY4INPNYMW7QN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/action/storage_attestation","attest_author":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/action/author_attestation","sign_citation":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/action/citation_signature","submit_replication":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/action/replication_record"}},"created_at":"2026-05-18T01:19:19.845913+00:00","updated_at":"2026-05-18T01:19:19.845913+00:00"}