{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N6NAE4DBUAF36BPQ4SNX3QIO3P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"41ed0b1dd0520fb6bd89f35dc2a672d68d8eb38557c0de6dc5901adc5f9c590e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-22T13:52:50Z","title_canon_sha256":"14afb4df0275c25d7ebb6fff41e8c51f5b6ebff2e5e8e155dd6076a3c64fb9c2"},"schema_version":"1.0","source":{"id":"1809.08437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08437","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08437v1","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08437","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"N6NAE4DBUAF3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N6NAE4DBUAF36BPQ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N6NAE4DB","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:13ce43f75d79d2d4861b5302203f059d564b915b0a045826ae221e99ad633889","target":"graph","created_at":"2026-05-18T00:05:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Daniel Lokshtanov, Fahad Panolan, Geevarghese Philip, Joydeep Mukherjee, Pranabendu Misra, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-22T13:52:50Z","title":"A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08437","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b4c28c228ce63b3cd6b3f7a053b3581afce1ea643e02ac811abf94247f53ddf9","target":"record","created_at":"2026-05-18T00:05:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"41ed0b1dd0520fb6bd89f35dc2a672d68d8eb38557c0de6dc5901adc5f9c590e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-22T13:52:50Z","title_canon_sha256":"14afb4df0275c25d7ebb6fff41e8c51f5b6ebff2e5e8e155dd6076a3c64fb9c2"},"schema_version":"1.0","source":{"id":"1809.08437","kind":"arxiv","version":1}},"canonical_sha256":"6f9a027061a00bbf05f0e49b7dc10edbdd284983f18c934894a8bb6374133bc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f9a027061a00bbf05f0e49b7dc10edbdd284983f18c934894a8bb6374133bc4","first_computed_at":"2026-05-18T00:05:08.484841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:08.484841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7PR0QLfmXvFdKHcsKkX8c8ctwrRosXBw9emsSttVFgXKD1dG9HHYPrOSRRu6g5w7bDWNAPxp/U7F8tdfBv8nBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:08.485480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4c28c228ce63b3cd6b3f7a053b3581afce1ea643e02ac811abf94247f53ddf9","sha256:13ce43f75d79d2d4861b5302203f059d564b915b0a045826ae221e99ad633889"],"state_sha256":"cb06ea0ce88ac1c6e6e2e6e650af97a8cd581353ddcae5bb75c7e993366d990e"}