{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:42M33IRV2KDTAL3ECD7PBEC5WK","short_pith_number":"pith:42M33IRV","schema_version":"1.0","canonical_sha256":"e699bda235d287302f6410fef0905db2bd02edfcdccb41122c427ebcd7858c47","source":{"kind":"arxiv","id":"1609.04347","version":1},"attestation_state":"computed","paper":{"title":"A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh","submitted_at":"2016-09-14T17:03:19Z","abstract_excerpt":"In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph $D$ on $n$ vertices and $m$ edges, and an integer $k$. The objective is to determine whether there exists a set of at most $k$ vertices intersecting every directed cycle of $D$. Whether or not DFVS admits a fixed parameter tractable (FPT) algorithm was considered the most important open problem in parameterized complexity until Chen, Liu, Lu, O'Sullivan and Razgon [JACM 2008] answered the question in the affirmative. They gave an algorithm for the problem with running time $O(k!4^kk^4nm)$. Since then, no faster 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":"1609.04347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-14T17:03:19Z","cross_cats_sorted":[],"title_canon_sha256":"c30f3bb086d96597208e69500305f86f6f2b6b113565f48a291c7205d0c34378","abstract_canon_sha256":"fd12bd8d6596c617ceabbaec456812b8fb569a1bb81a554b932dec9a2654c996"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:38.190163Z","signature_b64":"c5m3pi1a7h8hpKTLn5Dlhsf3Mnq0D6H9EmGOGx0ZYMGmmZLtfMYFB3EUICYps9vxtc9nG9zbdDNZvVrgFAqLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e699bda235d287302f6410fef0905db2bd02edfcdccb41122c427ebcd7858c47","last_reissued_at":"2026-05-18T01:04:38.189472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:38.189472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh","submitted_at":"2016-09-14T17:03:19Z","abstract_excerpt":"In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph $D$ on $n$ vertices and $m$ edges, and an integer $k$. The objective is to determine whether there exists a set of at most $k$ vertices intersecting every directed cycle of $D$. Whether or not DFVS admits a fixed parameter tractable (FPT) algorithm was considered the most important open problem in parameterized complexity until Chen, Liu, Lu, O'Sullivan and Razgon [JACM 2008] answered the question in the affirmative. They gave an algorithm for the problem with running time $O(k!4^kk^4nm)$. Since then, no faster a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04347","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":"1609.04347","created_at":"2026-05-18T01:04:38.189581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.04347v1","created_at":"2026-05-18T01:04:38.189581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04347","created_at":"2026-05-18T01:04:38.189581+00:00"},{"alias_kind":"pith_short_12","alias_value":"42M33IRV2KDT","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"42M33IRV2KDTAL3E","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"42M33IRV","created_at":"2026-05-18T12:29:58.707656+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/42M33IRV2KDTAL3ECD7PBEC5WK","json":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK.json","graph_json":"https://pith.science/api/pith-number/42M33IRV2KDTAL3ECD7PBEC5WK/graph.json","events_json":"https://pith.science/api/pith-number/42M33IRV2KDTAL3ECD7PBEC5WK/events.json","paper":"https://pith.science/paper/42M33IRV"},"agent_actions":{"view_html":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK","download_json":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK.json","view_paper":"https://pith.science/paper/42M33IRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.04347&json=true","fetch_graph":"https://pith.science/api/pith-number/42M33IRV2KDTAL3ECD7PBEC5WK/graph.json","fetch_events":"https://pith.science/api/pith-number/42M33IRV2KDTAL3ECD7PBEC5WK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK/action/storage_attestation","attest_author":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK/action/author_attestation","sign_citation":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK/action/citation_signature","submit_replication":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK/action/replication_record"}},"created_at":"2026-05-18T01:04:38.189581+00:00","updated_at":"2026-05-18T01:04:38.189581+00:00"}