{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:WX3URIBJ4SN46FF7SUPM62B2CU","short_pith_number":"pith:WX3URIBJ","schema_version":"1.0","canonical_sha256":"b5f748a029e49bcf14bf951ecf683a15273c95e07dea716c932cae5e2de3730c","source":{"kind":"arxiv","id":"math/0504378","version":2},"attestation_state":"computed","paper":{"title":"A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard","license":"","headline":"","cross_cats":["cs.CC","cs.CE","math.ST","q-bio.PE","stat.TH"],"primary_cat":"math.PR","authors_text":"S. Roch","submitted_at":"2005-04-19T08:36:17Z","abstract_excerpt":"Maximum likelihood is one of the most widely used techniques to infer evolutionary histories. Although it is thought to be intractable, a proof of its hardness has been lacking. Here, we give a short proof that computing the maximum likelihood tree is NP-hard by exploiting a connection between likelihood and parsimony observed by Tuffley and Steel."},"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":"math/0504378","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2005-04-19T08:36:17Z","cross_cats_sorted":["cs.CC","cs.CE","math.ST","q-bio.PE","stat.TH"],"title_canon_sha256":"c2e4f57a4affebbb663bfc8f02443d764b6ea2a6e196cc018a56acbda1a00a49","abstract_canon_sha256":"370432be95c6958f032514688c438cde9604b8949d0f2d65a2b08d4d0ea345b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:00.936518Z","signature_b64":"JiUwZ5jOoC5LIMb1uPfOSuM2iF7O7s6IblCoQqbrvHQT7DnffUi3eoAJLONZyhI55GBZEZqduD4BVejfyIuVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5f748a029e49bcf14bf951ecf683a15273c95e07dea716c932cae5e2de3730c","last_reissued_at":"2026-05-18T04:12:00.935947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:00.935947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard","license":"","headline":"","cross_cats":["cs.CC","cs.CE","math.ST","q-bio.PE","stat.TH"],"primary_cat":"math.PR","authors_text":"S. Roch","submitted_at":"2005-04-19T08:36:17Z","abstract_excerpt":"Maximum likelihood is one of the most widely used techniques to infer evolutionary histories. Although it is thought to be intractable, a proof of its hardness has been lacking. Here, we give a short proof that computing the maximum likelihood tree is NP-hard by exploiting a connection between likelihood and parsimony observed by Tuffley and Steel."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0504378","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":"math/0504378","created_at":"2026-05-18T04:12:00.936011+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0504378v2","created_at":"2026-05-18T04:12:00.936011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0504378","created_at":"2026-05-18T04:12:00.936011+00:00"},{"alias_kind":"pith_short_12","alias_value":"WX3URIBJ4SN4","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"WX3URIBJ4SN46FF7","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"WX3URIBJ","created_at":"2026-05-18T12:25:53.939244+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/WX3URIBJ4SN46FF7SUPM62B2CU","json":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU.json","graph_json":"https://pith.science/api/pith-number/WX3URIBJ4SN46FF7SUPM62B2CU/graph.json","events_json":"https://pith.science/api/pith-number/WX3URIBJ4SN46FF7SUPM62B2CU/events.json","paper":"https://pith.science/paper/WX3URIBJ"},"agent_actions":{"view_html":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU","download_json":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU.json","view_paper":"https://pith.science/paper/WX3URIBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0504378&json=true","fetch_graph":"https://pith.science/api/pith-number/WX3URIBJ4SN46FF7SUPM62B2CU/graph.json","fetch_events":"https://pith.science/api/pith-number/WX3URIBJ4SN46FF7SUPM62B2CU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU/action/storage_attestation","attest_author":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU/action/author_attestation","sign_citation":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU/action/citation_signature","submit_replication":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU/action/replication_record"}},"created_at":"2026-05-18T04:12:00.936011+00:00","updated_at":"2026-05-18T04:12:00.936011+00:00"}