{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:4WZV3HPPQB73B7XJSEGSVH3NDB","short_pith_number":"pith:4WZV3HPP","schema_version":"1.0","canonical_sha256":"e5b35d9def807fb0fee9910d2a9f6d1868822bacd6f487911bbbdfe235a8a26a","source":{"kind":"arxiv","id":"cs/0606048","version":1},"attestation_state":"computed","paper":{"title":"A New Quartet Tree Heuristic for Hierarchical Clustering","license":"","headline":"","cross_cats":["cs.CV","cs.DM","math.ST","physics.data-an","q-bio.QM","stat.TH"],"primary_cat":"cs.DS","authors_text":"Paul M.B. Vitanyi, Rudi Cilibrasi","submitted_at":"2006-06-11T16:05:51Z","abstract_excerpt":"We consider the problem of constructing an an optimal-weight tree from the 3*(n choose 4) weighted quartet topologies on n objects, where optimality means that the summed weight of the embedded quartet topologiesis optimal (so it can be the case that the optimal tree embeds all quartets as non-optimal topologies). We present a heuristic for reconstructing the optimal-weight tree, and a canonical manner to derive the quartet-topology weights from a given distance matrix. The method repeatedly transforms a bifurcating tree, with all objects involved as leaves, achieving a monotonic approximation"},"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":"cs/0606048","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-06-11T16:05:51Z","cross_cats_sorted":["cs.CV","cs.DM","math.ST","physics.data-an","q-bio.QM","stat.TH"],"title_canon_sha256":"1b8816ba1a232c18dbfcdd62b8cda076bb0269eb74668a98f279dd938fcc69bc","abstract_canon_sha256":"6baa82a6d7e8f8fa9dbf2f0c8969a8a1dda23bad23619eaf29e318a77576d125"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:54.048673Z","signature_b64":"cS+qo2JqkwH0/Ax0E4R0Th5nawOI0O6UOu97Kn2epoHNxC0SWZWIwLdIbVuJiEKAgbB0wYaDSp1nI5Zw/n2+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5b35d9def807fb0fee9910d2a9f6d1868822bacd6f487911bbbdfe235a8a26a","last_reissued_at":"2026-05-18T04:08:54.047938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:54.047938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Quartet Tree Heuristic for Hierarchical Clustering","license":"","headline":"","cross_cats":["cs.CV","cs.DM","math.ST","physics.data-an","q-bio.QM","stat.TH"],"primary_cat":"cs.DS","authors_text":"Paul M.B. Vitanyi, Rudi Cilibrasi","submitted_at":"2006-06-11T16:05:51Z","abstract_excerpt":"We consider the problem of constructing an an optimal-weight tree from the 3*(n choose 4) weighted quartet topologies on n objects, where optimality means that the summed weight of the embedded quartet topologiesis optimal (so it can be the case that the optimal tree embeds all quartets as non-optimal topologies). We present a heuristic for reconstructing the optimal-weight tree, and a canonical manner to derive the quartet-topology weights from a given distance matrix. The method repeatedly transforms a bifurcating tree, with all objects involved as leaves, achieving a monotonic approximation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0606048","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":"cs/0606048","created_at":"2026-05-18T04:08:54.048069+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0606048v1","created_at":"2026-05-18T04:08:54.048069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0606048","created_at":"2026-05-18T04:08:54.048069+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WZV3HPPQB73","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WZV3HPPQB73B7XJ","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WZV3HPP","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/4WZV3HPPQB73B7XJSEGSVH3NDB","json":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB.json","graph_json":"https://pith.science/api/pith-number/4WZV3HPPQB73B7XJSEGSVH3NDB/graph.json","events_json":"https://pith.science/api/pith-number/4WZV3HPPQB73B7XJSEGSVH3NDB/events.json","paper":"https://pith.science/paper/4WZV3HPP"},"agent_actions":{"view_html":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB","download_json":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB.json","view_paper":"https://pith.science/paper/4WZV3HPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0606048&json=true","fetch_graph":"https://pith.science/api/pith-number/4WZV3HPPQB73B7XJSEGSVH3NDB/graph.json","fetch_events":"https://pith.science/api/pith-number/4WZV3HPPQB73B7XJSEGSVH3NDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/action/storage_attestation","attest_author":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/action/author_attestation","sign_citation":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/action/citation_signature","submit_replication":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/action/replication_record"}},"created_at":"2026-05-18T04:08:54.048069+00:00","updated_at":"2026-05-18T04:08:54.048069+00:00"}