{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4SM3LFBENBI3YNYTGE5SSPEYWE","short_pith_number":"pith:4SM3LFBE","schema_version":"1.0","canonical_sha256":"e499b594246851bc3713313b293c98b13c49905b29026ea42fb70de7e5a8f02f","source":{"kind":"arxiv","id":"1112.5359","version":1},"attestation_state":"computed","paper":{"title":"Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","q-bio.QM"],"primary_cat":"math.CO","authors_text":"Celine Scornavacca, Leen Stougie, Leo van Iersel, Nela Lekic, Simone Linz, Steven Kelk","submitted_at":"2011-12-22T15:58:01Z","abstract_excerpt":"We show that the problem of computing the hybridization number of two rooted binary phylogenetic trees on the same set of taxa X has a constant factor polynomial-time approximation if and only if the problem of computing a minimum-size feedback vertex set in a directed graph (DFVS) has a constant factor polynomial-time approximation. The latter problem, which asks for a minimum number of vertices to be removed from a directed graph to transform it into a directed acyclic graph, is one of the problems in Karp's seminal 1972 list of 21 NP-complete problems. However, despite considerable attentio"},"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":"1112.5359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-22T15:58:01Z","cross_cats_sorted":["cs.DS","q-bio.QM"],"title_canon_sha256":"360f313af4b2e726de76fb567efcdeab48880bd5ba5a75a1505b9118a27bb698","abstract_canon_sha256":"7636ed5133d227a10a1db1be954b4b6398293aa9ed179bf219f495d47ee19e8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:47.476732Z","signature_b64":"5ibxZLeKTgMt96hXKpJBkZMBDKF2fIXpsS4IuvlKJ9ANwZDMLYx/LUhpnQeLS5+WoLjFAqmrP563axM4fPepDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e499b594246851bc3713313b293c98b13c49905b29026ea42fb70de7e5a8f02f","last_reissued_at":"2026-05-18T04:05:47.476356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:47.476356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","q-bio.QM"],"primary_cat":"math.CO","authors_text":"Celine Scornavacca, Leen Stougie, Leo van Iersel, Nela Lekic, Simone Linz, Steven Kelk","submitted_at":"2011-12-22T15:58:01Z","abstract_excerpt":"We show that the problem of computing the hybridization number of two rooted binary phylogenetic trees on the same set of taxa X has a constant factor polynomial-time approximation if and only if the problem of computing a minimum-size feedback vertex set in a directed graph (DFVS) has a constant factor polynomial-time approximation. The latter problem, which asks for a minimum number of vertices to be removed from a directed graph to transform it into a directed acyclic graph, is one of the problems in Karp's seminal 1972 list of 21 NP-complete problems. However, despite considerable attentio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5359","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":"1112.5359","created_at":"2026-05-18T04:05:47.476416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5359v1","created_at":"2026-05-18T04:05:47.476416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5359","created_at":"2026-05-18T04:05:47.476416+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SM3LFBENBI3","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SM3LFBENBI3YNYT","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SM3LFBE","created_at":"2026-05-18T12:26:20.644004+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/4SM3LFBENBI3YNYTGE5SSPEYWE","json":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE.json","graph_json":"https://pith.science/api/pith-number/4SM3LFBENBI3YNYTGE5SSPEYWE/graph.json","events_json":"https://pith.science/api/pith-number/4SM3LFBENBI3YNYTGE5SSPEYWE/events.json","paper":"https://pith.science/paper/4SM3LFBE"},"agent_actions":{"view_html":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE","download_json":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE.json","view_paper":"https://pith.science/paper/4SM3LFBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5359&json=true","fetch_graph":"https://pith.science/api/pith-number/4SM3LFBENBI3YNYTGE5SSPEYWE/graph.json","fetch_events":"https://pith.science/api/pith-number/4SM3LFBENBI3YNYTGE5SSPEYWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/action/storage_attestation","attest_author":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/action/author_attestation","sign_citation":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/action/citation_signature","submit_replication":"https://pith.science/pith/4SM3LFBENBI3YNYTGE5SSPEYWE/action/replication_record"}},"created_at":"2026-05-18T04:05:47.476416+00:00","updated_at":"2026-05-18T04:05:47.476416+00:00"}