{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RTKZTPKXY37OOSSJI7RFJJU42C","short_pith_number":"pith:RTKZTPKX","schema_version":"1.0","canonical_sha256":"8cd599bd57c6fee74a4947e254a69cd0858659256e60a2949eaa00397bb175bd","source":{"kind":"arxiv","id":"1510.07676","version":1},"attestation_state":"computed","paper":{"title":"Faster Exact and Parameterized 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, Mithilesh Kumar","submitted_at":"2015-10-26T20:54:31Z","abstract_excerpt":"A tournament is a directed graph T such that every pair of vertices are connected by an arc. A feedback vertex set is a set S of vertices in T such that T - S is acyclic. In this article we consider the Feedback Vertex Set problem in tournaments. Here input is a tournament T and integer k, and the task is to determine whether T has a feedback vertex set of size at most k. We give a new algorithm for Feedback Vertex Set in Tournaments. The running time of our algorithm is upper bounded by O(1.618^k + n^{O(1)}) and by O(1.46^n). Thus our algorithm simultaneously improves over the fastest known p"},"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":"1510.07676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-26T20:54:31Z","cross_cats_sorted":[],"title_canon_sha256":"77756e87acb6701332c3dd08dad04c311d6371d97b0a4c3b0c8891ff7aeae626","abstract_canon_sha256":"426e836f1d6b82149d79b9f3eb400a131e98a7c102b5b2cdb9f08020cf72cf37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:12.906295Z","signature_b64":"kZzIv/NJr/ykYUpEpdYs7ItAR0nfxjp7zphCRI24BWn1T+DygRnu2YFUf+woqLOi1HB3th6ixiegtcbZQi8VAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cd599bd57c6fee74a4947e254a69cd0858659256e60a2949eaa00397bb175bd","last_reissued_at":"2026-05-18T01:29:12.905621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:12.905621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Exact and Parameterized 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, Mithilesh Kumar","submitted_at":"2015-10-26T20:54:31Z","abstract_excerpt":"A tournament is a directed graph T such that every pair of vertices are connected by an arc. A feedback vertex set is a set S of vertices in T such that T - S is acyclic. In this article we consider the Feedback Vertex Set problem in tournaments. Here input is a tournament T and integer k, and the task is to determine whether T has a feedback vertex set of size at most k. We give a new algorithm for Feedback Vertex Set in Tournaments. The running time of our algorithm is upper bounded by O(1.618^k + n^{O(1)}) and by O(1.46^n). Thus our algorithm simultaneously improves over the fastest known p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07676","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":"1510.07676","created_at":"2026-05-18T01:29:12.905720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07676v1","created_at":"2026-05-18T01:29:12.905720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07676","created_at":"2026-05-18T01:29:12.905720+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTKZTPKXY37O","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTKZTPKXY37OOSSJ","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTKZTPKX","created_at":"2026-05-18T12:29:39.896362+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/RTKZTPKXY37OOSSJI7RFJJU42C","json":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C.json","graph_json":"https://pith.science/api/pith-number/RTKZTPKXY37OOSSJI7RFJJU42C/graph.json","events_json":"https://pith.science/api/pith-number/RTKZTPKXY37OOSSJI7RFJJU42C/events.json","paper":"https://pith.science/paper/RTKZTPKX"},"agent_actions":{"view_html":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C","download_json":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C.json","view_paper":"https://pith.science/paper/RTKZTPKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07676&json=true","fetch_graph":"https://pith.science/api/pith-number/RTKZTPKXY37OOSSJI7RFJJU42C/graph.json","fetch_events":"https://pith.science/api/pith-number/RTKZTPKXY37OOSSJI7RFJJU42C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C/action/storage_attestation","attest_author":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C/action/author_attestation","sign_citation":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C/action/citation_signature","submit_replication":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C/action/replication_record"}},"created_at":"2026-05-18T01:29:12.905720+00:00","updated_at":"2026-05-18T01:29:12.905720+00:00"}