{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:WX3URIBJ4SN46FF7SUPM62B2CU","short_pith_number":"pith:WX3URIBJ","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"},"canonical_sha256":"b5f748a029e49bcf14bf951ecf683a15273c95e07dea716c932cae5e2de3730c","source":{"kind":"arxiv","id":"math/0504378","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0504378","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"math/0504378v2","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0504378","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"WX3URIBJ4SN4","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"WX3URIBJ4SN46FF7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"WX3URIBJ","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:WX3URIBJ4SN46FF7SUPM62B2CU","target":"record","payload":{"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"},"canonical_sha256":"b5f748a029e49bcf14bf951ecf683a15273c95e07dea716c932cae5e2de3730c","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"},"source_kind":"arxiv","source_id":"math/0504378","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-18T04:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C9pVTlzYJioemGxG4y+hcmdRcbekA0H+19wwAFYKB0Xk1xeXa7Bc2LXqUCA52Df7Wcu6NNHGyW4nciz0bhkXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:10:27.200016Z"},"content_sha256":"cb04b12a011c46e365154b114223565ef6e611ebf29232287d83560a874bd7db","schema_version":"1.0","event_id":"sha256:cb04b12a011c46e365154b114223565ef6e611ebf29232287d83560a874bd7db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:WX3URIBJ4SN46FF7SUPM62B2CU","target":"graph","payload":{"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"},"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-18T04:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hP3CurHw1Iauj9W6I/yirD04odMnGyvbSIO17TR3SPXC1LGRhEFfUvS77Y8gzZf70mEDDs56kgyJv25AskPvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:10:27.200691Z"},"content_sha256":"7aa6c75b3bb9b1e9b5be434cbcf4d571af239ea12d48e086e9a5aca1d226b551","schema_version":"1.0","event_id":"sha256:7aa6c75b3bb9b1e9b5be434cbcf4d571af239ea12d48e086e9a5aca1d226b551"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU/bundle.json","state_url":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WX3URIBJ4SN46FF7SUPM62B2CU/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-05T21:10:27Z","links":{"resolver":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU","bundle":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU/bundle.json","state":"https://pith.science/pith/WX3URIBJ4SN46FF7SUPM62B2CU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WX3URIBJ4SN46FF7SUPM62B2CU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:WX3URIBJ4SN46FF7SUPM62B2CU","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":"370432be95c6958f032514688c438cde9604b8949d0f2d65a2b08d4d0ea345b6","cross_cats_sorted":["cs.CC","cs.CE","math.ST","q-bio.PE","stat.TH"],"license":"","primary_cat":"math.PR","submitted_at":"2005-04-19T08:36:17Z","title_canon_sha256":"c2e4f57a4affebbb663bfc8f02443d764b6ea2a6e196cc018a56acbda1a00a49"},"schema_version":"1.0","source":{"id":"math/0504378","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0504378","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"math/0504378v2","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0504378","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"WX3URIBJ4SN4","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"WX3URIBJ4SN46FF7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"WX3URIBJ","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:7aa6c75b3bb9b1e9b5be434cbcf4d571af239ea12d48e086e9a5aca1d226b551","target":"graph","created_at":"2026-05-18T04:12:00Z","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":"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.","authors_text":"S. Roch","cross_cats":["cs.CC","cs.CE","math.ST","q-bio.PE","stat.TH"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2005-04-19T08:36:17Z","title":"A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0504378","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:cb04b12a011c46e365154b114223565ef6e611ebf29232287d83560a874bd7db","target":"record","created_at":"2026-05-18T04:12:00Z","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":"370432be95c6958f032514688c438cde9604b8949d0f2d65a2b08d4d0ea345b6","cross_cats_sorted":["cs.CC","cs.CE","math.ST","q-bio.PE","stat.TH"],"license":"","primary_cat":"math.PR","submitted_at":"2005-04-19T08:36:17Z","title_canon_sha256":"c2e4f57a4affebbb663bfc8f02443d764b6ea2a6e196cc018a56acbda1a00a49"},"schema_version":"1.0","source":{"id":"math/0504378","kind":"arxiv","version":2}},"canonical_sha256":"b5f748a029e49bcf14bf951ecf683a15273c95e07dea716c932cae5e2de3730c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5f748a029e49bcf14bf951ecf683a15273c95e07dea716c932cae5e2de3730c","first_computed_at":"2026-05-18T04:12:00.935947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:00.935947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JiUwZ5jOoC5LIMb1uPfOSuM2iF7O7s6IblCoQqbrvHQT7DnffUi3eoAJLONZyhI55GBZEZqduD4BVejfyIuVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:00.936518Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0504378","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb04b12a011c46e365154b114223565ef6e611ebf29232287d83560a874bd7db","sha256:7aa6c75b3bb9b1e9b5be434cbcf4d571af239ea12d48e086e9a5aca1d226b551"],"state_sha256":"b5aa6703bed52ead816eaa8e4ce38b0b1cf69007b90514b0bab0f3e6550c8adc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gB6jU3fclP5xSk2ePd0aX6gv6arBtFb1VLUcEy5i3/q+1fNIcwJ0fx5QBKUBJcAKadr4zs4w1Xi4kOQqFs8zDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:10:27.204847Z","bundle_sha256":"c163746f67251beb6dd0a96c0454c900757267b4b92a417f18bff4920705b672"}}