{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:R6S64U2LY3INEQR6VANNX2P4F2","short_pith_number":"pith:R6S64U2L","schema_version":"1.0","canonical_sha256":"8fa5ee534bc6d0d2423ea81adbe9fc2e85ab81653fbeba954526dd4754320dd6","source":{"kind":"arxiv","id":"2311.18218","version":1},"attestation_state":"computed","paper":{"title":"Computing the Bounds of the Number of Reticulations in a Tree-Child Network That Displays a Set of Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Louxin Zhang, Yufeng Wu","submitted_at":"2023-11-30T03:22:32Z","abstract_excerpt":"Phylogenetic network is an evolutionary model that uses a rooted directed acyclic graph (instead of a tree) to model an evolutionary history of species in which reticulate events (e.g., hybrid speciation or horizontal gene transfer) occurred. Tree-child network is a kind of phylogenetic network with structural constraints. Existing approaches for tree-child network reconstruction can be slow for large data. In this paper, we present several computational approaches for bounding from below the number of reticulations in a tree-child network that displays a given set of rooted binary phylogeneti"},"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":"2311.18218","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2023-11-30T03:22:32Z","cross_cats_sorted":[],"title_canon_sha256":"f46fa3d021391e44e6b2309248eadf6cbfcc3f701bf43a2be3129411e9e6e26e","abstract_canon_sha256":"7f0b3ca32d5b17bd57bf18f7792fd435b4ec220470e64cf21b63b23622916ab1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:18:38.873424Z","signature_b64":"Mh9TbgT/uwtfRNKJJ7Vrmsw2EjEShM9usMnZFwQ/YJZfkGHwnHozqjWGP4cU0ZziX44X5l/GTDViYeef9cjyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fa5ee534bc6d0d2423ea81adbe9fc2e85ab81653fbeba954526dd4754320dd6","last_reissued_at":"2026-07-05T07:18:38.872989Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:18:38.872989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Bounds of the Number of Reticulations in a Tree-Child Network That Displays a Set of Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Louxin Zhang, Yufeng Wu","submitted_at":"2023-11-30T03:22:32Z","abstract_excerpt":"Phylogenetic network is an evolutionary model that uses a rooted directed acyclic graph (instead of a tree) to model an evolutionary history of species in which reticulate events (e.g., hybrid speciation or horizontal gene transfer) occurred. Tree-child network is a kind of phylogenetic network with structural constraints. Existing approaches for tree-child network reconstruction can be slow for large data. In this paper, we present several computational approaches for bounding from below the number of reticulations in a tree-child network that displays a given set of rooted binary phylogeneti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.18218","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/2311.18218/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":"2311.18218","created_at":"2026-07-05T07:18:38.873061+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.18218v1","created_at":"2026-07-05T07:18:38.873061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.18218","created_at":"2026-07-05T07:18:38.873061+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6S64U2LY3IN","created_at":"2026-07-05T07:18:38.873061+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6S64U2LY3INEQR6","created_at":"2026-07-05T07:18:38.873061+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6S64U2L","created_at":"2026-07-05T07:18:38.873061+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/R6S64U2LY3INEQR6VANNX2P4F2","json":"https://pith.science/pith/R6S64U2LY3INEQR6VANNX2P4F2.json","graph_json":"https://pith.science/api/pith-number/R6S64U2LY3INEQR6VANNX2P4F2/graph.json","events_json":"https://pith.science/api/pith-number/R6S64U2LY3INEQR6VANNX2P4F2/events.json","paper":"https://pith.science/paper/R6S64U2L"},"agent_actions":{"view_html":"https://pith.science/pith/R6S64U2LY3INEQR6VANNX2P4F2","download_json":"https://pith.science/pith/R6S64U2LY3INEQR6VANNX2P4F2.json","view_paper":"https://pith.science/paper/R6S64U2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.18218&json=true","fetch_graph":"https://pith.science/api/pith-number/R6S64U2LY3INEQR6VANNX2P4F2/graph.json","fetch_events":"https://pith.science/api/pith-number/R6S64U2LY3INEQR6VANNX2P4F2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6S64U2LY3INEQR6VANNX2P4F2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6S64U2LY3INEQR6VANNX2P4F2/action/storage_attestation","attest_author":"https://pith.science/pith/R6S64U2LY3INEQR6VANNX2P4F2/action/author_attestation","sign_citation":"https://pith.science/pith/R6S64U2LY3INEQR6VANNX2P4F2/action/citation_signature","submit_replication":"https://pith.science/pith/R6S64U2LY3INEQR6VANNX2P4F2/action/replication_record"}},"created_at":"2026-07-05T07:18:38.873061+00:00","updated_at":"2026-07-05T07:18:38.873061+00:00"}