{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YEP23X6O7H4GRWT75OSN7F57LA","short_pith_number":"pith:YEP23X6O","canonical_record":{"source":{"id":"1407.7125","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-26T12:40:11Z","cross_cats_sorted":[],"title_canon_sha256":"f411a79b111e7c465f7056a919453c9ecee4a84520a313c6ed29b13a3ea74c43","abstract_canon_sha256":"d7996bbb6c08826f6ce40e3319ebccee97193a57a23c93f1faf96fb2a3325f0d"},"schema_version":"1.0"},"canonical_sha256":"c11faddfcef9f868da7feba4df97bf580610260c9299da446012e77dd53463fd","source":{"kind":"arxiv","id":"1407.7125","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7125","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7125v2","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7125","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"YEP23X6O7H4G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YEP23X6O7H4GRWT7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YEP23X6O","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YEP23X6O7H4GRWT75OSN7F57LA","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7125","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-26T12:40:11Z","cross_cats_sorted":[],"title_canon_sha256":"f411a79b111e7c465f7056a919453c9ecee4a84520a313c6ed29b13a3ea74c43","abstract_canon_sha256":"d7996bbb6c08826f6ce40e3319ebccee97193a57a23c93f1faf96fb2a3325f0d"},"schema_version":"1.0"},"canonical_sha256":"c11faddfcef9f868da7feba4df97bf580610260c9299da446012e77dd53463fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:46.547975Z","signature_b64":"nMg67ml1XV5Rr1RPoaJGruoLoQW1ZwG+PBqpNFfUbugAgxktUqBXSPIidHl8agpfoC6n60k61B++s7el/R+7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c11faddfcef9f868da7feba4df97bf580610260c9299da446012e77dd53463fd","last_reissued_at":"2026-05-18T01:05:46.547301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:46.547301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7125","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:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8gJa2CnlGuzQb1HDQFEM1Su2M0+ZoQeAzl5v9gryPxFO/RVcocXgUXTh+ropCdiZycVtTn5iWueVt2d2jIwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T12:58:57.552182Z"},"content_sha256":"2fd0fc21e2f1351f83a279ae61d46dc3706dc8ed49b8b99b3f47edbee0f9a35e","schema_version":"1.0","event_id":"sha256:2fd0fc21e2f1351f83a279ae61d46dc3706dc8ed49b8b99b3f47edbee0f9a35e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YEP23X6O7H4GRWT75OSN7F57LA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A 3-factor approximation algorithm for a Maximum Acyclic Agreement Forest on k rooted, binary phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asish Mukhopadhyay, Puspal Bhabak","submitted_at":"2014-07-26T12:40:11Z","abstract_excerpt":"Phylogenetic trees are leaf-labelled trees, where the leaves correspond to extant species (taxa), and the internal vertices represent ancestral species. The evolutionary history of a set of species can be explained by more than one phylogenetic tree, giving rise to the problem of comparing phylogenetic trees for similarity. Various distance metrics, like the subtree prune-and-regraft (SPR), tree bisection reconnection (TBR) and nearest neighbour interchange (NNI) have been proposed to capture this similarity. The distance between two phylogenetic trees can also be measured by the size of a Max"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7125","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:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLE4Ew30P20D046KZKpLWi4Qwc+tj9PSLjUfjo7rmNXy6t1vHub7iexT0JzqReJyiYRm3EctzHk00PnZnNr2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T12:58:57.552536Z"},"content_sha256":"d054d1bfe47c32cac3052f2e6d0423751f82899d19aa744d3ed27ce04047a449","schema_version":"1.0","event_id":"sha256:d054d1bfe47c32cac3052f2e6d0423751f82899d19aa744d3ed27ce04047a449"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEP23X6O7H4GRWT75OSN7F57LA/bundle.json","state_url":"https://pith.science/pith/YEP23X6O7H4GRWT75OSN7F57LA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEP23X6O7H4GRWT75OSN7F57LA/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-30T12:58:57Z","links":{"resolver":"https://pith.science/pith/YEP23X6O7H4GRWT75OSN7F57LA","bundle":"https://pith.science/pith/YEP23X6O7H4GRWT75OSN7F57LA/bundle.json","state":"https://pith.science/pith/YEP23X6O7H4GRWT75OSN7F57LA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEP23X6O7H4GRWT75OSN7F57LA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YEP23X6O7H4GRWT75OSN7F57LA","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":"d7996bbb6c08826f6ce40e3319ebccee97193a57a23c93f1faf96fb2a3325f0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-26T12:40:11Z","title_canon_sha256":"f411a79b111e7c465f7056a919453c9ecee4a84520a313c6ed29b13a3ea74c43"},"schema_version":"1.0","source":{"id":"1407.7125","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7125","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7125v2","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7125","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"YEP23X6O7H4G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YEP23X6O7H4GRWT7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YEP23X6O","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:d054d1bfe47c32cac3052f2e6d0423751f82899d19aa744d3ed27ce04047a449","target":"graph","created_at":"2026-05-18T01:05:46Z","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":"Phylogenetic trees are leaf-labelled trees, where the leaves correspond to extant species (taxa), and the internal vertices represent ancestral species. The evolutionary history of a set of species can be explained by more than one phylogenetic tree, giving rise to the problem of comparing phylogenetic trees for similarity. Various distance metrics, like the subtree prune-and-regraft (SPR), tree bisection reconnection (TBR) and nearest neighbour interchange (NNI) have been proposed to capture this similarity. The distance between two phylogenetic trees can also be measured by the size of a Max","authors_text":"Asish Mukhopadhyay, Puspal Bhabak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-26T12:40:11Z","title":"A 3-factor approximation algorithm for a Maximum Acyclic Agreement Forest on k rooted, binary phylogenetic trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7125","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:2fd0fc21e2f1351f83a279ae61d46dc3706dc8ed49b8b99b3f47edbee0f9a35e","target":"record","created_at":"2026-05-18T01:05:46Z","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":"d7996bbb6c08826f6ce40e3319ebccee97193a57a23c93f1faf96fb2a3325f0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-26T12:40:11Z","title_canon_sha256":"f411a79b111e7c465f7056a919453c9ecee4a84520a313c6ed29b13a3ea74c43"},"schema_version":"1.0","source":{"id":"1407.7125","kind":"arxiv","version":2}},"canonical_sha256":"c11faddfcef9f868da7feba4df97bf580610260c9299da446012e77dd53463fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c11faddfcef9f868da7feba4df97bf580610260c9299da446012e77dd53463fd","first_computed_at":"2026-05-18T01:05:46.547301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:46.547301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nMg67ml1XV5Rr1RPoaJGruoLoQW1ZwG+PBqpNFfUbugAgxktUqBXSPIidHl8agpfoC6n60k61B++s7el/R+7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:46.547975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7125","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fd0fc21e2f1351f83a279ae61d46dc3706dc8ed49b8b99b3f47edbee0f9a35e","sha256:d054d1bfe47c32cac3052f2e6d0423751f82899d19aa744d3ed27ce04047a449"],"state_sha256":"66bd31d16dd5cf052d187a953fdb810dec2dedae3ac4cbb3fb936af00398b25a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1geIHNFRwQC8clmgpVgOjnj1emHck40I+RzyaKxggIpQzDq3dQk68RCgkvJWedw4gkAEPOr5GHJWdFRGSyG4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T12:58:57.554362Z","bundle_sha256":"72621e8ac4da5672c2f6d753fa7574d86b31713d1e1ac1a2d8a9ffa27e85a69c"}}