{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GIEMD6YOCGIUSCPJN2VGEEFAQI","short_pith_number":"pith:GIEMD6YO","schema_version":"1.0","canonical_sha256":"3208c1fb0e11914909e96eaa6210a0820ddcf0fe7c6d244e9a7e405b89152379","source":{"kind":"arxiv","id":"1902.10829","version":2},"attestation_state":"computed","paper":{"title":"Improved algorithms for Correlation Clustering with local objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantin Makarychev, Sanchit Kalhan, Timothy Zhou","submitted_at":"2019-02-27T23:23:17Z","abstract_excerpt":"Correlation Clustering is a powerful graph partitioning model that aims to cluster items based on the notion of similarity between items. An instance of the Correlation Clustering problem consists of a graph $G$ (not necessarily complete) whose edges are labeled by a binary classifier as ``similar'' and ``dissimilar''. An objective which has received a lot of attention in literature is that of minimizing the number of disagreements: an edge is in disagreement if it is a ``similar'' edge and is present across clusters or if it is a ``dissimilar'' edge and is present within a cluster. Define the"},"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":"1902.10829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T23:23:17Z","cross_cats_sorted":[],"title_canon_sha256":"7ad8aabed9acaa2b23802eef51d74ce1b1c434cd7e5f6754bee01ea60ca73d25","abstract_canon_sha256":"4b60c5f5aa9e824a886b9576f839d40083056fe46d3540a10076e66bcd52c5e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:42.190697Z","signature_b64":"HpckvtZTBnMbYIhI0/8hgGUcdW56f9Lsao7Hm7/OEgacSxP+NkuOI4zVcglhXULtgxEmX+Le/R849H8pm8N9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3208c1fb0e11914909e96eaa6210a0820ddcf0fe7c6d244e9a7e405b89152379","last_reissued_at":"2026-05-17T23:42:42.189915Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:42.189915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved algorithms for Correlation Clustering with local objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantin Makarychev, Sanchit Kalhan, Timothy Zhou","submitted_at":"2019-02-27T23:23:17Z","abstract_excerpt":"Correlation Clustering is a powerful graph partitioning model that aims to cluster items based on the notion of similarity between items. An instance of the Correlation Clustering problem consists of a graph $G$ (not necessarily complete) whose edges are labeled by a binary classifier as ``similar'' and ``dissimilar''. An objective which has received a lot of attention in literature is that of minimizing the number of disagreements: an edge is in disagreement if it is a ``similar'' edge and is present across clusters or if it is a ``dissimilar'' edge and is present within a cluster. Define the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10829","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":"1902.10829","created_at":"2026-05-17T23:42:42.190042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10829v2","created_at":"2026-05-17T23:42:42.190042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10829","created_at":"2026-05-17T23:42:42.190042+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIEMD6YOCGIU","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIEMD6YOCGIUSCPJ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIEMD6YO","created_at":"2026-05-18T12:33:18.533446+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/GIEMD6YOCGIUSCPJN2VGEEFAQI","json":"https://pith.science/pith/GIEMD6YOCGIUSCPJN2VGEEFAQI.json","graph_json":"https://pith.science/api/pith-number/GIEMD6YOCGIUSCPJN2VGEEFAQI/graph.json","events_json":"https://pith.science/api/pith-number/GIEMD6YOCGIUSCPJN2VGEEFAQI/events.json","paper":"https://pith.science/paper/GIEMD6YO"},"agent_actions":{"view_html":"https://pith.science/pith/GIEMD6YOCGIUSCPJN2VGEEFAQI","download_json":"https://pith.science/pith/GIEMD6YOCGIUSCPJN2VGEEFAQI.json","view_paper":"https://pith.science/paper/GIEMD6YO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10829&json=true","fetch_graph":"https://pith.science/api/pith-number/GIEMD6YOCGIUSCPJN2VGEEFAQI/graph.json","fetch_events":"https://pith.science/api/pith-number/GIEMD6YOCGIUSCPJN2VGEEFAQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIEMD6YOCGIUSCPJN2VGEEFAQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIEMD6YOCGIUSCPJN2VGEEFAQI/action/storage_attestation","attest_author":"https://pith.science/pith/GIEMD6YOCGIUSCPJN2VGEEFAQI/action/author_attestation","sign_citation":"https://pith.science/pith/GIEMD6YOCGIUSCPJN2VGEEFAQI/action/citation_signature","submit_replication":"https://pith.science/pith/GIEMD6YOCGIUSCPJN2VGEEFAQI/action/replication_record"}},"created_at":"2026-05-17T23:42:42.190042+00:00","updated_at":"2026-05-17T23:42:42.190042+00:00"}