{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ISQYOIYJ63E7S3WYCMCT6TPP4M","short_pith_number":"pith:ISQYOIYJ","schema_version":"1.0","canonical_sha256":"44a1872309f6c9f96ed813053f4defe32827bc0aeea04e94642c2e5f30ed6dec","source":{"kind":"arxiv","id":"1511.06000","version":2},"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, Suzanne van der Ster","submitted_at":"2015-11-18T22:10:28Z","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 Subtree Prune-and-Regraft (SPR) distance between two phylogenetic trees. Our result improves on the very recent 2.5-approximation algorithm due to Shi, Feng, You and Wang (2015). Our algorithm is the first approximation algorithm for this problem that uses LP duality in its analysis."},"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":"1511.06000","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-18T22:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"2791ac02d911caa49eee908ecd7208f29ebb79dd0faa158623de4324f0ab89ab","abstract_canon_sha256":"ca8a44f1d9ca09f6321bf216e41d1877790801af710e044ed9b89f3ecffa6017"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:06.876515Z","signature_b64":"st5RWfe95TiusrUv3HldxADVRM8yIPog9mMPmzpDgNvtP4eo8skhUGLVB/upFU2/xOmGNJDFC5eG/vFiD+NrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44a1872309f6c9f96ed813053f4defe32827bc0aeea04e94642c2e5f30ed6dec","last_reissued_at":"2026-05-18T01:16:06.875933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:06.875933Z","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, Suzanne van der Ster","submitted_at":"2015-11-18T22:10:28Z","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 Subtree Prune-and-Regraft (SPR) distance between two phylogenetic trees. Our result improves on the very recent 2.5-approximation algorithm due to Shi, Feng, You and Wang (2015). Our algorithm is the first approximation algorithm for this problem that uses LP duality in its analysis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06000","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.06000","created_at":"2026-05-18T01:16:06.876018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06000v2","created_at":"2026-05-18T01:16:06.876018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06000","created_at":"2026-05-18T01:16:06.876018+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISQYOIYJ63E7","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISQYOIYJ63E7S3WY","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISQYOIYJ","created_at":"2026-05-18T12:29:25.134429+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/ISQYOIYJ63E7S3WYCMCT6TPP4M","json":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M.json","graph_json":"https://pith.science/api/pith-number/ISQYOIYJ63E7S3WYCMCT6TPP4M/graph.json","events_json":"https://pith.science/api/pith-number/ISQYOIYJ63E7S3WYCMCT6TPP4M/events.json","paper":"https://pith.science/paper/ISQYOIYJ"},"agent_actions":{"view_html":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M","download_json":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M.json","view_paper":"https://pith.science/paper/ISQYOIYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06000&json=true","fetch_graph":"https://pith.science/api/pith-number/ISQYOIYJ63E7S3WYCMCT6TPP4M/graph.json","fetch_events":"https://pith.science/api/pith-number/ISQYOIYJ63E7S3WYCMCT6TPP4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/action/storage_attestation","attest_author":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/action/author_attestation","sign_citation":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/action/citation_signature","submit_replication":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/action/replication_record"}},"created_at":"2026-05-18T01:16:06.876018+00:00","updated_at":"2026-05-18T01:16:06.876018+00:00"}