{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UAMLCPPJKNBGVH6HJ22AZD2EKX","short_pith_number":"pith:UAMLCPPJ","schema_version":"1.0","canonical_sha256":"a018b13de953426a9fc74eb40c8f4455edd668d3f3c086ef4175db4c151a3333","source":{"kind":"arxiv","id":"1406.5667","version":2},"attestation_state":"computed","paper":{"title":"Correlation Clustering with Noisy Partial Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev","submitted_at":"2014-06-22T03:07:55Z","abstract_excerpt":"In this paper, we propose and study a semi-random model for the Correlation Clustering problem on arbitrary graphs G. We give two approximation algorithms for Correlation Clustering instances from this model. The first algorithm finds a solution of value $(1+ \\delta) optcost + O_{\\delta}(n\\log^3 n)$ with high probability, where $optcost$ is the value of the optimal solution (for every $\\delta > 0$). The second algorithm finds the ground truth clustering with an arbitrarily small classification error $\\eta$ (under some additional assumptions on the instance)."},"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":"1406.5667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-22T03:07:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0110a20f246aa38ab32d19daeb08185b97434b10e0d881cc56742e8a1251f408","abstract_canon_sha256":"d15ea166e63c8f9ae4de18718904a9543f5dcb0383e8e874f2d40a1f50009c6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:17.978593Z","signature_b64":"vJNNFbi71qhOzg5iL1d5M2Vzy1c69e606aQEuK/kRgSkjGkRO+3xIB8b9HfzYw8VZq50Dkg4VtFNWVAb5srCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a018b13de953426a9fc74eb40c8f4455edd668d3f3c086ef4175db4c151a3333","last_reissued_at":"2026-05-18T02:14:17.977978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:17.977978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correlation Clustering with Noisy Partial Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev","submitted_at":"2014-06-22T03:07:55Z","abstract_excerpt":"In this paper, we propose and study a semi-random model for the Correlation Clustering problem on arbitrary graphs G. We give two approximation algorithms for Correlation Clustering instances from this model. The first algorithm finds a solution of value $(1+ \\delta) optcost + O_{\\delta}(n\\log^3 n)$ with high probability, where $optcost$ is the value of the optimal solution (for every $\\delta > 0$). The second algorithm finds the ground truth clustering with an arbitrarily small classification error $\\eta$ (under some additional assumptions on the instance)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5667","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":"1406.5667","created_at":"2026-05-18T02:14:17.978089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5667v2","created_at":"2026-05-18T02:14:17.978089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5667","created_at":"2026-05-18T02:14:17.978089+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAMLCPPJKNBG","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAMLCPPJKNBGVH6H","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAMLCPPJ","created_at":"2026-05-18T12:28:52.271510+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/UAMLCPPJKNBGVH6HJ22AZD2EKX","json":"https://pith.science/pith/UAMLCPPJKNBGVH6HJ22AZD2EKX.json","graph_json":"https://pith.science/api/pith-number/UAMLCPPJKNBGVH6HJ22AZD2EKX/graph.json","events_json":"https://pith.science/api/pith-number/UAMLCPPJKNBGVH6HJ22AZD2EKX/events.json","paper":"https://pith.science/paper/UAMLCPPJ"},"agent_actions":{"view_html":"https://pith.science/pith/UAMLCPPJKNBGVH6HJ22AZD2EKX","download_json":"https://pith.science/pith/UAMLCPPJKNBGVH6HJ22AZD2EKX.json","view_paper":"https://pith.science/paper/UAMLCPPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5667&json=true","fetch_graph":"https://pith.science/api/pith-number/UAMLCPPJKNBGVH6HJ22AZD2EKX/graph.json","fetch_events":"https://pith.science/api/pith-number/UAMLCPPJKNBGVH6HJ22AZD2EKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAMLCPPJKNBGVH6HJ22AZD2EKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAMLCPPJKNBGVH6HJ22AZD2EKX/action/storage_attestation","attest_author":"https://pith.science/pith/UAMLCPPJKNBGVH6HJ22AZD2EKX/action/author_attestation","sign_citation":"https://pith.science/pith/UAMLCPPJKNBGVH6HJ22AZD2EKX/action/citation_signature","submit_replication":"https://pith.science/pith/UAMLCPPJKNBGVH6HJ22AZD2EKX/action/replication_record"}},"created_at":"2026-05-18T02:14:17.978089+00:00","updated_at":"2026-05-18T02:14:17.978089+00:00"}