{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EBWR7F5UADVPJ52OWP7NO6A4C4","short_pith_number":"pith:EBWR7F5U","schema_version":"1.0","canonical_sha256":"206d1f97b400eaf4f74eb3fed7781c170c5b15aa1a7eae83b4ed992691f63c39","source":{"kind":"arxiv","id":"1508.05424","version":2},"attestation_state":"computed","paper":{"title":"Reticulation-visible networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Charles Semple, Magnus Bordewich","submitted_at":"2015-08-21T22:03:35Z","abstract_excerpt":"Let $X$ be a finite set, $\\mathcal N$ be a reticulation-visible network on $X$, and $\\mathcal T$ be a rooted binary phylogenetic tree. We show that there is a polynomial-time algorithm for deciding whether or not $\\mathcal N$ displays $\\mathcal T$. Furthermore, for all $|X|\\ge 1$, we show that $\\mathcal N$ has at most $8|X|-7$ vertices in total and at most $3|X|-3$ reticulation vertices, and that these upper bounds are sharp."},"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":"1508.05424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-21T22:03:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1b082ca2d609ed264deeee1defb7db508e201f52258e39e402929e1ad8a31af5","abstract_canon_sha256":"28caf9e603dac15d319c16debdba523bb8927b6ed4ef262cc373740afd7118dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:46.706783Z","signature_b64":"ywDdpZ7M1THcx+DzHb4s69NDnG1TO/Xfwsjun/qG6nXIxs7TjR95qzlSLDQcpF0lH9JI4ZyJRrwxJ1ht50x6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"206d1f97b400eaf4f74eb3fed7781c170c5b15aa1a7eae83b4ed992691f63c39","last_reissued_at":"2026-05-18T00:41:46.706254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:46.706254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reticulation-visible networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Charles Semple, Magnus Bordewich","submitted_at":"2015-08-21T22:03:35Z","abstract_excerpt":"Let $X$ be a finite set, $\\mathcal N$ be a reticulation-visible network on $X$, and $\\mathcal T$ be a rooted binary phylogenetic tree. We show that there is a polynomial-time algorithm for deciding whether or not $\\mathcal N$ displays $\\mathcal T$. Furthermore, for all $|X|\\ge 1$, we show that $\\mathcal N$ has at most $8|X|-7$ vertices in total and at most $3|X|-3$ reticulation vertices, and that these upper bounds are sharp."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05424","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":""},"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":"1508.05424","created_at":"2026-05-18T00:41:46.706355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05424v2","created_at":"2026-05-18T00:41:46.706355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05424","created_at":"2026-05-18T00:41:46.706355+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBWR7F5UADVP","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBWR7F5UADVPJ52O","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBWR7F5U","created_at":"2026-05-18T12:29:19.899920+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/EBWR7F5UADVPJ52OWP7NO6A4C4","json":"https://pith.science/pith/EBWR7F5UADVPJ52OWP7NO6A4C4.json","graph_json":"https://pith.science/api/pith-number/EBWR7F5UADVPJ52OWP7NO6A4C4/graph.json","events_json":"https://pith.science/api/pith-number/EBWR7F5UADVPJ52OWP7NO6A4C4/events.json","paper":"https://pith.science/paper/EBWR7F5U"},"agent_actions":{"view_html":"https://pith.science/pith/EBWR7F5UADVPJ52OWP7NO6A4C4","download_json":"https://pith.science/pith/EBWR7F5UADVPJ52OWP7NO6A4C4.json","view_paper":"https://pith.science/paper/EBWR7F5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05424&json=true","fetch_graph":"https://pith.science/api/pith-number/EBWR7F5UADVPJ52OWP7NO6A4C4/graph.json","fetch_events":"https://pith.science/api/pith-number/EBWR7F5UADVPJ52OWP7NO6A4C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBWR7F5UADVPJ52OWP7NO6A4C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBWR7F5UADVPJ52OWP7NO6A4C4/action/storage_attestation","attest_author":"https://pith.science/pith/EBWR7F5UADVPJ52OWP7NO6A4C4/action/author_attestation","sign_citation":"https://pith.science/pith/EBWR7F5UADVPJ52OWP7NO6A4C4/action/citation_signature","submit_replication":"https://pith.science/pith/EBWR7F5UADVPJ52OWP7NO6A4C4/action/replication_record"}},"created_at":"2026-05-18T00:41:46.706355+00:00","updated_at":"2026-05-18T00:41:46.706355+00:00"}