{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OIHZ6GM4SPG44LRPG4HURW6HRZ","short_pith_number":"pith:OIHZ6GM4","schema_version":"1.0","canonical_sha256":"720f9f199c93cdce2e2f370f48dbc78e63ef39095ebc9e97dcdce73718e238b0","source":{"kind":"arxiv","id":"1412.4076","version":2},"attestation_state":"computed","paper":{"title":"On the complexity of computing MP distance between binary phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DS","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Mareike Fischer, Steven Kelk","submitted_at":"2014-12-12T18:24:35Z","abstract_excerpt":"Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Recently, a new distance measure has been proposed: 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. Here we show that computation of MP distance on two \\emph{binary} phylogenetic trees is NP-hard. This is a highly nontrivial extension of an earlier NP-hardness proof for two multifurcating phylogenetic t"},"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":"1412.4076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-12-12T18:24:35Z","cross_cats_sorted":["cs.CE","cs.DS","math.CO"],"title_canon_sha256":"8ecf6d6894deecb3832565fee0396a3076066caf73a14606fff177b117633754","abstract_canon_sha256":"d883da7d86bc33bd42c041dbbb406f7d2531ab2acd3f994e2c649f656604d74e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:10.206199Z","signature_b64":"K37wBtOF97X0AW5Vg2vGVKUfC/Zspzr210NNApaREhhJpFTDzuGJgGL/FjKC3G/z309r74AeVpXGKyHkBqXhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"720f9f199c93cdce2e2f370f48dbc78e63ef39095ebc9e97dcdce73718e238b0","last_reissued_at":"2026-05-18T02:29:10.205668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:10.205668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of computing MP distance between binary phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DS","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Mareike Fischer, Steven Kelk","submitted_at":"2014-12-12T18:24:35Z","abstract_excerpt":"Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Recently, a new distance measure has been proposed: 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. Here we show that computation of MP distance on two \\emph{binary} phylogenetic trees is NP-hard. This is a highly nontrivial extension of an earlier NP-hardness proof for two multifurcating phylogenetic t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4076","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":"1412.4076","created_at":"2026-05-18T02:29:10.205750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4076v2","created_at":"2026-05-18T02:29:10.205750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4076","created_at":"2026-05-18T02:29:10.205750+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIHZ6GM4SPG4","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIHZ6GM4SPG44LRP","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIHZ6GM4","created_at":"2026-05-18T12:28:41.024544+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/OIHZ6GM4SPG44LRPG4HURW6HRZ","json":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ.json","graph_json":"https://pith.science/api/pith-number/OIHZ6GM4SPG44LRPG4HURW6HRZ/graph.json","events_json":"https://pith.science/api/pith-number/OIHZ6GM4SPG44LRPG4HURW6HRZ/events.json","paper":"https://pith.science/paper/OIHZ6GM4"},"agent_actions":{"view_html":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ","download_json":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ.json","view_paper":"https://pith.science/paper/OIHZ6GM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4076&json=true","fetch_graph":"https://pith.science/api/pith-number/OIHZ6GM4SPG44LRPG4HURW6HRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OIHZ6GM4SPG44LRPG4HURW6HRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/action/storage_attestation","attest_author":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/action/author_attestation","sign_citation":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/action/citation_signature","submit_replication":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/action/replication_record"}},"created_at":"2026-05-18T02:29:10.205750+00:00","updated_at":"2026-05-18T02:29:10.205750+00:00"}