{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7MHEBHRLXHH6U7FST33OFXEUFJ","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":"f1f936a3f38ee211b338cccacfeeb57a02abf7954944fdab90ee937bc84f32c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-14T17:22:16Z","title_canon_sha256":"2791ac02d911caa49eee908ecd7208f29ebb79dd0faa158623de4324f0ab89ab"},"schema_version":"1.0","source":{"id":"1811.05916","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05916","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05916v1","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05916","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"7MHEBHRLXHH6","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7MHEBHRLXHH6U7FS","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7MHEBHRL","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:cdfcf4a0efae2165f3f0cf2f011825dfd90c975041d9a4017e9b3d9e86d8f0a2","target":"graph","created_at":"2026-05-18T00:00: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 give a 2-approximation algorithm for the Maximum Agreement Forest problem on two rooted binary trees. This NP-hard problem has been studied extensively in the past two decades, since it can be used to compute the rooted Subtree Prune-and-Regraft (rSPR) distance between two phylogenetic trees. Our algorithm is combinatorial and its running time is quadratic in the input size. To prove the approximation guarantee, we construct a feasible dual solution for a novel linear programming formulation. In addition, we show this linear program is stronger than previously known formulations, and we giv","authors_text":"Anke van Zuylen, Frans Schalekamp, Leen Stougie, Neil Olver, Suzanne van der Ster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-14T17:22:16Z","title":"A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05916","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:9346c0416197d0dcabf0033b8c749d4d828709794397ba669cccde25e67ccda6","target":"record","created_at":"2026-05-18T00:00: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":"f1f936a3f38ee211b338cccacfeeb57a02abf7954944fdab90ee937bc84f32c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-14T17:22:16Z","title_canon_sha256":"2791ac02d911caa49eee908ecd7208f29ebb79dd0faa158623de4324f0ab89ab"},"schema_version":"1.0","source":{"id":"1811.05916","kind":"arxiv","version":1}},"canonical_sha256":"fb0e409e2bb9cfea7cb29ef6e2dc942a7117923d9e1adedd592721983f1700f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb0e409e2bb9cfea7cb29ef6e2dc942a7117923d9e1adedd592721983f1700f6","first_computed_at":"2026-05-18T00:00:41.845714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:41.845714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/uR1oYob/BUWx5UKM/bAkYFgnSDyx60llZOfzcGGIfiaVKfcl3QdEGsOveyF2QeAXDPeRAOxM5Kex67p9UafBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:41.846172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05916","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9346c0416197d0dcabf0033b8c749d4d828709794397ba669cccde25e67ccda6","sha256:cdfcf4a0efae2165f3f0cf2f011825dfd90c975041d9a4017e9b3d9e86d8f0a2"],"state_sha256":"adb7351b902aab95a10f5b77b44ac20db271eb370cb456ac95e390f6a86a0f31"}