{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OFYQMXSMCSGUM3BHIUVM5PECXA","short_pith_number":"pith:OFYQMXSM","canonical_record":{"source":{"id":"2203.07619","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-15T03:12:46Z","cross_cats_sorted":[],"title_canon_sha256":"40c22dd80df2b310617371d1b6fb5a000c5c91fe51f111d9721a7b46ee0505b6","abstract_canon_sha256":"8d0e8bfeebc58a4b118729f17989fcd1256fc079822de2a23d9114701c67cd7e"},"schema_version":"1.0"},"canonical_sha256":"7171065e4c148d466c27452acebc82b823bf719e01cf5ff6d47c673afa8a6871","source":{"kind":"arxiv","id":"2203.07619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.07619","created_at":"2026-07-05T04:05:20Z"},{"alias_kind":"arxiv_version","alias_value":"2203.07619v1","created_at":"2026-07-05T04:05:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.07619","created_at":"2026-07-05T04:05:20Z"},{"alias_kind":"pith_short_12","alias_value":"OFYQMXSMCSGU","created_at":"2026-07-05T04:05:20Z"},{"alias_kind":"pith_short_16","alias_value":"OFYQMXSMCSGUM3BH","created_at":"2026-07-05T04:05:20Z"},{"alias_kind":"pith_short_8","alias_value":"OFYQMXSM","created_at":"2026-07-05T04:05:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OFYQMXSMCSGUM3BHIUVM5PECXA","target":"record","payload":{"canonical_record":{"source":{"id":"2203.07619","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-15T03:12:46Z","cross_cats_sorted":[],"title_canon_sha256":"40c22dd80df2b310617371d1b6fb5a000c5c91fe51f111d9721a7b46ee0505b6","abstract_canon_sha256":"8d0e8bfeebc58a4b118729f17989fcd1256fc079822de2a23d9114701c67cd7e"},"schema_version":"1.0"},"canonical_sha256":"7171065e4c148d466c27452acebc82b823bf719e01cf5ff6d47c673afa8a6871","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:05:20.607052Z","signature_b64":"Ltxo7CPparRAy2SKVFUrHqse9xPswVfm0SxGHS7QP3beDArnqmLf5u5SfP3tvK1XGhEggeJ5cwbCxfDV8JJyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7171065e4c148d466c27452acebc82b823bf719e01cf5ff6d47c673afa8a6871","last_reissued_at":"2026-07-05T04:05:20.606656Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:05:20.606656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.07619","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:05:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zj7LS4o1wiRS2ih8oQYiu0159AYHFSCMlTyzPssV78qSEXN9yFSRd3oYdSJ4ScJ2BuVAtigM8MGbKBdxjlPeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:04:52.797256Z"},"content_sha256":"2693225414aa6dd4b14c5294831c2c898d525414d0e72e0efe96f627fec1f535","schema_version":"1.0","event_id":"sha256:2693225414aa6dd4b14c5294831c2c898d525414d0e72e0efe96f627fec1f535"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OFYQMXSMCSGUM3BHIUVM5PECXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumeration of $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-03-15T03:12:46Z","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 {\\it bicombining tree-child networks} which are tree-child networks with every reticulation node having exactly two parents. In this paper, we extend these studies to {\\it $d$-combining tree-child networks} where every reticulation node has now $d\\geq 2$ parents. Moreover, we also give results and conjectures on the distributional behavior of the number of reticulation nodes of a network which is dr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.07619","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/2203.07619/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:05:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kWyYCpZcZWb01ALH7VfKqXM3KRbInUbKL/fC7Mng1oOaZ6IUHjqCLVlK9uc5InhlTEn7C8DUbU325Xn+68MCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:04:52.797647Z"},"content_sha256":"69c35b131be9e457de023232ba15d013f324fc130750801b3855fb9473ce1865","schema_version":"1.0","event_id":"sha256:69c35b131be9e457de023232ba15d013f324fc130750801b3855fb9473ce1865"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFYQMXSMCSGUM3BHIUVM5PECXA/bundle.json","state_url":"https://pith.science/pith/OFYQMXSMCSGUM3BHIUVM5PECXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFYQMXSMCSGUM3BHIUVM5PECXA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T08:04:52Z","links":{"resolver":"https://pith.science/pith/OFYQMXSMCSGUM3BHIUVM5PECXA","bundle":"https://pith.science/pith/OFYQMXSMCSGUM3BHIUVM5PECXA/bundle.json","state":"https://pith.science/pith/OFYQMXSMCSGUM3BHIUVM5PECXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFYQMXSMCSGUM3BHIUVM5PECXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OFYQMXSMCSGUM3BHIUVM5PECXA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8d0e8bfeebc58a4b118729f17989fcd1256fc079822de2a23d9114701c67cd7e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-15T03:12:46Z","title_canon_sha256":"40c22dd80df2b310617371d1b6fb5a000c5c91fe51f111d9721a7b46ee0505b6"},"schema_version":"1.0","source":{"id":"2203.07619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.07619","created_at":"2026-07-05T04:05:20Z"},{"alias_kind":"arxiv_version","alias_value":"2203.07619v1","created_at":"2026-07-05T04:05:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.07619","created_at":"2026-07-05T04:05:20Z"},{"alias_kind":"pith_short_12","alias_value":"OFYQMXSMCSGU","created_at":"2026-07-05T04:05:20Z"},{"alias_kind":"pith_short_16","alias_value":"OFYQMXSMCSGUM3BH","created_at":"2026-07-05T04:05:20Z"},{"alias_kind":"pith_short_8","alias_value":"OFYQMXSM","created_at":"2026-07-05T04:05:20Z"}],"graph_snapshots":[{"event_id":"sha256:69c35b131be9e457de023232ba15d013f324fc130750801b3855fb9473ce1865","target":"graph","created_at":"2026-07-05T04:05:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.07619/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 {\\it bicombining tree-child networks} which are tree-child networks with every reticulation node having exactly two parents. In this paper, we extend these studies to {\\it $d$-combining tree-child networks} where every reticulation node has now $d\\geq 2$ parents. Moreover, we also give results and conjectures on the distributional behavior of the number of reticulation nodes of a network which is dr","authors_text":"Guan-Ru Yu, Hexuan Liu, Michael Fuchs, Michael Wallner, Yu-Sheng Chang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-15T03:12:46Z","title":"Enumeration of $d$-combining Tree-Child Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.07619","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2693225414aa6dd4b14c5294831c2c898d525414d0e72e0efe96f627fec1f535","target":"record","created_at":"2026-07-05T04:05:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8d0e8bfeebc58a4b118729f17989fcd1256fc079822de2a23d9114701c67cd7e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-15T03:12:46Z","title_canon_sha256":"40c22dd80df2b310617371d1b6fb5a000c5c91fe51f111d9721a7b46ee0505b6"},"schema_version":"1.0","source":{"id":"2203.07619","kind":"arxiv","version":1}},"canonical_sha256":"7171065e4c148d466c27452acebc82b823bf719e01cf5ff6d47c673afa8a6871","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7171065e4c148d466c27452acebc82b823bf719e01cf5ff6d47c673afa8a6871","first_computed_at":"2026-07-05T04:05:20.606656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:05:20.606656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ltxo7CPparRAy2SKVFUrHqse9xPswVfm0SxGHS7QP3beDArnqmLf5u5SfP3tvK1XGhEggeJ5cwbCxfDV8JJyDw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:05:20.607052Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.07619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2693225414aa6dd4b14c5294831c2c898d525414d0e72e0efe96f627fec1f535","sha256:69c35b131be9e457de023232ba15d013f324fc130750801b3855fb9473ce1865"],"state_sha256":"db3574b38be346bb1ffce9f5e99e33e14fb11c35983cb73b8555a2817dcabb56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nm+9NS2W8MaGOx8SZS0BUKS4Qxek9k2KFThoHfl+4k+/791gCcxwUEoH6L3gxoH6MedMZJ+nxZwpLLV+hDAnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:04:52.799662Z","bundle_sha256":"93ed5bb8daec303711b95adfae019af81cc98e916def76517c13427049c809cc"}}