{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W3DNPQZFVJIO63MHE7E272MWSU","short_pith_number":"pith:W3DNPQZF","schema_version":"1.0","canonical_sha256":"b6c6d7c325aa50ef6d8727c9afe996952c5f3098495c5446a1a81cbcaf19b8ce","source":{"kind":"arxiv","id":"1611.07305","version":2},"attestation_state":"computed","paper":{"title":"Correlation Clustering with Low-Rank Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"cs.LG","authors_text":"Anthony Wirth, David F. Gleich, Nate Veldt","submitted_at":"2016-11-21T19:56:29Z","abstract_excerpt":"Correlation clustering is a technique for aggregating data based on qualitative information about which pairs of objects are labeled 'similar' or 'dissimilar.' Because the optimization problem is NP-hard, much of the previous literature focuses on finding approximation algorithms. In this paper we explore how to solve the correlation clustering objective exactly when the data to be clustered can be represented by a low-rank matrix. We prove in particular that correlation clustering can be solved in polynomial time when the underlying matrix is positive semidefinite with small constant rank, bu"},"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":"1611.07305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-21T19:56:29Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"35faeb20b99897e4a71ddc22317d7f5e8712ea500e6c60793081a5a27312bbac","abstract_canon_sha256":"3bde975e877faa083685161844dd13cd4a9c13075385ff5f8ae3f14789e3cebb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:32.524112Z","signature_b64":"+wToK67RZ+QxocEA8xCS0gIrIesJz+uaR6FePxSuJC+g7ltKnDrqkext+KxSxATOE6VoFSBQzS0CjLKjzJSrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6c6d7c325aa50ef6d8727c9afe996952c5f3098495c5446a1a81cbcaf19b8ce","last_reissued_at":"2026-05-18T00:48:32.523555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:32.523555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correlation Clustering with Low-Rank Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"cs.LG","authors_text":"Anthony Wirth, David F. Gleich, Nate Veldt","submitted_at":"2016-11-21T19:56:29Z","abstract_excerpt":"Correlation clustering is a technique for aggregating data based on qualitative information about which pairs of objects are labeled 'similar' or 'dissimilar.' Because the optimization problem is NP-hard, much of the previous literature focuses on finding approximation algorithms. In this paper we explore how to solve the correlation clustering objective exactly when the data to be clustered can be represented by a low-rank matrix. We prove in particular that correlation clustering can be solved in polynomial time when the underlying matrix is positive semidefinite with small constant rank, bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07305","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":"1611.07305","created_at":"2026-05-18T00:48:32.523637+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07305v2","created_at":"2026-05-18T00:48:32.523637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07305","created_at":"2026-05-18T00:48:32.523637+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3DNPQZFVJIO","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3DNPQZFVJIO63MH","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3DNPQZF","created_at":"2026-05-18T12:30:48.956258+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/W3DNPQZFVJIO63MHE7E272MWSU","json":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU.json","graph_json":"https://pith.science/api/pith-number/W3DNPQZFVJIO63MHE7E272MWSU/graph.json","events_json":"https://pith.science/api/pith-number/W3DNPQZFVJIO63MHE7E272MWSU/events.json","paper":"https://pith.science/paper/W3DNPQZF"},"agent_actions":{"view_html":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU","download_json":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU.json","view_paper":"https://pith.science/paper/W3DNPQZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07305&json=true","fetch_graph":"https://pith.science/api/pith-number/W3DNPQZFVJIO63MHE7E272MWSU/graph.json","fetch_events":"https://pith.science/api/pith-number/W3DNPQZFVJIO63MHE7E272MWSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU/action/storage_attestation","attest_author":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU/action/author_attestation","sign_citation":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU/action/citation_signature","submit_replication":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU/action/replication_record"}},"created_at":"2026-05-18T00:48:32.523637+00:00","updated_at":"2026-05-18T00:48:32.523637+00:00"}