{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FAEGN6M65ZHS75IKX2ITGL6JFS","short_pith_number":"pith:FAEGN6M6","schema_version":"1.0","canonical_sha256":"280866f99eee4f2ff50abe91332fc92ca199804f332677feafc21cb1e3601e85","source":{"kind":"arxiv","id":"2405.07110","version":1},"attestation_state":"computed","paper":{"title":"A Vector Representation for Phylogenetic Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Caroline Colijn, Cedric Chauve, Louxin Zhang","submitted_at":"2024-05-11T22:59:57Z","abstract_excerpt":"Good representations for phylogenetic trees and networks are important for optimizing storage efficiency and implementation of scalable methods for the inference and analysis of evolutionary trees for genes, genomes and species. We introduce a new representation for rooted phylogenetic trees that encodes a binary tree on n taxa as a vector of length 2n in which each taxon appears exactly twice. Using this new tree representation, we introduce a novel tree rearrangement operator, called a HOP, that results in a tree space of diameter n and a quadratic neighbourhood size. We also introduce a nov"},"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":"2405.07110","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.PE","submitted_at":"2024-05-11T22:59:57Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"4f58fdd7fef85a004d28d11e23a5bca63c5ad8ad47d50efc5edda73ec5e37364","abstract_canon_sha256":"7068dc0905696c87cb45555c7c7d5f71a29b9a77823a365c9bda2185a6d7a1da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:16.609847Z","signature_b64":"9/O+CN3hzbIKgop+Zyzm0yabScjRy+YC6pvRJ3Bj8UmHu9BkKW7TlNGm5zvAdAF93MTBQEYV/n5on0gRWR0aBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"280866f99eee4f2ff50abe91332fc92ca199804f332677feafc21cb1e3601e85","last_reissued_at":"2026-07-05T08:18:16.609323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:16.609323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Vector Representation for Phylogenetic Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Caroline Colijn, Cedric Chauve, Louxin Zhang","submitted_at":"2024-05-11T22:59:57Z","abstract_excerpt":"Good representations for phylogenetic trees and networks are important for optimizing storage efficiency and implementation of scalable methods for the inference and analysis of evolutionary trees for genes, genomes and species. We introduce a new representation for rooted phylogenetic trees that encodes a binary tree on n taxa as a vector of length 2n in which each taxon appears exactly twice. Using this new tree representation, we introduce a novel tree rearrangement operator, called a HOP, that results in a tree space of diameter n and a quadratic neighbourhood size. We also introduce a nov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07110","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.07110/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.07110","created_at":"2026-07-05T08:18:16.609383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.07110v1","created_at":"2026-07-05T08:18:16.609383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07110","created_at":"2026-07-05T08:18:16.609383+00:00"},{"alias_kind":"pith_short_12","alias_value":"FAEGN6M65ZHS","created_at":"2026-07-05T08:18:16.609383+00:00"},{"alias_kind":"pith_short_16","alias_value":"FAEGN6M65ZHS75IK","created_at":"2026-07-05T08:18:16.609383+00:00"},{"alias_kind":"pith_short_8","alias_value":"FAEGN6M6","created_at":"2026-07-05T08:18:16.609383+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/FAEGN6M65ZHS75IKX2ITGL6JFS","json":"https://pith.science/pith/FAEGN6M65ZHS75IKX2ITGL6JFS.json","graph_json":"https://pith.science/api/pith-number/FAEGN6M65ZHS75IKX2ITGL6JFS/graph.json","events_json":"https://pith.science/api/pith-number/FAEGN6M65ZHS75IKX2ITGL6JFS/events.json","paper":"https://pith.science/paper/FAEGN6M6"},"agent_actions":{"view_html":"https://pith.science/pith/FAEGN6M65ZHS75IKX2ITGL6JFS","download_json":"https://pith.science/pith/FAEGN6M65ZHS75IKX2ITGL6JFS.json","view_paper":"https://pith.science/paper/FAEGN6M6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.07110&json=true","fetch_graph":"https://pith.science/api/pith-number/FAEGN6M65ZHS75IKX2ITGL6JFS/graph.json","fetch_events":"https://pith.science/api/pith-number/FAEGN6M65ZHS75IKX2ITGL6JFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FAEGN6M65ZHS75IKX2ITGL6JFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FAEGN6M65ZHS75IKX2ITGL6JFS/action/storage_attestation","attest_author":"https://pith.science/pith/FAEGN6M65ZHS75IKX2ITGL6JFS/action/author_attestation","sign_citation":"https://pith.science/pith/FAEGN6M65ZHS75IKX2ITGL6JFS/action/citation_signature","submit_replication":"https://pith.science/pith/FAEGN6M65ZHS75IKX2ITGL6JFS/action/replication_record"}},"created_at":"2026-07-05T08:18:16.609383+00:00","updated_at":"2026-07-05T08:18:16.609383+00:00"}