{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NOYKUJWB3ACWBIHO56FRBGQ25H","short_pith_number":"pith:NOYKUJWB","canonical_record":{"source":{"id":"1402.1553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-02-07T05:21:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"92ecda70214e254f124b0e1251a970f3e7277073344eb60571d0f391b08c52af","abstract_canon_sha256":"1066510d26615a97fbbb3927e662c5675aa7fb3edaf2218f9e7dc38ed47da68b"},"schema_version":"1.0"},"canonical_sha256":"6bb0aa26c1d80560a0eeef8b109a1ae9f2df7c880650872adac64638e9437a4f","source":{"kind":"arxiv","id":"1402.1553","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1553","created_at":"2026-05-18T02:59:46Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1553v1","created_at":"2026-05-18T02:59:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1553","created_at":"2026-05-18T02:59:46Z"},{"alias_kind":"pith_short_12","alias_value":"NOYKUJWB3ACW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NOYKUJWB3ACWBIHO","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NOYKUJWB","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NOYKUJWB3ACWBIHO56FRBGQ25H","target":"record","payload":{"canonical_record":{"source":{"id":"1402.1553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-02-07T05:21:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"92ecda70214e254f124b0e1251a970f3e7277073344eb60571d0f391b08c52af","abstract_canon_sha256":"1066510d26615a97fbbb3927e662c5675aa7fb3edaf2218f9e7dc38ed47da68b"},"schema_version":"1.0"},"canonical_sha256":"6bb0aa26c1d80560a0eeef8b109a1ae9f2df7c880650872adac64638e9437a4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:46.914459Z","signature_b64":"+4DzzZYCsYztbfVqSTCk4+yeXXDv01B5myvpaUpczLY/gv90v+vq0PTWO/vTrghcAdQbe1O/6rSKdKzdQTJVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bb0aa26c1d80560a0eeef8b109a1ae9f2df7c880650872adac64638e9437a4f","last_reissued_at":"2026-05-18T02:59:46.913459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:46.913459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.1553","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:59:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVksYLCAqWSTo4ANMuKU+b1o3QyFe86dEI7pZsEAfWdlhSsNZz8BjWbBaG04Q0EjSSUbLO8QuRUDw4YNbWRaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:39:13.601930Z"},"content_sha256":"817f8df0c1c3e5c46c495271048f0b4907c37a92e331716a3d7920d3166b2321","schema_version":"1.0","event_id":"sha256:817f8df0c1c3e5c46c495271048f0b4907c37a92e331716a3d7920d3166b2321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NOYKUJWB3ACWBIHO56FRBGQ25H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Maximum Parsimony distance between phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"q-bio.PE","authors_text":"Mareike Fischer, Steven Kelk","submitted_at":"2014-02-07T05:21:58Z","abstract_excerpt":"Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Here, based on an idea of Bruen and Bryant, we propose and analyze a new distance measure: the Maximum Parsimony (MP) distance. This is based on the difference of the parsimony scores of a single character on both trees under consideration, and the goal is to find the character which maximizes this difference. In this article we show that this new distance is a metric and provides a lower bound to the well-known Subtree Prune and Regraft (SPR) distance. We also show that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1553","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:59:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kYz9VBiQ9l0VFO+66W6Bw9W65xWxlF7FEVokygC/wSyjq/e4OBVb7m6hZSDwmSN14O2Z0WJxATQGfGoDcJ60Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:39:13.602659Z"},"content_sha256":"af0f672d00c7cbf87de5d8ac86eaf8e975a669e904d0ee6708ec81cfd719f8e1","schema_version":"1.0","event_id":"sha256:af0f672d00c7cbf87de5d8ac86eaf8e975a669e904d0ee6708ec81cfd719f8e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOYKUJWB3ACWBIHO56FRBGQ25H/bundle.json","state_url":"https://pith.science/pith/NOYKUJWB3ACWBIHO56FRBGQ25H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOYKUJWB3ACWBIHO56FRBGQ25H/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-06-06T08:39:13Z","links":{"resolver":"https://pith.science/pith/NOYKUJWB3ACWBIHO56FRBGQ25H","bundle":"https://pith.science/pith/NOYKUJWB3ACWBIHO56FRBGQ25H/bundle.json","state":"https://pith.science/pith/NOYKUJWB3ACWBIHO56FRBGQ25H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOYKUJWB3ACWBIHO56FRBGQ25H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NOYKUJWB3ACWBIHO56FRBGQ25H","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":"1066510d26615a97fbbb3927e662c5675aa7fb3edaf2218f9e7dc38ed47da68b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-02-07T05:21:58Z","title_canon_sha256":"92ecda70214e254f124b0e1251a970f3e7277073344eb60571d0f391b08c52af"},"schema_version":"1.0","source":{"id":"1402.1553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1553","created_at":"2026-05-18T02:59:46Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1553v1","created_at":"2026-05-18T02:59:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1553","created_at":"2026-05-18T02:59:46Z"},{"alias_kind":"pith_short_12","alias_value":"NOYKUJWB3ACW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NOYKUJWB3ACWBIHO","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NOYKUJWB","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:af0f672d00c7cbf87de5d8ac86eaf8e975a669e904d0ee6708ec81cfd719f8e1","target":"graph","created_at":"2026-05-18T02:59:46Z","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":"Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Here, based on an idea of Bruen and Bryant, we propose and analyze a new distance measure: the Maximum Parsimony (MP) distance. This is based on the difference of the parsimony scores of a single character on both trees under consideration, and the goal is to find the character which maximizes this difference. In this article we show that this new distance is a metric and provides a lower bound to the well-known Subtree Prune and Regraft (SPR) distance. We also show that t","authors_text":"Mareike Fischer, Steven Kelk","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-02-07T05:21:58Z","title":"On the Maximum Parsimony distance between phylogenetic trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1553","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:817f8df0c1c3e5c46c495271048f0b4907c37a92e331716a3d7920d3166b2321","target":"record","created_at":"2026-05-18T02:59:46Z","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":"1066510d26615a97fbbb3927e662c5675aa7fb3edaf2218f9e7dc38ed47da68b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-02-07T05:21:58Z","title_canon_sha256":"92ecda70214e254f124b0e1251a970f3e7277073344eb60571d0f391b08c52af"},"schema_version":"1.0","source":{"id":"1402.1553","kind":"arxiv","version":1}},"canonical_sha256":"6bb0aa26c1d80560a0eeef8b109a1ae9f2df7c880650872adac64638e9437a4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bb0aa26c1d80560a0eeef8b109a1ae9f2df7c880650872adac64638e9437a4f","first_computed_at":"2026-05-18T02:59:46.913459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:46.913459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+4DzzZYCsYztbfVqSTCk4+yeXXDv01B5myvpaUpczLY/gv90v+vq0PTWO/vTrghcAdQbe1O/6rSKdKzdQTJVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:46.914459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:817f8df0c1c3e5c46c495271048f0b4907c37a92e331716a3d7920d3166b2321","sha256:af0f672d00c7cbf87de5d8ac86eaf8e975a669e904d0ee6708ec81cfd719f8e1"],"state_sha256":"a4037ed629bf1734b6bde51601b723294070fcdaebc7d7da38ba9ce0cfebf6bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U39bfIrtEn+HzJpAYiEiPnkuDHZ5Ysis4VA0m1lQ2eSLbkUygz8ARzNzasfBTwytxcoyD27qaMN8m/X8Yi+JCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:39:13.606309Z","bundle_sha256":"24313a593d156ba12c673173917dc3a87b2428857a222751b485ee4fe7af660e"}}