{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AWCXSSXOISRYVGAZRG2XKW5ZCK","short_pith_number":"pith:AWCXSSXO","schema_version":"1.0","canonical_sha256":"0585794aee44a38a981989b5755bb9129307148dd27d0902cff4e5be0a83effb","source":{"kind":"arxiv","id":"1411.0062","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Maximum Agreement Forest of Multiple General Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Feng Shi, Jianer Chen, Jianxin Wang, Qilong Feng, Xiaojun Ding","submitted_at":"2014-11-01T03:45:00Z","abstract_excerpt":"The Maximum Agreement Forest (Maf) problem is a well-studied problem in evolutionary biology, which asks for a largest common subforest of a given collection of phylogenetic trees with identical leaf label-set. However, the previous work about the Maf problem are mainly on two binary phylogenetic trees or two general (i.e., binary and non-binary) phylogenetic trees. In this paper, we study the more general version of the problem: the Maf problem on multiple general phylogenetic trees. We present a parameterized algorithm of running time $O(3^k n^2m)$ and a 3-approximation algorithm for the Maf"},"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":"1411.0062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-01T03:45:00Z","cross_cats_sorted":[],"title_canon_sha256":"917cb73e2fe0b7968266b81ec889065065cec0ec4b6d9b5cf5c76fdc0cc713e0","abstract_canon_sha256":"c20384a8572f3710e43679cfee43c6beb30052277c705fccc2d02187098b26c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:52.634074Z","signature_b64":"VfA9VJyQahgvKbXBv20faaCr0NgtNI9XD4QcroxF1InCFf8mazmSv4LCadjNU0UJTZBGNgtH/FAzebj8m3NOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0585794aee44a38a981989b5755bb9129307148dd27d0902cff4e5be0a83effb","last_reissued_at":"2026-05-18T02:38:52.633716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:52.633716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Maximum Agreement Forest of Multiple General Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Feng Shi, Jianer Chen, Jianxin Wang, Qilong Feng, Xiaojun Ding","submitted_at":"2014-11-01T03:45:00Z","abstract_excerpt":"The Maximum Agreement Forest (Maf) problem is a well-studied problem in evolutionary biology, which asks for a largest common subforest of a given collection of phylogenetic trees with identical leaf label-set. However, the previous work about the Maf problem are mainly on two binary phylogenetic trees or two general (i.e., binary and non-binary) phylogenetic trees. In this paper, we study the more general version of the problem: the Maf problem on multiple general phylogenetic trees. We present a parameterized algorithm of running time $O(3^k n^2m)$ and a 3-approximation algorithm for the Maf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0062","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":"1411.0062","created_at":"2026-05-18T02:38:52.633767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0062v1","created_at":"2026-05-18T02:38:52.633767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0062","created_at":"2026-05-18T02:38:52.633767+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWCXSSXOISRY","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWCXSSXOISRYVGAZ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWCXSSXO","created_at":"2026-05-18T12:28:19.803747+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/AWCXSSXOISRYVGAZRG2XKW5ZCK","json":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK.json","graph_json":"https://pith.science/api/pith-number/AWCXSSXOISRYVGAZRG2XKW5ZCK/graph.json","events_json":"https://pith.science/api/pith-number/AWCXSSXOISRYVGAZRG2XKW5ZCK/events.json","paper":"https://pith.science/paper/AWCXSSXO"},"agent_actions":{"view_html":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK","download_json":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK.json","view_paper":"https://pith.science/paper/AWCXSSXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0062&json=true","fetch_graph":"https://pith.science/api/pith-number/AWCXSSXOISRYVGAZRG2XKW5ZCK/graph.json","fetch_events":"https://pith.science/api/pith-number/AWCXSSXOISRYVGAZRG2XKW5ZCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/action/storage_attestation","attest_author":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/action/author_attestation","sign_citation":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/action/citation_signature","submit_replication":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/action/replication_record"}},"created_at":"2026-05-18T02:38:52.633767+00:00","updated_at":"2026-05-18T02:38:52.633767+00:00"}