{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AWCXSSXOISRYVGAZRG2XKW5ZCK","short_pith_number":"pith:AWCXSSXO","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"},"canonical_sha256":"0585794aee44a38a981989b5755bb9129307148dd27d0902cff4e5be0a83effb","source":{"kind":"arxiv","id":"1411.0062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0062","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0062v1","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0062","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"AWCXSSXOISRY","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AWCXSSXOISRYVGAZ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AWCXSSXO","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AWCXSSXOISRYVGAZRG2XKW5ZCK","target":"record","payload":{"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"},"canonical_sha256":"0585794aee44a38a981989b5755bb9129307148dd27d0902cff4e5be0a83effb","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"},"source_kind":"arxiv","source_id":"1411.0062","source_version":1,"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-18T02:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZgdIsq9umblkpkxDbnB3h1YW4eia3cjnyEh+dz4qKB5p7rDfEoFH3t7FI+V8JFP+llAj6sVah9JB71f/lSphCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:15:35.987543Z"},"content_sha256":"aba4b1e186d3c5e0aeb3f0237366279193750b682f6db1fa2f16a866d1cf458f","schema_version":"1.0","event_id":"sha256:aba4b1e186d3c5e0aeb3f0237366279193750b682f6db1fa2f16a866d1cf458f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AWCXSSXOISRYVGAZRG2XKW5ZCK","target":"graph","payload":{"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"},"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-18T02:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5PrtWrYufx2lLUGhpzvePJ7afhJUFT50K3pvjntVBhnyNTI6Z0qx1hRrgOZTiMenJ2EWa208HfiVQIJ+S8bBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:15:35.987894Z"},"content_sha256":"43147d2b9d95e531b145181859964ed6faa2fe47c4a8ede13350d70ea754a314","schema_version":"1.0","event_id":"sha256:43147d2b9d95e531b145181859964ed6faa2fe47c4a8ede13350d70ea754a314"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/bundle.json","state_url":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/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-28T02:15:35Z","links":{"resolver":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK","bundle":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/bundle.json","state":"https://pith.science/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWCXSSXOISRYVGAZRG2XKW5ZCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AWCXSSXOISRYVGAZRG2XKW5ZCK","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":"c20384a8572f3710e43679cfee43c6beb30052277c705fccc2d02187098b26c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-01T03:45:00Z","title_canon_sha256":"917cb73e2fe0b7968266b81ec889065065cec0ec4b6d9b5cf5c76fdc0cc713e0"},"schema_version":"1.0","source":{"id":"1411.0062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0062","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0062v1","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0062","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"AWCXSSXOISRY","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AWCXSSXOISRYVGAZ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AWCXSSXO","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:43147d2b9d95e531b145181859964ed6faa2fe47c4a8ede13350d70ea754a314","target":"graph","created_at":"2026-05-18T02:38:52Z","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 (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","authors_text":"Feng Shi, Jianer Chen, Jianxin Wang, Qilong Feng, Xiaojun Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-01T03:45:00Z","title":"Algorithms for Maximum Agreement Forest of Multiple General Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0062","kind":"arxiv","version":1},"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:aba4b1e186d3c5e0aeb3f0237366279193750b682f6db1fa2f16a866d1cf458f","target":"record","created_at":"2026-05-18T02:38:52Z","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":"c20384a8572f3710e43679cfee43c6beb30052277c705fccc2d02187098b26c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-01T03:45:00Z","title_canon_sha256":"917cb73e2fe0b7968266b81ec889065065cec0ec4b6d9b5cf5c76fdc0cc713e0"},"schema_version":"1.0","source":{"id":"1411.0062","kind":"arxiv","version":1}},"canonical_sha256":"0585794aee44a38a981989b5755bb9129307148dd27d0902cff4e5be0a83effb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0585794aee44a38a981989b5755bb9129307148dd27d0902cff4e5be0a83effb","first_computed_at":"2026-05-18T02:38:52.633716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:52.633716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VfA9VJyQahgvKbXBv20faaCr0NgtNI9XD4QcroxF1InCFf8mazmSv4LCadjNU0UJTZBGNgtH/FAzebj8m3NOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:52.634074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aba4b1e186d3c5e0aeb3f0237366279193750b682f6db1fa2f16a866d1cf458f","sha256:43147d2b9d95e531b145181859964ed6faa2fe47c4a8ede13350d70ea754a314"],"state_sha256":"494c117c89e03141e6aec07d00e1dba1d914ba0dd5156364d53fe7368aa7d28f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JS0ijHgzsf4W7KEUWLuoCMtXp+ciypJzAEUG5CYKoo768RP2Vm1COiw+XJuc9QPqU/1AB5pEqA2t06ahNnoBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:15:35.989942Z","bundle_sha256":"256de7424a8c23ec1976cfc2f67e804ee20988ecb2668e66ec603c480b3956b0"}}