{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QNSAFDIVA7P7Y3Y6GHKL5HVJHG","short_pith_number":"pith:QNSAFDIV","schema_version":"1.0","canonical_sha256":"8364028d1507dffc6f1e31d4be9ea939bae06a1a7667285d37a88580ef2b43f0","source":{"kind":"arxiv","id":"1506.08189","version":3},"attestation_state":"computed","paper":{"title":"Correlation Clustering and Biclustering with Locally Bounded Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Gregory J. Puleo, Olgica Milenkovic","submitted_at":"2015-06-26T19:46:41Z","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"},"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":"1506.08189","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-26T19:46:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0651f2009ec2ec21f84fabab0f4492d33cc11e155b209ac3d3f384bbc0abae73","abstract_canon_sha256":"6c417cb25ec30fa0d8302a4e913b2c13090656ec4fd2b765a4820066fb7349c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:03.979019Z","signature_b64":"9kqFjTq4cB4z4Ja0o4r39tNr6qLuETeXgH+2XNy705BuovmAScuHs3TkcX3ALhlnfmhf1+Dx6Y0PbyNqmarWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8364028d1507dffc6f1e31d4be9ea939bae06a1a7667285d37a88580ef2b43f0","last_reissued_at":"2026-05-18T01:14:03.978486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:03.978486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correlation Clustering and Biclustering with Locally Bounded Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Gregory J. Puleo, Olgica Milenkovic","submitted_at":"2015-06-26T19:46:41Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08189","kind":"arxiv","version":3},"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":"1506.08189","created_at":"2026-05-18T01:14:03.978577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08189v3","created_at":"2026-05-18T01:14:03.978577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08189","created_at":"2026-05-18T01:14:03.978577+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNSAFDIVA7P7","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNSAFDIVA7P7Y3Y6","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNSAFDIV","created_at":"2026-05-18T12:29:37.295048+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/QNSAFDIVA7P7Y3Y6GHKL5HVJHG","json":"https://pith.science/pith/QNSAFDIVA7P7Y3Y6GHKL5HVJHG.json","graph_json":"https://pith.science/api/pith-number/QNSAFDIVA7P7Y3Y6GHKL5HVJHG/graph.json","events_json":"https://pith.science/api/pith-number/QNSAFDIVA7P7Y3Y6GHKL5HVJHG/events.json","paper":"https://pith.science/paper/QNSAFDIV"},"agent_actions":{"view_html":"https://pith.science/pith/QNSAFDIVA7P7Y3Y6GHKL5HVJHG","download_json":"https://pith.science/pith/QNSAFDIVA7P7Y3Y6GHKL5HVJHG.json","view_paper":"https://pith.science/paper/QNSAFDIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08189&json=true","fetch_graph":"https://pith.science/api/pith-number/QNSAFDIVA7P7Y3Y6GHKL5HVJHG/graph.json","fetch_events":"https://pith.science/api/pith-number/QNSAFDIVA7P7Y3Y6GHKL5HVJHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNSAFDIVA7P7Y3Y6GHKL5HVJHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNSAFDIVA7P7Y3Y6GHKL5HVJHG/action/storage_attestation","attest_author":"https://pith.science/pith/QNSAFDIVA7P7Y3Y6GHKL5HVJHG/action/author_attestation","sign_citation":"https://pith.science/pith/QNSAFDIVA7P7Y3Y6GHKL5HVJHG/action/citation_signature","submit_replication":"https://pith.science/pith/QNSAFDIVA7P7Y3Y6GHKL5HVJHG/action/replication_record"}},"created_at":"2026-05-18T01:14:03.978577+00:00","updated_at":"2026-05-18T01:14:03.978577+00:00"}