{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A4IYWBQD7DEHGIVWZR4FFUMZQE","short_pith_number":"pith:A4IYWBQD","schema_version":"1.0","canonical_sha256":"07118b0603f8c87322b6cc7852d199813fdbcbdbcc70b7ba9a2c9b42562ed276","source":{"kind":"arxiv","id":"1707.08274","version":2},"attestation_state":"computed","paper":{"title":"A universal tree-based network with the minimum number of reticulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charles Semple, Magnus Bordewich","submitted_at":"2017-07-26T02:17:01Z","abstract_excerpt":"A tree-based network $\\mathcal N$ on $X$ is universal if every rooted binary phylogenetic $X$-tree is a base tree for $\\mathcal N$. Hayamizu and, independently, Zhang constructively showed that, for all positive integers $n$, there exists an universal tree-based network on $n$ leaves. For all $n$, Hayamizu's construction contains $\\Theta(n!)$ reticulations, while Zhang's construction contains $\\Theta(n^2)$ reticulations. A simple counting argument shows that an universal tree-based network has $\\Omega(n\\log n)$ reticulations. With this in mind, Hayamizu as well as Steel posed the problem of de"},"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":"1707.08274","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-26T02:17:01Z","cross_cats_sorted":[],"title_canon_sha256":"a94d06e13234391fff61964a93556a602990290b0d9cd9681f17c190b26cac43","abstract_canon_sha256":"cc9989b86c91d6de6359bd2de5a05616acd0dc2920d4898f2bcb88c10d715b2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:27.942995Z","signature_b64":"R5yyQdTYsNFBvVuEKWUsNobg4c1F7z3EO3553EQanWvR4Wy5AP4s5zC0E5DehHQvbiRMxxe54hVxgin1V1WlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07118b0603f8c87322b6cc7852d199813fdbcbdbcc70b7ba9a2c9b42562ed276","last_reissued_at":"2026-05-18T00:27:27.942287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:27.942287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A universal tree-based network with the minimum number of reticulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charles Semple, Magnus Bordewich","submitted_at":"2017-07-26T02:17:01Z","abstract_excerpt":"A tree-based network $\\mathcal N$ on $X$ is universal if every rooted binary phylogenetic $X$-tree is a base tree for $\\mathcal N$. Hayamizu and, independently, Zhang constructively showed that, for all positive integers $n$, there exists an universal tree-based network on $n$ leaves. For all $n$, Hayamizu's construction contains $\\Theta(n!)$ reticulations, while Zhang's construction contains $\\Theta(n^2)$ reticulations. A simple counting argument shows that an universal tree-based network has $\\Omega(n\\log n)$ reticulations. With this in mind, Hayamizu as well as Steel posed the problem of de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08274","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":"1707.08274","created_at":"2026-05-18T00:27:27.942408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08274v2","created_at":"2026-05-18T00:27:27.942408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08274","created_at":"2026-05-18T00:27:27.942408+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4IYWBQD7DEH","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4IYWBQD7DEHGIVW","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4IYWBQD","created_at":"2026-05-18T12:31:05.417338+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/A4IYWBQD7DEHGIVWZR4FFUMZQE","json":"https://pith.science/pith/A4IYWBQD7DEHGIVWZR4FFUMZQE.json","graph_json":"https://pith.science/api/pith-number/A4IYWBQD7DEHGIVWZR4FFUMZQE/graph.json","events_json":"https://pith.science/api/pith-number/A4IYWBQD7DEHGIVWZR4FFUMZQE/events.json","paper":"https://pith.science/paper/A4IYWBQD"},"agent_actions":{"view_html":"https://pith.science/pith/A4IYWBQD7DEHGIVWZR4FFUMZQE","download_json":"https://pith.science/pith/A4IYWBQD7DEHGIVWZR4FFUMZQE.json","view_paper":"https://pith.science/paper/A4IYWBQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08274&json=true","fetch_graph":"https://pith.science/api/pith-number/A4IYWBQD7DEHGIVWZR4FFUMZQE/graph.json","fetch_events":"https://pith.science/api/pith-number/A4IYWBQD7DEHGIVWZR4FFUMZQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4IYWBQD7DEHGIVWZR4FFUMZQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4IYWBQD7DEHGIVWZR4FFUMZQE/action/storage_attestation","attest_author":"https://pith.science/pith/A4IYWBQD7DEHGIVWZR4FFUMZQE/action/author_attestation","sign_citation":"https://pith.science/pith/A4IYWBQD7DEHGIVWZR4FFUMZQE/action/citation_signature","submit_replication":"https://pith.science/pith/A4IYWBQD7DEHGIVWZR4FFUMZQE/action/replication_record"}},"created_at":"2026-05-18T00:27:27.942408+00:00","updated_at":"2026-05-18T00:27:27.942408+00:00"}