{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IXUIHNULDEOBR6ST2BTCCB56TP","short_pith_number":"pith:IXUIHNUL","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"},"canonical_sha256":"45e883b68b191c18fa53d0662107be9bf7e625f5611454bc6375d72346c92814","source":{"kind":"arxiv","id":"2209.03850","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.03850","created_at":"2026-07-05T07:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"2209.03850v2","created_at":"2026-07-05T07:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.03850","created_at":"2026-07-05T07:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"IXUIHNULDEOB","created_at":"2026-07-05T07:59:47Z"},{"alias_kind":"pith_short_16","alias_value":"IXUIHNULDEOBR6ST","created_at":"2026-07-05T07:59:47Z"},{"alias_kind":"pith_short_8","alias_value":"IXUIHNUL","created_at":"2026-07-05T07:59:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IXUIHNULDEOBR6ST2BTCCB56TP","target":"record","payload":{"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"},"canonical_sha256":"45e883b68b191c18fa53d0662107be9bf7e625f5611454bc6375d72346c92814","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"},"source_kind":"arxiv","source_id":"2209.03850","source_version":2,"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-05T07:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQMKiP3Uaji5B+/MlkDbaTepk9VIKLaLJVOCskRkHEqDI6mquwg/KJ2kiyMLnrXrrRnIwelwibGCGZSX4B1PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:41:36.669891Z"},"content_sha256":"e6118397d989394789d94efc55b7b162b7375e034da5456e00a56678b15373f2","schema_version":"1.0","event_id":"sha256:e6118397d989394789d94efc55b7b162b7375e034da5456e00a56678b15373f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IXUIHNULDEOBR6ST2BTCCB56TP","target":"graph","payload":{"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"},"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-05T07:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gqn556T5QS0yaK85QMQt3SYEsoEnCwrnClnp+MbjFsa3fxa4HS7xKXTaDlhAs2PesPF+1V0NPZ5N9tb1naHJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:41:36.670264Z"},"content_sha256":"bfeac0d41699db1b8b435623d64c16d0db07aced5cde48c7925ca3d63d9daf92","schema_version":"1.0","event_id":"sha256:bfeac0d41699db1b8b435623d64c16d0db07aced5cde48c7925ca3d63d9daf92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP/bundle.json","state_url":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXUIHNULDEOBR6ST2BTCCB56TP/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-06T13:41:36Z","links":{"resolver":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP","bundle":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP/bundle.json","state":"https://pith.science/pith/IXUIHNULDEOBR6ST2BTCCB56TP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXUIHNULDEOBR6ST2BTCCB56TP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IXUIHNULDEOBR6ST2BTCCB56TP","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":"8957f1749d9278fc7935aca1f0ecb1b799df042ba591b3a67587087a54e24c58","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-08T14:43:35Z","title_canon_sha256":"2d47baf255a8f89e5c67723942722d393c289a7c9555b97ddbea74e8f26e6e81"},"schema_version":"1.0","source":{"id":"2209.03850","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.03850","created_at":"2026-07-05T07:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"2209.03850v2","created_at":"2026-07-05T07:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.03850","created_at":"2026-07-05T07:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"IXUIHNULDEOB","created_at":"2026-07-05T07:59:47Z"},{"alias_kind":"pith_short_16","alias_value":"IXUIHNULDEOBR6ST","created_at":"2026-07-05T07:59:47Z"},{"alias_kind":"pith_short_8","alias_value":"IXUIHNUL","created_at":"2026-07-05T07:59:47Z"}],"graph_snapshots":[{"event_id":"sha256:bfeac0d41699db1b8b435623d64c16d0db07aced5cde48c7925ca3d63d9daf92","target":"graph","created_at":"2026-07-05T07:59:47Z","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/2209.03850/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 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","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-09-08T14:43:35Z","title":"Enumerative and Distributional Results for $d$-combining Tree-Child Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.03850","kind":"arxiv","version":2},"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:e6118397d989394789d94efc55b7b162b7375e034da5456e00a56678b15373f2","target":"record","created_at":"2026-07-05T07:59:47Z","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":"8957f1749d9278fc7935aca1f0ecb1b799df042ba591b3a67587087a54e24c58","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-08T14:43:35Z","title_canon_sha256":"2d47baf255a8f89e5c67723942722d393c289a7c9555b97ddbea74e8f26e6e81"},"schema_version":"1.0","source":{"id":"2209.03850","kind":"arxiv","version":2}},"canonical_sha256":"45e883b68b191c18fa53d0662107be9bf7e625f5611454bc6375d72346c92814","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45e883b68b191c18fa53d0662107be9bf7e625f5611454bc6375d72346c92814","first_computed_at":"2026-07-05T07:59:47.432365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:59:47.432365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n7HHiIjNpfqcMlpGIUoN6Ci8HnOL37wh0KK5sKezt58HT2ImE86kRUNC96cdHR9S7eSa3VeJQgf33hiLmTVVBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:59:47.432826Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.03850","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6118397d989394789d94efc55b7b162b7375e034da5456e00a56678b15373f2","sha256:bfeac0d41699db1b8b435623d64c16d0db07aced5cde48c7925ca3d63d9daf92"],"state_sha256":"e3b51d80df3b44f6c6e34b90249061c4891062aa5a78a822459c70804339b9cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StoD5HnE7H3Uo4pRF16OA7EJL03gaOILj+pHueLsefUPiqu8ML+8av8XDZLvR2jIYRq58kiuvk8B8EtJhqYjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:41:36.672852Z","bundle_sha256":"bf466a9006a59efffab4abdee7e7e4738e3dd7e6f2810a777a6ce184e2e33401"}}