{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NQPZXGPM5CX5U36UWHLE2W7F6B","short_pith_number":"pith:NQPZXGPM","schema_version":"1.0","canonical_sha256":"6c1f9b99ece8afda6fd4b1d64d5be5f04d76c2bb797ceed4ddc106d33469f3d4","source":{"kind":"arxiv","id":"1101.4689","version":2},"attestation_state":"computed","paper":{"title":"Minimum k-way cut of bounded size is fixed-parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ken-ichi Kawarabayashi, Mikkel Thorup","submitted_at":"2011-01-24T23:48:50Z","abstract_excerpt":"We consider a the minimum k-way cut problem for unweighted graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k components, or report that this requires cutting more than s edges. We show that this problem is fixed-parameter tractable (FPT) in s. More precisely, for s=O(1), our algorithm runs in quadratic time while we have a different linear time algorithm for planar graphs and bounded genus graphs. Our tractability result stands in contrast to known W[1] hardness of related problems. Without the size boun"},"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":"1101.4689","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-24T23:48:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"904e0c50403501ea6b7bb067071961f749e001e2357dea07995dbd660bfb3e3e","abstract_canon_sha256":"b23596ade3d70066bf4e693061d43776459fea5bf972ef0a8b181d38f9cc2426"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:47.130417Z","signature_b64":"tel4Trw1xOIZNqpO+cRYfDsfU2hXuykQdEj2NOySMlSZqQqHgU5JsCUTD1a29Jg6pL9rCSkFE5uoZZjh3vCuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c1f9b99ece8afda6fd4b1d64d5be5f04d76c2bb797ceed4ddc106d33469f3d4","last_reissued_at":"2026-05-18T04:30:47.129937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:47.129937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum k-way cut of bounded size is fixed-parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ken-ichi Kawarabayashi, Mikkel Thorup","submitted_at":"2011-01-24T23:48:50Z","abstract_excerpt":"We consider a the minimum k-way cut problem for unweighted graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k components, or report that this requires cutting more than s edges. We show that this problem is fixed-parameter tractable (FPT) in s. More precisely, for s=O(1), our algorithm runs in quadratic time while we have a different linear time algorithm for planar graphs and bounded genus graphs. Our tractability result stands in contrast to known W[1] hardness of related problems. Without the size boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4689","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.4689","created_at":"2026-05-18T04:30:47.130009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4689v2","created_at":"2026-05-18T04:30:47.130009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4689","created_at":"2026-05-18T04:30:47.130009+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQPZXGPM5CX5","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQPZXGPM5CX5U36U","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQPZXGPM","created_at":"2026-05-18T12:26:37.096874+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/NQPZXGPM5CX5U36UWHLE2W7F6B","json":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B.json","graph_json":"https://pith.science/api/pith-number/NQPZXGPM5CX5U36UWHLE2W7F6B/graph.json","events_json":"https://pith.science/api/pith-number/NQPZXGPM5CX5U36UWHLE2W7F6B/events.json","paper":"https://pith.science/paper/NQPZXGPM"},"agent_actions":{"view_html":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B","download_json":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B.json","view_paper":"https://pith.science/paper/NQPZXGPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4689&json=true","fetch_graph":"https://pith.science/api/pith-number/NQPZXGPM5CX5U36UWHLE2W7F6B/graph.json","fetch_events":"https://pith.science/api/pith-number/NQPZXGPM5CX5U36UWHLE2W7F6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/action/storage_attestation","attest_author":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/action/author_attestation","sign_citation":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/action/citation_signature","submit_replication":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/action/replication_record"}},"created_at":"2026-05-18T04:30:47.130009+00:00","updated_at":"2026-05-18T04:30:47.130009+00:00"}