{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N6NAE4DBUAF36BPQ4SNX3QIO3P","short_pith_number":"pith:N6NAE4DB","schema_version":"1.0","canonical_sha256":"6f9a027061a00bbf05f0e49b7dc10edbdd284983f18c934894a8bb6374133bc4","source":{"kind":"arxiv","id":"1809.08437","version":1},"attestation_state":"computed","paper":{"title":"A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Geevarghese Philip, Joydeep Mukherjee, Pranabendu Misra, Saket Saurabh","submitted_at":"2018-09-22T13:52:50Z","abstract_excerpt":"A {\\em tournament} is a directed graph $T$ such that every pair of vertices is connected by an arc. A {\\em feedback vertex set} is a set $S$ of vertices in $T$ such that $T - S$ is acyclic. We consider the {\\sc Feedback Vertex Set} problem in tournaments. Here the input is a tournament $T$ and a weight function $w : V(T) \\rightarrow \\mathbb{N}$ and the task is to find a feedback vertex set $S$ in $T$ minimizing $w(S) = \\sum_{v \\in S} w(v)$. We give the first polynomial time factor $2$ approximation algorithm for this problem. Assuming the Unique Games conjecture, this is the best possible appr"},"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":"1809.08437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-22T13:52:50Z","cross_cats_sorted":[],"title_canon_sha256":"14afb4df0275c25d7ebb6fff41e8c51f5b6ebff2e5e8e155dd6076a3c64fb9c2","abstract_canon_sha256":"41ed0b1dd0520fb6bd89f35dc2a672d68d8eb38557c0de6dc5901adc5f9c590e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:08.485480Z","signature_b64":"7PR0QLfmXvFdKHcsKkX8c8ctwrRosXBw9emsSttVFgXKD1dG9HHYPrOSRRu6g5w7bDWNAPxp/U7F8tdfBv8nBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f9a027061a00bbf05f0e49b7dc10edbdd284983f18c934894a8bb6374133bc4","last_reissued_at":"2026-05-18T00:05:08.484841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:08.484841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Geevarghese Philip, Joydeep Mukherjee, Pranabendu Misra, Saket Saurabh","submitted_at":"2018-09-22T13:52:50Z","abstract_excerpt":"A {\\em tournament} is a directed graph $T$ such that every pair of vertices is connected by an arc. A {\\em feedback vertex set} is a set $S$ of vertices in $T$ such that $T - S$ is acyclic. We consider the {\\sc Feedback Vertex Set} problem in tournaments. Here the input is a tournament $T$ and a weight function $w : V(T) \\rightarrow \\mathbb{N}$ and the task is to find a feedback vertex set $S$ in $T$ minimizing $w(S) = \\sum_{v \\in S} w(v)$. We give the first polynomial time factor $2$ approximation algorithm for this problem. Assuming the Unique Games conjecture, this is the best possible appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08437","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":"1809.08437","created_at":"2026-05-18T00:05:08.484931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08437v1","created_at":"2026-05-18T00:05:08.484931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08437","created_at":"2026-05-18T00:05:08.484931+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6NAE4DBUAF3","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6NAE4DBUAF36BPQ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6NAE4DB","created_at":"2026-05-18T12:32:40.477152+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/N6NAE4DBUAF36BPQ4SNX3QIO3P","json":"https://pith.science/pith/N6NAE4DBUAF36BPQ4SNX3QIO3P.json","graph_json":"https://pith.science/api/pith-number/N6NAE4DBUAF36BPQ4SNX3QIO3P/graph.json","events_json":"https://pith.science/api/pith-number/N6NAE4DBUAF36BPQ4SNX3QIO3P/events.json","paper":"https://pith.science/paper/N6NAE4DB"},"agent_actions":{"view_html":"https://pith.science/pith/N6NAE4DBUAF36BPQ4SNX3QIO3P","download_json":"https://pith.science/pith/N6NAE4DBUAF36BPQ4SNX3QIO3P.json","view_paper":"https://pith.science/paper/N6NAE4DB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08437&json=true","fetch_graph":"https://pith.science/api/pith-number/N6NAE4DBUAF36BPQ4SNX3QIO3P/graph.json","fetch_events":"https://pith.science/api/pith-number/N6NAE4DBUAF36BPQ4SNX3QIO3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6NAE4DBUAF36BPQ4SNX3QIO3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6NAE4DBUAF36BPQ4SNX3QIO3P/action/storage_attestation","attest_author":"https://pith.science/pith/N6NAE4DBUAF36BPQ4SNX3QIO3P/action/author_attestation","sign_citation":"https://pith.science/pith/N6NAE4DBUAF36BPQ4SNX3QIO3P/action/citation_signature","submit_replication":"https://pith.science/pith/N6NAE4DBUAF36BPQ4SNX3QIO3P/action/replication_record"}},"created_at":"2026-05-18T00:05:08.484931+00:00","updated_at":"2026-05-18T00:05:08.484931+00:00"}