{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7MHEBHRLXHH6U7FST33OFXEUFJ","short_pith_number":"pith:7MHEBHRL","schema_version":"1.0","canonical_sha256":"fb0e409e2bb9cfea7cb29ef6e2dc942a7117923d9e1adedd592721983f1700f6","source":{"kind":"arxiv","id":"1811.05916","version":1},"attestation_state":"computed","paper":{"title":"A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anke van Zuylen, Frans Schalekamp, Leen Stougie, Neil Olver, Suzanne van der Ster","submitted_at":"2018-11-14T17:22:16Z","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"},"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":"1811.05916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-14T17:22:16Z","cross_cats_sorted":[],"title_canon_sha256":"2791ac02d911caa49eee908ecd7208f29ebb79dd0faa158623de4324f0ab89ab","abstract_canon_sha256":"f1f936a3f38ee211b338cccacfeeb57a02abf7954944fdab90ee937bc84f32c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:41.846172Z","signature_b64":"/uR1oYob/BUWx5UKM/bAkYFgnSDyx60llZOfzcGGIfiaVKfcl3QdEGsOveyF2QeAXDPeRAOxM5Kex67p9UafBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb0e409e2bb9cfea7cb29ef6e2dc942a7117923d9e1adedd592721983f1700f6","last_reissued_at":"2026-05-18T00:00:41.845714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:41.845714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anke van Zuylen, Frans Schalekamp, Leen Stougie, Neil Olver, Suzanne van der Ster","submitted_at":"2018-11-14T17:22:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05916","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.05916","created_at":"2026-05-18T00:00:41.845772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05916v1","created_at":"2026-05-18T00:00:41.845772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05916","created_at":"2026-05-18T00:00:41.845772+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MHEBHRLXHH6","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MHEBHRLXHH6U7FS","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MHEBHRL","created_at":"2026-05-18T12:32:11.075285+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/7MHEBHRLXHH6U7FST33OFXEUFJ","json":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ.json","graph_json":"https://pith.science/api/pith-number/7MHEBHRLXHH6U7FST33OFXEUFJ/graph.json","events_json":"https://pith.science/api/pith-number/7MHEBHRLXHH6U7FST33OFXEUFJ/events.json","paper":"https://pith.science/paper/7MHEBHRL"},"agent_actions":{"view_html":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ","download_json":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ.json","view_paper":"https://pith.science/paper/7MHEBHRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05916&json=true","fetch_graph":"https://pith.science/api/pith-number/7MHEBHRLXHH6U7FST33OFXEUFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7MHEBHRLXHH6U7FST33OFXEUFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/action/storage_attestation","attest_author":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/action/author_attestation","sign_citation":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/action/citation_signature","submit_replication":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/action/replication_record"}},"created_at":"2026-05-18T00:00:41.845772+00:00","updated_at":"2026-05-18T00:00:41.845772+00:00"}