{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WZDOEHEN4MXSKDZIIUX3DD4C73","short_pith_number":"pith:WZDOEHEN","schema_version":"1.0","canonical_sha256":"b646e21c8de32f250f28452fb18f82feee5e504bc80ea8544e502c1b451e5ff5","source":{"kind":"arxiv","id":"1705.10548","version":2},"attestation_state":"computed","paper":{"title":"A Faster Construction of Greedy Consensus Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gad M. Landau, Oren Weimann, Pawe{\\l} Gawrychowski, Wing-Kin Sung","submitted_at":"2017-05-30T11:12:33Z","abstract_excerpt":"A consensus tree is a phylogenetic tree that captures the similarity between a set of conflicting phylogenetic trees. The problem of computing a consensus tree is a major step in phylogenetic tree reconstruction. It also finds applications in predicting a species tree from a set of gene trees. This paper focuses on two of the most well-known and widely used oconsensus tree methods: the greedy consensus tree and the frequency difference consensus tree. Given $k$ conflicting trees each with $n$ leaves, the previous fastest algorithms for these problems were $O(k n^2)$ for the greedy consensus tr"},"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":"1705.10548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T11:12:33Z","cross_cats_sorted":[],"title_canon_sha256":"2ce046355f01b31e08cde9467536778322aa6666fa95b9b5eaddf7e9ff7f7252","abstract_canon_sha256":"bc87320d5ce16eb366726b29c2b3cb58e7c0d4357d611bf16df98b3dabffdc09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:57.506835Z","signature_b64":"+6s4EfKE6wSa+BAZx+9qi9psToyzW3IrI3j6nzBj6cYJ/AEK9T/Om3PdeZAnWRKjt7NVOAn0ZkytwP0BUo5xCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b646e21c8de32f250f28452fb18f82feee5e504bc80ea8544e502c1b451e5ff5","last_reissued_at":"2026-05-18T00:40:57.506421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:57.506421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Construction of Greedy Consensus Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gad M. Landau, Oren Weimann, Pawe{\\l} Gawrychowski, Wing-Kin Sung","submitted_at":"2017-05-30T11:12:33Z","abstract_excerpt":"A consensus tree is a phylogenetic tree that captures the similarity between a set of conflicting phylogenetic trees. The problem of computing a consensus tree is a major step in phylogenetic tree reconstruction. It also finds applications in predicting a species tree from a set of gene trees. This paper focuses on two of the most well-known and widely used oconsensus tree methods: the greedy consensus tree and the frequency difference consensus tree. Given $k$ conflicting trees each with $n$ leaves, the previous fastest algorithms for these problems were $O(k n^2)$ for the greedy consensus tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10548","kind":"arxiv","version":2},"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":"1705.10548","created_at":"2026-05-18T00:40:57.506482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10548v2","created_at":"2026-05-18T00:40:57.506482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10548","created_at":"2026-05-18T00:40:57.506482+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZDOEHEN4MXS","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZDOEHEN4MXSKDZI","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZDOEHEN","created_at":"2026-05-18T12:31:53.515858+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/WZDOEHEN4MXSKDZIIUX3DD4C73","json":"https://pith.science/pith/WZDOEHEN4MXSKDZIIUX3DD4C73.json","graph_json":"https://pith.science/api/pith-number/WZDOEHEN4MXSKDZIIUX3DD4C73/graph.json","events_json":"https://pith.science/api/pith-number/WZDOEHEN4MXSKDZIIUX3DD4C73/events.json","paper":"https://pith.science/paper/WZDOEHEN"},"agent_actions":{"view_html":"https://pith.science/pith/WZDOEHEN4MXSKDZIIUX3DD4C73","download_json":"https://pith.science/pith/WZDOEHEN4MXSKDZIIUX3DD4C73.json","view_paper":"https://pith.science/paper/WZDOEHEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10548&json=true","fetch_graph":"https://pith.science/api/pith-number/WZDOEHEN4MXSKDZIIUX3DD4C73/graph.json","fetch_events":"https://pith.science/api/pith-number/WZDOEHEN4MXSKDZIIUX3DD4C73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZDOEHEN4MXSKDZIIUX3DD4C73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZDOEHEN4MXSKDZIIUX3DD4C73/action/storage_attestation","attest_author":"https://pith.science/pith/WZDOEHEN4MXSKDZIIUX3DD4C73/action/author_attestation","sign_citation":"https://pith.science/pith/WZDOEHEN4MXSKDZIIUX3DD4C73/action/citation_signature","submit_replication":"https://pith.science/pith/WZDOEHEN4MXSKDZIIUX3DD4C73/action/replication_record"}},"created_at":"2026-05-18T00:40:57.506482+00:00","updated_at":"2026-05-18T00:40:57.506482+00:00"}