{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GOMXIZU6VUIGFPRCGC6EFVKU5Q","short_pith_number":"pith:GOMXIZU6","canonical_record":{"source":{"id":"2204.01366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T10:21:02Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"eed3c454a85e1247b056aa58b2894b4aaa0ac2bdd6e34bf2f6cd028477f73551","abstract_canon_sha256":"63030a1800bdde17f0d3eb0e296f012fdba799f74f68d487933eec262102e2b8"},"schema_version":"1.0"},"canonical_sha256":"339974669ead1062be2230bc42d554ec0dcf6e01078f2a80e115d571914a6287","source":{"kind":"arxiv","id":"2204.01366","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.01366","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"2204.01366v1","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.01366","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"GOMXIZU6VUIG","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_16","alias_value":"GOMXIZU6VUIGFPRC","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_8","alias_value":"GOMXIZU6","created_at":"2026-07-05T04:11:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GOMXIZU6VUIGFPRCGC6EFVKU5Q","target":"record","payload":{"canonical_record":{"source":{"id":"2204.01366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T10:21:02Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"eed3c454a85e1247b056aa58b2894b4aaa0ac2bdd6e34bf2f6cd028477f73551","abstract_canon_sha256":"63030a1800bdde17f0d3eb0e296f012fdba799f74f68d487933eec262102e2b8"},"schema_version":"1.0"},"canonical_sha256":"339974669ead1062be2230bc42d554ec0dcf6e01078f2a80e115d571914a6287","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:11:18.179207Z","signature_b64":"e3tDmL21aIaSvGTMEvm+WOnEuZqYY/NpcQrqP5vAqVxmmjG/hYSBlURRdvZyAOR0MhbGfQGKMu/93dNXIqknDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"339974669ead1062be2230bc42d554ec0dcf6e01078f2a80e115d571914a6287","last_reissued_at":"2026-07-05T04:11:18.178832Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:11:18.178832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.01366","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-07-05T04:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"beFadvJ30kdW4qxxu2gXT+MjE84PXF4kRdN/Op2oaZ+/7QGM1GCVu5r3V7hSvbyH2Lx3f25lK08MvQMOQ9iPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:06:44.279831Z"},"content_sha256":"4a5d7dc27340025d95826a12b0a17b8b85134e7013496e7313714ba6d91f835d","schema_version":"1.0","event_id":"sha256:4a5d7dc27340025d95826a12b0a17b8b85134e7013496e7313714ba6d91f835d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GOMXIZU6VUIGFPRCGC6EFVKU5Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to solve Minimum Cost Multicuts efficiently using Edge-Weighted Graph Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Margret Keuper, Steffen Jung","submitted_at":"2022-04-04T10:21:02Z","abstract_excerpt":"The minimum cost multicut problem is the NP-hard/APX-hard combinatorial optimization problem of partitioning a real-valued edge-weighted graph such as to minimize the total cost of the partition. While graph convolutional neural networks (GNN) have proven to be promising in the context of combinatorial optimization, most of them are only tailored to or tested on positive-valued edge weights, i.e. they do not comply to the nature of the multicut problem. We therefore adapt various GNN architectures including Graph Convolutional Networks, Signed Graph Convolutional Networks and Graph Isomorphic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.01366","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.01366/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-05T04:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5oKdhV54exNdmlYO+mocC4cwwILsQlPGE1BQmp/oed94Ov5wz4DkgLdGD62DqHP055ZpkkiQo2InyEOBpNWSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:06:44.280348Z"},"content_sha256":"d3b42725618d8283bb58868922a1ecaa7b7203eb458cc76bb1cc0f7a0971ac7b","schema_version":"1.0","event_id":"sha256:d3b42725618d8283bb58868922a1ecaa7b7203eb458cc76bb1cc0f7a0971ac7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOMXIZU6VUIGFPRCGC6EFVKU5Q/bundle.json","state_url":"https://pith.science/pith/GOMXIZU6VUIGFPRCGC6EFVKU5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOMXIZU6VUIGFPRCGC6EFVKU5Q/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-05T22:06:44Z","links":{"resolver":"https://pith.science/pith/GOMXIZU6VUIGFPRCGC6EFVKU5Q","bundle":"https://pith.science/pith/GOMXIZU6VUIGFPRCGC6EFVKU5Q/bundle.json","state":"https://pith.science/pith/GOMXIZU6VUIGFPRCGC6EFVKU5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOMXIZU6VUIGFPRCGC6EFVKU5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GOMXIZU6VUIGFPRCGC6EFVKU5Q","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":"63030a1800bdde17f0d3eb0e296f012fdba799f74f68d487933eec262102e2b8","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T10:21:02Z","title_canon_sha256":"eed3c454a85e1247b056aa58b2894b4aaa0ac2bdd6e34bf2f6cd028477f73551"},"schema_version":"1.0","source":{"id":"2204.01366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.01366","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"2204.01366v1","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.01366","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"GOMXIZU6VUIG","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_16","alias_value":"GOMXIZU6VUIGFPRC","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_8","alias_value":"GOMXIZU6","created_at":"2026-07-05T04:11:18Z"}],"graph_snapshots":[{"event_id":"sha256:d3b42725618d8283bb58868922a1ecaa7b7203eb458cc76bb1cc0f7a0971ac7b","target":"graph","created_at":"2026-07-05T04:11:18Z","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/2204.01366/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The minimum cost multicut problem is the NP-hard/APX-hard combinatorial optimization problem of partitioning a real-valued edge-weighted graph such as to minimize the total cost of the partition. While graph convolutional neural networks (GNN) have proven to be promising in the context of combinatorial optimization, most of them are only tailored to or tested on positive-valued edge weights, i.e. they do not comply to the nature of the multicut problem. We therefore adapt various GNN architectures including Graph Convolutional Networks, Signed Graph Convolutional Networks and Graph Isomorphic ","authors_text":"Margret Keuper, Steffen Jung","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T10:21:02Z","title":"Learning to solve Minimum Cost Multicuts efficiently using Edge-Weighted Graph Convolutional Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.01366","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:4a5d7dc27340025d95826a12b0a17b8b85134e7013496e7313714ba6d91f835d","target":"record","created_at":"2026-07-05T04:11:18Z","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":"63030a1800bdde17f0d3eb0e296f012fdba799f74f68d487933eec262102e2b8","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T10:21:02Z","title_canon_sha256":"eed3c454a85e1247b056aa58b2894b4aaa0ac2bdd6e34bf2f6cd028477f73551"},"schema_version":"1.0","source":{"id":"2204.01366","kind":"arxiv","version":1}},"canonical_sha256":"339974669ead1062be2230bc42d554ec0dcf6e01078f2a80e115d571914a6287","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"339974669ead1062be2230bc42d554ec0dcf6e01078f2a80e115d571914a6287","first_computed_at":"2026-07-05T04:11:18.178832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:11:18.178832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e3tDmL21aIaSvGTMEvm+WOnEuZqYY/NpcQrqP5vAqVxmmjG/hYSBlURRdvZyAOR0MhbGfQGKMu/93dNXIqknDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:11:18.179207Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.01366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a5d7dc27340025d95826a12b0a17b8b85134e7013496e7313714ba6d91f835d","sha256:d3b42725618d8283bb58868922a1ecaa7b7203eb458cc76bb1cc0f7a0971ac7b"],"state_sha256":"a2e830f49ab4ecbf9d7176f260385544ef1b5a009aad2ca60304266367e78da6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eskyohesW+bkqdfVSOjVjNUVFGZ6Y+LJ33DDeDNjA4QJ7KbtK23CYDMMzef3ujQbagugZZrwzTN+QbNvhl7yBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T22:06:44.284294Z","bundle_sha256":"cbc66852b007c2ea1761ee784e6353383fbe0f2299984f8479e1cc6e7c9b853d"}}