{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RTPT5FDW7XHO2C7MFNKYK6RZYJ","short_pith_number":"pith:RTPT5FDW","canonical_record":{"source":{"id":"1406.0217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-06-01T23:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"9c8f2ef4175393e8f78ccc301eafa984c80345f121028a6fb946f69fa258ed3e","abstract_canon_sha256":"065ba14970adb0c927a713da4f08617896b99df6ec99c2309935bc1bc1762166"},"schema_version":"1.0"},"canonical_sha256":"8cdf3e9476fdceed0bec2b55857a39c255e34c1b10fca1842c1f914ca22a4d04","source":{"kind":"arxiv","id":"1406.0217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0217","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0217v1","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0217","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"RTPT5FDW7XHO","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RTPT5FDW7XHO2C7M","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RTPT5FDW","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RTPT5FDW7XHO2C7MFNKYK6RZYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1406.0217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-06-01T23:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"9c8f2ef4175393e8f78ccc301eafa984c80345f121028a6fb946f69fa258ed3e","abstract_canon_sha256":"065ba14970adb0c927a713da4f08617896b99df6ec99c2309935bc1bc1762166"},"schema_version":"1.0"},"canonical_sha256":"8cdf3e9476fdceed0bec2b55857a39c255e34c1b10fca1842c1f914ca22a4d04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:41.466304Z","signature_b64":"AaQH4OV5sELo3tAM1py4vaRBG1GqAesBQLh1uCu+7Itp44Z+mwZFfulpplwsEIfQXuRI12718cV0TqSinUIPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cdf3e9476fdceed0bec2b55857a39c255e34c1b10fca1842c1f914ca22a4d04","last_reissued_at":"2026-05-18T02:50:41.465779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:41.465779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.0217","source_version":1,"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-18T02:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbo4M6cLKVsPB0fz9EZDd/YYzrl5U2Q0gLcsmm7OBhUvwdgjISZ9fOMRSDbQRQTPDuaaHkgmp0kAMbCSajPsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:49:49.271965Z"},"content_sha256":"f17faa1ab72eabb14af5f4712564542665efa6bdded89408104240a4ec1d4c82","schema_version":"1.0","event_id":"sha256:f17faa1ab72eabb14af5f4712564542665efa6bdded89408104240a4ec1d4c82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RTPT5FDW7XHO2C7MFNKYK6RZYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The most parsimonious tree for random data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Lina Herbst, Mareike Fischer, Michelle Galla, Mike Steel","submitted_at":"2014-06-01T23:50:13Z","abstract_excerpt":"Applying a method to reconstruct a phylogenetic tree from random data provides a way to detect whether that method has an inherent bias towards certain tree `shapes'. For maximum parsimony, applied to a sequence of random 2-state data, each possible binary phylogenetic tree has exactly the same distribution for its parsimony score. Despite this pleasing and slightly surprising symmetry, some binary phylogenetic trees are more likely than others to be a most parsimonious (MP) tree for a sequence of $k$ such characters, as we show. For $k=2$, and unrooted binary trees on six taxa, any tree with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0217","kind":"arxiv","version":1},"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-18T02:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJlJ8TiLczo1hp+tI34r0wAvWq5D+c71YQC+6WvzWakLIZg+013zzB8sCGCcLIhDJTXTWlRjIzpgE5UnbisBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:49:49.272556Z"},"content_sha256":"46fc04303127e2dc9b3219b44ab52c46dd227298511f3a93e0d7f1541d790b9b","schema_version":"1.0","event_id":"sha256:46fc04303127e2dc9b3219b44ab52c46dd227298511f3a93e0d7f1541d790b9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTPT5FDW7XHO2C7MFNKYK6RZYJ/bundle.json","state_url":"https://pith.science/pith/RTPT5FDW7XHO2C7MFNKYK6RZYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTPT5FDW7XHO2C7MFNKYK6RZYJ/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-31T02:49:49Z","links":{"resolver":"https://pith.science/pith/RTPT5FDW7XHO2C7MFNKYK6RZYJ","bundle":"https://pith.science/pith/RTPT5FDW7XHO2C7MFNKYK6RZYJ/bundle.json","state":"https://pith.science/pith/RTPT5FDW7XHO2C7MFNKYK6RZYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTPT5FDW7XHO2C7MFNKYK6RZYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RTPT5FDW7XHO2C7MFNKYK6RZYJ","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":"065ba14970adb0c927a713da4f08617896b99df6ec99c2309935bc1bc1762166","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-06-01T23:50:13Z","title_canon_sha256":"9c8f2ef4175393e8f78ccc301eafa984c80345f121028a6fb946f69fa258ed3e"},"schema_version":"1.0","source":{"id":"1406.0217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0217","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0217v1","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0217","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"RTPT5FDW7XHO","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RTPT5FDW7XHO2C7M","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RTPT5FDW","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:46fc04303127e2dc9b3219b44ab52c46dd227298511f3a93e0d7f1541d790b9b","target":"graph","created_at":"2026-05-18T02:50:41Z","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":"Applying a method to reconstruct a phylogenetic tree from random data provides a way to detect whether that method has an inherent bias towards certain tree `shapes'. For maximum parsimony, applied to a sequence of random 2-state data, each possible binary phylogenetic tree has exactly the same distribution for its parsimony score. Despite this pleasing and slightly surprising symmetry, some binary phylogenetic trees are more likely than others to be a most parsimonious (MP) tree for a sequence of $k$ such characters, as we show. For $k=2$, and unrooted binary trees on six taxa, any tree with ","authors_text":"Lina Herbst, Mareike Fischer, Michelle Galla, Mike Steel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-06-01T23:50:13Z","title":"The most parsimonious tree for random data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0217","kind":"arxiv","version":1},"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:f17faa1ab72eabb14af5f4712564542665efa6bdded89408104240a4ec1d4c82","target":"record","created_at":"2026-05-18T02:50:41Z","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":"065ba14970adb0c927a713da4f08617896b99df6ec99c2309935bc1bc1762166","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-06-01T23:50:13Z","title_canon_sha256":"9c8f2ef4175393e8f78ccc301eafa984c80345f121028a6fb946f69fa258ed3e"},"schema_version":"1.0","source":{"id":"1406.0217","kind":"arxiv","version":1}},"canonical_sha256":"8cdf3e9476fdceed0bec2b55857a39c255e34c1b10fca1842c1f914ca22a4d04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cdf3e9476fdceed0bec2b55857a39c255e34c1b10fca1842c1f914ca22a4d04","first_computed_at":"2026-05-18T02:50:41.465779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:41.465779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AaQH4OV5sELo3tAM1py4vaRBG1GqAesBQLh1uCu+7Itp44Z+mwZFfulpplwsEIfQXuRI12718cV0TqSinUIPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:41.466304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f17faa1ab72eabb14af5f4712564542665efa6bdded89408104240a4ec1d4c82","sha256:46fc04303127e2dc9b3219b44ab52c46dd227298511f3a93e0d7f1541d790b9b"],"state_sha256":"187cfcc32eb46fbc4a9212017b1b31358bc065c785b6de8b192c5590cbf68282"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9oJo6Q2sy580vd7slAvGqz1RKPdLyPpioNm/RGrEdkgWiKPzHLVRLnX5vNUCAQlBG76GDhLB9q6yhFxjMtDNAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:49:49.275473Z","bundle_sha256":"f64b82529ce4fb5367ca6082ed2a711431650dff003be0675f9d2756216a186e"}}