{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ANQM2E5J66NYWM2SXDLU5UJJRD","short_pith_number":"pith:ANQM2E5J","schema_version":"1.0","canonical_sha256":"0360cd13a9f79b8b3352b8d74ed12988e7002fb1b4c019ea28799d2d869e3c99","source":{"kind":"arxiv","id":"1512.02510","version":1},"attestation_state":"computed","paper":{"title":"A randomized polynomial kernel for Subset Feedback Vertex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Eva-Maria C. Hols, Stefan Kratsch","submitted_at":"2015-12-08T15:32:45Z","abstract_excerpt":"The Subset Feedback Vertex Set problem generalizes the classical Feedback Vertex Set problem and asks, for a given undirected graph $G=(V,E)$, a set $S \\subseteq V$, and an integer $k$, whether there exists a set $X$ of at most $k$ vertices such that no cycle in $G-X$ contains a vertex of $S$. It was independently shown by Cygan et al. (ICALP '11, SIDMA '13) and Kawarabayashi and Kobayashi (JCTB '12) that Subset Feedback Vertex Set is fixed-parameter tractable for parameter $k$. Cygan et al. asked whether the problem also admits a polynomial kernelization.\n  We answer the question of Cygan et "},"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":"1512.02510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-08T15:32:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5b480ce66c7514751b2c0630184fa1c7c52811f646dac364d354b0fce6ee7ecf","abstract_canon_sha256":"11eabeb73b6c9b25ce954c8f199cb9a9e8e58aca15e84330a90b422cb9c22f7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:44.534960Z","signature_b64":"jaxhV4LA8pk+1OwKxWHqTGfEQsEZh2Kc3n1jXpiAeCpiEKAld5KULN7EBfimb16r6tUz/TJzHCo1NPEL/uRpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0360cd13a9f79b8b3352b8d74ed12988e7002fb1b4c019ea28799d2d869e3c99","last_reissued_at":"2026-05-18T01:24:44.534340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:44.534340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A randomized polynomial kernel for Subset Feedback Vertex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Eva-Maria C. Hols, Stefan Kratsch","submitted_at":"2015-12-08T15:32:45Z","abstract_excerpt":"The Subset Feedback Vertex Set problem generalizes the classical Feedback Vertex Set problem and asks, for a given undirected graph $G=(V,E)$, a set $S \\subseteq V$, and an integer $k$, whether there exists a set $X$ of at most $k$ vertices such that no cycle in $G-X$ contains a vertex of $S$. It was independently shown by Cygan et al. (ICALP '11, SIDMA '13) and Kawarabayashi and Kobayashi (JCTB '12) that Subset Feedback Vertex Set is fixed-parameter tractable for parameter $k$. Cygan et al. asked whether the problem also admits a polynomial kernelization.\n  We answer the question of Cygan et "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02510","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":"1512.02510","created_at":"2026-05-18T01:24:44.534425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02510v1","created_at":"2026-05-18T01:24:44.534425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02510","created_at":"2026-05-18T01:24:44.534425+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANQM2E5J66NY","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANQM2E5J66NYWM2S","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANQM2E5J","created_at":"2026-05-18T12:29:10.953037+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/ANQM2E5J66NYWM2SXDLU5UJJRD","json":"https://pith.science/pith/ANQM2E5J66NYWM2SXDLU5UJJRD.json","graph_json":"https://pith.science/api/pith-number/ANQM2E5J66NYWM2SXDLU5UJJRD/graph.json","events_json":"https://pith.science/api/pith-number/ANQM2E5J66NYWM2SXDLU5UJJRD/events.json","paper":"https://pith.science/paper/ANQM2E5J"},"agent_actions":{"view_html":"https://pith.science/pith/ANQM2E5J66NYWM2SXDLU5UJJRD","download_json":"https://pith.science/pith/ANQM2E5J66NYWM2SXDLU5UJJRD.json","view_paper":"https://pith.science/paper/ANQM2E5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02510&json=true","fetch_graph":"https://pith.science/api/pith-number/ANQM2E5J66NYWM2SXDLU5UJJRD/graph.json","fetch_events":"https://pith.science/api/pith-number/ANQM2E5J66NYWM2SXDLU5UJJRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANQM2E5J66NYWM2SXDLU5UJJRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANQM2E5J66NYWM2SXDLU5UJJRD/action/storage_attestation","attest_author":"https://pith.science/pith/ANQM2E5J66NYWM2SXDLU5UJJRD/action/author_attestation","sign_citation":"https://pith.science/pith/ANQM2E5J66NYWM2SXDLU5UJJRD/action/citation_signature","submit_replication":"https://pith.science/pith/ANQM2E5J66NYWM2SXDLU5UJJRD/action/replication_record"}},"created_at":"2026-05-18T01:24:44.534425+00:00","updated_at":"2026-05-18T01:24:44.534425+00:00"}