{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OQK73ENIDD7E2HRFPBAW4KJODJ","short_pith_number":"pith:OQK73ENI","schema_version":"1.0","canonical_sha256":"7415fd91a818fe4d1e2578416e292e1a59bf35d9802da8ff6727d79bfc6f3e85","source":{"kind":"arxiv","id":"1207.7034","version":2},"attestation_state":"computed","paper":{"title":"Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"q-bio.PE","authors_text":"Celine Scornavacca, Steven Kelk","submitted_at":"2012-07-30T18:41:21Z","abstract_excerpt":"It has remained an open question for some time whether, given a set of not necessarily binary (i.e. \"nonbinary\") trees T on a set of taxa X, it is possible to determine in time f(r).poly(m) whether there exists a phylogenetic network that displays all the trees in T, where r refers to the reticulation number of the network and m=|X|+|T|. Here we show that this holds if one or both of the following conditions holds: (1) |T| is bounded by a function of r; (2) the maximum degree of the nodes in T is bounded by a function of r. These sufficient conditions absorb and significantly extend known spec"},"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":"1207.7034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2012-07-30T18:41:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d5a451ea8e963805a08b8cfd53909c1c870a8ba4ecfbd6e42fad932f3f7da84e","abstract_canon_sha256":"c597ba71723272d4c9b9937b0e2067ea993639b1c77cbf6b73bc893c00b80429"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:34.521108Z","signature_b64":"yvtQzMgplZSK2ajBvk2OvSw0ROAQ3TtNV/uEjng6h85kDOMg1dmOQ1SE5ygU40CI7e9nyb2ZaSVycoJhc9h9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7415fd91a818fe4d1e2578416e292e1a59bf35d9802da8ff6727d79bfc6f3e85","last_reissued_at":"2026-05-18T03:49:34.520582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:34.520582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"q-bio.PE","authors_text":"Celine Scornavacca, Steven Kelk","submitted_at":"2012-07-30T18:41:21Z","abstract_excerpt":"It has remained an open question for some time whether, given a set of not necessarily binary (i.e. \"nonbinary\") trees T on a set of taxa X, it is possible to determine in time f(r).poly(m) whether there exists a phylogenetic network that displays all the trees in T, where r refers to the reticulation number of the network and m=|X|+|T|. Here we show that this holds if one or both of the following conditions holds: (1) |T| is bounded by a function of r; (2) the maximum degree of the nodes in T is bounded by a function of r. These sufficient conditions absorb and significantly extend known spec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7034","kind":"arxiv","version":2},"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":"1207.7034","created_at":"2026-05-18T03:49:34.520664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.7034v2","created_at":"2026-05-18T03:49:34.520664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7034","created_at":"2026-05-18T03:49:34.520664+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQK73ENIDD7E","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQK73ENIDD7E2HRF","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQK73ENI","created_at":"2026-05-18T12:27:16.716162+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/OQK73ENIDD7E2HRFPBAW4KJODJ","json":"https://pith.science/pith/OQK73ENIDD7E2HRFPBAW4KJODJ.json","graph_json":"https://pith.science/api/pith-number/OQK73ENIDD7E2HRFPBAW4KJODJ/graph.json","events_json":"https://pith.science/api/pith-number/OQK73ENIDD7E2HRFPBAW4KJODJ/events.json","paper":"https://pith.science/paper/OQK73ENI"},"agent_actions":{"view_html":"https://pith.science/pith/OQK73ENIDD7E2HRFPBAW4KJODJ","download_json":"https://pith.science/pith/OQK73ENIDD7E2HRFPBAW4KJODJ.json","view_paper":"https://pith.science/paper/OQK73ENI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.7034&json=true","fetch_graph":"https://pith.science/api/pith-number/OQK73ENIDD7E2HRFPBAW4KJODJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OQK73ENIDD7E2HRFPBAW4KJODJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQK73ENIDD7E2HRFPBAW4KJODJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQK73ENIDD7E2HRFPBAW4KJODJ/action/storage_attestation","attest_author":"https://pith.science/pith/OQK73ENIDD7E2HRFPBAW4KJODJ/action/author_attestation","sign_citation":"https://pith.science/pith/OQK73ENIDD7E2HRFPBAW4KJODJ/action/citation_signature","submit_replication":"https://pith.science/pith/OQK73ENIDD7E2HRFPBAW4KJODJ/action/replication_record"}},"created_at":"2026-05-18T03:49:34.520664+00:00","updated_at":"2026-05-18T03:49:34.520664+00:00"}