{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z3GWLC2KQJ77CLMTIGB65IGVLO","short_pith_number":"pith:Z3GWLC2K","schema_version":"1.0","canonical_sha256":"cecd658b4a827ff12d934183eea0d55bb8737e6fbcff8c44520a411d454737e6","source":{"kind":"arxiv","id":"1704.04249","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Complexity and Approximability of Directed Odd Cycle Transversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Meirav Zehavi, M. S. Ramanujan, Saket Saurabh","submitted_at":"2017-04-13T18:27:04Z","abstract_excerpt":"A directed odd cycle transversal of a directed graph (digraph) $D$ is a vertex set $S$ that intersects every odd directed cycle of $D$. In the Directed Odd Cycle Transversal (DOCT) problem, the input consists of a digraph $D$ and an integer $k$. The objective is to determine whether there exists a directed odd cycle transversal of $D$ of size at most $k$.\n  In this paper, we settle the parameterized complexity of DOCT when parameterized by the solution size $k$ by showing that DOCT does not admit an algorithm with running time $f(k)n^{O(1)}$ unless FPT = W[1]. On the positive side, we give a f"},"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":"1704.04249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-13T18:27:04Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"a20587d3c33726454608e7c659dcac50944ef402f555a29aa691900c089c86ba","abstract_canon_sha256":"c6e13ea414314bb84ba63720c35002904e597926eb503f4454e6a01176ec740d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:22.050570Z","signature_b64":"C5NS7IZfX61S0rncKIyMD/u5x0eBU2j++aqGvEXnVPeiThgodrYSId0UJTlgznsaI8DEEawZ2cz8cbhtbZrCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cecd658b4a827ff12d934183eea0d55bb8737e6fbcff8c44520a411d454737e6","last_reissued_at":"2026-05-18T00:46:22.050208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:22.050208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity and Approximability of Directed Odd Cycle Transversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Meirav Zehavi, M. S. Ramanujan, Saket Saurabh","submitted_at":"2017-04-13T18:27:04Z","abstract_excerpt":"A directed odd cycle transversal of a directed graph (digraph) $D$ is a vertex set $S$ that intersects every odd directed cycle of $D$. In the Directed Odd Cycle Transversal (DOCT) problem, the input consists of a digraph $D$ and an integer $k$. The objective is to determine whether there exists a directed odd cycle transversal of $D$ of size at most $k$.\n  In this paper, we settle the parameterized complexity of DOCT when parameterized by the solution size $k$ by showing that DOCT does not admit an algorithm with running time $f(k)n^{O(1)}$ unless FPT = W[1]. On the positive side, we give a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04249","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":"1704.04249","created_at":"2026-05-18T00:46:22.050261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04249v1","created_at":"2026-05-18T00:46:22.050261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04249","created_at":"2026-05-18T00:46:22.050261+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3GWLC2KQJ77","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3GWLC2KQJ77CLMT","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3GWLC2K","created_at":"2026-05-18T12:31:59.375834+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/Z3GWLC2KQJ77CLMTIGB65IGVLO","json":"https://pith.science/pith/Z3GWLC2KQJ77CLMTIGB65IGVLO.json","graph_json":"https://pith.science/api/pith-number/Z3GWLC2KQJ77CLMTIGB65IGVLO/graph.json","events_json":"https://pith.science/api/pith-number/Z3GWLC2KQJ77CLMTIGB65IGVLO/events.json","paper":"https://pith.science/paper/Z3GWLC2K"},"agent_actions":{"view_html":"https://pith.science/pith/Z3GWLC2KQJ77CLMTIGB65IGVLO","download_json":"https://pith.science/pith/Z3GWLC2KQJ77CLMTIGB65IGVLO.json","view_paper":"https://pith.science/paper/Z3GWLC2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04249&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3GWLC2KQJ77CLMTIGB65IGVLO/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3GWLC2KQJ77CLMTIGB65IGVLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3GWLC2KQJ77CLMTIGB65IGVLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3GWLC2KQJ77CLMTIGB65IGVLO/action/storage_attestation","attest_author":"https://pith.science/pith/Z3GWLC2KQJ77CLMTIGB65IGVLO/action/author_attestation","sign_citation":"https://pith.science/pith/Z3GWLC2KQJ77CLMTIGB65IGVLO/action/citation_signature","submit_replication":"https://pith.science/pith/Z3GWLC2KQJ77CLMTIGB65IGVLO/action/replication_record"}},"created_at":"2026-05-18T00:46:22.050261+00:00","updated_at":"2026-05-18T00:46:22.050261+00:00"}