{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LO5LQRN53TIFTHLQFTAV5MIAXX","short_pith_number":"pith:LO5LQRN5","canonical_record":{"source":{"id":"1908.03389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T09:56:48Z","cross_cats_sorted":[],"title_canon_sha256":"67a64d2b9aaf475b40b90b7a0dbb365a8f9dd9424820fbfcd68cd0b227b5e0c3","abstract_canon_sha256":"676e6ef5f1ab292e90c50503a42d3ec08c00de5a72c7c493ab6899b49889bc1a"},"schema_version":"1.0"},"canonical_sha256":"5bbab845bddcd0599d702cc15eb100bddaf63af557283ceb0e1a834cf55507d2","source":{"kind":"arxiv","id":"1908.03389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03389","created_at":"2026-07-04T23:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03389v1","created_at":"2026-07-04T23:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03389","created_at":"2026-07-04T23:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"LO5LQRN53TIF","created_at":"2026-07-04T23:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"LO5LQRN53TIFTHLQ","created_at":"2026-07-04T23:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"LO5LQRN5","created_at":"2026-07-04T23:52:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LO5LQRN53TIFTHLQFTAV5MIAXX","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T09:56:48Z","cross_cats_sorted":[],"title_canon_sha256":"67a64d2b9aaf475b40b90b7a0dbb365a8f9dd9424820fbfcd68cd0b227b5e0c3","abstract_canon_sha256":"676e6ef5f1ab292e90c50503a42d3ec08c00de5a72c7c493ab6899b49889bc1a"},"schema_version":"1.0"},"canonical_sha256":"5bbab845bddcd0599d702cc15eb100bddaf63af557283ceb0e1a834cf55507d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:39.522230Z","signature_b64":"VVdbpLiOEU1qJUla92MfeHoUmUeo65w6hzvSCf2WkMloQ5x0mZ3Wvs5b4xKQ70EstIRbXAsSM1fmK/zFKo1OBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bbab845bddcd0599d702cc15eb100bddaf63af557283ceb0e1a834cf55507d2","last_reissued_at":"2026-07-04T23:52:39.521843Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:39.521843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03389","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-04T23:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YAjz3UFL5p6GNaD/qkqJpQp7UYQKEmLTkN1vndBeh8t8FiJApwjlmLLQZE0Kg9zfSv1R+ljRzjGKUpzVAb+4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:58:56.937488Z"},"content_sha256":"432934851c9108bb8f515ecdb402622bfd02329b2f8c3b6357909a82c108a6af","schema_version":"1.0","event_id":"sha256:432934851c9108bb8f515ecdb402622bfd02329b2f8c3b6357909a82c108a6af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LO5LQRN53TIFTHLQFTAV5MIAXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi","submitted_at":"2019-08-09T09:56:48Z","abstract_excerpt":"We study two variants of \\textsc{Maximum Cut}, which we call \\textsc{Connected Maximum Cut} and \\textsc{Maximum Minimal Cut}, in this paper. In these problems, given an unweighted graph, the goal is to compute a maximum cut satisfying some connectivity requirements. Both problems are known to be NP-complete even on planar graphs whereas \\textsc{Maximum Cut} on planar graphs is solvable in polynomial time. We first show that these problems are NP-complete even on planar bipartite graphs and split graphs. Then we give parameterized algorithms using graph parameters such as clique-width, tree-wid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03389","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/1908.03389/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:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AqPuxgpeKY12T6sqPNAWxoj9lEm19fjCQWjLhC01MlLpswd+hsSYVrOqKjhn4T0k/7jnU4YV7O91qhBkwHl/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:58:56.938141Z"},"content_sha256":"078ec1e0461a20d9692ac6da5f85945c407f98880c6fbbd2643465f8dad1d1ff","schema_version":"1.0","event_id":"sha256:078ec1e0461a20d9692ac6da5f85945c407f98880c6fbbd2643465f8dad1d1ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LO5LQRN53TIFTHLQFTAV5MIAXX/bundle.json","state_url":"https://pith.science/pith/LO5LQRN53TIFTHLQFTAV5MIAXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LO5LQRN53TIFTHLQFTAV5MIAXX/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-16T04:58:57Z","links":{"resolver":"https://pith.science/pith/LO5LQRN53TIFTHLQFTAV5MIAXX","bundle":"https://pith.science/pith/LO5LQRN53TIFTHLQFTAV5MIAXX/bundle.json","state":"https://pith.science/pith/LO5LQRN53TIFTHLQFTAV5MIAXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LO5LQRN53TIFTHLQFTAV5MIAXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LO5LQRN53TIFTHLQFTAV5MIAXX","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":"676e6ef5f1ab292e90c50503a42d3ec08c00de5a72c7c493ab6899b49889bc1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T09:56:48Z","title_canon_sha256":"67a64d2b9aaf475b40b90b7a0dbb365a8f9dd9424820fbfcd68cd0b227b5e0c3"},"schema_version":"1.0","source":{"id":"1908.03389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03389","created_at":"2026-07-04T23:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03389v1","created_at":"2026-07-04T23:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03389","created_at":"2026-07-04T23:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"LO5LQRN53TIF","created_at":"2026-07-04T23:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"LO5LQRN53TIFTHLQ","created_at":"2026-07-04T23:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"LO5LQRN5","created_at":"2026-07-04T23:52:39Z"}],"graph_snapshots":[{"event_id":"sha256:078ec1e0461a20d9692ac6da5f85945c407f98880c6fbbd2643465f8dad1d1ff","target":"graph","created_at":"2026-07-04T23:52:39Z","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/1908.03389/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study two variants of \\textsc{Maximum Cut}, which we call \\textsc{Connected Maximum Cut} and \\textsc{Maximum Minimal Cut}, in this paper. In these problems, given an unweighted graph, the goal is to compute a maximum cut satisfying some connectivity requirements. Both problems are known to be NP-complete even on planar graphs whereas \\textsc{Maximum Cut} on planar graphs is solvable in polynomial time. We first show that these problems are NP-complete even on planar bipartite graphs and split graphs. Then we give parameterized algorithms using graph parameters such as clique-width, tree-wid","authors_text":"Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03389","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:432934851c9108bb8f515ecdb402622bfd02329b2f8c3b6357909a82c108a6af","target":"record","created_at":"2026-07-04T23:52:39Z","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":"676e6ef5f1ab292e90c50503a42d3ec08c00de5a72c7c493ab6899b49889bc1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T09:56:48Z","title_canon_sha256":"67a64d2b9aaf475b40b90b7a0dbb365a8f9dd9424820fbfcd68cd0b227b5e0c3"},"schema_version":"1.0","source":{"id":"1908.03389","kind":"arxiv","version":1}},"canonical_sha256":"5bbab845bddcd0599d702cc15eb100bddaf63af557283ceb0e1a834cf55507d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bbab845bddcd0599d702cc15eb100bddaf63af557283ceb0e1a834cf55507d2","first_computed_at":"2026-07-04T23:52:39.521843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:39.521843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VVdbpLiOEU1qJUla92MfeHoUmUeo65w6hzvSCf2WkMloQ5x0mZ3Wvs5b4xKQ70EstIRbXAsSM1fmK/zFKo1OBg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:39.522230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:432934851c9108bb8f515ecdb402622bfd02329b2f8c3b6357909a82c108a6af","sha256:078ec1e0461a20d9692ac6da5f85945c407f98880c6fbbd2643465f8dad1d1ff"],"state_sha256":"57430c83bd6c091ff8704b5dc2c8175895d425dec98d4eeac6d31d8a8f6cfc3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMaxDyK9NRYgutY8wVWGSi7wkQ2oootCXigAzAGIhW8fYZDX4r4u4YrLET/wKb7RGT1bb1dn2em/H1MXDhg2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T04:58:57.013492Z","bundle_sha256":"825f15b2dc2f19326fe9c42faaa22a6ee1fe620c325b360e4da85ea5dfc62726"}}