{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G6TSZ7FFQ52QZM6XTAV2TRX3FE","short_pith_number":"pith:G6TSZ7FF","schema_version":"1.0","canonical_sha256":"37a72cfca587750cb3d7982ba9c6fb292cc33cbc22bba402e624f222d3390a4c","source":{"kind":"arxiv","id":"1312.5105","version":1},"attestation_state":"computed","paper":{"title":"Local correlation clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Garc\\'ia-Soriano, Francesco Bonchi, Konstantin Kutzkov","submitted_at":"2013-12-18T12:04:10Z","abstract_excerpt":"Correlation clustering is perhaps the most natural formulation of clustering. Given $n$ objects and a pairwise similarity measure, the goal is to cluster the objects so that, to the best possible extent, similar objects are put in the same cluster and dissimilar objects are put in different clusters. Despite its theoretical appeal, the practical relevance of correlation clustering still remains largely unexplored, mainly due to the fact that correlation clustering requires the $\\Theta(n^2)$ pairwise similarities as input.\n  In this paper we initiate the investigation into \\emph{local} algorith"},"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":"1312.5105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-18T12:04:10Z","cross_cats_sorted":[],"title_canon_sha256":"863ee7e00dbebb1487d41a0f66909d591b198185ced4e3803c521fe6d504c4e6","abstract_canon_sha256":"96938113ed6a7d3c45aff55323aa8dbea84ec6700ea384a3282b5f3f2ff3519d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:16.284855Z","signature_b64":"sQtDDCL3T/8qJPtaIetJfwyqsoFZhWFEKZnnHPLB07KwLOIQ8tHjviW2jzS8GFLkM+fbvNtkjAfeXTHQ6ZvgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37a72cfca587750cb3d7982ba9c6fb292cc33cbc22bba402e624f222d3390a4c","last_reissued_at":"2026-05-18T03:04:16.284278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:16.284278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local correlation clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Garc\\'ia-Soriano, Francesco Bonchi, Konstantin Kutzkov","submitted_at":"2013-12-18T12:04:10Z","abstract_excerpt":"Correlation clustering is perhaps the most natural formulation of clustering. Given $n$ objects and a pairwise similarity measure, the goal is to cluster the objects so that, to the best possible extent, similar objects are put in the same cluster and dissimilar objects are put in different clusters. Despite its theoretical appeal, the practical relevance of correlation clustering still remains largely unexplored, mainly due to the fact that correlation clustering requires the $\\Theta(n^2)$ pairwise similarities as input.\n  In this paper we initiate the investigation into \\emph{local} algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5105","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.5105","created_at":"2026-05-18T03:04:16.284374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.5105v1","created_at":"2026-05-18T03:04:16.284374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5105","created_at":"2026-05-18T03:04:16.284374+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6TSZ7FFQ52Q","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6TSZ7FFQ52QZM6X","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6TSZ7FF","created_at":"2026-05-18T12:27:45.050594+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/G6TSZ7FFQ52QZM6XTAV2TRX3FE","json":"https://pith.science/pith/G6TSZ7FFQ52QZM6XTAV2TRX3FE.json","graph_json":"https://pith.science/api/pith-number/G6TSZ7FFQ52QZM6XTAV2TRX3FE/graph.json","events_json":"https://pith.science/api/pith-number/G6TSZ7FFQ52QZM6XTAV2TRX3FE/events.json","paper":"https://pith.science/paper/G6TSZ7FF"},"agent_actions":{"view_html":"https://pith.science/pith/G6TSZ7FFQ52QZM6XTAV2TRX3FE","download_json":"https://pith.science/pith/G6TSZ7FFQ52QZM6XTAV2TRX3FE.json","view_paper":"https://pith.science/paper/G6TSZ7FF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.5105&json=true","fetch_graph":"https://pith.science/api/pith-number/G6TSZ7FFQ52QZM6XTAV2TRX3FE/graph.json","fetch_events":"https://pith.science/api/pith-number/G6TSZ7FFQ52QZM6XTAV2TRX3FE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6TSZ7FFQ52QZM6XTAV2TRX3FE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6TSZ7FFQ52QZM6XTAV2TRX3FE/action/storage_attestation","attest_author":"https://pith.science/pith/G6TSZ7FFQ52QZM6XTAV2TRX3FE/action/author_attestation","sign_citation":"https://pith.science/pith/G6TSZ7FFQ52QZM6XTAV2TRX3FE/action/citation_signature","submit_replication":"https://pith.science/pith/G6TSZ7FFQ52QZM6XTAV2TRX3FE/action/replication_record"}},"created_at":"2026-05-18T03:04:16.284374+00:00","updated_at":"2026-05-18T03:04:16.284374+00:00"}