{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZZFZS6BYM44JBJTDQZMP2HKLZT","short_pith_number":"pith:ZZFZS6BY","canonical_record":{"source":{"id":"1207.6090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2012-07-25T19:11:42Z","cross_cats_sorted":["math.CO","q-bio.PE"],"title_canon_sha256":"929103226228aa556847b1978c7cd3c469c3d4a417d8866da431feae89cea26a","abstract_canon_sha256":"f378dd633d0222b71226d5ffdbc49afb9db4c974648aa671d8786822e85cb3b2"},"schema_version":"1.0"},"canonical_sha256":"ce4b997838673890a6638658fd1d4bccf8b7948e14e6f191e9b5de0a99d888a5","source":{"kind":"arxiv","id":"1207.6090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6090","created_at":"2026-05-18T03:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6090v1","created_at":"2026-05-18T03:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6090","created_at":"2026-05-18T03:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZZFZS6BYM44J","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZZFZS6BYM44JBJTD","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZZFZS6BY","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZZFZS6BYM44JBJTDQZMP2HKLZT","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2012-07-25T19:11:42Z","cross_cats_sorted":["math.CO","q-bio.PE"],"title_canon_sha256":"929103226228aa556847b1978c7cd3c469c3d4a417d8866da431feae89cea26a","abstract_canon_sha256":"f378dd633d0222b71226d5ffdbc49afb9db4c974648aa671d8786822e85cb3b2"},"schema_version":"1.0"},"canonical_sha256":"ce4b997838673890a6638658fd1d4bccf8b7948e14e6f191e9b5de0a99d888a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:09.528553Z","signature_b64":"Bvv704dBTaHnev3NrX9NlmKMw7vROFtHKageUzXt7tj8EmGqxzGSufsUHuejDt4PiViJRVPbZRBPrJizWiEmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce4b997838673890a6638658fd1d4bccf8b7948e14e6f191e9b5de0a99d888a5","last_reissued_at":"2026-05-18T03:50:09.527769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:09.527769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6090","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-18T03:50:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2Ey7r2I6u5tINZbE8XkWeBh5AhkTnVWLGQqaThaBd0fDGLjLbe3InwD7WMU+JcrYnBEz4ZCADyrQvLtIBfrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:21:20.388004Z"},"content_sha256":"f4ead8ec269efd7196dfd08a67d1a736bdc8d26679a7ea84ccd0c2fd1b838032","schema_version":"1.0","event_id":"sha256:f4ead8ec269efd7196dfd08a67d1a736bdc8d26679a7ea84ccd0c2fd1b838032"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZZFZS6BYM44JBJTDQZMP2HKLZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","q-bio.PE"],"primary_cat":"q-bio.QM","authors_text":"Steven Kelk, Teresa Piovesan","submitted_at":"2012-07-25T19:11:42Z","abstract_excerpt":"Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time (6^r.r!).poly(n)$, where n=|X|. The novelty of this approach is its use of terminals, which are maximal elements of a natural partial order on X, and several insights from the softwired clusters literature. This yields a surprisingly simple and practical bounded-search algorithm and offers an alternative perspective on the underlying combinatorial structure of the hybridization number problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6090","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-18T03:50:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5k4bz9uRD24xfKM4Atfk42NgQv/lL+0eW9wupvZakps9kxt3X1EgwUzFAgSNtAsUkZvMxyaATrTDMNhOhHfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:21:20.388651Z"},"content_sha256":"62475a718892885777f36ac1685813464b96f79863deeefe57b460bd1068600c","schema_version":"1.0","event_id":"sha256:62475a718892885777f36ac1685813464b96f79863deeefe57b460bd1068600c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZFZS6BYM44JBJTDQZMP2HKLZT/bundle.json","state_url":"https://pith.science/pith/ZZFZS6BYM44JBJTDQZMP2HKLZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZFZS6BYM44JBJTDQZMP2HKLZT/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-28T00:21:20Z","links":{"resolver":"https://pith.science/pith/ZZFZS6BYM44JBJTDQZMP2HKLZT","bundle":"https://pith.science/pith/ZZFZS6BYM44JBJTDQZMP2HKLZT/bundle.json","state":"https://pith.science/pith/ZZFZS6BYM44JBJTDQZMP2HKLZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZFZS6BYM44JBJTDQZMP2HKLZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZZFZS6BYM44JBJTDQZMP2HKLZT","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":"f378dd633d0222b71226d5ffdbc49afb9db4c974648aa671d8786822e85cb3b2","cross_cats_sorted":["math.CO","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2012-07-25T19:11:42Z","title_canon_sha256":"929103226228aa556847b1978c7cd3c469c3d4a417d8866da431feae89cea26a"},"schema_version":"1.0","source":{"id":"1207.6090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6090","created_at":"2026-05-18T03:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6090v1","created_at":"2026-05-18T03:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6090","created_at":"2026-05-18T03:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZZFZS6BYM44J","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZZFZS6BYM44JBJTD","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZZFZS6BY","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:62475a718892885777f36ac1685813464b96f79863deeefe57b460bd1068600c","target":"graph","created_at":"2026-05-18T03:50:09Z","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, not necessarily binary phylogenetic trees on taxon set X in time (6^r.r!).poly(n)$, where n=|X|. The novelty of this approach is its use of terminals, which are maximal elements of a natural partial order on X, and several insights from the softwired clusters literature. This yields a surprisingly simple and practical bounded-search algorithm and offers an alternative perspective on the underlying combinatorial structure of the hybridization number problem.","authors_text":"Steven Kelk, Teresa Piovesan","cross_cats":["math.CO","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2012-07-25T19:11:42Z","title":"A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6090","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:f4ead8ec269efd7196dfd08a67d1a736bdc8d26679a7ea84ccd0c2fd1b838032","target":"record","created_at":"2026-05-18T03:50:09Z","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":"f378dd633d0222b71226d5ffdbc49afb9db4c974648aa671d8786822e85cb3b2","cross_cats_sorted":["math.CO","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2012-07-25T19:11:42Z","title_canon_sha256":"929103226228aa556847b1978c7cd3c469c3d4a417d8866da431feae89cea26a"},"schema_version":"1.0","source":{"id":"1207.6090","kind":"arxiv","version":1}},"canonical_sha256":"ce4b997838673890a6638658fd1d4bccf8b7948e14e6f191e9b5de0a99d888a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce4b997838673890a6638658fd1d4bccf8b7948e14e6f191e9b5de0a99d888a5","first_computed_at":"2026-05-18T03:50:09.527769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:09.527769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bvv704dBTaHnev3NrX9NlmKMw7vROFtHKageUzXt7tj8EmGqxzGSufsUHuejDt4PiViJRVPbZRBPrJizWiEmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:09.528553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4ead8ec269efd7196dfd08a67d1a736bdc8d26679a7ea84ccd0c2fd1b838032","sha256:62475a718892885777f36ac1685813464b96f79863deeefe57b460bd1068600c"],"state_sha256":"8245ee54e68fbeaa5da545b00f4a3508d238cd2b9051f689ae11bc08a7a2d468"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNRHc6DYqvwnxqrYYyURi5w1kVG4g/+P91mH2DvqxR4Oi4CUL7M7LXqXRxNXwWlHt7epbbii8zwfJpWrp8SiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:21:20.390968Z","bundle_sha256":"00eca29da55293345bda08ef921b504c233c21ed0d04f93bd680a408c01b045f"}}