{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SY4KT6W4ZT4D2WJOLPP5QNQSKJ","short_pith_number":"pith:SY4KT6W4","schema_version":"1.0","canonical_sha256":"9638a9fadcccf83d592e5bdfd8361252700e63523cedc27675fe2bb35c00d59e","source":{"kind":"arxiv","id":"1503.00831","version":2},"attestation_state":"computed","paper":{"title":"Capturing a phylogenetic tree when the number of character states varies with the number of leaves","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Mike Steel","submitted_at":"2015-03-03T05:49:54Z","abstract_excerpt":"We show that for any two values $\\alpha, \\beta >0 $ for which $\\alpha+\\beta>1$ then there is a value $N$ so that for all $n \\geq N$ the following holds. For any binary phylogenetic tree $T$ on $n$ leaves there is a set of $\\lfloor n^\\alpha \\rfloor$ characters that capture $T$, and for which each character takes at most $\\lfloor n^\\beta \\rfloor$ distinct states. Here `capture' means that $T$ is the unique perfect phylogeny for these characters. Our short proof of this combinatorial result is based on the probabilistic method."},"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":"1503.00831","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2015-03-03T05:49:54Z","cross_cats_sorted":[],"title_canon_sha256":"b4c0258a40afcc6cdcd7019dbdede9c28c575189771bbddeb1fc9ade30b9ce65","abstract_canon_sha256":"43097c7cd8e28123d0f718c1d72d8528276cb77efd6b9b2f9bc15ebd2e17aefd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:45.259057Z","signature_b64":"foZx4VSE91D910Ua2+Tj8mO5ChO1ab2R+DGsd6hu0F5i8hA5GZQMBg4k/80upa4ej/DgolZtwym+KgBxUUY2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9638a9fadcccf83d592e5bdfd8361252700e63523cedc27675fe2bb35c00d59e","last_reissued_at":"2026-05-18T01:34:45.258366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:45.258366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capturing a phylogenetic tree when the number of character states varies with the number of leaves","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Mike Steel","submitted_at":"2015-03-03T05:49:54Z","abstract_excerpt":"We show that for any two values $\\alpha, \\beta >0 $ for which $\\alpha+\\beta>1$ then there is a value $N$ so that for all $n \\geq N$ the following holds. For any binary phylogenetic tree $T$ on $n$ leaves there is a set of $\\lfloor n^\\alpha \\rfloor$ characters that capture $T$, and for which each character takes at most $\\lfloor n^\\beta \\rfloor$ distinct states. Here `capture' means that $T$ is the unique perfect phylogeny for these characters. Our short proof of this combinatorial result is based on the probabilistic method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00831","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":"1503.00831","created_at":"2026-05-18T01:34:45.258480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00831v2","created_at":"2026-05-18T01:34:45.258480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00831","created_at":"2026-05-18T01:34:45.258480+00:00"},{"alias_kind":"pith_short_12","alias_value":"SY4KT6W4ZT4D","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SY4KT6W4ZT4D2WJO","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SY4KT6W4","created_at":"2026-05-18T12:29:42.218222+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/SY4KT6W4ZT4D2WJOLPP5QNQSKJ","json":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ.json","graph_json":"https://pith.science/api/pith-number/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/graph.json","events_json":"https://pith.science/api/pith-number/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/events.json","paper":"https://pith.science/paper/SY4KT6W4"},"agent_actions":{"view_html":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ","download_json":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ.json","view_paper":"https://pith.science/paper/SY4KT6W4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00831&json=true","fetch_graph":"https://pith.science/api/pith-number/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/action/storage_attestation","attest_author":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/action/author_attestation","sign_citation":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/action/citation_signature","submit_replication":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/action/replication_record"}},"created_at":"2026-05-18T01:34:45.258480+00:00","updated_at":"2026-05-18T01:34:45.258480+00:00"}