{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2YGDA2M2O4ULZTY4INPNYMW7QN","short_pith_number":"pith:2YGDA2M2","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"},"canonical_sha256":"d60c30699a7728bccf1c435edc32df83737b171c7894f38d88d711b44ad2d04e","source":{"kind":"arxiv","id":"1603.02782","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02782","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02782v1","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02782","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"2YGDA2M2O4UL","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YGDA2M2O4ULZTY4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YGDA2M2","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2YGDA2M2O4ULZTY4INPNYMW7QN","target":"record","payload":{"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"},"canonical_sha256":"d60c30699a7728bccf1c435edc32df83737b171c7894f38d88d711b44ad2d04e","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"},"source_kind":"arxiv","source_id":"1603.02782","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-18T01:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8zoWDKUYkTTenOZeBD0dgZnrX7Mfq3cGdElsGTWmgjYK5rHLUEU+c13qiVL7gAN1zpN8ghN25wQPur1rNK7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:31:51.950795Z"},"content_sha256":"58e7ecacf0dedafa2e830f40811965d4bd2f9c47678531c8fffa96026c0ef980","schema_version":"1.0","event_id":"sha256:58e7ecacf0dedafa2e830f40811965d4bd2f9c47678531c8fffa96026c0ef980"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2YGDA2M2O4ULZTY4INPNYMW7QN","target":"graph","payload":{"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"},"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-18T01:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yw1WvFVshej2uFWy0Qb9cKA+NkXJ2jO22aAgdwIJQ06t/KpmV37MjQxtemu+PPyUOMrTZdLA4ZZH0GVZcH09BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:31:51.951138Z"},"content_sha256":"46ba077060f7690b45d499f6250ec84df47d25b7cf173b5301067e76b9be67fd","schema_version":"1.0","event_id":"sha256:46ba077060f7690b45d499f6250ec84df47d25b7cf173b5301067e76b9be67fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/bundle.json","state_url":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/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-28T11:31:51Z","links":{"resolver":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN","bundle":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/bundle.json","state":"https://pith.science/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YGDA2M2O4ULZTY4INPNYMW7QN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2YGDA2M2O4ULZTY4INPNYMW7QN","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":"4e6cdeb5c84df9f54b47585977753c6528dfa07fa4bcb60faad304cc8236e872","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-09T05:18:53Z","title_canon_sha256":"7812ebd2cf0c106dba4d3bd973f1e09e55dc5cbbde5883d321159fd87912077d"},"schema_version":"1.0","source":{"id":"1603.02782","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02782","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02782v1","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02782","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"2YGDA2M2O4UL","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YGDA2M2O4ULZTY4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YGDA2M2","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:46ba077060f7690b45d499f6250ec84df47d25b7cf173b5301067e76b9be67fd","target":"graph","created_at":"2026-05-18T01:19:19Z","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":"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","authors_text":"Alexandros G. Dimakis, Anastasios Kyrillidis, Dimitris Papailiopoulos, Megasthenis Asteris","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-09T05:18:53Z","title":"Bipartite Correlation Clustering -- Maximizing Agreements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02782","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:58e7ecacf0dedafa2e830f40811965d4bd2f9c47678531c8fffa96026c0ef980","target":"record","created_at":"2026-05-18T01:19:19Z","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":"4e6cdeb5c84df9f54b47585977753c6528dfa07fa4bcb60faad304cc8236e872","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-09T05:18:53Z","title_canon_sha256":"7812ebd2cf0c106dba4d3bd973f1e09e55dc5cbbde5883d321159fd87912077d"},"schema_version":"1.0","source":{"id":"1603.02782","kind":"arxiv","version":1}},"canonical_sha256":"d60c30699a7728bccf1c435edc32df83737b171c7894f38d88d711b44ad2d04e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d60c30699a7728bccf1c435edc32df83737b171c7894f38d88d711b44ad2d04e","first_computed_at":"2026-05-18T01:19:19.845854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:19.845854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BOjdo36Ts1bMNYZ/l0koIpajRGugWuOzcvdnRjS6Anak/lv0JFve6v8jpsf41CRars/4QmOCWxdf4u8TWKXBDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:19.846209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02782","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58e7ecacf0dedafa2e830f40811965d4bd2f9c47678531c8fffa96026c0ef980","sha256:46ba077060f7690b45d499f6250ec84df47d25b7cf173b5301067e76b9be67fd"],"state_sha256":"480705fa362bbcf563cf345256e9bb8a45ab47f454d1f37d42886a916d795380"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9DB+fkpMExX9dYzw8BkBv+8cFwBiCISueWwSjtO/rGtHrbyq+4yLxamHjJUjD04cmrz9FzXr/mig3D3f+QzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:31:51.953111Z","bundle_sha256":"e714ee6921560585cf84f8789f22899d7a4eb6f8d50f3a97c21bcb5e214cb6cc"}}