{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GOFUCQ7RHKBHQCOJ3MWKA37RE4","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":"f09a9eb216b80f36d92907da15dd57e4ca3b094825eec3a99677e2ee5f876168","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-29T17:42:37Z","title_canon_sha256":"09e327754d33a713b0d090be7ac2a583012c26dcb895c1afdd97c504d5709d9b"},"schema_version":"1.0","source":{"id":"1903.12641","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12641","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12641v2","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12641","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"GOFUCQ7RHKBH","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GOFUCQ7RHKBHQCOJ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GOFUCQ7R","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:bce73ace3d226edd0b79b4a687506720447323d46635236a2c8aaae77c1662eb","target":"graph","created_at":"2026-05-17T23:47:53Z","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":"Given a graph $G=(V, E)$, a connected cut $\\delta (U)$ is the set of edges of E linking all vertices of U to all vertices of $V\\backslash U$ such that the induced subgraphs $G[U]$ and $G[V\\backslash U]$ are connected. Given a positive weight function $w$ defined on $E$, the connected maximum cut problem (CMAX CUT) is to find a connected cut $\\Omega$ such that $w(\\Omega)$ is maximum among all connected cuts. CMAX CUT is NP-hard even for planar graphs. In this paper, we prove that CMAX CUT is polynomial for graphs without $K_5\\backslash e$ as a minor. We deduce a quadratic time algorithm for the","authors_text":"Brahim Chaourar","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-29T17:42:37Z","title":"Connected max cut is polynomial for graphs without $K_5\\backslash e$ as a minor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12641","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:13e2432dd106b3ee4746a5d9bd6e7a436f6271618d5965f450d4d0c9172a5220","target":"record","created_at":"2026-05-17T23:47:53Z","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":"f09a9eb216b80f36d92907da15dd57e4ca3b094825eec3a99677e2ee5f876168","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-29T17:42:37Z","title_canon_sha256":"09e327754d33a713b0d090be7ac2a583012c26dcb895c1afdd97c504d5709d9b"},"schema_version":"1.0","source":{"id":"1903.12641","kind":"arxiv","version":2}},"canonical_sha256":"338b4143f13a827809c9db2ca06ff1271b565ff427ff3545298c07a473e47300","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"338b4143f13a827809c9db2ca06ff1271b565ff427ff3545298c07a473e47300","first_computed_at":"2026-05-17T23:47:53.682757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:53.682757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"23ta0otxh2P4Lx9yulcU7X3GAWd7YX1khr4FurBscV29bH7SftHjB2mtoizirzI5mrilItrzxOjYCiU0HxZoCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:53.683200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12641","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13e2432dd106b3ee4746a5d9bd6e7a436f6271618d5965f450d4d0c9172a5220","sha256:bce73ace3d226edd0b79b4a687506720447323d46635236a2c8aaae77c1662eb"],"state_sha256":"0f3f13725c1aabd8f047e7d0d9edf0fe095c6310a8d2425d2a39583faa0b3aa4"}