{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZUPGKEHVWB2YRIGQPEOY2IKI6X","short_pith_number":"pith:ZUPGKEHV","schema_version":"1.0","canonical_sha256":"cd1e6510f5b07588a0d0791d8d2148f5db589094b443a057d5fa13b3d7f8285e","source":{"kind":"arxiv","id":"1707.03648","version":1},"attestation_state":"computed","paper":{"title":"Finding the most parsimonious or likely tree in a network with respect to an alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Celine Scornavacca, Fabio Pardi, Leo van Iersel, Steven Kelk","submitted_at":"2017-07-12T11:23:41Z","abstract_excerpt":"Phylogenetic networks are often constructed by merging multiple conflicting phylogenetic signals into a directed acyclic graph. It is interesting to explore whether a network constructed in this way induces biologically-relevant phylogenetic signals that were not present in the input. Here we show that, given a multiple alignment A for a set of taxa X and a rooted phylogenetic network N whose leaves are labelled by X, it is NP-hard to locate the most parsimonious phylogenetic tree displayed by N (with respect to A) even when the level of N - the maximum number of reticulation nodes within a bi"},"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":"1707.03648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-07-12T11:23:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e19df10292cf98ecc3190383b19b47ecc3fcddfa632a89045e68337c519854d8","abstract_canon_sha256":"f7d711da2a7ab3b51be3c3c02ba9d3b7486fe05f73dacbbf3080e9685cde880d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:25.406470Z","signature_b64":"/rqpcXiMeVMewlg4dACoH/UnYFyC5OPQMW78huoAeVit7dtCGzr51W7yLN2KwpRnA1H6TXfpQOGP63fBpp4rCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd1e6510f5b07588a0d0791d8d2148f5db589094b443a057d5fa13b3d7f8285e","last_reissued_at":"2026-05-18T00:40:25.405802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:25.405802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding the most parsimonious or likely tree in a network with respect to an alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Celine Scornavacca, Fabio Pardi, Leo van Iersel, Steven Kelk","submitted_at":"2017-07-12T11:23:41Z","abstract_excerpt":"Phylogenetic networks are often constructed by merging multiple conflicting phylogenetic signals into a directed acyclic graph. It is interesting to explore whether a network constructed in this way induces biologically-relevant phylogenetic signals that were not present in the input. Here we show that, given a multiple alignment A for a set of taxa X and a rooted phylogenetic network N whose leaves are labelled by X, it is NP-hard to locate the most parsimonious phylogenetic tree displayed by N (with respect to A) even when the level of N - the maximum number of reticulation nodes within a bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03648","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":"1707.03648","created_at":"2026-05-18T00:40:25.405886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03648v1","created_at":"2026-05-18T00:40:25.405886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03648","created_at":"2026-05-18T00:40:25.405886+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUPGKEHVWB2Y","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUPGKEHVWB2YRIGQ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUPGKEHV","created_at":"2026-05-18T12:31:59.375834+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/ZUPGKEHVWB2YRIGQPEOY2IKI6X","json":"https://pith.science/pith/ZUPGKEHVWB2YRIGQPEOY2IKI6X.json","graph_json":"https://pith.science/api/pith-number/ZUPGKEHVWB2YRIGQPEOY2IKI6X/graph.json","events_json":"https://pith.science/api/pith-number/ZUPGKEHVWB2YRIGQPEOY2IKI6X/events.json","paper":"https://pith.science/paper/ZUPGKEHV"},"agent_actions":{"view_html":"https://pith.science/pith/ZUPGKEHVWB2YRIGQPEOY2IKI6X","download_json":"https://pith.science/pith/ZUPGKEHVWB2YRIGQPEOY2IKI6X.json","view_paper":"https://pith.science/paper/ZUPGKEHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03648&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUPGKEHVWB2YRIGQPEOY2IKI6X/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUPGKEHVWB2YRIGQPEOY2IKI6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUPGKEHVWB2YRIGQPEOY2IKI6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUPGKEHVWB2YRIGQPEOY2IKI6X/action/storage_attestation","attest_author":"https://pith.science/pith/ZUPGKEHVWB2YRIGQPEOY2IKI6X/action/author_attestation","sign_citation":"https://pith.science/pith/ZUPGKEHVWB2YRIGQPEOY2IKI6X/action/citation_signature","submit_replication":"https://pith.science/pith/ZUPGKEHVWB2YRIGQPEOY2IKI6X/action/replication_record"}},"created_at":"2026-05-18T00:40:25.405886+00:00","updated_at":"2026-05-18T00:40:25.405886+00:00"}