{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FS37MNHDMXCNC3LHTE5LAZIJAA","short_pith_number":"pith:FS37MNHD","schema_version":"1.0","canonical_sha256":"2cb7f634e365c4d16d67993ab06509003866fbc65d9ec5d466c8cd798cdb5bb8","source":{"kind":"arxiv","id":"1307.5908","version":1},"attestation_state":"computed","paper":{"title":"Distance-based phylogenetic methods around a polytomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","q-bio.QM"],"primary_cat":"q-bio.PE","authors_text":"Ruth Davidson, Seth Sullivant","submitted_at":"2013-07-22T23:23:07Z","abstract_excerpt":"Distance-based phylogenetic algorithms attempt to solve the NP-hard least squares phylogeny problem by mapping an arbitrary dissimilarity map representing biological data to a tree metric. The set of all dissimilarity maps is a Euclidean space properly containing the space of all tree metrics as a polyhedral fan. Outputs of distance-based tree reconstruction algorithms such as UPGMA and Neighbor-Joining are points in the maximal cones in the fan. Tree metrics with polytomies lie at the intersections of maximal cones.\n  A phylogenetic algorithm divides the space of all dissimilarity maps into r"},"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":"1307.5908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-07-22T23:23:07Z","cross_cats_sorted":["math.CO","q-bio.QM"],"title_canon_sha256":"3913804974a345fa970a7758fde1950aff5c8684738df118d87fe5a1a76a83a0","abstract_canon_sha256":"95a3bdf11b36d2311878331bbdd789ead3453de106de9449888070bdc41fcf49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:45.828949Z","signature_b64":"D+6lxHW0XlM089ARzJQZjq+E75onY6UOwaanJjgqlyYQBU95nzUc1MeTGI0lWV3FaPP5oclWu8HyovA0DWjMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cb7f634e365c4d16d67993ab06509003866fbc65d9ec5d466c8cd798cdb5bb8","last_reissued_at":"2026-05-18T03:17:45.828383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:45.828383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance-based phylogenetic methods around a polytomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","q-bio.QM"],"primary_cat":"q-bio.PE","authors_text":"Ruth Davidson, Seth Sullivant","submitted_at":"2013-07-22T23:23:07Z","abstract_excerpt":"Distance-based phylogenetic algorithms attempt to solve the NP-hard least squares phylogeny problem by mapping an arbitrary dissimilarity map representing biological data to a tree metric. The set of all dissimilarity maps is a Euclidean space properly containing the space of all tree metrics as a polyhedral fan. Outputs of distance-based tree reconstruction algorithms such as UPGMA and Neighbor-Joining are points in the maximal cones in the fan. Tree metrics with polytomies lie at the intersections of maximal cones.\n  A phylogenetic algorithm divides the space of all dissimilarity maps into r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5908","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":"1307.5908","created_at":"2026-05-18T03:17:45.828454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5908v1","created_at":"2026-05-18T03:17:45.828454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5908","created_at":"2026-05-18T03:17:45.828454+00:00"},{"alias_kind":"pith_short_12","alias_value":"FS37MNHDMXCN","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FS37MNHDMXCNC3LH","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FS37MNHD","created_at":"2026-05-18T12:27:45.050594+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/FS37MNHDMXCNC3LHTE5LAZIJAA","json":"https://pith.science/pith/FS37MNHDMXCNC3LHTE5LAZIJAA.json","graph_json":"https://pith.science/api/pith-number/FS37MNHDMXCNC3LHTE5LAZIJAA/graph.json","events_json":"https://pith.science/api/pith-number/FS37MNHDMXCNC3LHTE5LAZIJAA/events.json","paper":"https://pith.science/paper/FS37MNHD"},"agent_actions":{"view_html":"https://pith.science/pith/FS37MNHDMXCNC3LHTE5LAZIJAA","download_json":"https://pith.science/pith/FS37MNHDMXCNC3LHTE5LAZIJAA.json","view_paper":"https://pith.science/paper/FS37MNHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5908&json=true","fetch_graph":"https://pith.science/api/pith-number/FS37MNHDMXCNC3LHTE5LAZIJAA/graph.json","fetch_events":"https://pith.science/api/pith-number/FS37MNHDMXCNC3LHTE5LAZIJAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FS37MNHDMXCNC3LHTE5LAZIJAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FS37MNHDMXCNC3LHTE5LAZIJAA/action/storage_attestation","attest_author":"https://pith.science/pith/FS37MNHDMXCNC3LHTE5LAZIJAA/action/author_attestation","sign_citation":"https://pith.science/pith/FS37MNHDMXCNC3LHTE5LAZIJAA/action/citation_signature","submit_replication":"https://pith.science/pith/FS37MNHDMXCNC3LHTE5LAZIJAA/action/replication_record"}},"created_at":"2026-05-18T03:17:45.828454+00:00","updated_at":"2026-05-18T03:17:45.828454+00:00"}