{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GOFUCQ7RHKBHQCOJ3MWKA37RE4","short_pith_number":"pith:GOFUCQ7R","canonical_record":{"source":{"id":"1903.12641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-29T17:42:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"09e327754d33a713b0d090be7ac2a583012c26dcb895c1afdd97c504d5709d9b","abstract_canon_sha256":"f09a9eb216b80f36d92907da15dd57e4ca3b094825eec3a99677e2ee5f876168"},"schema_version":"1.0"},"canonical_sha256":"338b4143f13a827809c9db2ca06ff1271b565ff427ff3545298c07a473e47300","source":{"kind":"arxiv","id":"1903.12641","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GOFUCQ7RHKBHQCOJ3MWKA37RE4","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-29T17:42:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"09e327754d33a713b0d090be7ac2a583012c26dcb895c1afdd97c504d5709d9b","abstract_canon_sha256":"f09a9eb216b80f36d92907da15dd57e4ca3b094825eec3a99677e2ee5f876168"},"schema_version":"1.0"},"canonical_sha256":"338b4143f13a827809c9db2ca06ff1271b565ff427ff3545298c07a473e47300","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:53.683200Z","signature_b64":"23ta0otxh2P4Lx9yulcU7X3GAWd7YX1khr4FurBscV29bH7SftHjB2mtoizirzI5mrilItrzxOjYCiU0HxZoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"338b4143f13a827809c9db2ca06ff1271b565ff427ff3545298c07a473e47300","last_reissued_at":"2026-05-17T23:47:53.682757Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:53.682757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12641","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-05-17T23:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m6O0WwO6FMaymqH97qPjmq0XMLQ2VH++7NxxR4CVRy0ei4VIh+NiUrhqXI3l1EgNHKTWLxz4jpeoW6kEa2NtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:19:51.839387Z"},"content_sha256":"13e2432dd106b3ee4746a5d9bd6e7a436f6271618d5965f450d4d0c9172a5220","schema_version":"1.0","event_id":"sha256:13e2432dd106b3ee4746a5d9bd6e7a436f6271618d5965f450d4d0c9172a5220"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GOFUCQ7RHKBHQCOJ3MWKA37RE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected max cut is polynomial for graphs without $K_5\\backslash e$ as a minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Brahim Chaourar","submitted_at":"2019-03-29T17:42:37Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12641","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":""},"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:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hl7iLIIWQVy9JHqTvIwEyA0/VGBiCrCKoz/UjyBspsRuAXRCnGyg5aX7YoSMNka3c2ch6EuvxzfejkC9sR+ODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:19:51.839860Z"},"content_sha256":"bce73ace3d226edd0b79b4a687506720447323d46635236a2c8aaae77c1662eb","schema_version":"1.0","event_id":"sha256:bce73ace3d226edd0b79b4a687506720447323d46635236a2c8aaae77c1662eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOFUCQ7RHKBHQCOJ3MWKA37RE4/bundle.json","state_url":"https://pith.science/pith/GOFUCQ7RHKBHQCOJ3MWKA37RE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOFUCQ7RHKBHQCOJ3MWKA37RE4/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-16T14:19:51Z","links":{"resolver":"https://pith.science/pith/GOFUCQ7RHKBHQCOJ3MWKA37RE4","bundle":"https://pith.science/pith/GOFUCQ7RHKBHQCOJ3MWKA37RE4/bundle.json","state":"https://pith.science/pith/GOFUCQ7RHKBHQCOJ3MWKA37RE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOFUCQ7RHKBHQCOJ3MWKA37RE4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4UsVuFVCsyzNZzoy1MLU+70TG2KLj0twkL1FZKbZOAqsylXDI8pVGGWhf97FTYk6gW6wQrxIf8tLiItP90hAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T14:19:51.848057Z","bundle_sha256":"c10ec4ee60c4ba86ce28af0fe304437a8ce537725c7f44b2c31a0d8e4fe6c53f"}}