{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TRWRSUEHNZWBRGX6UICY3WVA34","short_pith_number":"pith:TRWRSUEH","canonical_record":{"source":{"id":"1109.3268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-09-15T06:29:37Z","cross_cats_sorted":[],"title_canon_sha256":"a8b818138d9cc6e3f950611930e50df840ae90418cd381cd80fa62a813a5c62a","abstract_canon_sha256":"672ee4a6eaf6dbb4364da84a84d52d4966ce503485fe908838eed4691afa7b39"},"schema_version":"1.0"},"canonical_sha256":"9c6d1950876e6c189afea2058ddaa0df2ab9ab67d6380671dd184e129fdcbcff","source":{"kind":"arxiv","id":"1109.3268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3268","created_at":"2026-05-18T04:12:57Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3268v1","created_at":"2026-05-18T04:12:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3268","created_at":"2026-05-18T04:12:57Z"},{"alias_kind":"pith_short_12","alias_value":"TRWRSUEHNZWB","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TRWRSUEHNZWBRGX6","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TRWRSUEH","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TRWRSUEHNZWBRGX6UICY3WVA34","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-09-15T06:29:37Z","cross_cats_sorted":[],"title_canon_sha256":"a8b818138d9cc6e3f950611930e50df840ae90418cd381cd80fa62a813a5c62a","abstract_canon_sha256":"672ee4a6eaf6dbb4364da84a84d52d4966ce503485fe908838eed4691afa7b39"},"schema_version":"1.0"},"canonical_sha256":"9c6d1950876e6c189afea2058ddaa0df2ab9ab67d6380671dd184e129fdcbcff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:57.128767Z","signature_b64":"y2uUw6zJZVUpAcgq97NBbbyo7meOwSR41dt6zrLR49HENWnF6HOwParGbTiQfAGWWuqUg41ayq9KadGZy5tTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c6d1950876e6c189afea2058ddaa0df2ab9ab67d6380671dd184e129fdcbcff","last_reissued_at":"2026-05-18T04:12:57.128224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:57.128224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3268","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:12:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsbONbqb1QJb3bV9HbVfFPXWpTUDfc5mpzxSTKbrQ8prfDFc6JwRUEhh53ex8PcGeWt7VTvFkNnLkIFR3RWXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:27:51.698428Z"},"content_sha256":"8c91c83237a482c61c7bdeb433657f9acc503c6c7f0032511804d932e2bfc932","schema_version":"1.0","event_id":"sha256:8c91c83237a482c61c7bdeb433657f9acc503c6c7f0032511804d932e2bfc932"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TRWRSUEHNZWBRGX6UICY3WVA34","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A first step towards computing all hybridization networks for two rooted binary phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Benjamin Albrecht, Celine Scornavacca, Simone Linz","submitted_at":"2011-09-15T06:29:37Z","abstract_excerpt":"Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimum number of hybridization vertices. With the standard approach to tackle this problem being combinatorial, the reconstructed network is rarely unique. From a biological point of view, it is therefore of importance to not only compute one network, but all possible networks. In this paper, we make a first step towards approaching this goal by presenting the first algorithm---called allMAAFs---that calculates all maximu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3268","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:12:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oh40MjTGXKpa2LMoxpY6G5axcD4b3q4GwgHoXoPNXCUqvd2RMedLxwt8Zm9z64eAApfrWsbK/BNKdMvfwQS0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:27:51.699274Z"},"content_sha256":"81eaba672b9ebf8697a4fc86f126088d79030abf313226eba2b1fe08f1d229c5","schema_version":"1.0","event_id":"sha256:81eaba672b9ebf8697a4fc86f126088d79030abf313226eba2b1fe08f1d229c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34/bundle.json","state_url":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRWRSUEHNZWBRGX6UICY3WVA34/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-25T04:27:51Z","links":{"resolver":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34","bundle":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34/bundle.json","state":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRWRSUEHNZWBRGX6UICY3WVA34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TRWRSUEHNZWBRGX6UICY3WVA34","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":"672ee4a6eaf6dbb4364da84a84d52d4966ce503485fe908838eed4691afa7b39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-09-15T06:29:37Z","title_canon_sha256":"a8b818138d9cc6e3f950611930e50df840ae90418cd381cd80fa62a813a5c62a"},"schema_version":"1.0","source":{"id":"1109.3268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3268","created_at":"2026-05-18T04:12:57Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3268v1","created_at":"2026-05-18T04:12:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3268","created_at":"2026-05-18T04:12:57Z"},{"alias_kind":"pith_short_12","alias_value":"TRWRSUEHNZWB","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TRWRSUEHNZWBRGX6","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TRWRSUEH","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:81eaba672b9ebf8697a4fc86f126088d79030abf313226eba2b1fe08f1d229c5","target":"graph","created_at":"2026-05-18T04:12:57Z","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":"Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimum number of hybridization vertices. With the standard approach to tackle this problem being combinatorial, the reconstructed network is rarely unique. From a biological point of view, it is therefore of importance to not only compute one network, but all possible networks. In this paper, we make a first step towards approaching this goal by presenting the first algorithm---called allMAAFs---that calculates all maximu","authors_text":"Benjamin Albrecht, Celine Scornavacca, Simone Linz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-09-15T06:29:37Z","title":"A first step towards computing all hybridization networks for two rooted binary phylogenetic trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3268","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:8c91c83237a482c61c7bdeb433657f9acc503c6c7f0032511804d932e2bfc932","target":"record","created_at":"2026-05-18T04:12:57Z","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":"672ee4a6eaf6dbb4364da84a84d52d4966ce503485fe908838eed4691afa7b39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-09-15T06:29:37Z","title_canon_sha256":"a8b818138d9cc6e3f950611930e50df840ae90418cd381cd80fa62a813a5c62a"},"schema_version":"1.0","source":{"id":"1109.3268","kind":"arxiv","version":1}},"canonical_sha256":"9c6d1950876e6c189afea2058ddaa0df2ab9ab67d6380671dd184e129fdcbcff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c6d1950876e6c189afea2058ddaa0df2ab9ab67d6380671dd184e129fdcbcff","first_computed_at":"2026-05-18T04:12:57.128224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:57.128224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y2uUw6zJZVUpAcgq97NBbbyo7meOwSR41dt6zrLR49HENWnF6HOwParGbTiQfAGWWuqUg41ayq9KadGZy5tTDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:57.128767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c91c83237a482c61c7bdeb433657f9acc503c6c7f0032511804d932e2bfc932","sha256:81eaba672b9ebf8697a4fc86f126088d79030abf313226eba2b1fe08f1d229c5"],"state_sha256":"b44606e90b59e0999d1001fcabc2c5c99262d308671dc2a5c5f2c0df0df7d379"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkuYf7e4jVzDjUfdv8DaxzTuZjxSe7fhYCWBLxu7uo4BZuFhFrLxwWK+qLxxv+MtKQoT7+o2EhGz8lXGqH42Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T04:27:51.701264Z","bundle_sha256":"268d1def3795ae9c515db58b0a75c463f32294252937ce9aa158dafb63207f32"}}