{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Q2MWPPGDPCY3IQNOWIFMHUGZNL","short_pith_number":"pith:Q2MWPPGD","schema_version":"1.0","canonical_sha256":"869967bcc378b1b441aeb20ac3d0d96afc93e854428c2d6c779d12da7fdf277d","source":{"kind":"arxiv","id":"1205.1271","version":3},"attestation_state":"computed","paper":{"title":"Directed 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":"D\\'aniel Marx, Marek Cygan, MohammadTaghi Hajiaghayi, Rajesh Chitnis","submitted_at":"2012-05-07T02:59:39Z","abstract_excerpt":"Given a graph $G$ and an integer $k$, the Feedback Vertex Set (FVS) problem asks if there is a vertex set $T$ of size at most $k$ that hits all cycles in the graph. The fixed-parameter tractability status of FVS in directed graphs was a long-standing open problem until Chen et al. (STOC '08) showed that it is FPT by giving a $4^{k}k!n^{O(1)}$ time algorithm. In the subset versions of this problems, we are given an additional subset $S$ of vertices (resp., edges) and we want to hit all cycles passing through a vertex of $S$ (resp. an edge of $S$). Recently, the Subset Feedback Vertex Set in und"},"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":"1205.1271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-07T02:59:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"eda401fefb6da14cf9f342d79f8c9b7886cf963f9aede32884d625e47cc65075","abstract_canon_sha256":"b05f5d970dbfa70200fa635df11b23883fb3eef45e4690e510724fcec1f3a85e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:22.782801Z","signature_b64":"wAlK0YxjvqCrraRGI7oy2KkdEoFD6wy5bJXJh+9naIsN/nCZioCyM3dKRojF2kN5xDx/wPkDJAxUJ6wgudMqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"869967bcc378b1b441aeb20ac3d0d96afc93e854428c2d6c779d12da7fdf277d","last_reissued_at":"2026-05-18T02:32:22.782409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:22.782409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed 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":"D\\'aniel Marx, Marek Cygan, MohammadTaghi Hajiaghayi, Rajesh Chitnis","submitted_at":"2012-05-07T02:59:39Z","abstract_excerpt":"Given a graph $G$ and an integer $k$, the Feedback Vertex Set (FVS) problem asks if there is a vertex set $T$ of size at most $k$ that hits all cycles in the graph. The fixed-parameter tractability status of FVS in directed graphs was a long-standing open problem until Chen et al. (STOC '08) showed that it is FPT by giving a $4^{k}k!n^{O(1)}$ time algorithm. In the subset versions of this problems, we are given an additional subset $S$ of vertices (resp., edges) and we want to hit all cycles passing through a vertex of $S$ (resp. an edge of $S$). Recently, the Subset Feedback Vertex Set in und"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1271","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":"1205.1271","created_at":"2026-05-18T02:32:22.782475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1271v3","created_at":"2026-05-18T02:32:22.782475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1271","created_at":"2026-05-18T02:32:22.782475+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2MWPPGDPCY3","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2MWPPGDPCY3IQNO","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2MWPPGD","created_at":"2026-05-18T12:27:18.751474+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/Q2MWPPGDPCY3IQNOWIFMHUGZNL","json":"https://pith.science/pith/Q2MWPPGDPCY3IQNOWIFMHUGZNL.json","graph_json":"https://pith.science/api/pith-number/Q2MWPPGDPCY3IQNOWIFMHUGZNL/graph.json","events_json":"https://pith.science/api/pith-number/Q2MWPPGDPCY3IQNOWIFMHUGZNL/events.json","paper":"https://pith.science/paper/Q2MWPPGD"},"agent_actions":{"view_html":"https://pith.science/pith/Q2MWPPGDPCY3IQNOWIFMHUGZNL","download_json":"https://pith.science/pith/Q2MWPPGDPCY3IQNOWIFMHUGZNL.json","view_paper":"https://pith.science/paper/Q2MWPPGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1271&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2MWPPGDPCY3IQNOWIFMHUGZNL/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2MWPPGDPCY3IQNOWIFMHUGZNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2MWPPGDPCY3IQNOWIFMHUGZNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2MWPPGDPCY3IQNOWIFMHUGZNL/action/storage_attestation","attest_author":"https://pith.science/pith/Q2MWPPGDPCY3IQNOWIFMHUGZNL/action/author_attestation","sign_citation":"https://pith.science/pith/Q2MWPPGDPCY3IQNOWIFMHUGZNL/action/citation_signature","submit_replication":"https://pith.science/pith/Q2MWPPGDPCY3IQNOWIFMHUGZNL/action/replication_record"}},"created_at":"2026-05-18T02:32:22.782475+00:00","updated_at":"2026-05-18T02:32:22.782475+00:00"}