{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VFTQB34L7JS4PTW4FP4AK6YCCP","short_pith_number":"pith:VFTQB34L","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"},"canonical_sha256":"a96700ef8bfa65c7cedc2bf8057b0213f136b8704492f491222eabe92fd33660","source":{"kind":"arxiv","id":"1608.02709","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02709","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02709v2","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02709","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"VFTQB34L7JS4","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VFTQB34L7JS4PTW4","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VFTQB34L","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VFTQB34L7JS4PTW4FP4AK6YCCP","target":"record","payload":{"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"},"canonical_sha256":"a96700ef8bfa65c7cedc2bf8057b0213f136b8704492f491222eabe92fd33660","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"},"source_kind":"arxiv","source_id":"1608.02709","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fn3z1hu+dVNn/UV4k4G4eJnGb5Bgs28RsaWL3hfyhrsljIKpqvw/u0gt6Q3x5vTx/f8+d0XpeNJS6AzVkZsCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:14:05.678943Z"},"content_sha256":"5e9bae77f269379ee0be9ae4cf691a32960a8c84d3b5eaefc85b375690507334","schema_version":"1.0","event_id":"sha256:5e9bae77f269379ee0be9ae4cf691a32960a8c84d3b5eaefc85b375690507334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VFTQB34L7JS4PTW4FP4AK6YCCP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDjmPbUKqZ0Qm6wbEY4HoW2YDnoH4W9RLHjlMjjEAFJBevysYxc3RFg9aGHZtXKRsYes57JJa63Pveg3BgWYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:14:05.679293Z"},"content_sha256":"352d4f055f752044b02a62124d4331922eaefad14e62aa4681b6ee776e0c19e7","schema_version":"1.0","event_id":"sha256:352d4f055f752044b02a62124d4331922eaefad14e62aa4681b6ee776e0c19e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/bundle.json","state_url":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T06:14:05Z","links":{"resolver":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP","bundle":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/bundle.json","state":"https://pith.science/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFTQB34L7JS4PTW4FP4AK6YCCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VFTQB34L7JS4PTW4FP4AK6YCCP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6c32b0f1267d9ac6eb7a744631a5c04aee14e97262a8a7b2aa46cb9d51c56af1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-09T07:39:01Z","title_canon_sha256":"589b86e77e1b8c305bb9177779cb73fbee30b3d32865d6aa1db18592327b57e0"},"schema_version":"1.0","source":{"id":"1608.02709","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02709","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02709v2","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02709","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"VFTQB34L7JS4","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VFTQB34L7JS4PTW4","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VFTQB34L","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:352d4f055f752044b02a62124d4331922eaefad14e62aa4681b6ee776e0c19e7","target":"graph","created_at":"2026-05-18T01:06:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Feng Shi, Jianer Chen, Jianxin Wang, Qilong Feng","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-09T07:39:01Z","title":"Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02709","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5e9bae77f269379ee0be9ae4cf691a32960a8c84d3b5eaefc85b375690507334","target":"record","created_at":"2026-05-18T01:06:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6c32b0f1267d9ac6eb7a744631a5c04aee14e97262a8a7b2aa46cb9d51c56af1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-09T07:39:01Z","title_canon_sha256":"589b86e77e1b8c305bb9177779cb73fbee30b3d32865d6aa1db18592327b57e0"},"schema_version":"1.0","source":{"id":"1608.02709","kind":"arxiv","version":2}},"canonical_sha256":"a96700ef8bfa65c7cedc2bf8057b0213f136b8704492f491222eabe92fd33660","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a96700ef8bfa65c7cedc2bf8057b0213f136b8704492f491222eabe92fd33660","first_computed_at":"2026-05-18T01:06:20.383493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:20.383493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OAYLp6hxcNh/r2tSnAjijZNg1A/EFMlKGILa21WQ8oPCPU8yFyI3v495Q60d3hDW5PEQV0o7GNamphpxGsY3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:20.384109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02709","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e9bae77f269379ee0be9ae4cf691a32960a8c84d3b5eaefc85b375690507334","sha256:352d4f055f752044b02a62124d4331922eaefad14e62aa4681b6ee776e0c19e7"],"state_sha256":"476d494bb8779fcdf905d06d81b7b7e8f4d94e509bf2466bb1021348f52e9bfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/MHWPaVApEMVA8guBDwHlr+4u2qKyjiVMKueyT/TchPxCsdAU2Bn/z7j9H0VuaMczDDHb1DY7IYCSf/vxYrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:14:05.681436Z","bundle_sha256":"6e184055d44d7da255b9ca308095c0dea4d7d999e175e0f6e69cc35b97dd5ad0"}}