{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:N3ADIFK7WEYWRIJFM4VP7JGDCJ","short_pith_number":"pith:N3ADIFK7","canonical_record":{"source":{"id":"1012.3011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-14T12:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"cfb269312388813b4b150b9d3d987822c6f227be0e9c1c32eb55512a7c898bce","abstract_canon_sha256":"67362e95af8b11b5d2fe9f56b462eae737e648beb88b7eb3c8c9ea8d6a726019"},"schema_version":"1.0"},"canonical_sha256":"6ec034155fb13168a125672affa4c312707150021a5b2c9e64beadab91764711","source":{"kind":"arxiv","id":"1012.3011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3011","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3011v1","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3011","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"pith_short_12","alias_value":"N3ADIFK7WEYW","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N3ADIFK7WEYWRIJF","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N3ADIFK7","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:N3ADIFK7WEYWRIJFM4VP7JGDCJ","target":"record","payload":{"canonical_record":{"source":{"id":"1012.3011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-14T12:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"cfb269312388813b4b150b9d3d987822c6f227be0e9c1c32eb55512a7c898bce","abstract_canon_sha256":"67362e95af8b11b5d2fe9f56b462eae737e648beb88b7eb3c8c9ea8d6a726019"},"schema_version":"1.0"},"canonical_sha256":"6ec034155fb13168a125672affa4c312707150021a5b2c9e64beadab91764711","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:18.852303Z","signature_b64":"mSoUTbr+tobcRsADEuKOPYQzzPPiJgedYKu8HeV2rhOXJwKHTJ1On521Fmtwd+YasiG8mvdTJ5QKeoPxFYYzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec034155fb13168a125672affa4c312707150021a5b2c9e64beadab91764711","last_reissued_at":"2026-05-18T04:33:18.851736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:18.851736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.3011","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-18T04:33:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3WFSqcKBRQ44tToxxlbPQtJLjGGhsGfA/gHXzXOii0g2ntg71J3dlfKba8ug6Kw7lhdpRhBJxJ+LOKSbUbzBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:58:08.036184Z"},"content_sha256":"ee29afeff53b4384a4f4bbe53d35c380e4dea0962afb265296ea791ab01a4e73","schema_version":"1.0","event_id":"sha256:ee29afeff53b4384a4f4bbe53d35c380e4dea0962afb265296ea791ab01a4e73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:N3ADIFK7WEYWRIJFM4VP7JGDCJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Algorithm for Bipartite Correlation Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Edo Liberty, Nir Ailon, Noa Avigdor-Elgrabli","submitted_at":"2010-12-14T12:58:59Z","abstract_excerpt":"Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained in any way. The best known approximation algorithm for this problem gives a factor of 11. This result and all previous ones involve solving large linear or semi-definite programs which become prohibitive even for modestly sized tasks. In this paper we present an improved factor 4 approximation algorithm to this problem using a simple combinatorial algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3011","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-18T04:33:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQTOEjbaumNKw7Co1oLqPsT0g6qwMcbWTbEh+mHn/VGBIftA79TCUO2kuEI+XYCm7AkXSROprNhxhiUtg6orBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:58:08.036555Z"},"content_sha256":"678e629bc109ae6d11dabe5e251e726496587e8f872b5033940a18a010e93a0b","schema_version":"1.0","event_id":"sha256:678e629bc109ae6d11dabe5e251e726496587e8f872b5033940a18a010e93a0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3ADIFK7WEYWRIJFM4VP7JGDCJ/bundle.json","state_url":"https://pith.science/pith/N3ADIFK7WEYWRIJFM4VP7JGDCJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3ADIFK7WEYWRIJFM4VP7JGDCJ/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-06-02T00:58:08Z","links":{"resolver":"https://pith.science/pith/N3ADIFK7WEYWRIJFM4VP7JGDCJ","bundle":"https://pith.science/pith/N3ADIFK7WEYWRIJFM4VP7JGDCJ/bundle.json","state":"https://pith.science/pith/N3ADIFK7WEYWRIJFM4VP7JGDCJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3ADIFK7WEYWRIJFM4VP7JGDCJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:N3ADIFK7WEYWRIJFM4VP7JGDCJ","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":"67362e95af8b11b5d2fe9f56b462eae737e648beb88b7eb3c8c9ea8d6a726019","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-14T12:58:59Z","title_canon_sha256":"cfb269312388813b4b150b9d3d987822c6f227be0e9c1c32eb55512a7c898bce"},"schema_version":"1.0","source":{"id":"1012.3011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3011","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3011v1","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3011","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"pith_short_12","alias_value":"N3ADIFK7WEYW","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N3ADIFK7WEYWRIJF","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N3ADIFK7","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:678e629bc109ae6d11dabe5e251e726496587e8f872b5033940a18a010e93a0b","target":"graph","created_at":"2026-05-18T04:33:18Z","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":"Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained in any way. The best known approximation algorithm for this problem gives a factor of 11. This result and all previous ones involve solving large linear or semi-definite programs which become prohibitive even for modestly sized tasks. In this paper we present an improved factor 4 approximation algorithm to this problem using a simple combinatorial algorithm ","authors_text":"Edo Liberty, Nir Ailon, Noa Avigdor-Elgrabli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-14T12:58:59Z","title":"An Improved Algorithm for Bipartite Correlation Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3011","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:ee29afeff53b4384a4f4bbe53d35c380e4dea0962afb265296ea791ab01a4e73","target":"record","created_at":"2026-05-18T04:33:18Z","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":"67362e95af8b11b5d2fe9f56b462eae737e648beb88b7eb3c8c9ea8d6a726019","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-14T12:58:59Z","title_canon_sha256":"cfb269312388813b4b150b9d3d987822c6f227be0e9c1c32eb55512a7c898bce"},"schema_version":"1.0","source":{"id":"1012.3011","kind":"arxiv","version":1}},"canonical_sha256":"6ec034155fb13168a125672affa4c312707150021a5b2c9e64beadab91764711","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ec034155fb13168a125672affa4c312707150021a5b2c9e64beadab91764711","first_computed_at":"2026-05-18T04:33:18.851736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:18.851736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mSoUTbr+tobcRsADEuKOPYQzzPPiJgedYKu8HeV2rhOXJwKHTJ1On521Fmtwd+YasiG8mvdTJ5QKeoPxFYYzBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:18.852303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee29afeff53b4384a4f4bbe53d35c380e4dea0962afb265296ea791ab01a4e73","sha256:678e629bc109ae6d11dabe5e251e726496587e8f872b5033940a18a010e93a0b"],"state_sha256":"78a0ea0466cd462c1f7d20baefa32befc5e13df5251caf33b0c76b503a8958c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U39XqFN+7to1BRfs+4PLjuuTGYj2yiZhN5JMS1EMx1Z7g/8ELrW8igxxUJvDNb3B9RKLAlt3650T2rgd7IolCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:58:08.038398Z","bundle_sha256":"c5460aecc4bef022983f963d2ad01981e63f33c1b8d0f67f4dbd320c4ec54aa1"}}