{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3LQZDSMXQMGOEMGNQ7V7UFHCGE","short_pith_number":"pith:3LQZDSMX","canonical_record":{"source":{"id":"1902.05659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-15T01:50:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d14c55728a8e6651707840d6ee112d4f0c943275c49ac07ba01848debcc0296a","abstract_canon_sha256":"c78ea84edfa0a8f546a1ee98ac039949f6cb10e00fffcf1e895dec2abecaea1e"},"schema_version":"1.0"},"canonical_sha256":"dae191c997830ce230cd87ebfa14e23125072603746bdd73864584349a4b620a","source":{"kind":"arxiv","id":"1902.05659","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05659","created_at":"2026-07-04T23:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05659v2","created_at":"2026-07-04T23:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05659","created_at":"2026-07-04T23:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"3LQZDSMXQMGO","created_at":"2026-07-04T23:51:15Z"},{"alias_kind":"pith_short_16","alias_value":"3LQZDSMXQMGOEMGN","created_at":"2026-07-04T23:51:15Z"},{"alias_kind":"pith_short_8","alias_value":"3LQZDSMX","created_at":"2026-07-04T23:51:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3LQZDSMXQMGOEMGNQ7V7UFHCGE","target":"record","payload":{"canonical_record":{"source":{"id":"1902.05659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-15T01:50:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d14c55728a8e6651707840d6ee112d4f0c943275c49ac07ba01848debcc0296a","abstract_canon_sha256":"c78ea84edfa0a8f546a1ee98ac039949f6cb10e00fffcf1e895dec2abecaea1e"},"schema_version":"1.0"},"canonical_sha256":"dae191c997830ce230cd87ebfa14e23125072603746bdd73864584349a4b620a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:15.429354Z","signature_b64":"Ps9a+c/4KZSyilUekyUwHCAZ4hfvslA2lt8WI1pbyMBTZuD9cZaFxVyJbNFb3ApDxniin3FXhMj4UwWbn7VoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dae191c997830ce230cd87ebfa14e23125072603746bdd73864584349a4b620a","last_reissued_at":"2026-07-04T23:51:15.429002Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:15.429002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.05659","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-07-04T23:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXsuH7WxvR6D/1Di+/4ojkUu/MONJFc9km6J6ZO/ZKlCva3mrSPCjgN6oeBMqB92uzxzSYFHKb0x7PUM+Kh3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:16:36.501360Z"},"content_sha256":"b996130b6a11516b948978b5cf949691f706685d2dcace9255da92a3c0a58b28","schema_version":"1.0","event_id":"sha256:b996130b6a11516b948978b5cf949691f706685d2dcace9255da92a3c0a58b28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3LQZDSMXQMGOEMGNQ7V7UFHCGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Massively Parallel Benders Decomposition for Correlation Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CV","authors_text":"Jovita Lukasik, Julian Yarkony, Maneesh Singh, Margret Keuper","submitted_at":"2019-02-15T01:50:07Z","abstract_excerpt":"We tackle the problem of graph partitioning for image segmentation using correlation clustering (CC), which we treat as an integer linear program (ILP). We reformulate optimization in the ILP so as to admit efficient optimization via Benders decomposition, a classic technique from operations research. Our Benders decomposition formulation has many subproblems, each associated with a node in the CC instance's graph, which are solved in parallel. Each Benders subproblem enforces the cycle inequalities corresponding to the negative weight edges attached to its corresponding node in the CC instanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05659","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.05659/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INViTg8t+mEUVGTZpFAfJR6V+7mthdMWDnqN+YsPiHBcWLXcR4h6gk/qSQ4mo8c0mC3K1QvfwDzlMikXa/z4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:16:36.501864Z"},"content_sha256":"94810c6c7fdba62856fdafdb7875c91a0814458e43e99913c277e56396ee9690","schema_version":"1.0","event_id":"sha256:94810c6c7fdba62856fdafdb7875c91a0814458e43e99913c277e56396ee9690"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LQZDSMXQMGOEMGNQ7V7UFHCGE/bundle.json","state_url":"https://pith.science/pith/3LQZDSMXQMGOEMGNQ7V7UFHCGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LQZDSMXQMGOEMGNQ7V7UFHCGE/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-08-16T20:16:36Z","links":{"resolver":"https://pith.science/pith/3LQZDSMXQMGOEMGNQ7V7UFHCGE","bundle":"https://pith.science/pith/3LQZDSMXQMGOEMGNQ7V7UFHCGE/bundle.json","state":"https://pith.science/pith/3LQZDSMXQMGOEMGNQ7V7UFHCGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LQZDSMXQMGOEMGNQ7V7UFHCGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3LQZDSMXQMGOEMGNQ7V7UFHCGE","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":"c78ea84edfa0a8f546a1ee98ac039949f6cb10e00fffcf1e895dec2abecaea1e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-15T01:50:07Z","title_canon_sha256":"d14c55728a8e6651707840d6ee112d4f0c943275c49ac07ba01848debcc0296a"},"schema_version":"1.0","source":{"id":"1902.05659","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05659","created_at":"2026-07-04T23:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05659v2","created_at":"2026-07-04T23:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05659","created_at":"2026-07-04T23:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"3LQZDSMXQMGO","created_at":"2026-07-04T23:51:15Z"},{"alias_kind":"pith_short_16","alias_value":"3LQZDSMXQMGOEMGN","created_at":"2026-07-04T23:51:15Z"},{"alias_kind":"pith_short_8","alias_value":"3LQZDSMX","created_at":"2026-07-04T23:51:15Z"}],"graph_snapshots":[{"event_id":"sha256:94810c6c7fdba62856fdafdb7875c91a0814458e43e99913c277e56396ee9690","target":"graph","created_at":"2026-07-04T23:51:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1902.05659/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We tackle the problem of graph partitioning for image segmentation using correlation clustering (CC), which we treat as an integer linear program (ILP). We reformulate optimization in the ILP so as to admit efficient optimization via Benders decomposition, a classic technique from operations research. Our Benders decomposition formulation has many subproblems, each associated with a node in the CC instance's graph, which are solved in parallel. Each Benders subproblem enforces the cycle inequalities corresponding to the negative weight edges attached to its corresponding node in the CC instanc","authors_text":"Jovita Lukasik, Julian Yarkony, Maneesh Singh, Margret Keuper","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-15T01:50:07Z","title":"Massively Parallel Benders Decomposition for Correlation Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05659","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:b996130b6a11516b948978b5cf949691f706685d2dcace9255da92a3c0a58b28","target":"record","created_at":"2026-07-04T23:51:15Z","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":"c78ea84edfa0a8f546a1ee98ac039949f6cb10e00fffcf1e895dec2abecaea1e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-15T01:50:07Z","title_canon_sha256":"d14c55728a8e6651707840d6ee112d4f0c943275c49ac07ba01848debcc0296a"},"schema_version":"1.0","source":{"id":"1902.05659","kind":"arxiv","version":2}},"canonical_sha256":"dae191c997830ce230cd87ebfa14e23125072603746bdd73864584349a4b620a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dae191c997830ce230cd87ebfa14e23125072603746bdd73864584349a4b620a","first_computed_at":"2026-07-04T23:51:15.429002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:15.429002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ps9a+c/4KZSyilUekyUwHCAZ4hfvslA2lt8WI1pbyMBTZuD9cZaFxVyJbNFb3ApDxniin3FXhMj4UwWbn7VoBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:15.429354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05659","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b996130b6a11516b948978b5cf949691f706685d2dcace9255da92a3c0a58b28","sha256:94810c6c7fdba62856fdafdb7875c91a0814458e43e99913c277e56396ee9690"],"state_sha256":"675fb2c47461adeda42c81225be1c5cee2d7e8cb722602148c34fddd66388fe9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TiptJS22/cmY8PFrkzRvTWiyZzh9s9Bir0ULr46cRYa63XA+Vq/UkRKOp6LCzsRJntbTg791TlLIULsQH7QOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:16:36.506868Z","bundle_sha256":"0e9f5c07ace523268e0bf40baddc5577e3df15e342abcc7807855d3d71f412c5"}}