{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VFTQB34L7JS4PTW4FP4AK6YCCP","short_pith_number":"pith:VFTQB34L","schema_version":"1.0","canonical_sha256":"a96700ef8bfa65c7cedc2bf8057b0213f136b8704492f491222eabe92fd33660","source":{"kind":"arxiv","id":"1608.02709","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Feng Shi, Jianer Chen, Jianxin Wang, Qilong Feng","submitted_at":"2016-08-09T07:39:01Z","abstract_excerpt":"The Maximum Agreement Forest problem has been extensively studied in phylogenetics. Most previous work is on two binary phylogenetic trees. In this paper, we study a generalized version of the problem: the Maximum Agreement Forest problem on multiple rooted multifurcating phylogenetic trees, from the perspective of fixed-parameter algorithms. By taking advantage of a new branch-and-bound strategy, two parameterized algorithms, with running times $O(2.42^k m^3 n^4)$ and $O(2.74^k m^3 n^5)$, respectively, are presented for the hard version and the soft version of the problem, which correspond to"},"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":"1608.02709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-09T07:39:01Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"589b86e77e1b8c305bb9177779cb73fbee30b3d32865d6aa1db18592327b57e0","abstract_canon_sha256":"6c32b0f1267d9ac6eb7a744631a5c04aee14e97262a8a7b2aa46cb9d51c56af1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:20.384109Z","signature_b64":"OAYLp6hxcNh/r2tSnAjijZNg1A/EFMlKGILa21WQ8oPCPU8yFyI3v495Q60d3hDW5PEQV0o7GNamphpxGsY3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a96700ef8bfa65c7cedc2bf8057b0213f136b8704492f491222eabe92fd33660","last_reissued_at":"2026-05-18T01:06:20.383493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:20.383493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Feng Shi, Jianer Chen, Jianxin Wang, Qilong Feng","submitted_at":"2016-08-09T07:39:01Z","abstract_excerpt":"The Maximum Agreement Forest problem has been extensively studied in phylogenetics. Most previous work is on two binary phylogenetic trees. In this paper, we study a generalized version of the problem: the Maximum Agreement Forest problem on multiple rooted multifurcating phylogenetic trees, from the perspective of fixed-parameter algorithms. By taking advantage of a new branch-and-bound strategy, two parameterized algorithms, with running times $O(2.42^k m^3 n^4)$ and $O(2.74^k m^3 n^5)$, respectively, are presented for the hard version and the soft version of the problem, which correspond to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02709","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":"1608.02709","created_at":"2026-05-18T01:06:20.383591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02709v2","created_at":"2026-05-18T01:06:20.383591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02709","created_at":"2026-05-18T01:06:20.383591+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFTQB34L7JS4","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFTQB34L7JS4PTW4","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFTQB34L","created_at":"2026-05-18T12:30:48.956258+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/VFTQB34L7JS4PTW4FP4AK6YCCP","json":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP.json","graph_json":"https://pith.science/api/pith-number/VFTQB34L7JS4PTW4FP4AK6YCCP/graph.json","events_json":"https://pith.science/api/pith-number/VFTQB34L7JS4PTW4FP4AK6YCCP/events.json","paper":"https://pith.science/paper/VFTQB34L"},"agent_actions":{"view_html":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP","download_json":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP.json","view_paper":"https://pith.science/paper/VFTQB34L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02709&json=true","fetch_graph":"https://pith.science/api/pith-number/VFTQB34L7JS4PTW4FP4AK6YCCP/graph.json","fetch_events":"https://pith.science/api/pith-number/VFTQB34L7JS4PTW4FP4AK6YCCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/action/storage_attestation","attest_author":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/action/author_attestation","sign_citation":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/action/citation_signature","submit_replication":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/action/replication_record"}},"created_at":"2026-05-18T01:06:20.383591+00:00","updated_at":"2026-05-18T01:06:20.383591+00:00"}