{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PBPT2LUQKQRVZ4KLEQWY45D2EU","short_pith_number":"pith:PBPT2LUQ","schema_version":"1.0","canonical_sha256":"785f3d2e9054235cf14b242d8e747a251fc538330cec0987cf9f85eb383d05d2","source":{"kind":"arxiv","id":"1411.6804","version":1},"attestation_state":"computed","paper":{"title":"Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.DS","authors_text":"Celine Scornavacca, Katharina Huber, Leo van Iersel, Taoyang Wu, Vincent Moulton","submitted_at":"2014-11-25T10:41:32Z","abstract_excerpt":"Binets and trinets are phylogenetic networks with two and three leaves, respectively. Here we consider the problem of deciding if there exists a binary level-1 phylogenetic network displaying a given set $\\mathcal{T}$ of binary binets or trinets over a set $X$ of taxa, and constructing such a network whenever it exists. We show that this is NP-hard for trinets but polynomial-time solvable for binets. Moreover, we show that the problem is still polynomial-time solvable for inputs consisting of binets and trinets as long as the cycles in the trinets have size three. Finally, we present an $O(3^{"},"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":"1411.6804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T10:41:32Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"5ea9a284d52ad8f8d2aef4c7c64636fab84f69cb6c23fa6f7dd02cff7d2aebd5","abstract_canon_sha256":"1bdbe03d7e6378925c6f1fe2ff4d6f698bf884c4b730b3cf4342d9c0570a4ec8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:47.279346Z","signature_b64":"wA+wzw/laTKIWmhtCDyh8y1mG9C3vdV/+sJ3KK1O2lxR3f81lrKXF4WbzyMs3fdf4BzyGG9/2K/1/STQzKmRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"785f3d2e9054235cf14b242d8e747a251fc538330cec0987cf9f85eb383d05d2","last_reissued_at":"2026-05-18T02:32:47.278924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:47.278924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.DS","authors_text":"Celine Scornavacca, Katharina Huber, Leo van Iersel, Taoyang Wu, Vincent Moulton","submitted_at":"2014-11-25T10:41:32Z","abstract_excerpt":"Binets and trinets are phylogenetic networks with two and three leaves, respectively. Here we consider the problem of deciding if there exists a binary level-1 phylogenetic network displaying a given set $\\mathcal{T}$ of binary binets or trinets over a set $X$ of taxa, and constructing such a network whenever it exists. We show that this is NP-hard for trinets but polynomial-time solvable for binets. Moreover, we show that the problem is still polynomial-time solvable for inputs consisting of binets and trinets as long as the cycles in the trinets have size three. Finally, we present an $O(3^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6804","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":"1411.6804","created_at":"2026-05-18T02:32:47.278985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6804v1","created_at":"2026-05-18T02:32:47.278985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6804","created_at":"2026-05-18T02:32:47.278985+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBPT2LUQKQRV","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBPT2LUQKQRVZ4KL","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBPT2LUQ","created_at":"2026-05-18T12:28:43.426989+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/PBPT2LUQKQRVZ4KLEQWY45D2EU","json":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU.json","graph_json":"https://pith.science/api/pith-number/PBPT2LUQKQRVZ4KLEQWY45D2EU/graph.json","events_json":"https://pith.science/api/pith-number/PBPT2LUQKQRVZ4KLEQWY45D2EU/events.json","paper":"https://pith.science/paper/PBPT2LUQ"},"agent_actions":{"view_html":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU","download_json":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU.json","view_paper":"https://pith.science/paper/PBPT2LUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6804&json=true","fetch_graph":"https://pith.science/api/pith-number/PBPT2LUQKQRVZ4KLEQWY45D2EU/graph.json","fetch_events":"https://pith.science/api/pith-number/PBPT2LUQKQRVZ4KLEQWY45D2EU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/action/storage_attestation","attest_author":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/action/author_attestation","sign_citation":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/action/citation_signature","submit_replication":"https://pith.science/pith/PBPT2LUQKQRVZ4KLEQWY45D2EU/action/replication_record"}},"created_at":"2026-05-18T02:32:47.278985+00:00","updated_at":"2026-05-18T02:32:47.278985+00:00"}