{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JJ2CZ6ZJRGM3YNXI6SX3WAKRKO","short_pith_number":"pith:JJ2CZ6ZJ","schema_version":"1.0","canonical_sha256":"4a742cfb298999bc36e8f4afbb0151538cbbe0dfd01d680e923d29b0ba510dd3","source":{"kind":"arxiv","id":"1907.00117","version":1},"attestation_state":"computed","paper":{"title":"Min-Max Correlation Clustering via MultiCut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barna Saha, Roy Schwartz, Saba Ahmadi, Sainyam Galhotra, Samir Khuller","submitted_at":"2019-06-28T23:32:06Z","abstract_excerpt":"Correlation clustering is a fundamental combinatorial optimization problem arising in many contexts and applications that has been the subject of dozens of papers in the literature. In this problem we are given a general weighted graph where each edge is labeled positive or negative. The goal is to obtain a partitioning (clustering) of the vertices that minimizes disagreements - weight of negative edges trapped inside a cluster plus positive edges between different clusters. Most of the papers on this topic mainly focus on minimizing total disagreement, a global objective for this problem. In "},"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":"1907.00117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-28T23:32:06Z","cross_cats_sorted":[],"title_canon_sha256":"1369b667328fb081f2ea18a00a5f352b6c3b9b001fa871b4645c072521c9c630","abstract_canon_sha256":"0fbca44e2ac87ece799630719928939d783b50ed15fb2c9f2105643da67dc7b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:57.437480Z","signature_b64":"usooNhViKjxUDijcz+5/nO58DHOys7AS1JxdMuTCOuNuxwhQ55IvnlRi0cGueTfGJV73SrbqsyMg1NHI7GYEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a742cfb298999bc36e8f4afbb0151538cbbe0dfd01d680e923d29b0ba510dd3","last_reissued_at":"2026-05-17T23:41:57.436740Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:57.436740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Min-Max Correlation Clustering via MultiCut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barna Saha, Roy Schwartz, Saba Ahmadi, Sainyam Galhotra, Samir Khuller","submitted_at":"2019-06-28T23:32:06Z","abstract_excerpt":"Correlation clustering is a fundamental combinatorial optimization problem arising in many contexts and applications that has been the subject of dozens of papers in the literature. In this problem we are given a general weighted graph where each edge is labeled positive or negative. The goal is to obtain a partitioning (clustering) of the vertices that minimizes disagreements - weight of negative edges trapped inside a cluster plus positive edges between different clusters. Most of the papers on this topic mainly focus on minimizing total disagreement, a global objective for this problem. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00117","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":"1907.00117","created_at":"2026-05-17T23:41:57.436838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00117v1","created_at":"2026-05-17T23:41:57.436838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00117","created_at":"2026-05-17T23:41:57.436838+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJ2CZ6ZJRGM3","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJ2CZ6ZJRGM3YNXI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJ2CZ6ZJ","created_at":"2026-05-18T12:33:21.387695+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/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO","json":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO.json","graph_json":"https://pith.science/api/pith-number/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/graph.json","events_json":"https://pith.science/api/pith-number/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/events.json","paper":"https://pith.science/paper/JJ2CZ6ZJ"},"agent_actions":{"view_html":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO","download_json":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO.json","view_paper":"https://pith.science/paper/JJ2CZ6ZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00117&json=true","fetch_graph":"https://pith.science/api/pith-number/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/graph.json","fetch_events":"https://pith.science/api/pith-number/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/action/storage_attestation","attest_author":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/action/author_attestation","sign_citation":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/action/citation_signature","submit_replication":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/action/replication_record"}},"created_at":"2026-05-17T23:41:57.436838+00:00","updated_at":"2026-05-17T23:41:57.436838+00:00"}