{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ISQYOIYJ63E7S3WYCMCT6TPP4M","short_pith_number":"pith:ISQYOIYJ","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"},"canonical_sha256":"44a1872309f6c9f96ed813053f4defe32827bc0aeea04e94642c2e5f30ed6dec","source":{"kind":"arxiv","id":"1511.06000","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06000","created_at":"2026-05-18T01:16:06Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06000v2","created_at":"2026-05-18T01:16:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06000","created_at":"2026-05-18T01:16:06Z"},{"alias_kind":"pith_short_12","alias_value":"ISQYOIYJ63E7","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"ISQYOIYJ63E7S3WY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"ISQYOIYJ","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ISQYOIYJ63E7S3WYCMCT6TPP4M","target":"record","payload":{"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"},"canonical_sha256":"44a1872309f6c9f96ed813053f4defe32827bc0aeea04e94642c2e5f30ed6dec","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"},"source_kind":"arxiv","source_id":"1511.06000","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-18T01:16:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3QOjGwDbEhA3eUNLstQvOJRDeI/5ZMOIxy2bb8fDo6TyWpWUx4t9jZxhc8vIvFkBaOEiBxhPGVQpD2fU9g18AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:25:00.499039Z"},"content_sha256":"be189b17ea51cc7ff0571f6cfc3c9de5c93e1468860230cdc62c0a03db04b870","schema_version":"1.0","event_id":"sha256:be189b17ea51cc7ff0571f6cfc3c9de5c93e1468860230cdc62c0a03db04b870"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ISQYOIYJ63E7S3WYCMCT6TPP4M","target":"graph","payload":{"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"},"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-18T01:16:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pC6Iunj8QYib/A4tNgFdFGoi4dwKTTUPd2xj4XjI8aikxNq/gJZeKIAZL9SGz4fZf8JNOeoebCVDRBQJeJxAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:25:00.499405Z"},"content_sha256":"bae9491a13f0bafb951f053a13116e49cf566f421b5cc02b26d0f016e3d4247a","schema_version":"1.0","event_id":"sha256:bae9491a13f0bafb951f053a13116e49cf566f421b5cc02b26d0f016e3d4247a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/bundle.json","state_url":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/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-06-23T03:25:00Z","links":{"resolver":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M","bundle":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/bundle.json","state":"https://pith.science/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISQYOIYJ63E7S3WYCMCT6TPP4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ISQYOIYJ63E7S3WYCMCT6TPP4M","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":"ca8a44f1d9ca09f6321bf216e41d1877790801af710e044ed9b89f3ecffa6017","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-18T22:10:28Z","title_canon_sha256":"2791ac02d911caa49eee908ecd7208f29ebb79dd0faa158623de4324f0ab89ab"},"schema_version":"1.0","source":{"id":"1511.06000","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06000","created_at":"2026-05-18T01:16:06Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06000v2","created_at":"2026-05-18T01:16:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06000","created_at":"2026-05-18T01:16:06Z"},{"alias_kind":"pith_short_12","alias_value":"ISQYOIYJ63E7","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"ISQYOIYJ63E7S3WY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"ISQYOIYJ","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:bae9491a13f0bafb951f053a13116e49cf566f421b5cc02b26d0f016e3d4247a","target":"graph","created_at":"2026-05-18T01:16:06Z","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 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.","authors_text":"Anke van Zuylen, Frans Schalekamp, Suzanne van der Ster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-18T22:10:28Z","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":"1511.06000","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:be189b17ea51cc7ff0571f6cfc3c9de5c93e1468860230cdc62c0a03db04b870","target":"record","created_at":"2026-05-18T01:16:06Z","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":"ca8a44f1d9ca09f6321bf216e41d1877790801af710e044ed9b89f3ecffa6017","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-18T22:10:28Z","title_canon_sha256":"2791ac02d911caa49eee908ecd7208f29ebb79dd0faa158623de4324f0ab89ab"},"schema_version":"1.0","source":{"id":"1511.06000","kind":"arxiv","version":2}},"canonical_sha256":"44a1872309f6c9f96ed813053f4defe32827bc0aeea04e94642c2e5f30ed6dec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44a1872309f6c9f96ed813053f4defe32827bc0aeea04e94642c2e5f30ed6dec","first_computed_at":"2026-05-18T01:16:06.875933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:06.875933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"st5RWfe95TiusrUv3HldxADVRM8yIPog9mMPmzpDgNvtP4eo8skhUGLVB/upFU2/xOmGNJDFC5eG/vFiD+NrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:06.876515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06000","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be189b17ea51cc7ff0571f6cfc3c9de5c93e1468860230cdc62c0a03db04b870","sha256:bae9491a13f0bafb951f053a13116e49cf566f421b5cc02b26d0f016e3d4247a"],"state_sha256":"350788991b5d11bc5ada29c6ea3eca3243cabcbade76287a3775b28a412bbd84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UD5xvzsT/83E/eaUYQAhbZiIv7UXlH8fEQOINnoClmnfczGCXkC60e41QBEvDACp6fGkud8CpMykjsMXMFUhBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T03:25:00.501378Z","bundle_sha256":"27b197b025f31dad39c48c50b28a06780b8eb6dcb7ef2e949699a881716bab8f"}}