{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NPP3FSTZLSNYSDUXUWVYL2G52K","short_pith_number":"pith:NPP3FSTZ","schema_version":"1.0","canonical_sha256":"6bdfb2ca795c9b890e97a5ab85e8ddd283d2ca34e2f63952378892438847238b","source":{"kind":"arxiv","id":"2207.02629","version":1},"attestation_state":"computed","paper":{"title":"Can Multiple Phylogenetic Trees Be Displayed in a Tree-Child Network Simultaneously?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Louxin Zhang, Yufeng Wu","submitted_at":"2022-07-06T12:40:57Z","abstract_excerpt":"A binary phylogenetic network on a taxon set $X$ is a rooted acyclic digraph in which the degree of each nonleaf node is three and its leaves (i.e.degree-one nodes) are uniquely labeled with the taxa of $X$. It is tree-child if each nonleaf node has at least one child of indegree one. A set of binary phylogenetic trees may or may not be simultaneously displayed in a binary tree-child network. Necessary conditions for multiple phylogenetic trees being simultaneously displayed in a tree-child network are given here. In particular, it is proved that any two phylogenetic trees can always simultane"},"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":"2207.02629","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2022-07-06T12:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"387ac0f9dab7ea68dbb66327295bb5f7d5e64015998bf808d10fdfab197832a8","abstract_canon_sha256":"f0ee47059fbac98c07e89f1384f98bf34d17b1a9582dce55e75299639385ca0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:05.872971Z","signature_b64":"SUpHwxOMfCHnhqrjAxa8+K7azuD2c2EtHhKO7ast+U4V47r1GRDlCd4J95Qbb2uW+JGoSfYjTkDGYXKvarrXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bdfb2ca795c9b890e97a5ab85e8ddd283d2ca34e2f63952378892438847238b","last_reissued_at":"2026-07-05T04:38:05.872531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:05.872531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Multiple Phylogenetic Trees Be Displayed in a Tree-Child Network Simultaneously?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Louxin Zhang, Yufeng Wu","submitted_at":"2022-07-06T12:40:57Z","abstract_excerpt":"A binary phylogenetic network on a taxon set $X$ is a rooted acyclic digraph in which the degree of each nonleaf node is three and its leaves (i.e.degree-one nodes) are uniquely labeled with the taxa of $X$. It is tree-child if each nonleaf node has at least one child of indegree one. A set of binary phylogenetic trees may or may not be simultaneously displayed in a binary tree-child network. Necessary conditions for multiple phylogenetic trees being simultaneously displayed in a tree-child network are given here. In particular, it is proved that any two phylogenetic trees can always simultane"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.02629","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.02629/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.02629","created_at":"2026-07-05T04:38:05.872598+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.02629v1","created_at":"2026-07-05T04:38:05.872598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.02629","created_at":"2026-07-05T04:38:05.872598+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPP3FSTZLSNY","created_at":"2026-07-05T04:38:05.872598+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPP3FSTZLSNYSDUX","created_at":"2026-07-05T04:38:05.872598+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPP3FSTZ","created_at":"2026-07-05T04:38:05.872598+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/NPP3FSTZLSNYSDUXUWVYL2G52K","json":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K.json","graph_json":"https://pith.science/api/pith-number/NPP3FSTZLSNYSDUXUWVYL2G52K/graph.json","events_json":"https://pith.science/api/pith-number/NPP3FSTZLSNYSDUXUWVYL2G52K/events.json","paper":"https://pith.science/paper/NPP3FSTZ"},"agent_actions":{"view_html":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K","download_json":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K.json","view_paper":"https://pith.science/paper/NPP3FSTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.02629&json=true","fetch_graph":"https://pith.science/api/pith-number/NPP3FSTZLSNYSDUXUWVYL2G52K/graph.json","fetch_events":"https://pith.science/api/pith-number/NPP3FSTZLSNYSDUXUWVYL2G52K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/action/storage_attestation","attest_author":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/action/author_attestation","sign_citation":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/action/citation_signature","submit_replication":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/action/replication_record"}},"created_at":"2026-07-05T04:38:05.872598+00:00","updated_at":"2026-07-05T04:38:05.872598+00:00"}