{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NTOXVX7XCFZKNWLPPSUB5H6274","short_pith_number":"pith:NTOXVX7X","schema_version":"1.0","canonical_sha256":"6cdd7adff71172a6d96f7ca81e9fdaff12134c9f597b1c4acff3989b9c1bf8b2","source":{"kind":"arxiv","id":"2605.19853","version":1},"attestation_state":"computed","paper":{"title":"Linear Kernels for $l$-Exact Component Order Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingyu Xiao, Yuxi Liu","submitted_at":"2026-05-19T13:45:29Z","abstract_excerpt":"The \\textsc{$l$-Exact Component Order Connectivity} problem asks whether, given an input graph $G$ and an integer $k$, there exists a vertex subset $S\\subseteq V(G)$ of size at most $k$ such that every connected component in $G - S$ has exactly $l$ vertices. In this paper, we present an $O(kl)$-vertex kernel for this problem, computable in $|V(G)|^{O(l)}$ time. This is the first known linear kernel for each fixed $l\\geq 3$. For $l=1$, this problem reduces to the classical \\textsc{Vertex Cover}, and our result matches the best-known $2k$-vertex kernel. For $l=2$ (known as \\textsc{Deletion to In"},"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":"2605.19853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T13:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"d1c9ccc540750d4113d14543964656a4292fcadf5de84b37990cdba651d1927a","abstract_canon_sha256":"e3c10ba965897a0e8e03ea93d7a7cb75adcc7ba714f7f21afb3273d2682e5c44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:06:17.731160Z","signature_b64":"Gs7BZrCXdGzh+k++zIuysG43p9Wv6D+mb2ZWtUm5xY89XTsxFGv9FWo4pWBUsEs3Io9NIxGYTFSDvYTsXh7JCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cdd7adff71172a6d96f7ca81e9fdaff12134c9f597b1c4acff3989b9c1bf8b2","last_reissued_at":"2026-05-20T01:06:17.730419Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:06:17.730419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Kernels for $l$-Exact Component Order Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingyu Xiao, Yuxi Liu","submitted_at":"2026-05-19T13:45:29Z","abstract_excerpt":"The \\textsc{$l$-Exact Component Order Connectivity} problem asks whether, given an input graph $G$ and an integer $k$, there exists a vertex subset $S\\subseteq V(G)$ of size at most $k$ such that every connected component in $G - S$ has exactly $l$ vertices. In this paper, we present an $O(kl)$-vertex kernel for this problem, computable in $|V(G)|^{O(l)}$ time. This is the first known linear kernel for each fixed $l\\geq 3$. For $l=1$, this problem reduces to the classical \\textsc{Vertex Cover}, and our result matches the best-known $2k$-vertex kernel. For $l=2$ (known as \\textsc{Deletion to In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19853","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19853/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.19853","created_at":"2026-05-20T01:06:17.730545+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19853v1","created_at":"2026-05-20T01:06:17.730545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19853","created_at":"2026-05-20T01:06:17.730545+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTOXVX7XCFZK","created_at":"2026-05-20T01:06:17.730545+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTOXVX7XCFZKNWLP","created_at":"2026-05-20T01:06:17.730545+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTOXVX7X","created_at":"2026-05-20T01:06:17.730545+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/NTOXVX7XCFZKNWLPPSUB5H6274","json":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274.json","graph_json":"https://pith.science/api/pith-number/NTOXVX7XCFZKNWLPPSUB5H6274/graph.json","events_json":"https://pith.science/api/pith-number/NTOXVX7XCFZKNWLPPSUB5H6274/events.json","paper":"https://pith.science/paper/NTOXVX7X"},"agent_actions":{"view_html":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274","download_json":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274.json","view_paper":"https://pith.science/paper/NTOXVX7X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19853&json=true","fetch_graph":"https://pith.science/api/pith-number/NTOXVX7XCFZKNWLPPSUB5H6274/graph.json","fetch_events":"https://pith.science/api/pith-number/NTOXVX7XCFZKNWLPPSUB5H6274/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274/action/storage_attestation","attest_author":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274/action/author_attestation","sign_citation":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274/action/citation_signature","submit_replication":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274/action/replication_record"}},"created_at":"2026-05-20T01:06:17.730545+00:00","updated_at":"2026-05-20T01:06:17.730545+00:00"}