{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NIOZY5VL2FX4DP4T53CC23CYOC","short_pith_number":"pith:NIOZY5VL","schema_version":"1.0","canonical_sha256":"6a1d9c76abd16fc1bf93eec42d6c5870bd2c3ca0a9522f619978b4f2950e46d3","source":{"kind":"arxiv","id":"1604.03008","version":1},"attestation_state":"computed","paper":{"title":"Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Celine Scornavacca, Christophe Paul, Ignasi Sau, Julien Baste","submitted_at":"2016-04-11T15:49:14Z","abstract_excerpt":"In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species $X$; these relationships are often depicted via a phylogenetic tree -- a tree having its leaves univocally labeled by elements of $X$ and without degree-2 nodes -- called the \"species tree\". One common approach for reconstructing a species tree consists in first constructing several phylogenetic trees from primary data (e.g. DNA sequences originating from some species in $X$), and then constructing a single phylogenetic tree maximizing the \"concordance\" with the input trees. The so-obtained "},"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":"1604.03008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-11T15:49:14Z","cross_cats_sorted":[],"title_canon_sha256":"8d26ae9f22c5577a5baeccd07cb6ddd13b464ede58d3cbad137378588be27525","abstract_canon_sha256":"55e1998e5515af571ec124c79bb0d0f47cb454f87dd8cb8007ad76ab29938352"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:21.658844Z","signature_b64":"2T9D9RND03MFWLS9FtH+C2HpcibnvtD9YCEVzs3/+DJc10esUDIbQEl5ILGaMOV9Z2TOpDOOoocx9c+myamoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a1d9c76abd16fc1bf93eec42d6c5870bd2c3ca0a9522f619978b4f2950e46d3","last_reissued_at":"2026-05-18T01:17:21.658338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:21.658338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Celine Scornavacca, Christophe Paul, Ignasi Sau, Julien Baste","submitted_at":"2016-04-11T15:49:14Z","abstract_excerpt":"In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species $X$; these relationships are often depicted via a phylogenetic tree -- a tree having its leaves univocally labeled by elements of $X$ and without degree-2 nodes -- called the \"species tree\". One common approach for reconstructing a species tree consists in first constructing several phylogenetic trees from primary data (e.g. DNA sequences originating from some species in $X$), and then constructing a single phylogenetic tree maximizing the \"concordance\" with the input trees. The so-obtained "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03008","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":"1604.03008","created_at":"2026-05-18T01:17:21.658416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03008v1","created_at":"2026-05-18T01:17:21.658416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03008","created_at":"2026-05-18T01:17:21.658416+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIOZY5VL2FX4","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIOZY5VL2FX4DP4T","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIOZY5VL","created_at":"2026-05-18T12:30:32.724797+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/NIOZY5VL2FX4DP4T53CC23CYOC","json":"https://pith.science/pith/NIOZY5VL2FX4DP4T53CC23CYOC.json","graph_json":"https://pith.science/api/pith-number/NIOZY5VL2FX4DP4T53CC23CYOC/graph.json","events_json":"https://pith.science/api/pith-number/NIOZY5VL2FX4DP4T53CC23CYOC/events.json","paper":"https://pith.science/paper/NIOZY5VL"},"agent_actions":{"view_html":"https://pith.science/pith/NIOZY5VL2FX4DP4T53CC23CYOC","download_json":"https://pith.science/pith/NIOZY5VL2FX4DP4T53CC23CYOC.json","view_paper":"https://pith.science/paper/NIOZY5VL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03008&json=true","fetch_graph":"https://pith.science/api/pith-number/NIOZY5VL2FX4DP4T53CC23CYOC/graph.json","fetch_events":"https://pith.science/api/pith-number/NIOZY5VL2FX4DP4T53CC23CYOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIOZY5VL2FX4DP4T53CC23CYOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIOZY5VL2FX4DP4T53CC23CYOC/action/storage_attestation","attest_author":"https://pith.science/pith/NIOZY5VL2FX4DP4T53CC23CYOC/action/author_attestation","sign_citation":"https://pith.science/pith/NIOZY5VL2FX4DP4T53CC23CYOC/action/citation_signature","submit_replication":"https://pith.science/pith/NIOZY5VL2FX4DP4T53CC23CYOC/action/replication_record"}},"created_at":"2026-05-18T01:17:21.658416+00:00","updated_at":"2026-05-18T01:17:21.658416+00:00"}