{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TDBRHNXJG22HOJBQKJVCAX5RLI","short_pith_number":"pith:TDBRHNXJ","canonical_record":{"source":{"id":"1811.06777","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T12:19:54Z","cross_cats_sorted":[],"title_canon_sha256":"b72f17ef8d5390d6ae467bb47fc0d9c8524d8638516e5511ac678fce6410c13d","abstract_canon_sha256":"d118f0934f820b3b5c222c355cdc088d4d516130f7267f167280a6ce6fbe2d5a"},"schema_version":"1.0"},"canonical_sha256":"98c313b6e936b4772430526a205fb15a100c621ad2d560db577676126e65cd11","source":{"kind":"arxiv","id":"1811.06777","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06777","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06777v3","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06777","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"TDBRHNXJG22H","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TDBRHNXJG22HOJBQ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TDBRHNXJ","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TDBRHNXJG22HOJBQKJVCAX5RLI","target":"record","payload":{"canonical_record":{"source":{"id":"1811.06777","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T12:19:54Z","cross_cats_sorted":[],"title_canon_sha256":"b72f17ef8d5390d6ae467bb47fc0d9c8524d8638516e5511ac678fce6410c13d","abstract_canon_sha256":"d118f0934f820b3b5c222c355cdc088d4d516130f7267f167280a6ce6fbe2d5a"},"schema_version":"1.0"},"canonical_sha256":"98c313b6e936b4772430526a205fb15a100c621ad2d560db577676126e65cd11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:04.080681Z","signature_b64":"CiKjviWvrsPxDAUM6HXkh5svBBCDQlNLJsS8mN3VLndIcuoz+4L5+WSdDCCrdE9iigqDkh24OoUH9cE9052RBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98c313b6e936b4772430526a205fb15a100c621ad2d560db577676126e65cd11","last_reissued_at":"2026-05-17T23:40:04.079866Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:04.079866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.06777","source_version":3,"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-05-17T23:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/g5oqebcan/ibcUv09MiVsGjP9uitJYCvi4ZbjVnxTNbxLNgQOTGgDg4OSeQvXjUcMwVbJs6bwGP8u/vecbcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:20:24.310450Z"},"content_sha256":"e31d7e0a21735604ae9c5c40745cc5223e76be8eb4a3b78de61628af4eb520ae","schema_version":"1.0","event_id":"sha256:e31d7e0a21735604ae9c5c40745cc5223e76be8eb4a3b78de61628af4eb520ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TDBRHNXJG22HOJBQKJVCAX5RLI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leo van Iersel, Mark Jones, Remie Janssen, Vincent Moulton, Yukihiro Murakami","submitted_at":"2018-11-16T12:19:54Z","abstract_excerpt":"Network reconstruction lies at the heart of phylogenetic research. Two well studied classes of phylogenetic networks include tree-child networks and level-$k$ networks. In a tree-child network, every non-leaf node has a child that is a tree node or a leaf. In a level-$k$ network, the maximum number of reticulations contained in a biconnected component is $k$. Here, we show that level-$k$ tree-child networks are encoded by their reticulate-edge-deleted subnetworks, which are subnetworks obtained by deleting a single reticulation edge, if $k\\geq 2$. Following this, we provide a polynomial-time a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06777","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1rDM1xy2+5tKll74gELBo9w10w50qn1Nbu17rYyUpeQNH8p1PKBbL7aTejdV3w0BhrrN15/7VMu0A7E6766Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:20:24.311117Z"},"content_sha256":"b2e6179399bb07e80345057a928dc2ff56624fac96a9db7bd9f8550339939ca1","schema_version":"1.0","event_id":"sha256:b2e6179399bb07e80345057a928dc2ff56624fac96a9db7bd9f8550339939ca1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/bundle.json","state_url":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/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-05-30T01:20:24Z","links":{"resolver":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI","bundle":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/bundle.json","state":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TDBRHNXJG22HOJBQKJVCAX5RLI","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":"d118f0934f820b3b5c222c355cdc088d4d516130f7267f167280a6ce6fbe2d5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T12:19:54Z","title_canon_sha256":"b72f17ef8d5390d6ae467bb47fc0d9c8524d8638516e5511ac678fce6410c13d"},"schema_version":"1.0","source":{"id":"1811.06777","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06777","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06777v3","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06777","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"TDBRHNXJG22H","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TDBRHNXJG22HOJBQ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TDBRHNXJ","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:b2e6179399bb07e80345057a928dc2ff56624fac96a9db7bd9f8550339939ca1","target":"graph","created_at":"2026-05-17T23:40:04Z","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"},"paper":{"abstract_excerpt":"Network reconstruction lies at the heart of phylogenetic research. Two well studied classes of phylogenetic networks include tree-child networks and level-$k$ networks. In a tree-child network, every non-leaf node has a child that is a tree node or a leaf. In a level-$k$ network, the maximum number of reticulations contained in a biconnected component is $k$. Here, we show that level-$k$ tree-child networks are encoded by their reticulate-edge-deleted subnetworks, which are subnetworks obtained by deleting a single reticulation edge, if $k\\geq 2$. Following this, we provide a polynomial-time a","authors_text":"Leo van Iersel, Mark Jones, Remie Janssen, Vincent Moulton, Yukihiro Murakami","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T12:19:54Z","title":"Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06777","kind":"arxiv","version":3},"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:e31d7e0a21735604ae9c5c40745cc5223e76be8eb4a3b78de61628af4eb520ae","target":"record","created_at":"2026-05-17T23:40:04Z","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":"d118f0934f820b3b5c222c355cdc088d4d516130f7267f167280a6ce6fbe2d5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T12:19:54Z","title_canon_sha256":"b72f17ef8d5390d6ae467bb47fc0d9c8524d8638516e5511ac678fce6410c13d"},"schema_version":"1.0","source":{"id":"1811.06777","kind":"arxiv","version":3}},"canonical_sha256":"98c313b6e936b4772430526a205fb15a100c621ad2d560db577676126e65cd11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98c313b6e936b4772430526a205fb15a100c621ad2d560db577676126e65cd11","first_computed_at":"2026-05-17T23:40:04.079866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:04.079866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CiKjviWvrsPxDAUM6HXkh5svBBCDQlNLJsS8mN3VLndIcuoz+4L5+WSdDCCrdE9iigqDkh24OoUH9cE9052RBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:04.080681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06777","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e31d7e0a21735604ae9c5c40745cc5223e76be8eb4a3b78de61628af4eb520ae","sha256:b2e6179399bb07e80345057a928dc2ff56624fac96a9db7bd9f8550339939ca1"],"state_sha256":"e250fbf535519237b4b052232052315953c584b98a960527c911a72b3f5da722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wcBqvaEVOmU+qHJaC6NoeI1zFLNe4WogvHKu3wq3Uql3Z1Nr2UjAuE/X9GTh9vSMEDe8Pgf5sL3MGgh6yhHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:20:24.314406Z","bundle_sha256":"315549813df02c6efc5ce9b850308a5a60359f31134a1de112a8e242f7c6d14a"}}