{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C4NJMB65IE7D24IGLWHWQMD66F","short_pith_number":"pith:C4NJMB65","canonical_record":{"source":{"id":"1108.4642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-08-23T15:54:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"903574c1ffaaaf7819e851ae6e2f20481cbd193494383cba3ce9685849937fb1","abstract_canon_sha256":"9b3caf0620512c3e326b64f19ef87e249f53984f0f241e467c4e1c5a97b51f11"},"schema_version":"1.0"},"canonical_sha256":"171a9607dd413e3d71065d8f68307ef153f4890e86523e112b7af7358e9a7cb4","source":{"kind":"arxiv","id":"1108.4642","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4642","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4642v1","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4642","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"C4NJMB65IE7D","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C4NJMB65IE7D24IG","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C4NJMB65","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C4NJMB65IE7D24IGLWHWQMD66F","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-08-23T15:54:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"903574c1ffaaaf7819e851ae6e2f20481cbd193494383cba3ce9685849937fb1","abstract_canon_sha256":"9b3caf0620512c3e326b64f19ef87e249f53984f0f241e467c4e1c5a97b51f11"},"schema_version":"1.0"},"canonical_sha256":"171a9607dd413e3d71065d8f68307ef153f4890e86523e112b7af7358e9a7cb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:54.035941Z","signature_b64":"0q83Jcy4CGcXlyT9m/eVIoi/PjsD/fbRjnFXAQx2bS0nAG83B3P2yEcdf+vyH3FvdkN6NQ+PMl1I6dcx0LZBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"171a9607dd413e3d71065d8f68307ef153f4890e86523e112b7af7358e9a7cb4","last_reissued_at":"2026-05-18T04:14:54.035483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:54.035483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4642","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-18T04:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"43nbLU5cigSFxoE+n/ApiXyLTxyM7xzauF4DyI5d5BMphJkgHv/mPcnSlxicJXHeYvLFllVRw7yjNM8iJwK6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:42:51.091358Z"},"content_sha256":"459fb159a6eb0ea3aeee5216afd29a15efd6f2d0534088fb161d232b0a05da81","schema_version":"1.0","event_id":"sha256:459fb159a6eb0ea3aeee5216afd29a15efd6f2d0534088fb161d232b0a05da81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C4NJMB65IE7D24IGLWHWQMD66F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on efficient computation of hybridization number via softwired clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Steven Kelk","submitted_at":"2011-08-23T15:54:02Z","abstract_excerpt":"Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted binary phylogenetic trees on taxon set X in time (6r)^r.poly(n), where n=|X|. The novelty of this approach is that it avoids the use of Maximum Acyclic Agreement Forests (MAAFs) and instead exploits the equivalence of the problem with a related problem from the softwired clusters literature. This offers an alternative perspective on the underlying combinatorial structure of the hybridization number problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4642","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-18T04:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txMl8oeCD1iq9Eey36DVNQmebp3X8dmHtvzRkEPN4IbCifKyi40211aWkdzC7apaSyje+/b4VPDoSLzWn6KlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:42:51.092049Z"},"content_sha256":"04b31f47717a3f31c65c6bc5bbe94b5d2013ce1320c5830b4d9f65a330f2c141","schema_version":"1.0","event_id":"sha256:04b31f47717a3f31c65c6bc5bbe94b5d2013ce1320c5830b4d9f65a330f2c141"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4NJMB65IE7D24IGLWHWQMD66F/bundle.json","state_url":"https://pith.science/pith/C4NJMB65IE7D24IGLWHWQMD66F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4NJMB65IE7D24IGLWHWQMD66F/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-06T07:42:51Z","links":{"resolver":"https://pith.science/pith/C4NJMB65IE7D24IGLWHWQMD66F","bundle":"https://pith.science/pith/C4NJMB65IE7D24IGLWHWQMD66F/bundle.json","state":"https://pith.science/pith/C4NJMB65IE7D24IGLWHWQMD66F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4NJMB65IE7D24IGLWHWQMD66F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C4NJMB65IE7D24IGLWHWQMD66F","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":"9b3caf0620512c3e326b64f19ef87e249f53984f0f241e467c4e1c5a97b51f11","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-08-23T15:54:02Z","title_canon_sha256":"903574c1ffaaaf7819e851ae6e2f20481cbd193494383cba3ce9685849937fb1"},"schema_version":"1.0","source":{"id":"1108.4642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4642","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4642v1","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4642","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"C4NJMB65IE7D","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C4NJMB65IE7D24IG","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C4NJMB65","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:04b31f47717a3f31c65c6bc5bbe94b5d2013ce1320c5830b4d9f65a330f2c141","target":"graph","created_at":"2026-05-18T04:14:54Z","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":"Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted binary phylogenetic trees on taxon set X in time (6r)^r.poly(n), where n=|X|. The novelty of this approach is that it avoids the use of Maximum Acyclic Agreement Forests (MAAFs) and instead exploits the equivalence of the problem with a related problem from the softwired clusters literature. This offers an alternative perspective on the underlying combinatorial structure of the hybridization number problem.","authors_text":"Steven Kelk","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-08-23T15:54:02Z","title":"A note on efficient computation of hybridization number via softwired clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4642","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:459fb159a6eb0ea3aeee5216afd29a15efd6f2d0534088fb161d232b0a05da81","target":"record","created_at":"2026-05-18T04:14:54Z","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":"9b3caf0620512c3e326b64f19ef87e249f53984f0f241e467c4e1c5a97b51f11","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-08-23T15:54:02Z","title_canon_sha256":"903574c1ffaaaf7819e851ae6e2f20481cbd193494383cba3ce9685849937fb1"},"schema_version":"1.0","source":{"id":"1108.4642","kind":"arxiv","version":1}},"canonical_sha256":"171a9607dd413e3d71065d8f68307ef153f4890e86523e112b7af7358e9a7cb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"171a9607dd413e3d71065d8f68307ef153f4890e86523e112b7af7358e9a7cb4","first_computed_at":"2026-05-18T04:14:54.035483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:54.035483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0q83Jcy4CGcXlyT9m/eVIoi/PjsD/fbRjnFXAQx2bS0nAG83B3P2yEcdf+vyH3FvdkN6NQ+PMl1I6dcx0LZBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:54.035941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:459fb159a6eb0ea3aeee5216afd29a15efd6f2d0534088fb161d232b0a05da81","sha256:04b31f47717a3f31c65c6bc5bbe94b5d2013ce1320c5830b4d9f65a330f2c141"],"state_sha256":"fa11e516942d99b84a31069206766b6b443ad0995fb4ee74df84d2b5b5d7dba4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"apSKDqkfyI/nxIczYjz7vd2tsV0kw/1E1aQishgQCE94BgGu3uekyO3+k8MPueZlYtG/E5bqZetZy2dTM9VdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T07:42:51.096665Z","bundle_sha256":"67350b012c83999a617d48bd18f2706d8469fa06b5ebf573eed906b356dd3110"}}