{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:I6AFU4K3OJS36D2HLLDSYXJDWO","short_pith_number":"pith:I6AFU4K3","schema_version":"1.0","canonical_sha256":"47805a715b7265bf0f475ac72c5d23b3bad237d09901d09d129a258b1b702497","source":{"kind":"arxiv","id":"1004.2972","version":3},"attestation_state":"computed","paper":{"title":"Subset feedback vertex set is fixed parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Marek Cygan, Michal Pilipczuk","submitted_at":"2010-04-17T17:19:47Z","abstract_excerpt":"The classical Feedback Vertex Set problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. Feedback Vertex Set has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fixed-parameter algorithms have been a rich source of ideas in the field.\n  In this paper we consider a more general and difficult version of the problem, named Subset Feedback Vertex Set (SUBSET-FVS in short) where an instance comes additionally with a set S ? V of vertices, and we ask for a set of a"},"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":"1004.2972","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-17T17:19:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"467914be5e0169afc84a2bf364cd056478df0b5abfe76b535baf70d4787df970","abstract_canon_sha256":"605eee1d8678a27dd29a356fb9b53e128a88403f89411405ce9a5044c19dcbf7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:32.259839Z","signature_b64":"cI3Fx/U0tWtvXPRNNRQOjTi9G+18ml+sOAQhmliod8Fl3aZgDL87H5oPi7XctO4kIdTQzOvEPXIGVi26GH9GAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47805a715b7265bf0f475ac72c5d23b3bad237d09901d09d129a258b1b702497","last_reissued_at":"2026-05-18T04:16:32.259487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:32.259487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subset feedback vertex set is fixed parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Marek Cygan, Michal Pilipczuk","submitted_at":"2010-04-17T17:19:47Z","abstract_excerpt":"The classical Feedback Vertex Set problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. Feedback Vertex Set has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fixed-parameter algorithms have been a rich source of ideas in the field.\n  In this paper we consider a more general and difficult version of the problem, named Subset Feedback Vertex Set (SUBSET-FVS in short) where an instance comes additionally with a set S ? V of vertices, and we ask for a set of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2972","kind":"arxiv","version":3},"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":"1004.2972","created_at":"2026-05-18T04:16:32.259541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.2972v3","created_at":"2026-05-18T04:16:32.259541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2972","created_at":"2026-05-18T04:16:32.259541+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6AFU4K3OJS3","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6AFU4K3OJS36D2H","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6AFU4K3","created_at":"2026-05-18T12:26:07.630475+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/I6AFU4K3OJS36D2HLLDSYXJDWO","json":"https://pith.science/pith/I6AFU4K3OJS36D2HLLDSYXJDWO.json","graph_json":"https://pith.science/api/pith-number/I6AFU4K3OJS36D2HLLDSYXJDWO/graph.json","events_json":"https://pith.science/api/pith-number/I6AFU4K3OJS36D2HLLDSYXJDWO/events.json","paper":"https://pith.science/paper/I6AFU4K3"},"agent_actions":{"view_html":"https://pith.science/pith/I6AFU4K3OJS36D2HLLDSYXJDWO","download_json":"https://pith.science/pith/I6AFU4K3OJS36D2HLLDSYXJDWO.json","view_paper":"https://pith.science/paper/I6AFU4K3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.2972&json=true","fetch_graph":"https://pith.science/api/pith-number/I6AFU4K3OJS36D2HLLDSYXJDWO/graph.json","fetch_events":"https://pith.science/api/pith-number/I6AFU4K3OJS36D2HLLDSYXJDWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6AFU4K3OJS36D2HLLDSYXJDWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6AFU4K3OJS36D2HLLDSYXJDWO/action/storage_attestation","attest_author":"https://pith.science/pith/I6AFU4K3OJS36D2HLLDSYXJDWO/action/author_attestation","sign_citation":"https://pith.science/pith/I6AFU4K3OJS36D2HLLDSYXJDWO/action/citation_signature","submit_replication":"https://pith.science/pith/I6AFU4K3OJS36D2HLLDSYXJDWO/action/replication_record"}},"created_at":"2026-05-18T04:16:32.259541+00:00","updated_at":"2026-05-18T04:16:32.259541+00:00"}