{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5JK4ZWVTJEEWV3KGXWYRFRVVYI","short_pith_number":"pith:5JK4ZWVT","schema_version":"1.0","canonical_sha256":"ea55ccdab349096aed46bdb112c6b5c216353ad4fbc6f0559bad8af391e5aa97","source":{"kind":"arxiv","id":"1905.03134","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.03134","created_at":"2026-05-17T23:46:42.759106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03134v1","created_at":"2026-05-17T23:46:42.759106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03134","created_at":"2026-05-17T23:46:42.759106+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JK4ZWVTJEEW","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JK4ZWVTJEEWV3KG","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JK4ZWVT","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI","json":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI.json","graph_json":"https://pith.science/api/pith-number/5JK4ZWVTJEEWV3KGXWYRFRVVYI/graph.json","events_json":"https://pith.science/api/pith-number/5JK4ZWVTJEEWV3KGXWYRFRVVYI/events.json","paper":"https://pith.science/paper/5JK4ZWVT"},"agent_actions":{"view_html":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI","download_json":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI.json","view_paper":"https://pith.science/paper/5JK4ZWVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03134&json=true","fetch_graph":"https://pith.science/api/pith-number/5JK4ZWVTJEEWV3KGXWYRFRVVYI/graph.json","fetch_events":"https://pith.science/api/pith-number/5JK4ZWVTJEEWV3KGXWYRFRVVYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/action/storage_attestation","attest_author":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/action/author_attestation","sign_citation":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/action/citation_signature","submit_replication":"https://pith.science/pith/5JK4ZWVTJEEWV3KGXWYRFRVVYI/action/replication_record"}},"created_at":"2026-05-17T23:46:42.759106+00:00","updated_at":"2026-05-17T23:46:42.759106+00:00"}