{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:4WZV3HPPQB73B7XJSEGSVH3NDB","short_pith_number":"pith:4WZV3HPP","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"},"canonical_sha256":"e5b35d9def807fb0fee9910d2a9f6d1868822bacd6f487911bbbdfe235a8a26a","source":{"kind":"arxiv","id":"cs/0606048","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0606048","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0606048v1","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0606048","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"4WZV3HPPQB73","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"4WZV3HPPQB73B7XJ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"4WZV3HPP","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:4WZV3HPPQB73B7XJSEGSVH3NDB","target":"record","payload":{"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"},"canonical_sha256":"e5b35d9def807fb0fee9910d2a9f6d1868822bacd6f487911bbbdfe235a8a26a","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"},"source_kind":"arxiv","source_id":"cs/0606048","source_version":1,"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:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f6/9ZzASWJbeDOy0vH5Z2+bRq6Y8yKnbGSVXMOLHlUOQ5xiZYERdE+1IUnAfMdJkAqmMWZZN0avx6lmoXAl/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:54:41.007828Z"},"content_sha256":"82cae8ccf5785fcef6498ed7c7aa768d6909ac4c6d09d80cf51402ea301bf413","schema_version":"1.0","event_id":"sha256:82cae8ccf5785fcef6498ed7c7aa768d6909ac4c6d09d80cf51402ea301bf413"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:4WZV3HPPQB73B7XJSEGSVH3NDB","target":"graph","payload":{"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"},"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:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+lie6AGRIuOTW+/hjyoCVz6nhdFlifmqSS9w7+DqrdtguIuuBbUSXU30DDD0cboIF9v/hMOPNV6A5f2YqW8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:54:41.008201Z"},"content_sha256":"5f9cd350ea1e65738cac999e017bb3a2ac3580c09548b775cc5a3580f3801816","schema_version":"1.0","event_id":"sha256:5f9cd350ea1e65738cac999e017bb3a2ac3580c09548b775cc5a3580f3801816"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/bundle.json","state_url":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/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-21T10:54:41Z","links":{"resolver":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB","bundle":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/bundle.json","state":"https://pith.science/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WZV3HPPQB73B7XJSEGSVH3NDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:4WZV3HPPQB73B7XJSEGSVH3NDB","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":"6baa82a6d7e8f8fa9dbf2f0c8969a8a1dda23bad23619eaf29e318a77576d125","cross_cats_sorted":["cs.CV","cs.DM","math.ST","physics.data-an","q-bio.QM","stat.TH"],"license":"","primary_cat":"cs.DS","submitted_at":"2006-06-11T16:05:51Z","title_canon_sha256":"1b8816ba1a232c18dbfcdd62b8cda076bb0269eb74668a98f279dd938fcc69bc"},"schema_version":"1.0","source":{"id":"cs/0606048","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0606048","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0606048v1","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0606048","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"4WZV3HPPQB73","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"4WZV3HPPQB73B7XJ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"4WZV3HPP","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:5f9cd350ea1e65738cac999e017bb3a2ac3580c09548b775cc5a3580f3801816","target":"graph","created_at":"2026-05-18T04:08:54Z","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":"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","authors_text":"Paul M.B. Vitanyi, Rudi Cilibrasi","cross_cats":["cs.CV","cs.DM","math.ST","physics.data-an","q-bio.QM","stat.TH"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2006-06-11T16:05:51Z","title":"A New Quartet Tree Heuristic for Hierarchical Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0606048","kind":"arxiv","version":1},"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:82cae8ccf5785fcef6498ed7c7aa768d6909ac4c6d09d80cf51402ea301bf413","target":"record","created_at":"2026-05-18T04:08:54Z","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":"6baa82a6d7e8f8fa9dbf2f0c8969a8a1dda23bad23619eaf29e318a77576d125","cross_cats_sorted":["cs.CV","cs.DM","math.ST","physics.data-an","q-bio.QM","stat.TH"],"license":"","primary_cat":"cs.DS","submitted_at":"2006-06-11T16:05:51Z","title_canon_sha256":"1b8816ba1a232c18dbfcdd62b8cda076bb0269eb74668a98f279dd938fcc69bc"},"schema_version":"1.0","source":{"id":"cs/0606048","kind":"arxiv","version":1}},"canonical_sha256":"e5b35d9def807fb0fee9910d2a9f6d1868822bacd6f487911bbbdfe235a8a26a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5b35d9def807fb0fee9910d2a9f6d1868822bacd6f487911bbbdfe235a8a26a","first_computed_at":"2026-05-18T04:08:54.047938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:54.047938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cS+qo2JqkwH0/Ax0E4R0Th5nawOI0O6UOu97Kn2epoHNxC0SWZWIwLdIbVuJiEKAgbB0wYaDSp1nI5Zw/n2+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:54.048673Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0606048","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82cae8ccf5785fcef6498ed7c7aa768d6909ac4c6d09d80cf51402ea301bf413","sha256:5f9cd350ea1e65738cac999e017bb3a2ac3580c09548b775cc5a3580f3801816"],"state_sha256":"0be88663c0e59425e0339f7aadf38ef3abf21e286d4b7853a53d386ca7d2747e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdY+StImIUi3aTuOeAg2fwS335YHyjjiCxCMevIvCpy2Wk+ZhxvrHEVuPTkchjJJdEOYIltGClAoBVlLodoBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T10:54:41.010264Z","bundle_sha256":"8a0b9b010336a4ab49fa30d1047ecfc5a1a8c9e9e3dd482f9a8399aad8b53b74"}}