{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NTOXVX7XCFZKNWLPPSUB5H6274","short_pith_number":"pith:NTOXVX7X","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"},"canonical_sha256":"6cdd7adff71172a6d96f7ca81e9fdaff12134c9f597b1c4acff3989b9c1bf8b2","source":{"kind":"arxiv","id":"2605.19853","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19853","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19853v1","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19853","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"NTOXVX7XCFZK","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_16","alias_value":"NTOXVX7XCFZKNWLP","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_8","alias_value":"NTOXVX7X","created_at":"2026-05-20T01:06:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NTOXVX7XCFZKNWLPPSUB5H6274","target":"record","payload":{"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"},"canonical_sha256":"6cdd7adff71172a6d96f7ca81e9fdaff12134c9f597b1c4acff3989b9c1bf8b2","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"},"source_kind":"arxiv","source_id":"2605.19853","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"312G+7icDlse5zweWEnCxmVMOUe+DgaIMz7xaOnXC8Oxxtbvny009mJmY3hRCcXzxayNKu6MKrEBHWdLlJ8yAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:57:31.566514Z"},"content_sha256":"32212dc3c0d9d55ca508cf0cb453a1e68eac67db9b9f030dd12f283ecb9d4459","schema_version":"1.0","event_id":"sha256:32212dc3c0d9d55ca508cf0cb453a1e68eac67db9b9f030dd12f283ecb9d4459"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NTOXVX7XCFZKNWLPPSUB5H6274","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m4chGdM0iNfe1QYdYoLIHmzWlSBae56JF4/p9isgvOF+PQI4gBoGM/ykLuJi0zsZZS+7AyXcf+7dnqH4z7TcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:57:31.567185Z"},"content_sha256":"19af7303c7d95445e7fef0eb1b5fe6d40b0d33fec28f5d5f202d4c121f51bb76","schema_version":"1.0","event_id":"sha256:19af7303c7d95445e7fef0eb1b5fe6d40b0d33fec28f5d5f202d4c121f51bb76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274/bundle.json","state_url":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTOXVX7XCFZKNWLPPSUB5H6274/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T07:57:31Z","links":{"resolver":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274","bundle":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274/bundle.json","state":"https://pith.science/pith/NTOXVX7XCFZKNWLPPSUB5H6274/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTOXVX7XCFZKNWLPPSUB5H6274/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NTOXVX7XCFZKNWLPPSUB5H6274","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e3c10ba965897a0e8e03ea93d7a7cb75adcc7ba714f7f21afb3273d2682e5c44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T13:45:29Z","title_canon_sha256":"d1c9ccc540750d4113d14543964656a4292fcadf5de84b37990cdba651d1927a"},"schema_version":"1.0","source":{"id":"2605.19853","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19853","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19853v1","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19853","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"NTOXVX7XCFZK","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_16","alias_value":"NTOXVX7XCFZKNWLP","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_8","alias_value":"NTOXVX7X","created_at":"2026-05-20T01:06:17Z"}],"graph_snapshots":[{"event_id":"sha256:19af7303c7d95445e7fef0eb1b5fe6d40b0d33fec28f5d5f202d4c121f51bb76","target":"graph","created_at":"2026-05-20T01:06:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.19853/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mingyu Xiao, Yuxi Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T13:45:29Z","title":"Linear Kernels for $l$-Exact Component Order Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19853","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:32212dc3c0d9d55ca508cf0cb453a1e68eac67db9b9f030dd12f283ecb9d4459","target":"record","created_at":"2026-05-20T01:06:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e3c10ba965897a0e8e03ea93d7a7cb75adcc7ba714f7f21afb3273d2682e5c44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T13:45:29Z","title_canon_sha256":"d1c9ccc540750d4113d14543964656a4292fcadf5de84b37990cdba651d1927a"},"schema_version":"1.0","source":{"id":"2605.19853","kind":"arxiv","version":1}},"canonical_sha256":"6cdd7adff71172a6d96f7ca81e9fdaff12134c9f597b1c4acff3989b9c1bf8b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cdd7adff71172a6d96f7ca81e9fdaff12134c9f597b1c4acff3989b9c1bf8b2","first_computed_at":"2026-05-20T01:06:17.730419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:06:17.730419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gs7BZrCXdGzh+k++zIuysG43p9Wv6D+mb2ZWtUm5xY89XTsxFGv9FWo4pWBUsEs3Io9NIxGYTFSDvYTsXh7JCg==","signature_status":"signed_v1","signed_at":"2026-05-20T01:06:17.731160Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19853","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32212dc3c0d9d55ca508cf0cb453a1e68eac67db9b9f030dd12f283ecb9d4459","sha256:19af7303c7d95445e7fef0eb1b5fe6d40b0d33fec28f5d5f202d4c121f51bb76"],"state_sha256":"a583731f0e4ee372f0e23a3f531652516a9137e7b01d17e542685356d7300a16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QvSjecJytSv5nv6h8/Xnf1NZcCMTczZpikx5Md8wKdpuu1JAvG3jX0hObTpFxNnSAwK9LMV/cFQginJULXtbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T07:57:31.570808Z","bundle_sha256":"4d2770f03a60bba92d30a0894e65409a2cc4d847a85793c5738fe88e87e353b9"}}