{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7UNEA4SFZNVRD6QQZTQLVYNTKM","short_pith_number":"pith:7UNEA4SF","schema_version":"1.0","canonical_sha256":"fd1a407245cb6b11fa10cce0bae1b35317267da0e0b5b19625c4f0d6e0bef755","source":{"kind":"arxiv","id":"1312.1255","version":1},"attestation_state":"computed","paper":{"title":"A short note on exponential-time algorithms for hybridization number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"q-bio.PE","authors_text":"Leen Stougie, Leo van Iersel, Nela Lekic, Steven Kelk","submitted_at":"2013-12-04T17:37:37Z","abstract_excerpt":"In this short note we prove that, given two (not necessarily binary) rooted phylogenetic trees T_1, T_2 on the same set of taxa X, where |X|=n, the hybridization number of T_1 and T_2 can be computed in time O^{*}(2^n) i.e. O(2^{n} poly(n)). The result also means that a Maximum Acyclic Agreement Forest (MAAF) can be computed within the same time bound."},"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":"1312.1255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2013-12-04T17:37:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7c7bbd00b9d27b4cdcb54831d8678ffbd588a089f9f9a7fe9ecd8607c1b0184d","abstract_canon_sha256":"bb6dcb4b29c5fb31e879d0a424d948bb86633150609aa8272cfe678135988a44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:34.548025Z","signature_b64":"fDi7/JAvPrmde0KwIToSiy7u+4fut9Yp/3YPoNFo8ycYPRegviQ51b3o7NNT5wJPah/KM51lfg8b9FWSHYhYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd1a407245cb6b11fa10cce0bae1b35317267da0e0b5b19625c4f0d6e0bef755","last_reissued_at":"2026-05-18T03:05:34.547536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:34.547536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short note on exponential-time algorithms for hybridization number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"q-bio.PE","authors_text":"Leen Stougie, Leo van Iersel, Nela Lekic, Steven Kelk","submitted_at":"2013-12-04T17:37:37Z","abstract_excerpt":"In this short note we prove that, given two (not necessarily binary) rooted phylogenetic trees T_1, T_2 on the same set of taxa X, where |X|=n, the hybridization number of T_1 and T_2 can be computed in time O^{*}(2^n) i.e. O(2^{n} poly(n)). The result also means that a Maximum Acyclic Agreement Forest (MAAF) can be computed within the same time bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1255","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":"1312.1255","created_at":"2026-05-18T03:05:34.547608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1255v1","created_at":"2026-05-18T03:05:34.547608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1255","created_at":"2026-05-18T03:05:34.547608+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UNEA4SFZNVR","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UNEA4SFZNVRD6QQ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UNEA4SF","created_at":"2026-05-18T12:27:38.830355+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/7UNEA4SFZNVRD6QQZTQLVYNTKM","json":"https://pith.science/pith/7UNEA4SFZNVRD6QQZTQLVYNTKM.json","graph_json":"https://pith.science/api/pith-number/7UNEA4SFZNVRD6QQZTQLVYNTKM/graph.json","events_json":"https://pith.science/api/pith-number/7UNEA4SFZNVRD6QQZTQLVYNTKM/events.json","paper":"https://pith.science/paper/7UNEA4SF"},"agent_actions":{"view_html":"https://pith.science/pith/7UNEA4SFZNVRD6QQZTQLVYNTKM","download_json":"https://pith.science/pith/7UNEA4SFZNVRD6QQZTQLVYNTKM.json","view_paper":"https://pith.science/paper/7UNEA4SF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1255&json=true","fetch_graph":"https://pith.science/api/pith-number/7UNEA4SFZNVRD6QQZTQLVYNTKM/graph.json","fetch_events":"https://pith.science/api/pith-number/7UNEA4SFZNVRD6QQZTQLVYNTKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UNEA4SFZNVRD6QQZTQLVYNTKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UNEA4SFZNVRD6QQZTQLVYNTKM/action/storage_attestation","attest_author":"https://pith.science/pith/7UNEA4SFZNVRD6QQZTQLVYNTKM/action/author_attestation","sign_citation":"https://pith.science/pith/7UNEA4SFZNVRD6QQZTQLVYNTKM/action/citation_signature","submit_replication":"https://pith.science/pith/7UNEA4SFZNVRD6QQZTQLVYNTKM/action/replication_record"}},"created_at":"2026-05-18T03:05:34.547608+00:00","updated_at":"2026-05-18T03:05:34.547608+00:00"}