{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:NPP3FSTZLSNYSDUXUWVYL2G52K","short_pith_number":"pith:NPP3FSTZ","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"},"canonical_sha256":"6bdfb2ca795c9b890e97a5ab85e8ddd283d2ca34e2f63952378892438847238b","source":{"kind":"arxiv","id":"2207.02629","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.02629","created_at":"2026-07-05T04:38:05Z"},{"alias_kind":"arxiv_version","alias_value":"2207.02629v1","created_at":"2026-07-05T04:38:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.02629","created_at":"2026-07-05T04:38:05Z"},{"alias_kind":"pith_short_12","alias_value":"NPP3FSTZLSNY","created_at":"2026-07-05T04:38:05Z"},{"alias_kind":"pith_short_16","alias_value":"NPP3FSTZLSNYSDUX","created_at":"2026-07-05T04:38:05Z"},{"alias_kind":"pith_short_8","alias_value":"NPP3FSTZ","created_at":"2026-07-05T04:38:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:NPP3FSTZLSNYSDUXUWVYL2G52K","target":"record","payload":{"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"},"canonical_sha256":"6bdfb2ca795c9b890e97a5ab85e8ddd283d2ca34e2f63952378892438847238b","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"},"source_kind":"arxiv","source_id":"2207.02629","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:38:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N1wwNd99Napvq7JijEKGPuSHxZdZ+0lbpgSYj5TN+KhfLx81RGGfz8ngIS5qPFoCUwkGsvXwPQUowEm5yEVnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:06:50.724589Z"},"content_sha256":"0f10a5a3d29871e9a72564b89ebb3d983d4ed177bba921cf11558fa99d6520a9","schema_version":"1.0","event_id":"sha256:0f10a5a3d29871e9a72564b89ebb3d983d4ed177bba921cf11558fa99d6520a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:NPP3FSTZLSNYSDUXUWVYL2G52K","target":"graph","payload":{"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"},"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:38:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTbpL+mv718qr7O9zqBrccWGbyQ5yUPjiKdQ2ouHX0omvaogtN88C8U0LSE6r6nT4ZOWFoKKxhgaa7dClx4lDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:06:50.725003Z"},"content_sha256":"5d3e53a435924e1b18134f484097ba813e59f468220813875fcfc0997057f630","schema_version":"1.0","event_id":"sha256:5d3e53a435924e1b18134f484097ba813e59f468220813875fcfc0997057f630"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/bundle.json","state_url":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/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-06T12:06:50Z","links":{"resolver":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K","bundle":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/bundle.json","state":"https://pith.science/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NPP3FSTZLSNYSDUXUWVYL2G52K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NPP3FSTZLSNYSDUXUWVYL2G52K","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":"f0ee47059fbac98c07e89f1384f98bf34d17b1a9582dce55e75299639385ca0a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2022-07-06T12:40:57Z","title_canon_sha256":"387ac0f9dab7ea68dbb66327295bb5f7d5e64015998bf808d10fdfab197832a8"},"schema_version":"1.0","source":{"id":"2207.02629","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.02629","created_at":"2026-07-05T04:38:05Z"},{"alias_kind":"arxiv_version","alias_value":"2207.02629v1","created_at":"2026-07-05T04:38:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.02629","created_at":"2026-07-05T04:38:05Z"},{"alias_kind":"pith_short_12","alias_value":"NPP3FSTZLSNY","created_at":"2026-07-05T04:38:05Z"},{"alias_kind":"pith_short_16","alias_value":"NPP3FSTZLSNYSDUX","created_at":"2026-07-05T04:38:05Z"},{"alias_kind":"pith_short_8","alias_value":"NPP3FSTZ","created_at":"2026-07-05T04:38:05Z"}],"graph_snapshots":[{"event_id":"sha256:5d3e53a435924e1b18134f484097ba813e59f468220813875fcfc0997057f630","target":"graph","created_at":"2026-07-05T04:38:05Z","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/2207.02629/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Louxin Zhang, Yufeng Wu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2022-07-06T12:40:57Z","title":"Can Multiple Phylogenetic Trees Be Displayed in a Tree-Child Network Simultaneously?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.02629","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:0f10a5a3d29871e9a72564b89ebb3d983d4ed177bba921cf11558fa99d6520a9","target":"record","created_at":"2026-07-05T04:38:05Z","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":"f0ee47059fbac98c07e89f1384f98bf34d17b1a9582dce55e75299639385ca0a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2022-07-06T12:40:57Z","title_canon_sha256":"387ac0f9dab7ea68dbb66327295bb5f7d5e64015998bf808d10fdfab197832a8"},"schema_version":"1.0","source":{"id":"2207.02629","kind":"arxiv","version":1}},"canonical_sha256":"6bdfb2ca795c9b890e97a5ab85e8ddd283d2ca34e2f63952378892438847238b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bdfb2ca795c9b890e97a5ab85e8ddd283d2ca34e2f63952378892438847238b","first_computed_at":"2026-07-05T04:38:05.872531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:38:05.872531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SUpHwxOMfCHnhqrjAxa8+K7azuD2c2EtHhKO7ast+U4V47r1GRDlCd4J95Qbb2uW+JGoSfYjTkDGYXKvarrXBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:38:05.872971Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.02629","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f10a5a3d29871e9a72564b89ebb3d983d4ed177bba921cf11558fa99d6520a9","sha256:5d3e53a435924e1b18134f484097ba813e59f468220813875fcfc0997057f630"],"state_sha256":"871f75c61937e120eb231d90cc494455ee3b56dba24fbc9440cc336bc05044f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiLtqxEldHkl0YPLzJmtpc8Y/ZgRZBZ5s5OeqMFHqUrulXOzcQvDZ/V+smh+mObRPpRMnpV8Ir7ze32SsoZbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T12:06:50.727026Z","bundle_sha256":"f249b995d73ab2df535871dc2adea8fafd5b08a5160177bc66ad48a1888d4dd5"}}