{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QNSAFDIVA7P7Y3Y6GHKL5HVJHG","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":"6c417cb25ec30fa0d8302a4e913b2c13090656ec4fd2b765a4820066fb7349c6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-26T19:46:41Z","title_canon_sha256":"0651f2009ec2ec21f84fabab0f4492d33cc11e155b209ac3d3f384bbc0abae73"},"schema_version":"1.0","source":{"id":"1506.08189","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08189","created_at":"2026-05-18T01:14:03Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08189v3","created_at":"2026-05-18T01:14:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08189","created_at":"2026-05-18T01:14:03Z"},{"alias_kind":"pith_short_12","alias_value":"QNSAFDIVA7P7","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QNSAFDIVA7P7Y3Y6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QNSAFDIV","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:f5c6575fe26fc7f095308a8286b9705d418ed5436ff70f07e6e338a71159ee63","target":"graph","created_at":"2026-05-18T01:14:03Z","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":"We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$ edges between clusters or $-$ edges within clusters. Classically, one seeks to minimize the total number of such errors. We introduce a new framework that allows the objective to be a more general function of the number of errors at each vertex (for example, we may wish to minimize the number of errors at the worst vertex) and provide a rounding algorithm wh","authors_text":"Gregory J. Puleo, Olgica Milenkovic","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-26T19:46:41Z","title":"Correlation Clustering and Biclustering with Locally Bounded Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08189","kind":"arxiv","version":3},"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:6b4974407dc88e1db0053c587aeb9e27d3662503920f3835c5ff09f239c7a7b4","target":"record","created_at":"2026-05-18T01:14:03Z","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":"6c417cb25ec30fa0d8302a4e913b2c13090656ec4fd2b765a4820066fb7349c6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-26T19:46:41Z","title_canon_sha256":"0651f2009ec2ec21f84fabab0f4492d33cc11e155b209ac3d3f384bbc0abae73"},"schema_version":"1.0","source":{"id":"1506.08189","kind":"arxiv","version":3}},"canonical_sha256":"8364028d1507dffc6f1e31d4be9ea939bae06a1a7667285d37a88580ef2b43f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8364028d1507dffc6f1e31d4be9ea939bae06a1a7667285d37a88580ef2b43f0","first_computed_at":"2026-05-18T01:14:03.978486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:03.978486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9kqFjTq4cB4z4Ja0o4r39tNr6qLuETeXgH+2XNy705BuovmAScuHs3TkcX3ALhlnfmhf1+Dx6Y0PbyNqmarWAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:03.979019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08189","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b4974407dc88e1db0053c587aeb9e27d3662503920f3835c5ff09f239c7a7b4","sha256:f5c6575fe26fc7f095308a8286b9705d418ed5436ff70f07e6e338a71159ee63"],"state_sha256":"76894ddc1f14fe0fbd088e8d77b3cbf94c2d90182a58d5b47429380c5b68eaa8"}