{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y5JEFSXQVZLHE7RWLEVEDUNPTT","short_pith_number":"pith:Y5JEFSXQ","canonical_record":{"source":{"id":"1108.2664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-08-12T17:20:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"74425104620524bd8736739be0103452a7f60dace2db8dd9aa5cfda51f8f6263","abstract_canon_sha256":"348e44313b1e631068c6280b12c7c2195166ee278f7793bbcab608598fef4870"},"schema_version":"1.0"},"canonical_sha256":"c75242caf0ae56727e36592a41d1af9cfdcdbdecd2ce1f0f91301d1d44eefcee","source":{"kind":"arxiv","id":"1108.2664","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2664","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2664v2","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2664","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"Y5JEFSXQVZLH","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y5JEFSXQVZLHE7RW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y5JEFSXQ","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y5JEFSXQVZLHE7RWLEVEDUNPTT","target":"record","payload":{"canonical_record":{"source":{"id":"1108.2664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-08-12T17:20:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"74425104620524bd8736739be0103452a7f60dace2db8dd9aa5cfda51f8f6263","abstract_canon_sha256":"348e44313b1e631068c6280b12c7c2195166ee278f7793bbcab608598fef4870"},"schema_version":"1.0"},"canonical_sha256":"c75242caf0ae56727e36592a41d1af9cfdcdbdecd2ce1f0f91301d1d44eefcee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:41.963269Z","signature_b64":"dEyUj3tJXp/yd5HstAGowFngt34V4AzF59+NwIiCqGdJQdSybhK0XzlTkIJoa4yt21QCH2ppxQdlwv4EUx6gAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c75242caf0ae56727e36592a41d1af9cfdcdbdecd2ce1f0f91301d1d44eefcee","last_reissued_at":"2026-05-18T02:21:41.962791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:41.962791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.2664","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-18T02:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGbjN2z/P/a2K8O2t4VVB2+p010UjNCrl4D4dVHesojEKZ+icQP1XCY3sOZl52KZovn1njQjMizUg5V3baEICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:34:14.948799Z"},"content_sha256":"9b9722a8a209a076e0248e2b999787a38a11741ec6aeceb63437e9cd196b6306","schema_version":"1.0","event_id":"sha256:9b9722a8a209a076e0248e2b999787a38a11741ec6aeceb63437e9cd196b6306"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y5JEFSXQVZLHE7RWLEVEDUNPTT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Chris Whidden, Norbert Zeh, Robert G. Beiko","submitted_at":"2011-08-12T17:20:39Z","abstract_excerpt":"We present new and improved fixed-parameter algorithms for computing maximum agreement forests (MAFs) of pairs of rooted binary phylogenetic trees. The size of such a forest for two trees corresponds to their subtree prune-and-regraft distance and, if the agreement forest is acyclic, to their hybridization number. These distance measures are essential tools for understanding reticulate evolution. Our algorithm for computing maximum acyclic agreement forests is the first depth-bounded search algorithm for this problem. Our algorithms substantially outperform the best previous algorithms for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2664","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-18T02:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bIVmsD8b9xatROgPcjocTdsGPLBELkV0ksJ7DBWPNia9NiwJM9G9+IOr9qPTCBIXjiXU60T/U89ePy2R16xvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:34:14.949466Z"},"content_sha256":"83346a89c1fff14c349c8730257fbda4652d8692176cd162a012a7996e6d0bf5","schema_version":"1.0","event_id":"sha256:83346a89c1fff14c349c8730257fbda4652d8692176cd162a012a7996e6d0bf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5JEFSXQVZLHE7RWLEVEDUNPTT/bundle.json","state_url":"https://pith.science/pith/Y5JEFSXQVZLHE7RWLEVEDUNPTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5JEFSXQVZLHE7RWLEVEDUNPTT/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-30T05:34:14Z","links":{"resolver":"https://pith.science/pith/Y5JEFSXQVZLHE7RWLEVEDUNPTT","bundle":"https://pith.science/pith/Y5JEFSXQVZLHE7RWLEVEDUNPTT/bundle.json","state":"https://pith.science/pith/Y5JEFSXQVZLHE7RWLEVEDUNPTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5JEFSXQVZLHE7RWLEVEDUNPTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y5JEFSXQVZLHE7RWLEVEDUNPTT","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":"348e44313b1e631068c6280b12c7c2195166ee278f7793bbcab608598fef4870","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-08-12T17:20:39Z","title_canon_sha256":"74425104620524bd8736739be0103452a7f60dace2db8dd9aa5cfda51f8f6263"},"schema_version":"1.0","source":{"id":"1108.2664","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2664","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2664v2","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2664","created_at":"2026-05-18T02:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"Y5JEFSXQVZLH","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y5JEFSXQVZLHE7RW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y5JEFSXQ","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:83346a89c1fff14c349c8730257fbda4652d8692176cd162a012a7996e6d0bf5","target":"graph","created_at":"2026-05-18T02:21:41Z","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":"We present new and improved fixed-parameter algorithms for computing maximum agreement forests (MAFs) of pairs of rooted binary phylogenetic trees. The size of such a forest for two trees corresponds to their subtree prune-and-regraft distance and, if the agreement forest is acyclic, to their hybridization number. These distance measures are essential tools for understanding reticulate evolution. Our algorithm for computing maximum acyclic agreement forests is the first depth-bounded search algorithm for this problem. Our algorithms substantially outperform the best previous algorithms for the","authors_text":"Chris Whidden, Norbert Zeh, Robert G. Beiko","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-08-12T17:20:39Z","title":"Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2664","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:9b9722a8a209a076e0248e2b999787a38a11741ec6aeceb63437e9cd196b6306","target":"record","created_at":"2026-05-18T02:21:41Z","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":"348e44313b1e631068c6280b12c7c2195166ee278f7793bbcab608598fef4870","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-08-12T17:20:39Z","title_canon_sha256":"74425104620524bd8736739be0103452a7f60dace2db8dd9aa5cfda51f8f6263"},"schema_version":"1.0","source":{"id":"1108.2664","kind":"arxiv","version":2}},"canonical_sha256":"c75242caf0ae56727e36592a41d1af9cfdcdbdecd2ce1f0f91301d1d44eefcee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c75242caf0ae56727e36592a41d1af9cfdcdbdecd2ce1f0f91301d1d44eefcee","first_computed_at":"2026-05-18T02:21:41.962791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:41.962791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dEyUj3tJXp/yd5HstAGowFngt34V4AzF59+NwIiCqGdJQdSybhK0XzlTkIJoa4yt21QCH2ppxQdlwv4EUx6gAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:41.963269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2664","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b9722a8a209a076e0248e2b999787a38a11741ec6aeceb63437e9cd196b6306","sha256:83346a89c1fff14c349c8730257fbda4652d8692176cd162a012a7996e6d0bf5"],"state_sha256":"073feac0156a5eea6d27c3bfcbe76775f8524d9807ae94ba85a3ea93b6317d6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YyrDZ4LLwIgtKZaY5sx15Ep+fTIptzfF9kkTOEFx7XRlc6bZfD9dJ6bMBpo/uLrYFGUlsbTrzJqSvu8uEvW6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:34:14.952463Z","bundle_sha256":"f6bd1d92e4b7a950016fd17647bb81795d3369a0906620b36f36bc8e9eef1ee6"}}