{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TDBRHNXJG22HOJBQKJVCAX5RLI","short_pith_number":"pith:TDBRHNXJ","schema_version":"1.0","canonical_sha256":"98c313b6e936b4772430526a205fb15a100c621ad2d560db577676126e65cd11","source":{"kind":"arxiv","id":"1811.06777","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.06777","created_at":"2026-05-17T23:40:04.079967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06777v3","created_at":"2026-05-17T23:40:04.079967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06777","created_at":"2026-05-17T23:40:04.079967+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDBRHNXJG22H","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDBRHNXJG22HOJBQ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDBRHNXJ","created_at":"2026-05-18T12:32:53.628368+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/TDBRHNXJG22HOJBQKJVCAX5RLI","json":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI.json","graph_json":"https://pith.science/api/pith-number/TDBRHNXJG22HOJBQKJVCAX5RLI/graph.json","events_json":"https://pith.science/api/pith-number/TDBRHNXJG22HOJBQKJVCAX5RLI/events.json","paper":"https://pith.science/paper/TDBRHNXJ"},"agent_actions":{"view_html":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI","download_json":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI.json","view_paper":"https://pith.science/paper/TDBRHNXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06777&json=true","fetch_graph":"https://pith.science/api/pith-number/TDBRHNXJG22HOJBQKJVCAX5RLI/graph.json","fetch_events":"https://pith.science/api/pith-number/TDBRHNXJG22HOJBQKJVCAX5RLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/action/storage_attestation","attest_author":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/action/author_attestation","sign_citation":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/action/citation_signature","submit_replication":"https://pith.science/pith/TDBRHNXJG22HOJBQKJVCAX5RLI/action/replication_record"}},"created_at":"2026-05-17T23:40:04.079967+00:00","updated_at":"2026-05-17T23:40:04.079967+00:00"}