{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EDUAS6RPI2ALOQRGKLT34WEF63","short_pith_number":"pith:EDUAS6RP","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"},"canonical_sha256":"20e8097a2f4680b7422652e7be5885f6d2a5818b27c0f85de6ce26444906449b","source":{"kind":"arxiv","id":"1304.6189","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6189","created_at":"2026-05-18T03:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6189v2","created_at":"2026-05-18T03:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6189","created_at":"2026-05-18T03:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"EDUAS6RPI2AL","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EDUAS6RPI2ALOQRG","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EDUAS6RP","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EDUAS6RPI2ALOQRGKLT34WEF63","target":"record","payload":{"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"},"canonical_sha256":"20e8097a2f4680b7422652e7be5885f6d2a5818b27c0f85de6ce26444906449b","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"},"source_kind":"arxiv","source_id":"1304.6189","source_version":2,"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-18T03:11:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4XFPZbqtggHSCidsxCdFCfkPbb3uPg0wrsNPsDoev56RNneMxaPZ6c2phzeHCga/Eg643r3tsvCm+L6D/CVuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:16:58.611390Z"},"content_sha256":"e3e36fdecfae3935dc7350c7cd04134a5d8f949091a2ead54fa4edfd824149e4","schema_version":"1.0","event_id":"sha256:e3e36fdecfae3935dc7350c7cd04134a5d8f949091a2ead54fa4edfd824149e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EDUAS6RPI2ALOQRGKLT34WEF63","target":"graph","payload":{"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"},"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-18T03:11:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Euxe0cs2lWCwatbNLBRc0VBXJwZuBhIlqf6NCNVBhbFpKXWlBuk/+EQOGKdYSLZlHINM6UNOQ4wnKCL1V9WUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:16:58.611973Z"},"content_sha256":"d631013a3ffdfab44b99fc98212486706a9cb920c3b56cb8076301244ce46443","schema_version":"1.0","event_id":"sha256:d631013a3ffdfab44b99fc98212486706a9cb920c3b56cb8076301244ce46443"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63/bundle.json","state_url":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDUAS6RPI2ALOQRGKLT34WEF63/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-25T13:16:58Z","links":{"resolver":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63","bundle":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63/bundle.json","state":"https://pith.science/pith/EDUAS6RPI2ALOQRGKLT34WEF63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDUAS6RPI2ALOQRGKLT34WEF63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EDUAS6RPI2ALOQRGKLT34WEF63","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":"73cf99ebd43e2be5dfc04bed6ba5620e32b957c5282f6ae43a840543e7a66bb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T07:38:34Z","title_canon_sha256":"485472b2d6de0437aa2f70b3ad1862fbf46ae2e3d8e05f47a787d8fc94d34e35"},"schema_version":"1.0","source":{"id":"1304.6189","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6189","created_at":"2026-05-18T03:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6189v2","created_at":"2026-05-18T03:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6189","created_at":"2026-05-18T03:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"EDUAS6RPI2AL","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EDUAS6RPI2ALOQRG","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EDUAS6RP","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:d631013a3ffdfab44b99fc98212486706a9cb920c3b56cb8076301244ce46443","target":"graph","created_at":"2026-05-18T03:11:46Z","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":"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","authors_text":"Fedor V. Fomin, Janne H. Korhonen, Petr A. Golovach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T07:38:34Z","title":"On the parameterized complexity of cutting a few vertices from a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6189","kind":"arxiv","version":2},"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:e3e36fdecfae3935dc7350c7cd04134a5d8f949091a2ead54fa4edfd824149e4","target":"record","created_at":"2026-05-18T03:11:46Z","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":"73cf99ebd43e2be5dfc04bed6ba5620e32b957c5282f6ae43a840543e7a66bb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T07:38:34Z","title_canon_sha256":"485472b2d6de0437aa2f70b3ad1862fbf46ae2e3d8e05f47a787d8fc94d34e35"},"schema_version":"1.0","source":{"id":"1304.6189","kind":"arxiv","version":2}},"canonical_sha256":"20e8097a2f4680b7422652e7be5885f6d2a5818b27c0f85de6ce26444906449b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20e8097a2f4680b7422652e7be5885f6d2a5818b27c0f85de6ce26444906449b","first_computed_at":"2026-05-18T03:11:46.715668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:46.715668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yHJPTIi9zxJj7ALwa8ONKN58IYnKOQ6poNSI3CYrJh291Uy+WJFVFSwbrtwCmUMld/czld6TFvHAcneuyhQsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:46.716268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6189","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3e36fdecfae3935dc7350c7cd04134a5d8f949091a2ead54fa4edfd824149e4","sha256:d631013a3ffdfab44b99fc98212486706a9cb920c3b56cb8076301244ce46443"],"state_sha256":"6a6bf35bdd48a62841c8392ca184027543c52de0ff20648587eb64d86133559f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wllVeKbY9sWp/Vv/qNCPubRT1ZKKDLztEcTTVzQiaoem0Wkj7dUy90y2F0bIm6+4mgKz/gnC0zsZqLryMZCWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:16:58.615015Z","bundle_sha256":"54321656a8e62e8fea5f06c3ae6fe0d531e02228dca0f181044f238964eb5a7e"}}