{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7MHEBHRLXHH6U7FST33OFXEUFJ","short_pith_number":"pith:7MHEBHRL","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"},"canonical_sha256":"fb0e409e2bb9cfea7cb29ef6e2dc942a7117923d9e1adedd592721983f1700f6","source":{"kind":"arxiv","id":"1811.05916","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7MHEBHRLXHH6U7FST33OFXEUFJ","target":"record","payload":{"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"},"canonical_sha256":"fb0e409e2bb9cfea7cb29ef6e2dc942a7117923d9e1adedd592721983f1700f6","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"},"source_kind":"arxiv","source_id":"1811.05916","source_version":1,"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-18T00:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dRgjObSgrtugmolowYUG/yWuyB2VVd8MDuppFllXtMZhZuPc3BOjOoWS6zIAiLniChu2Pqt5J3EOWrPS7HySCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:56:48.245285Z"},"content_sha256":"9346c0416197d0dcabf0033b8c749d4d828709794397ba669cccde25e67ccda6","schema_version":"1.0","event_id":"sha256:9346c0416197d0dcabf0033b8c749d4d828709794397ba669cccde25e67ccda6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7MHEBHRLXHH6U7FST33OFXEUFJ","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, 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"},"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-18T00:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71w0OybjA1J8Kyt9iQxVz6pyCBZorV3Hgm+3zOLe03Z+BQHg15VGA9rhi4/TdJ6s25K04enXbMbmyd94USb3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:56:48.245857Z"},"content_sha256":"cdfcf4a0efae2165f3f0cf2f011825dfd90c975041d9a4017e9b3d9e86d8f0a2","schema_version":"1.0","event_id":"sha256:cdfcf4a0efae2165f3f0cf2f011825dfd90c975041d9a4017e9b3d9e86d8f0a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/bundle.json","state_url":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/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-28T21:56:48Z","links":{"resolver":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ","bundle":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/bundle.json","state":"https://pith.science/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MHEBHRLXHH6U7FST33OFXEUFJ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCmKlcBwf05EDKSTO49rXNTrmktWnlZStngzHJhg9tcpoTQfYHIj1F/3nj394SxRIDCZQLIAGaeodDbLTPX8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:56:48.249182Z","bundle_sha256":"5a42b649d6073a7a523f6ad019e20126c229ac1c2cda869c31df866d3e7f5a0a"}}