{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:H2O35G6ZRMSFXMMCUSBVLD2OHP","short_pith_number":"pith:H2O35G6Z","schema_version":"1.0","canonical_sha256":"3e9dbe9bd98b245bb182a483558f4e3bcffa5b30d68fc5396d610ba8ca650483","source":{"kind":"arxiv","id":"1511.01137","version":1},"attestation_state":"computed","paper":{"title":"A 7/3-Approximation for Feedback Vertex Sets in Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o A. V\\'egh, Matthias Mnich, Virginia Vassilevska Williams","submitted_at":"2015-11-03T22:09:46Z","abstract_excerpt":"We consider the minimum-weight feedback vertex set problem in tournaments: given a tournament with non-negative vertex weights, remove a minimum-weight set of vertices that intersects all cycles. This problem is $\\mathsf{NP}$-hard to solve exactly, and Unique Games-hard to approximate by a factor better than 2. We present the first $7/3$ approximation algorithm for this problem, improving on the previously best known ratio $5/2$ given by Cai et al. [FOCS 1998, SICOMP 2001]."},"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":"1511.01137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T22:09:46Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c359c5df42675f2b6ff1f784559122c8322477e216a9fb15dcc4154cbaf8ff40","abstract_canon_sha256":"79e1a53fefe4b0179a792eaf5563d77f0f7bf7895e4b44dc9758cf64e0011455"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:47.986476Z","signature_b64":"fb5fK9Fc6Jx01PO8V/c7TKMbD4wKoA5XSWMJgr9mQ1qUUg+TGlAmvOeIsZlyiC4KIQ5fsV9xWHZMbJnOPv4gDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e9dbe9bd98b245bb182a483558f4e3bcffa5b30d68fc5396d610ba8ca650483","last_reissued_at":"2026-05-18T01:27:47.985844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:47.985844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 7/3-Approximation for Feedback Vertex Sets in Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o A. V\\'egh, Matthias Mnich, Virginia Vassilevska Williams","submitted_at":"2015-11-03T22:09:46Z","abstract_excerpt":"We consider the minimum-weight feedback vertex set problem in tournaments: given a tournament with non-negative vertex weights, remove a minimum-weight set of vertices that intersects all cycles. This problem is $\\mathsf{NP}$-hard to solve exactly, and Unique Games-hard to approximate by a factor better than 2. We present the first $7/3$ approximation algorithm for this problem, improving on the previously best known ratio $5/2$ given by Cai et al. [FOCS 1998, SICOMP 2001]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01137","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":"1511.01137","created_at":"2026-05-18T01:27:47.985937+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01137v1","created_at":"2026-05-18T01:27:47.985937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01137","created_at":"2026-05-18T01:27:47.985937+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2O35G6ZRMSF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2O35G6ZRMSFXMMC","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2O35G6Z","created_at":"2026-05-18T12:29:22.688609+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/H2O35G6ZRMSFXMMCUSBVLD2OHP","json":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP.json","graph_json":"https://pith.science/api/pith-number/H2O35G6ZRMSFXMMCUSBVLD2OHP/graph.json","events_json":"https://pith.science/api/pith-number/H2O35G6ZRMSFXMMCUSBVLD2OHP/events.json","paper":"https://pith.science/paper/H2O35G6Z"},"agent_actions":{"view_html":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP","download_json":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP.json","view_paper":"https://pith.science/paper/H2O35G6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01137&json=true","fetch_graph":"https://pith.science/api/pith-number/H2O35G6ZRMSFXMMCUSBVLD2OHP/graph.json","fetch_events":"https://pith.science/api/pith-number/H2O35G6ZRMSFXMMCUSBVLD2OHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/action/storage_attestation","attest_author":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/action/author_attestation","sign_citation":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/action/citation_signature","submit_replication":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/action/replication_record"}},"created_at":"2026-05-18T01:27:47.985937+00:00","updated_at":"2026-05-18T01:27:47.985937+00:00"}