{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G6TN5SDKLDDWAXYZSRGC3NTNOP","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":"f926f4226aea32a18e5db5a228756037d7e1bec927ea8fb7efe1d3764b0a29e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-20T13:02:58Z","title_canon_sha256":"3dae9310c9cf7285633fc94448218bc8a4ad55a9b8ffbf5599bb9116baf71adc"},"schema_version":"1.0","source":{"id":"1608.05816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05816","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05816v1","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05816","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"G6TN5SDKLDDW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G6TN5SDKLDDWAXYZ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G6TN5SDK","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:0da13a71f5153b4fdcbcf480bb816b5e721bb1c55b8b6eb117e6b26facc0a346","target":"graph","created_at":"2026-05-18T00:38:36Z","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"},"paper":{"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","authors_text":"Mingyu Xiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-20T13:02:58Z","title":"Linear Kernels for Separating a Graph into Components of Bounded Size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05816","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:c2cee1f38efc6ff3851e9af1fc9e10c806af084f1156234bef3c1c43b236db34","target":"record","created_at":"2026-05-18T00:38:36Z","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":"f926f4226aea32a18e5db5a228756037d7e1bec927ea8fb7efe1d3764b0a29e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-20T13:02:58Z","title_canon_sha256":"3dae9310c9cf7285633fc94448218bc8a4ad55a9b8ffbf5599bb9116baf71adc"},"schema_version":"1.0","source":{"id":"1608.05816","kind":"arxiv","version":1}},"canonical_sha256":"37a6dec86a58c7605f19944c2db66d73cb29a7ba348ffb451b4f1940f0b8fa22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37a6dec86a58c7605f19944c2db66d73cb29a7ba348ffb451b4f1940f0b8fa22","first_computed_at":"2026-05-18T00:38:36.392669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:36.392669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oRbmqR8AhMcLkBhdbbugF+y1Kdj7ENI8HbExXAsv2wxdZzmcWJZWpUKJAuFzZK23PChhypK3lWfMKOxwr7akAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:36.393211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2cee1f38efc6ff3851e9af1fc9e10c806af084f1156234bef3c1c43b236db34","sha256:0da13a71f5153b4fdcbcf480bb816b5e721bb1c55b8b6eb117e6b26facc0a346"],"state_sha256":"59f39950e802540ad4172647799881fa1ef161468fc9e41e01774cd8364939d9"}