{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IXUIHNULDEOBR6ST2BTCCB56TP","short_pith_number":"pith:IXUIHNUL","schema_version":"1.0","canonical_sha256":"45e883b68b191c18fa53d0662107be9bf7e625f5611454bc6375d72346c92814","source":{"kind":"arxiv","id":"2209.03850","version":2},"attestation_state":"computed","paper":{"title":"Enumerative and Distributional Results for $d$-combining Tree-Child Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guan-Ru Yu, Hexuan Liu, Michael Fuchs, Michael Wallner, Yu-Sheng Chang","submitted_at":"2022-09-08T14:43:35Z","abstract_excerpt":"Tree-child networks are one of the most prominent network classes for modeling evolutionary processes which contain reticulation events. Several recent studies have addressed counting questions for bicombining tree-child networks in which every reticulation node has exactly two parents. We extend these studies to $d$-combining tree-child networks where every reticulation node has now $d\\geq 2$ parents, and we study one-component as well as general tree-child networks. For the number of one-component networks, we derive an exact formula from which asymptotic results follow that contain a stretc"},"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":"2209.03850","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-08T14:43:35Z","cross_cats_sorted":[],"title_canon_sha256":"2d47baf255a8f89e5c67723942722d393c289a7c9555b97ddbea74e8f26e6e81","abstract_canon_sha256":"8957f1749d9278fc7935aca1f0ecb1b799df042ba591b3a67587087a54e24c58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:59:47.432826Z","signature_b64":"n7HHiIjNpfqcMlpGIUoN6Ci8HnOL37wh0KK5sKezt58HT2ImE86kRUNC96cdHR9S7eSa3VeJQgf33hiLmTVVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45e883b68b191c18fa53d0662107be9bf7e625f5611454bc6375d72346c92814","last_reissued_at":"2026-07-05T07:59:47.432365Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:59:47.432365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerative and Distributional Results for $d$-combining Tree-Child Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guan-Ru Yu, Hexuan Liu, Michael Fuchs, Michael Wallner, Yu-Sheng Chang","submitted_at":"2022-09-08T14:43:35Z","abstract_excerpt":"Tree-child networks are one of the most prominent network classes for modeling evolutionary processes which contain reticulation events. Several recent studies have addressed counting questions for bicombining tree-child networks in which every reticulation node has exactly two parents. We extend these studies to $d$-combining tree-child networks where every reticulation node has now $d\\geq 2$ parents, and we study one-component as well as general tree-child networks. For the number of one-component networks, we derive an exact formula from which asymptotic results follow that contain a stretc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.03850","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.03850/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":"2209.03850","created_at":"2026-07-05T07:59:47.432424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.03850v2","created_at":"2026-07-05T07:59:47.432424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.03850","created_at":"2026-07-05T07:59:47.432424+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXUIHNULDEOB","created_at":"2026-07-05T07:59:47.432424+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXUIHNULDEOBR6ST","created_at":"2026-07-05T07:59:47.432424+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXUIHNUL","created_at":"2026-07-05T07:59:47.432424+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/IXUIHNULDEOBR6ST2BTCCB56TP","json":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP.json","graph_json":"https://pith.science/api/pith-number/IXUIHNULDEOBR6ST2BTCCB56TP/graph.json","events_json":"https://pith.science/api/pith-number/IXUIHNULDEOBR6ST2BTCCB56TP/events.json","paper":"https://pith.science/paper/IXUIHNUL"},"agent_actions":{"view_html":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP","download_json":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP.json","view_paper":"https://pith.science/paper/IXUIHNUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.03850&json=true","fetch_graph":"https://pith.science/api/pith-number/IXUIHNULDEOBR6ST2BTCCB56TP/graph.json","fetch_events":"https://pith.science/api/pith-number/IXUIHNULDEOBR6ST2BTCCB56TP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP/action/storage_attestation","attest_author":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP/action/author_attestation","sign_citation":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP/action/citation_signature","submit_replication":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP/action/replication_record"}},"created_at":"2026-07-05T07:59:47.432424+00:00","updated_at":"2026-07-05T07:59:47.432424+00:00"}