{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NP3YUBA5ZXHDEY42E7SHHGKUKE","short_pith_number":"pith:NP3YUBA5","schema_version":"1.0","canonical_sha256":"6bf78a041dcdce32639a27e473995451019cc7efd75f5a03b9814eed2fd8d03a","source":{"kind":"arxiv","id":"2002.03508","version":1},"attestation_state":"computed","paper":{"title":"Fair Correlation Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Barna Saha, Roy Schwartz, Saba Ahmadi, Sainyam Galhotra","submitted_at":"2020-02-10T02:59:17Z","abstract_excerpt":"In this paper we study the problem of correlation clustering under fairness constraints. In the classic correlation clustering problem, we are given a complete graph where each edge is labeled positive or negative. The goal is to obtain a clustering of the vertices that minimizes disagreements -- the number of negative edges trapped inside a cluster plus positive edges between different clusters.\n  We consider two variations of fairness constraint for the problem of correlation clustering where each node has a color, and the goal is to form clusters that do not over-represent vertices of any c"},"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":"2002.03508","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-02-10T02:59:17Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"1f837d2c4790192d0b9c3cbd3fb8f9fc10309a6c0725a70165df0bbc944eb6b1","abstract_canon_sha256":"9abf74903cbf3786b9af5fcc87338a6d34f6f15c987efc308339fbd9eb4dffcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:22.994183Z","signature_b64":"Yekyqtp3DxUgyBMlCm4KkYFVQNaMImHtx3ebmN1P31f7p/+6jHL6RHNaQ8hvfiMbjq9KJA8CzdCF5NwFtOxQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bf78a041dcdce32639a27e473995451019cc7efd75f5a03b9814eed2fd8d03a","last_reissued_at":"2026-07-05T00:39:22.993683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:22.993683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Correlation Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Barna Saha, Roy Schwartz, Saba Ahmadi, Sainyam Galhotra","submitted_at":"2020-02-10T02:59:17Z","abstract_excerpt":"In this paper we study the problem of correlation clustering under fairness constraints. In the classic correlation clustering problem, we are given a complete graph where each edge is labeled positive or negative. The goal is to obtain a clustering of the vertices that minimizes disagreements -- the number of negative edges trapped inside a cluster plus positive edges between different clusters.\n  We consider two variations of fairness constraint for the problem of correlation clustering where each node has a color, and the goal is to form clusters that do not over-represent vertices of any c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03508","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.03508/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2002.03508","created_at":"2026-07-05T00:39:22.993748+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.03508v1","created_at":"2026-07-05T00:39:22.993748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03508","created_at":"2026-07-05T00:39:22.993748+00:00"},{"alias_kind":"pith_short_12","alias_value":"NP3YUBA5ZXHD","created_at":"2026-07-05T00:39:22.993748+00:00"},{"alias_kind":"pith_short_16","alias_value":"NP3YUBA5ZXHDEY42","created_at":"2026-07-05T00:39:22.993748+00:00"},{"alias_kind":"pith_short_8","alias_value":"NP3YUBA5","created_at":"2026-07-05T00:39:22.993748+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23265","citing_title":"Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2404.16676","citing_title":"Multilayer Correlation Clustering","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20897","citing_title":"Creating Robust and Fair Graph Structures for Connectivity and Clustering","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NP3YUBA5ZXHDEY42E7SHHGKUKE","json":"https://pith.science/pith/NP3YUBA5ZXHDEY42E7SHHGKUKE.json","graph_json":"https://pith.science/api/pith-number/NP3YUBA5ZXHDEY42E7SHHGKUKE/graph.json","events_json":"https://pith.science/api/pith-number/NP3YUBA5ZXHDEY42E7SHHGKUKE/events.json","paper":"https://pith.science/paper/NP3YUBA5"},"agent_actions":{"view_html":"https://pith.science/pith/NP3YUBA5ZXHDEY42E7SHHGKUKE","download_json":"https://pith.science/pith/NP3YUBA5ZXHDEY42E7SHHGKUKE.json","view_paper":"https://pith.science/paper/NP3YUBA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.03508&json=true","fetch_graph":"https://pith.science/api/pith-number/NP3YUBA5ZXHDEY42E7SHHGKUKE/graph.json","fetch_events":"https://pith.science/api/pith-number/NP3YUBA5ZXHDEY42E7SHHGKUKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NP3YUBA5ZXHDEY42E7SHHGKUKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NP3YUBA5ZXHDEY42E7SHHGKUKE/action/storage_attestation","attest_author":"https://pith.science/pith/NP3YUBA5ZXHDEY42E7SHHGKUKE/action/author_attestation","sign_citation":"https://pith.science/pith/NP3YUBA5ZXHDEY42E7SHHGKUKE/action/citation_signature","submit_replication":"https://pith.science/pith/NP3YUBA5ZXHDEY42E7SHHGKUKE/action/replication_record"}},"created_at":"2026-07-05T00:39:22.993748+00:00","updated_at":"2026-07-05T00:39:22.993748+00:00"}