{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SY4KT6W4ZT4D2WJOLPP5QNQSKJ","short_pith_number":"pith:SY4KT6W4","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"},"canonical_sha256":"9638a9fadcccf83d592e5bdfd8361252700e63523cedc27675fe2bb35c00d59e","source":{"kind":"arxiv","id":"1503.00831","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00831","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00831v2","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00831","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"SY4KT6W4ZT4D","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SY4KT6W4ZT4D2WJO","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SY4KT6W4","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SY4KT6W4ZT4D2WJOLPP5QNQSKJ","target":"record","payload":{"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"},"canonical_sha256":"9638a9fadcccf83d592e5bdfd8361252700e63523cedc27675fe2bb35c00d59e","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"},"source_kind":"arxiv","source_id":"1503.00831","source_version":2,"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-18T01:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKRgbOXvhaFzCRpWJBfXOIzj+xkpZktBCMaFHoThhC1wKLHN5U3G4VxvFcOzemK6dbNUn4C5wNfUz00EwPocCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:37:09.588576Z"},"content_sha256":"6a9f8093276afafb7d966c19a77195fbef813cd59d0bf060892a93be49f1f321","schema_version":"1.0","event_id":"sha256:6a9f8093276afafb7d966c19a77195fbef813cd59d0bf060892a93be49f1f321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SY4KT6W4ZT4D2WJOLPP5QNQSKJ","target":"graph","payload":{"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"},"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-18T01:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2IIoP3zDkTEerFbU5TI0u8XYuWD43q3o1Q/9jrF1tMeq1EQV3smw6P82IhmcTTBvMc0SR3pRb5q/TSSCoX/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:37:09.589213Z"},"content_sha256":"bfd1faf946f9ccc981606df93886810ab8eaa850a6220c7f41b810e5525ad1e2","schema_version":"1.0","event_id":"sha256:bfd1faf946f9ccc981606df93886810ab8eaa850a6220c7f41b810e5525ad1e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/bundle.json","state_url":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/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-31T03:37:09Z","links":{"resolver":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ","bundle":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/bundle.json","state":"https://pith.science/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SY4KT6W4ZT4D2WJOLPP5QNQSKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SY4KT6W4ZT4D2WJOLPP5QNQSKJ","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":"43097c7cd8e28123d0f718c1d72d8528276cb77efd6b9b2f9bc15ebd2e17aefd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2015-03-03T05:49:54Z","title_canon_sha256":"b4c0258a40afcc6cdcd7019dbdede9c28c575189771bbddeb1fc9ade30b9ce65"},"schema_version":"1.0","source":{"id":"1503.00831","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00831","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00831v2","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00831","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"SY4KT6W4ZT4D","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SY4KT6W4ZT4D2WJO","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SY4KT6W4","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:bfd1faf946f9ccc981606df93886810ab8eaa850a6220c7f41b810e5525ad1e2","target":"graph","created_at":"2026-05-18T01:34:45Z","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":"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.","authors_text":"Mike Steel","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2015-03-03T05:49:54Z","title":"Capturing a phylogenetic tree when the number of character states varies with the number of leaves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00831","kind":"arxiv","version":2},"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:6a9f8093276afafb7d966c19a77195fbef813cd59d0bf060892a93be49f1f321","target":"record","created_at":"2026-05-18T01:34:45Z","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":"43097c7cd8e28123d0f718c1d72d8528276cb77efd6b9b2f9bc15ebd2e17aefd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2015-03-03T05:49:54Z","title_canon_sha256":"b4c0258a40afcc6cdcd7019dbdede9c28c575189771bbddeb1fc9ade30b9ce65"},"schema_version":"1.0","source":{"id":"1503.00831","kind":"arxiv","version":2}},"canonical_sha256":"9638a9fadcccf83d592e5bdfd8361252700e63523cedc27675fe2bb35c00d59e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9638a9fadcccf83d592e5bdfd8361252700e63523cedc27675fe2bb35c00d59e","first_computed_at":"2026-05-18T01:34:45.258366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:45.258366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"foZx4VSE91D910Ua2+Tj8mO5ChO1ab2R+DGsd6hu0F5i8hA5GZQMBg4k/80upa4ej/DgolZtwym+KgBxUUY2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:45.259057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00831","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a9f8093276afafb7d966c19a77195fbef813cd59d0bf060892a93be49f1f321","sha256:bfd1faf946f9ccc981606df93886810ab8eaa850a6220c7f41b810e5525ad1e2"],"state_sha256":"78164fdf09aacae58024fd8c6610a3499ccda2f53d0dc6f54f98b84c1f256245"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1sEa0h5OR4t3NL173iiutrG6yJhuS3vZZrR0RV6f/rHgkxoZIiEvJd6Hms90NhOJD8jGC4qsrhoeTubYooZaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:37:09.592304Z","bundle_sha256":"ab6aadc8a01c6d555cf947a2e39e8037e46a78eb3fb5b5be26a5b91e2437e00c"}}