{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OIHZ6GM4SPG44LRPG4HURW6HRZ","short_pith_number":"pith:OIHZ6GM4","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"},"canonical_sha256":"720f9f199c93cdce2e2f370f48dbc78e63ef39095ebc9e97dcdce73718e238b0","source":{"kind":"arxiv","id":"1412.4076","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4076","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4076v2","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4076","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"pith_short_12","alias_value":"OIHZ6GM4SPG4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OIHZ6GM4SPG44LRP","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OIHZ6GM4","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OIHZ6GM4SPG44LRPG4HURW6HRZ","target":"record","payload":{"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"},"canonical_sha256":"720f9f199c93cdce2e2f370f48dbc78e63ef39095ebc9e97dcdce73718e238b0","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"},"source_kind":"arxiv","source_id":"1412.4076","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-18T02:29:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmk8JV8GYNsDPxEtmUQR7QlzO89D3Cb6vnOzKkHL13k6Q+4Ws8GOQinSWAKNlo5J3H86ttkW0RqyNHr8nj3+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:30:05.196089Z"},"content_sha256":"5dcb8ad95565acb30e98106a8851bd1249726fd4bba1f6d1382b4dfda43fa6cf","schema_version":"1.0","event_id":"sha256:5dcb8ad95565acb30e98106a8851bd1249726fd4bba1f6d1382b4dfda43fa6cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OIHZ6GM4SPG44LRPG4HURW6HRZ","target":"graph","payload":{"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"},"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:29:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7d4ZsDoE6EY53q8TAiWQoK9rBqnFvUGezUqMSqj9DqwHyRYNchMg6ZNvBpd8lTG3p8EcR60swJAHLopHRObICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:30:05.196782Z"},"content_sha256":"edb0f75b14b0d2f10fdf19bb3ba447a597de78930e03dd14ffc8aa7adbd42df2","schema_version":"1.0","event_id":"sha256:edb0f75b14b0d2f10fdf19bb3ba447a597de78930e03dd14ffc8aa7adbd42df2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/bundle.json","state_url":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/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-06T05:30:05Z","links":{"resolver":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ","bundle":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/bundle.json","state":"https://pith.science/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIHZ6GM4SPG44LRPG4HURW6HRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OIHZ6GM4SPG44LRPG4HURW6HRZ","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":"d883da7d86bc33bd42c041dbbb406f7d2531ab2acd3f994e2c649f656604d74e","cross_cats_sorted":["cs.CE","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-12-12T18:24:35Z","title_canon_sha256":"8ecf6d6894deecb3832565fee0396a3076066caf73a14606fff177b117633754"},"schema_version":"1.0","source":{"id":"1412.4076","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4076","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4076v2","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4076","created_at":"2026-05-18T02:29:10Z"},{"alias_kind":"pith_short_12","alias_value":"OIHZ6GM4SPG4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OIHZ6GM4SPG44LRP","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OIHZ6GM4","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:edb0f75b14b0d2f10fdf19bb3ba447a597de78930e03dd14ffc8aa7adbd42df2","target":"graph","created_at":"2026-05-18T02:29:10Z","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. 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","authors_text":"Mareike Fischer, Steven Kelk","cross_cats":["cs.CE","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-12-12T18:24:35Z","title":"On the complexity of computing MP distance between binary phylogenetic trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4076","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:5dcb8ad95565acb30e98106a8851bd1249726fd4bba1f6d1382b4dfda43fa6cf","target":"record","created_at":"2026-05-18T02:29:10Z","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":"d883da7d86bc33bd42c041dbbb406f7d2531ab2acd3f994e2c649f656604d74e","cross_cats_sorted":["cs.CE","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2014-12-12T18:24:35Z","title_canon_sha256":"8ecf6d6894deecb3832565fee0396a3076066caf73a14606fff177b117633754"},"schema_version":"1.0","source":{"id":"1412.4076","kind":"arxiv","version":2}},"canonical_sha256":"720f9f199c93cdce2e2f370f48dbc78e63ef39095ebc9e97dcdce73718e238b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"720f9f199c93cdce2e2f370f48dbc78e63ef39095ebc9e97dcdce73718e238b0","first_computed_at":"2026-05-18T02:29:10.205668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:10.205668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K37wBtOF97X0AW5Vg2vGVKUfC/Zspzr210NNApaREhhJpFTDzuGJgGL/FjKC3G/z309r74AeVpXGKyHkBqXhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:10.206199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4076","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dcb8ad95565acb30e98106a8851bd1249726fd4bba1f6d1382b4dfda43fa6cf","sha256:edb0f75b14b0d2f10fdf19bb3ba447a597de78930e03dd14ffc8aa7adbd42df2"],"state_sha256":"55ddb741b263594b689f187848521ddfa59761b387a9a79a45ec54eb9208f064"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G0vjzda4WUAnWMRGjp8DayQ2sKWqlPNuT1IFotIg6JHk8y0e5m3mbYaE9UkmwQ6/LBecDp+fBtXs3ygX+GfwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T05:30:05.200359Z","bundle_sha256":"eb353dcb22ac37f855d1f9dc7abb4ebc78a6e3a9ec6a54e66b8fe836ea553606"}}