{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FSANL6S3CT3F6SKG2WZQUUWYAW","short_pith_number":"pith:FSANL6S3","schema_version":"1.0","canonical_sha256":"2c80d5fa5b14f65f4946d5b30a52d80590838686288cca3d0e533376bb91e6f9","source":{"kind":"arxiv","id":"1704.00497","version":1},"attestation_state":"computed","paper":{"title":"UPGMA and the normalized equidistant minimum evolution problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"q-bio.PE","authors_text":"Andreas Spillner, Taoyang Wu, Vincent Moulton","submitted_at":"2017-04-03T09:38:33Z","abstract_excerpt":"UPGMA (Unweighted Pair Group Method with Arithmetic Mean) is a widely used clustering method. Here we show that UPGMA is a greedy heuristic for the normalized equidistant minimum evolution (NEME) problem, that is, finding a rooted tree that minimizes the minimum evolution score relative to the dissimilarity matrix among all rooted trees with the same leaf-set in which all leaves have the same distance to the root. We prove that the NEME problem is NP-hard. In addition, we present some heuristic and approximation algorithms for solving the NEME problem, including a polynomial time algorithm tha"},"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":"1704.00497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-04-03T09:38:33Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"f6a9580467d1054b88162d0891aaef8e49b91b992eb0ccfc06e2f26ef307afa5","abstract_canon_sha256":"79027fac721d463a5651a5f73c8e422af14bb88b6929f6b2d9bd86c1955a8dfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:22.192454Z","signature_b64":"TFSC3Chcypc7MuVdyzuG4O3PmIc1H0YCs5+PTPIAOoh8MEtBQb+mj59UVmL80y0tN0xquZydudJGLJ58I65HBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c80d5fa5b14f65f4946d5b30a52d80590838686288cca3d0e533376bb91e6f9","last_reissued_at":"2026-05-18T00:47:22.191965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:22.191965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UPGMA and the normalized equidistant minimum evolution problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"q-bio.PE","authors_text":"Andreas Spillner, Taoyang Wu, Vincent Moulton","submitted_at":"2017-04-03T09:38:33Z","abstract_excerpt":"UPGMA (Unweighted Pair Group Method with Arithmetic Mean) is a widely used clustering method. Here we show that UPGMA is a greedy heuristic for the normalized equidistant minimum evolution (NEME) problem, that is, finding a rooted tree that minimizes the minimum evolution score relative to the dissimilarity matrix among all rooted trees with the same leaf-set in which all leaves have the same distance to the root. We prove that the NEME problem is NP-hard. In addition, we present some heuristic and approximation algorithms for solving the NEME problem, including a polynomial time algorithm tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00497","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.00497","created_at":"2026-05-18T00:47:22.192044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00497v1","created_at":"2026-05-18T00:47:22.192044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00497","created_at":"2026-05-18T00:47:22.192044+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSANL6S3CT3F","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSANL6S3CT3F6SKG","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSANL6S3","created_at":"2026-05-18T12:31:15.632608+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/FSANL6S3CT3F6SKG2WZQUUWYAW","json":"https://pith.science/pith/FSANL6S3CT3F6SKG2WZQUUWYAW.json","graph_json":"https://pith.science/api/pith-number/FSANL6S3CT3F6SKG2WZQUUWYAW/graph.json","events_json":"https://pith.science/api/pith-number/FSANL6S3CT3F6SKG2WZQUUWYAW/events.json","paper":"https://pith.science/paper/FSANL6S3"},"agent_actions":{"view_html":"https://pith.science/pith/FSANL6S3CT3F6SKG2WZQUUWYAW","download_json":"https://pith.science/pith/FSANL6S3CT3F6SKG2WZQUUWYAW.json","view_paper":"https://pith.science/paper/FSANL6S3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00497&json=true","fetch_graph":"https://pith.science/api/pith-number/FSANL6S3CT3F6SKG2WZQUUWYAW/graph.json","fetch_events":"https://pith.science/api/pith-number/FSANL6S3CT3F6SKG2WZQUUWYAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSANL6S3CT3F6SKG2WZQUUWYAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSANL6S3CT3F6SKG2WZQUUWYAW/action/storage_attestation","attest_author":"https://pith.science/pith/FSANL6S3CT3F6SKG2WZQUUWYAW/action/author_attestation","sign_citation":"https://pith.science/pith/FSANL6S3CT3F6SKG2WZQUUWYAW/action/citation_signature","submit_replication":"https://pith.science/pith/FSANL6S3CT3F6SKG2WZQUUWYAW/action/replication_record"}},"created_at":"2026-05-18T00:47:22.192044+00:00","updated_at":"2026-05-18T00:47:22.192044+00:00"}