{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EDUAS6RPI2ALOQRGKLT34WEF63","short_pith_number":"pith:EDUAS6RP","schema_version":"1.0","canonical_sha256":"20e8097a2f4680b7422652e7be5885f6d2a5818b27c0f85de6ce26444906449b","source":{"kind":"arxiv","id":"1304.6189","version":2},"attestation_state":"computed","paper":{"title":"On the parameterized complexity of cutting a few vertices from a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Janne H. Korhonen, Petr A. Golovach","submitted_at":"2013-04-23T07:38:34Z","abstract_excerpt":"We study the parameterized complexity of separating a small set of vertices from a graph by a small vertex-separator. That is, given a graph $G$ and integers $k$, $t$, the task is to find a vertex set $X$ with $|X| \\le k$ and $|N(X)| \\le t$. We show that\n  - the problem is fixed-parameter tractable (FPT) when parameterized by $t$ but W[1]-hard when parameterized by $k$, and\n  - a terminal variant of the problem, where $X$ must contain a given vertex $s$, is W[1]-hard when parameterized either by $k$ or by $t$ alone, but is FPT when parameterized by $k + t$.\n  We also show that if we consider e"},"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":"1304.6189","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T07:38:34Z","cross_cats_sorted":[],"title_canon_sha256":"485472b2d6de0437aa2f70b3ad1862fbf46ae2e3d8e05f47a787d8fc94d34e35","abstract_canon_sha256":"73cf99ebd43e2be5dfc04bed6ba5620e32b957c5282f6ae43a840543e7a66bb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:46.716268Z","signature_b64":"yHJPTIi9zxJj7ALwa8ONKN58IYnKOQ6poNSI3CYrJh291Uy+WJFVFSwbrtwCmUMld/czld6TFvHAcneuyhQsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20e8097a2f4680b7422652e7be5885f6d2a5818b27c0f85de6ce26444906449b","last_reissued_at":"2026-05-18T03:11:46.715668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:46.715668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the parameterized complexity of cutting a few vertices from a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Janne H. Korhonen, Petr A. Golovach","submitted_at":"2013-04-23T07:38:34Z","abstract_excerpt":"We study the parameterized complexity of separating a small set of vertices from a graph by a small vertex-separator. That is, given a graph $G$ and integers $k$, $t$, the task is to find a vertex set $X$ with $|X| \\le k$ and $|N(X)| \\le t$. We show that\n  - the problem is fixed-parameter tractable (FPT) when parameterized by $t$ but W[1]-hard when parameterized by $k$, and\n  - a terminal variant of the problem, where $X$ must contain a given vertex $s$, is W[1]-hard when parameterized either by $k$ or by $t$ alone, but is FPT when parameterized by $k + t$.\n  We also show that if we consider e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6189","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":"1304.6189","created_at":"2026-05-18T03:11:46.715754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6189v2","created_at":"2026-05-18T03:11:46.715754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6189","created_at":"2026-05-18T03:11:46.715754+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDUAS6RPI2AL","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDUAS6RPI2ALOQRG","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDUAS6RP","created_at":"2026-05-18T12:27:43.054852+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/EDUAS6RPI2ALOQRGKLT34WEF63","json":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63.json","graph_json":"https://pith.science/api/pith-number/EDUAS6RPI2ALOQRGKLT34WEF63/graph.json","events_json":"https://pith.science/api/pith-number/EDUAS6RPI2ALOQRGKLT34WEF63/events.json","paper":"https://pith.science/paper/EDUAS6RP"},"agent_actions":{"view_html":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63","download_json":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63.json","view_paper":"https://pith.science/paper/EDUAS6RP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6189&json=true","fetch_graph":"https://pith.science/api/pith-number/EDUAS6RPI2ALOQRGKLT34WEF63/graph.json","fetch_events":"https://pith.science/api/pith-number/EDUAS6RPI2ALOQRGKLT34WEF63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63/action/storage_attestation","attest_author":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63/action/author_attestation","sign_citation":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63/action/citation_signature","submit_replication":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63/action/replication_record"}},"created_at":"2026-05-18T03:11:46.715754+00:00","updated_at":"2026-05-18T03:11:46.715754+00:00"}