{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JJ2CZ6ZJRGM3YNXI6SX3WAKRKO","short_pith_number":"pith:JJ2CZ6ZJ","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"},"canonical_sha256":"4a742cfb298999bc36e8f4afbb0151538cbbe0dfd01d680e923d29b0ba510dd3","source":{"kind":"arxiv","id":"1907.00117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00117","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00117v1","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00117","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"JJ2CZ6ZJRGM3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JJ2CZ6ZJRGM3YNXI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JJ2CZ6ZJ","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JJ2CZ6ZJRGM3YNXI6SX3WAKRKO","target":"record","payload":{"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"},"canonical_sha256":"4a742cfb298999bc36e8f4afbb0151538cbbe0dfd01d680e923d29b0ba510dd3","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"},"source_kind":"arxiv","source_id":"1907.00117","source_version":1,"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-17T23:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YA15IyFbvpBgEu6ETTzipTLtUXq1Rkt7ELhZtMkRFXOrxiyLuFj2X3hNhNS3HCPF1W6G1614FiCgVYLjzkGSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:53:50.216864Z"},"content_sha256":"350521f405a4d4a6be1de552b85e54284a9719cb3d28c2cf79d8853b457e9e31","schema_version":"1.0","event_id":"sha256:350521f405a4d4a6be1de552b85e54284a9719cb3d28c2cf79d8853b457e9e31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JJ2CZ6ZJRGM3YNXI6SX3WAKRKO","target":"graph","payload":{"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"},"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-17T23:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S7Kg3Pj/dnxdTKWw7MHafD63piZZe++H7I22WIN5O+X6Sk8ZEE+168xfRyivgocxqRxHL1Gahui6V38bphlgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:53:50.217213Z"},"content_sha256":"8d31eff077498d3dddeaffaaf44afd6ca6bc42aa07e21984472db37fff28c5b4","schema_version":"1.0","event_id":"sha256:8d31eff077498d3dddeaffaaf44afd6ca6bc42aa07e21984472db37fff28c5b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/bundle.json","state_url":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/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-06-28T12:53:50Z","links":{"resolver":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO","bundle":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/bundle.json","state":"https://pith.science/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJ2CZ6ZJRGM3YNXI6SX3WAKRKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JJ2CZ6ZJRGM3YNXI6SX3WAKRKO","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":"0fbca44e2ac87ece799630719928939d783b50ed15fb2c9f2105643da67dc7b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-28T23:32:06Z","title_canon_sha256":"1369b667328fb081f2ea18a00a5f352b6c3b9b001fa871b4645c072521c9c630"},"schema_version":"1.0","source":{"id":"1907.00117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00117","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00117v1","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00117","created_at":"2026-05-17T23:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"JJ2CZ6ZJRGM3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JJ2CZ6ZJRGM3YNXI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JJ2CZ6ZJ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:8d31eff077498d3dddeaffaaf44afd6ca6bc42aa07e21984472db37fff28c5b4","target":"graph","created_at":"2026-05-17T23:41:57Z","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 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 ","authors_text":"Barna Saha, Roy Schwartz, Saba Ahmadi, Sainyam Galhotra, Samir Khuller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-28T23:32:06Z","title":"Min-Max Correlation Clustering via MultiCut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00117","kind":"arxiv","version":1},"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:350521f405a4d4a6be1de552b85e54284a9719cb3d28c2cf79d8853b457e9e31","target":"record","created_at":"2026-05-17T23:41:57Z","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":"0fbca44e2ac87ece799630719928939d783b50ed15fb2c9f2105643da67dc7b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-28T23:32:06Z","title_canon_sha256":"1369b667328fb081f2ea18a00a5f352b6c3b9b001fa871b4645c072521c9c630"},"schema_version":"1.0","source":{"id":"1907.00117","kind":"arxiv","version":1}},"canonical_sha256":"4a742cfb298999bc36e8f4afbb0151538cbbe0dfd01d680e923d29b0ba510dd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a742cfb298999bc36e8f4afbb0151538cbbe0dfd01d680e923d29b0ba510dd3","first_computed_at":"2026-05-17T23:41:57.436740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:57.436740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"usooNhViKjxUDijcz+5/nO58DHOys7AS1JxdMuTCOuNuxwhQ55IvnlRi0cGueTfGJV73SrbqsyMg1NHI7GYEDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:57.437480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:350521f405a4d4a6be1de552b85e54284a9719cb3d28c2cf79d8853b457e9e31","sha256:8d31eff077498d3dddeaffaaf44afd6ca6bc42aa07e21984472db37fff28c5b4"],"state_sha256":"5c849c73fcd2cbd06a73f64442db83e2d1c6938563272137317768ac28a5f4d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6rzR9EJUiWXtQhiaznZGEGo64cg1kn+hTrswZjvj+mnAluZb7oV/DnaSlZ1kpvY5mg4cmEoGJixRzy7tJc3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:53:50.219096Z","bundle_sha256":"27159adf3cafd9506d83a214dcb5eb821de76ba2cc534ade98bc461f77667236"}}