{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G6TN5SDKLDDWAXYZSRGC3NTNOP","short_pith_number":"pith:G6TN5SDK","schema_version":"1.0","canonical_sha256":"37a6dec86a58c7605f19944c2db66d73cb29a7ba348ffb451b4f1940f0b8fa22","source":{"kind":"arxiv","id":"1608.05816","version":1},"attestation_state":"computed","paper":{"title":"Linear Kernels for Separating a Graph into Components of Bounded Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingyu Xiao","submitted_at":"2016-08-20T13:02:58Z","abstract_excerpt":"Graph separation and partitioning are fundamental problems that have been extensively studied both in theory and practice. The \\textsc{$p$-Size Separator} problem, closely related to the \\textsc{Balanced Separator} problem, is to check whether we can delete at most $k$ vertices in a given graph $G$ such that each connected component of the remaining graph has at most $p$ vertices. This problem is NP-hard for each fixed integer $p\\geq 1$ and it becomes the famous \\textsc{Vertex Cover} problem when $p=1$. It is known that the problem with parameter $k$ is W[1]-hard for unfixed $p$. In this paper"},"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":"1608.05816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-20T13:02:58Z","cross_cats_sorted":[],"title_canon_sha256":"3dae9310c9cf7285633fc94448218bc8a4ad55a9b8ffbf5599bb9116baf71adc","abstract_canon_sha256":"f926f4226aea32a18e5db5a228756037d7e1bec927ea8fb7efe1d3764b0a29e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:36.393211Z","signature_b64":"oRbmqR8AhMcLkBhdbbugF+y1Kdj7ENI8HbExXAsv2wxdZzmcWJZWpUKJAuFzZK23PChhypK3lWfMKOxwr7akAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37a6dec86a58c7605f19944c2db66d73cb29a7ba348ffb451b4f1940f0b8fa22","last_reissued_at":"2026-05-18T00:38:36.392669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:36.392669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Kernels for Separating a Graph into Components of Bounded Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingyu Xiao","submitted_at":"2016-08-20T13:02:58Z","abstract_excerpt":"Graph separation and partitioning are fundamental problems that have been extensively studied both in theory and practice. The \\textsc{$p$-Size Separator} problem, closely related to the \\textsc{Balanced Separator} problem, is to check whether we can delete at most $k$ vertices in a given graph $G$ such that each connected component of the remaining graph has at most $p$ vertices. This problem is NP-hard for each fixed integer $p\\geq 1$ and it becomes the famous \\textsc{Vertex Cover} problem when $p=1$. It is known that the problem with parameter $k$ is W[1]-hard for unfixed $p$. In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05816","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":"1608.05816","created_at":"2026-05-18T00:38:36.392750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05816v1","created_at":"2026-05-18T00:38:36.392750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05816","created_at":"2026-05-18T00:38:36.392750+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6TN5SDKLDDW","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6TN5SDKLDDWAXYZ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6TN5SDK","created_at":"2026-05-18T12:30:15.759754+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/G6TN5SDKLDDWAXYZSRGC3NTNOP","json":"https://pith.science/pith/G6TN5SDKLDDWAXYZSRGC3NTNOP.json","graph_json":"https://pith.science/api/pith-number/G6TN5SDKLDDWAXYZSRGC3NTNOP/graph.json","events_json":"https://pith.science/api/pith-number/G6TN5SDKLDDWAXYZSRGC3NTNOP/events.json","paper":"https://pith.science/paper/G6TN5SDK"},"agent_actions":{"view_html":"https://pith.science/pith/G6TN5SDKLDDWAXYZSRGC3NTNOP","download_json":"https://pith.science/pith/G6TN5SDKLDDWAXYZSRGC3NTNOP.json","view_paper":"https://pith.science/paper/G6TN5SDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05816&json=true","fetch_graph":"https://pith.science/api/pith-number/G6TN5SDKLDDWAXYZSRGC3NTNOP/graph.json","fetch_events":"https://pith.science/api/pith-number/G6TN5SDKLDDWAXYZSRGC3NTNOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6TN5SDKLDDWAXYZSRGC3NTNOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6TN5SDKLDDWAXYZSRGC3NTNOP/action/storage_attestation","attest_author":"https://pith.science/pith/G6TN5SDKLDDWAXYZSRGC3NTNOP/action/author_attestation","sign_citation":"https://pith.science/pith/G6TN5SDKLDDWAXYZSRGC3NTNOP/action/citation_signature","submit_replication":"https://pith.science/pith/G6TN5SDKLDDWAXYZSRGC3NTNOP/action/replication_record"}},"created_at":"2026-05-18T00:38:36.392750+00:00","updated_at":"2026-05-18T00:38:36.392750+00:00"}