{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W3DNPQZFVJIO63MHE7E272MWSU","short_pith_number":"pith:W3DNPQZF","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"},"canonical_sha256":"b6c6d7c325aa50ef6d8727c9afe996952c5f3098495c5446a1a81cbcaf19b8ce","source":{"kind":"arxiv","id":"1611.07305","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07305","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07305v2","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07305","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"pith_short_12","alias_value":"W3DNPQZFVJIO","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W3DNPQZFVJIO63MH","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W3DNPQZF","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W3DNPQZFVJIO63MHE7E272MWSU","target":"record","payload":{"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"},"canonical_sha256":"b6c6d7c325aa50ef6d8727c9afe996952c5f3098495c5446a1a81cbcaf19b8ce","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"},"source_kind":"arxiv","source_id":"1611.07305","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2te/hajCCxutZORcVVLCZP8tHqx+8bTJxd9FthahbjiSI7rvcoJOtbUi0I4gfm79x2aoxfr2bIclEMhBrM7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:07:02.935187Z"},"content_sha256":"cec9593d2e7f1bde812cc6e97b70249413de5c6b3a1437ea8b791004c2a6f3f2","schema_version":"1.0","event_id":"sha256:cec9593d2e7f1bde812cc6e97b70249413de5c6b3a1437ea8b791004c2a6f3f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W3DNPQZFVJIO63MHE7E272MWSU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NNakriAY499jBObxZO3jk8MttWgxL73BNcbiWFchnc11d2SB4mjJf8771bNC2vrDK6rrYeUwtnGWavvLtZvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:07:02.935633Z"},"content_sha256":"6abea037b330d8c7b59b1536cef5e411e618acfe3d58ec49b18b11120208f710","schema_version":"1.0","event_id":"sha256:6abea037b330d8c7b59b1536cef5e411e618acfe3d58ec49b18b11120208f710"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU/bundle.json","state_url":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3DNPQZFVJIO63MHE7E272MWSU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T23:07:02Z","links":{"resolver":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU","bundle":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU/bundle.json","state":"https://pith.science/pith/W3DNPQZFVJIO63MHE7E272MWSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3DNPQZFVJIO63MHE7E272MWSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W3DNPQZFVJIO63MHE7E272MWSU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3bde975e877faa083685161844dd13cd4a9c13075385ff5f8ae3f14789e3cebb","cross_cats_sorted":["cs.DS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-21T19:56:29Z","title_canon_sha256":"35faeb20b99897e4a71ddc22317d7f5e8712ea500e6c60793081a5a27312bbac"},"schema_version":"1.0","source":{"id":"1611.07305","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07305","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07305v2","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07305","created_at":"2026-05-18T00:48:32Z"},{"alias_kind":"pith_short_12","alias_value":"W3DNPQZFVJIO","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W3DNPQZFVJIO63MH","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W3DNPQZF","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:6abea037b330d8c7b59b1536cef5e411e618acfe3d58ec49b18b11120208f710","target":"graph","created_at":"2026-05-18T00:48:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anthony Wirth, David F. Gleich, Nate Veldt","cross_cats":["cs.DS","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-21T19:56:29Z","title":"Correlation Clustering with Low-Rank Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07305","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cec9593d2e7f1bde812cc6e97b70249413de5c6b3a1437ea8b791004c2a6f3f2","target":"record","created_at":"2026-05-18T00:48:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3bde975e877faa083685161844dd13cd4a9c13075385ff5f8ae3f14789e3cebb","cross_cats_sorted":["cs.DS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-21T19:56:29Z","title_canon_sha256":"35faeb20b99897e4a71ddc22317d7f5e8712ea500e6c60793081a5a27312bbac"},"schema_version":"1.0","source":{"id":"1611.07305","kind":"arxiv","version":2}},"canonical_sha256":"b6c6d7c325aa50ef6d8727c9afe996952c5f3098495c5446a1a81cbcaf19b8ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6c6d7c325aa50ef6d8727c9afe996952c5f3098495c5446a1a81cbcaf19b8ce","first_computed_at":"2026-05-18T00:48:32.523555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:32.523555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+wToK67RZ+QxocEA8xCS0gIrIesJz+uaR6FePxSuJC+g7ltKnDrqkext+KxSxATOE6VoFSBQzS0CjLKjzJSrDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:32.524112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07305","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cec9593d2e7f1bde812cc6e97b70249413de5c6b3a1437ea8b791004c2a6f3f2","sha256:6abea037b330d8c7b59b1536cef5e411e618acfe3d58ec49b18b11120208f710"],"state_sha256":"d9c1f06b396c4b87e9f1ce496af5b68c3bbc571f99a58f5c4bbc451a49ae16c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjuY8XQ3tIAX85OUQXyGloCm0DU3VTF3wNDZpNsKhNgjsWsFcuuYaoHQTmCEJSeRnQ2pJZ9ueirag+E+8AUjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:07:02.938182Z","bundle_sha256":"662a70d88854cd59cb92a5011aec1a1cc4511585f1dc84ba3cab129b520c95d4"}}