{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BDJRYBV72CEM5WOSVXOM6RCU7H","short_pith_number":"pith:BDJRYBV7","canonical_record":{"source":{"id":"1210.3211","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-11T12:45:56Z","cross_cats_sorted":["cs.DM","q-bio.PE"],"title_canon_sha256":"9c674953e6572f374c22792216d1b3956643562fca7db09b5953f46e85960172","abstract_canon_sha256":"c557e1aa9de5a84a0dd2483bcbbda31de64e75a463304cedb6cded167e76de21"},"schema_version":"1.0"},"canonical_sha256":"08d31c06bfd088ced9d2addccf4454f9d91f95f6659ae6da19bba7523f218fdd","source":{"kind":"arxiv","id":"1210.3211","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3211","created_at":"2026-05-18T03:37:52Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3211v3","created_at":"2026-05-18T03:37:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3211","created_at":"2026-05-18T03:37:52Z"},{"alias_kind":"pith_short_12","alias_value":"BDJRYBV72CEM","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BDJRYBV72CEM5WOS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BDJRYBV7","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BDJRYBV72CEM5WOSVXOM6RCU7H","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3211","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-11T12:45:56Z","cross_cats_sorted":["cs.DM","q-bio.PE"],"title_canon_sha256":"9c674953e6572f374c22792216d1b3956643562fca7db09b5953f46e85960172","abstract_canon_sha256":"c557e1aa9de5a84a0dd2483bcbbda31de64e75a463304cedb6cded167e76de21"},"schema_version":"1.0"},"canonical_sha256":"08d31c06bfd088ced9d2addccf4454f9d91f95f6659ae6da19bba7523f218fdd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:52.373886Z","signature_b64":"/6tSLfAMiS87jYEii1IFV/ReCjUQbCt0e+YpzEBIYlOJD8Ve58N/N3GUCx1McP0DhRzS3gT25MVOMGCzfVuYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08d31c06bfd088ced9d2addccf4454f9d91f95f6659ae6da19bba7523f218fdd","last_reissued_at":"2026-05-18T03:37:52.373151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:52.373151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3211","source_version":3,"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-18T03:37:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ac9B87uBJ+xHGV7ZCntstBwdfUzilI/GUT3jbWId+dkTTgrpO+fr8GHqa+U81wyxJpqIUNE2Kvqc/Tl39+XJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:45:26.614765Z"},"content_sha256":"9928b2b78b2c7d0b72c64a4a2b406cdbd0d8f322ef69d64c1cb037ef1206a7d0","schema_version":"1.0","event_id":"sha256:9928b2b78b2c7d0b72c64a4a2b406cdbd0d8f322ef69d64c1cb037ef1206a7d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BDJRYBV72CEM5WOSVXOM6RCU7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation algorithms for nonbinary agreement forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","q-bio.PE"],"primary_cat":"math.CO","authors_text":"Leen Stougie, Leo van Iersel, Nela Leki\\'c, Steven Kelk","submitted_at":"2012-10-11T12:45:56Z","abstract_excerpt":"Given two rooted phylogenetic trees on the same set of taxa X, the Maximum Agreement Forest problem (MAF) asks to find a forest that is, in a certain sense, common to both trees and has a minimum number of components. The Maximum Acyclic Agreement Forest problem (MAAF) has the additional restriction that the components of the forest cannot have conflicting ancestral relations in the input trees. There has been considerable interest in the special cases of these problems in which the input trees are required to be binary. However, in practice, phylogenetic trees are rarely binary, due to uncert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3211","kind":"arxiv","version":3},"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-18T03:37:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHAkBozhQiea935/88HMlqbpe1sjBFvJCV8hISGiXrgxa0f+lIueU5hm5mRq4SGUVdLsS2aA72v2gpO/8J9DDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:45:26.615109Z"},"content_sha256":"745c03bee731a9e6e07c0c4efcee18760bee919d6fbc184796d0e547516ff6cc","schema_version":"1.0","event_id":"sha256:745c03bee731a9e6e07c0c4efcee18760bee919d6fbc184796d0e547516ff6cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDJRYBV72CEM5WOSVXOM6RCU7H/bundle.json","state_url":"https://pith.science/pith/BDJRYBV72CEM5WOSVXOM6RCU7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDJRYBV72CEM5WOSVXOM6RCU7H/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-01T20:45:26Z","links":{"resolver":"https://pith.science/pith/BDJRYBV72CEM5WOSVXOM6RCU7H","bundle":"https://pith.science/pith/BDJRYBV72CEM5WOSVXOM6RCU7H/bundle.json","state":"https://pith.science/pith/BDJRYBV72CEM5WOSVXOM6RCU7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDJRYBV72CEM5WOSVXOM6RCU7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BDJRYBV72CEM5WOSVXOM6RCU7H","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":"c557e1aa9de5a84a0dd2483bcbbda31de64e75a463304cedb6cded167e76de21","cross_cats_sorted":["cs.DM","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-11T12:45:56Z","title_canon_sha256":"9c674953e6572f374c22792216d1b3956643562fca7db09b5953f46e85960172"},"schema_version":"1.0","source":{"id":"1210.3211","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3211","created_at":"2026-05-18T03:37:52Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3211v3","created_at":"2026-05-18T03:37:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3211","created_at":"2026-05-18T03:37:52Z"},{"alias_kind":"pith_short_12","alias_value":"BDJRYBV72CEM","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BDJRYBV72CEM5WOS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BDJRYBV7","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:745c03bee731a9e6e07c0c4efcee18760bee919d6fbc184796d0e547516ff6cc","target":"graph","created_at":"2026-05-18T03:37:52Z","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":"Given two rooted phylogenetic trees on the same set of taxa X, the Maximum Agreement Forest problem (MAF) asks to find a forest that is, in a certain sense, common to both trees and has a minimum number of components. The Maximum Acyclic Agreement Forest problem (MAAF) has the additional restriction that the components of the forest cannot have conflicting ancestral relations in the input trees. There has been considerable interest in the special cases of these problems in which the input trees are required to be binary. However, in practice, phylogenetic trees are rarely binary, due to uncert","authors_text":"Leen Stougie, Leo van Iersel, Nela Leki\\'c, Steven Kelk","cross_cats":["cs.DM","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-11T12:45:56Z","title":"Approximation algorithms for nonbinary agreement forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3211","kind":"arxiv","version":3},"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:9928b2b78b2c7d0b72c64a4a2b406cdbd0d8f322ef69d64c1cb037ef1206a7d0","target":"record","created_at":"2026-05-18T03:37:52Z","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":"c557e1aa9de5a84a0dd2483bcbbda31de64e75a463304cedb6cded167e76de21","cross_cats_sorted":["cs.DM","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-11T12:45:56Z","title_canon_sha256":"9c674953e6572f374c22792216d1b3956643562fca7db09b5953f46e85960172"},"schema_version":"1.0","source":{"id":"1210.3211","kind":"arxiv","version":3}},"canonical_sha256":"08d31c06bfd088ced9d2addccf4454f9d91f95f6659ae6da19bba7523f218fdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08d31c06bfd088ced9d2addccf4454f9d91f95f6659ae6da19bba7523f218fdd","first_computed_at":"2026-05-18T03:37:52.373151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:52.373151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/6tSLfAMiS87jYEii1IFV/ReCjUQbCt0e+YpzEBIYlOJD8Ve58N/N3GUCx1McP0DhRzS3gT25MVOMGCzfVuYAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:52.373886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3211","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9928b2b78b2c7d0b72c64a4a2b406cdbd0d8f322ef69d64c1cb037ef1206a7d0","sha256:745c03bee731a9e6e07c0c4efcee18760bee919d6fbc184796d0e547516ff6cc"],"state_sha256":"f76fa05cd170464daec46e6f2f29dba4931527c44a57174016aab51345dd703e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yub+ZpGtHR33WvqQVi3Y/bi6nryH9rG7xsB2hh8ilavdVLT1/nWyTsQ/1TfoN+0/r+ZTlOU61EQS1W7VuWdtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:45:26.616972Z","bundle_sha256":"7576dd98a688aa7e73d29b8665f6a507ac89cee2fb773c041362b6d8b489f234"}}