{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XAN53SEESMN4JEUZPS6G7ODIKC","short_pith_number":"pith:XAN53SEE","schema_version":"1.0","canonical_sha256":"b81bddc884931bc492997cbc6fb86850a7ed96a36601103387f488cfd8ab5a31","source":{"kind":"arxiv","id":"1510.07758","version":1},"attestation_state":"computed","paper":{"title":"Fast Compatibility Testing for Rooted Phylogenetic Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Fern\\'andez-Baca, Yun Deng","submitted_at":"2015-10-27T02:59:29Z","abstract_excerpt":"We consider the following basic problem in phylogenetic tree construction. Let $\\mathcal{P} = \\{T_1, \\ldots, T_k\\}$ be a collection of rooted phylogenetic trees over various subsets of a set of species. The tree compatibility problem asks whether there is a tree $T$ with the following property: for each $i \\in \\{1, \\dots, k\\}$, $T_i$ can be obtained from the restriction of $T$ to the species set of $T_i$ by contracting zero or more edges. If such a tree $T$ exists, we say that $\\mathcal{P}$ is compatible.\n  We give a $\\tilde{O}(M_\\mathcal{P})$ algorithm for the tree compatibility problem, wher"},"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":"1510.07758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-27T02:59:29Z","cross_cats_sorted":[],"title_canon_sha256":"eb0c9fa93ee98610f09aeacc9fcd76ce38ea6ba8f2f7a263195896ddef885de6","abstract_canon_sha256":"756daf04fff45a2ef7e91035f3120666343fe2489a84c35e0878c902dc341df7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:12.711846Z","signature_b64":"P1wBxeiKqJAQiIvecd6D2gKEEOUqHpKjUbLFc++FDYdK+2GYdf44g1Kv446ulqaW8SfpAg0qb0zh5yPQXLNiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b81bddc884931bc492997cbc6fb86850a7ed96a36601103387f488cfd8ab5a31","last_reissued_at":"2026-05-18T01:29:12.711145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:12.711145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Compatibility Testing for Rooted Phylogenetic Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Fern\\'andez-Baca, Yun Deng","submitted_at":"2015-10-27T02:59:29Z","abstract_excerpt":"We consider the following basic problem in phylogenetic tree construction. Let $\\mathcal{P} = \\{T_1, \\ldots, T_k\\}$ be a collection of rooted phylogenetic trees over various subsets of a set of species. The tree compatibility problem asks whether there is a tree $T$ with the following property: for each $i \\in \\{1, \\dots, k\\}$, $T_i$ can be obtained from the restriction of $T$ to the species set of $T_i$ by contracting zero or more edges. If such a tree $T$ exists, we say that $\\mathcal{P}$ is compatible.\n  We give a $\\tilde{O}(M_\\mathcal{P})$ algorithm for the tree compatibility problem, wher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07758","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":"1510.07758","created_at":"2026-05-18T01:29:12.711265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07758v1","created_at":"2026-05-18T01:29:12.711265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07758","created_at":"2026-05-18T01:29:12.711265+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAN53SEESMN4","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAN53SEESMN4JEUZ","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAN53SEE","created_at":"2026-05-18T12:29:50.041715+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/XAN53SEESMN4JEUZPS6G7ODIKC","json":"https://pith.science/pith/XAN53SEESMN4JEUZPS6G7ODIKC.json","graph_json":"https://pith.science/api/pith-number/XAN53SEESMN4JEUZPS6G7ODIKC/graph.json","events_json":"https://pith.science/api/pith-number/XAN53SEESMN4JEUZPS6G7ODIKC/events.json","paper":"https://pith.science/paper/XAN53SEE"},"agent_actions":{"view_html":"https://pith.science/pith/XAN53SEESMN4JEUZPS6G7ODIKC","download_json":"https://pith.science/pith/XAN53SEESMN4JEUZPS6G7ODIKC.json","view_paper":"https://pith.science/paper/XAN53SEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07758&json=true","fetch_graph":"https://pith.science/api/pith-number/XAN53SEESMN4JEUZPS6G7ODIKC/graph.json","fetch_events":"https://pith.science/api/pith-number/XAN53SEESMN4JEUZPS6G7ODIKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAN53SEESMN4JEUZPS6G7ODIKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAN53SEESMN4JEUZPS6G7ODIKC/action/storage_attestation","attest_author":"https://pith.science/pith/XAN53SEESMN4JEUZPS6G7ODIKC/action/author_attestation","sign_citation":"https://pith.science/pith/XAN53SEESMN4JEUZPS6G7ODIKC/action/citation_signature","submit_replication":"https://pith.science/pith/XAN53SEESMN4JEUZPS6G7ODIKC/action/replication_record"}},"created_at":"2026-05-18T01:29:12.711265+00:00","updated_at":"2026-05-18T01:29:12.711265+00:00"}