{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5JK4ZWVTJEEWV3KGXWYRFRVVYI","short_pith_number":"pith:5JK4ZWVT","canonical_record":{"source":{"id":"1905.03134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-08T15:07:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0f6b24e08dba97feec195a886ab283b2d759003342a09f8638020be4ee043764","abstract_canon_sha256":"a63813ca42d647fc18155794b1be6b9efafb54af8ce5786c44090c2aff3dfd36"},"schema_version":"1.0"},"canonical_sha256":"ea55ccdab349096aed46bdb112c6b5c216353ad4fbc6f0559bad8af391e5aa97","source":{"kind":"arxiv","id":"1905.03134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03134","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03134v1","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03134","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"5JK4ZWVTJEEW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5JK4ZWVTJEEWV3KG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5JK4ZWVT","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5JK4ZWVTJEEWV3KGXWYRFRVVYI","target":"record","payload":{"canonical_record":{"source":{"id":"1905.03134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-08T15:07:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0f6b24e08dba97feec195a886ab283b2d759003342a09f8638020be4ee043764","abstract_canon_sha256":"a63813ca42d647fc18155794b1be6b9efafb54af8ce5786c44090c2aff3dfd36"},"schema_version":"1.0"},"canonical_sha256":"ea55ccdab349096aed46bdb112c6b5c216353ad4fbc6f0559bad8af391e5aa97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:42.759687Z","signature_b64":"dke0aZHDRqnTETCNELU1TbH3egErMiHzUSpUSw3JUV++7k1hEEI3S7bIB8YUlAs0h0QqT0xn7zancUpN8XJMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea55ccdab349096aed46bdb112c6b5c216353ad4fbc6f0559bad8af391e5aa97","last_reissued_at":"2026-05-17T23:46:42.759032Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:42.759032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.03134","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-05-17T23:46:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10qj8bPsiuflszah+3o8BmCi0AJfKhvk5OSTzla2PDOzBMZHalpNMEreQiSOIF9ZKD1qv+ODBsUVDSskfMsnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:03:45.555417Z"},"content_sha256":"653c3ce05b2eb2210ca0d027581250936e1ce1a8cc7b46f2fcc955dee03d4215","schema_version":"1.0","event_id":"sha256:653c3ce05b2eb2210ca0d027581250936e1ce1a8cc7b46f2fcc955dee03d4215"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5JK4ZWVTJEEWV3KGXWYRFRVVYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Guilherme C. M. Gomes, Ignasi Sau","submitted_at":"2019-05-08T15:07:28Z","abstract_excerpt":"A matching cut is a partition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT problem asks whether a graph has a matching cut, and has been intensively studied in the literature. Motivated by a question posed by Komusiewicz et al. [IPEC 2018], we introduce a natural generalization of this problem, which we call $d$-CUT: for a positive integer $d$, a $d$-cut is a bipartition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most $d$ neighbors across the cut. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03134","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":""},"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:46:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ruZucD7482yInpv68k8oP0mwo5jb/i30S9f+1ZFm6B3I20cqGYRJ1eJF+w6gW95UnGFI6eDQ/DRo6oTzGfoZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:03:45.555771Z"},"content_sha256":"b4c15b9787ccd02da97fe7130a5838eabc6b7b3e6f5b0e48b8b0533ef6dcf175","schema_version":"1.0","event_id":"sha256:b4c15b9787ccd02da97fe7130a5838eabc6b7b3e6f5b0e48b8b0533ef6dcf175"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/bundle.json","state_url":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/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-06-05T11:03:45Z","links":{"resolver":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI","bundle":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/bundle.json","state":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5JK4ZWVTJEEWV3KGXWYRFRVVYI","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":"a63813ca42d647fc18155794b1be6b9efafb54af8ce5786c44090c2aff3dfd36","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-08T15:07:28Z","title_canon_sha256":"0f6b24e08dba97feec195a886ab283b2d759003342a09f8638020be4ee043764"},"schema_version":"1.0","source":{"id":"1905.03134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03134","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03134v1","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03134","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"5JK4ZWVTJEEW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5JK4ZWVTJEEWV3KG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5JK4ZWVT","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:b4c15b9787ccd02da97fe7130a5838eabc6b7b3e6f5b0e48b8b0533ef6dcf175","target":"graph","created_at":"2026-05-17T23:46:42Z","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":"A matching cut is a partition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT problem asks whether a graph has a matching cut, and has been intensively studied in the literature. Motivated by a question posed by Komusiewicz et al. [IPEC 2018], we introduce a natural generalization of this problem, which we call $d$-CUT: for a positive integer $d$, a $d$-cut is a bipartition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most $d$ neighbors across the cut. We ","authors_text":"Guilherme C. M. Gomes, Ignasi Sau","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-08T15:07:28Z","title":"Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03134","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:653c3ce05b2eb2210ca0d027581250936e1ce1a8cc7b46f2fcc955dee03d4215","target":"record","created_at":"2026-05-17T23:46:42Z","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":"a63813ca42d647fc18155794b1be6b9efafb54af8ce5786c44090c2aff3dfd36","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-08T15:07:28Z","title_canon_sha256":"0f6b24e08dba97feec195a886ab283b2d759003342a09f8638020be4ee043764"},"schema_version":"1.0","source":{"id":"1905.03134","kind":"arxiv","version":1}},"canonical_sha256":"ea55ccdab349096aed46bdb112c6b5c216353ad4fbc6f0559bad8af391e5aa97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea55ccdab349096aed46bdb112c6b5c216353ad4fbc6f0559bad8af391e5aa97","first_computed_at":"2026-05-17T23:46:42.759032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:42.759032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dke0aZHDRqnTETCNELU1TbH3egErMiHzUSpUSw3JUV++7k1hEEI3S7bIB8YUlAs0h0QqT0xn7zancUpN8XJMCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:42.759687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:653c3ce05b2eb2210ca0d027581250936e1ce1a8cc7b46f2fcc955dee03d4215","sha256:b4c15b9787ccd02da97fe7130a5838eabc6b7b3e6f5b0e48b8b0533ef6dcf175"],"state_sha256":"910f65fc423cc8e7e2930a76afe9d812bb7d916a25b17990fbd22b50f727c952"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ds0NrIuMRwVe92kMXNgGCN4rvhi/YcIshkd9uITtQLomzcUKxFpA9B8+1JbKXRDVIRUZoCoF0EG3RwW6gmfsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:03:45.557713Z","bundle_sha256":"171b0302c4777afd6216c16e3a4ea46fc2f6df3a2fc3d9addb6b9b20ca4ea247"}}