{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TRWRSUEHNZWBRGX6UICY3WVA34","short_pith_number":"pith:TRWRSUEH","schema_version":"1.0","canonical_sha256":"9c6d1950876e6c189afea2058ddaa0df2ab9ab67d6380671dd184e129fdcbcff","source":{"kind":"arxiv","id":"1109.3268","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.3268","created_at":"2026-05-18T04:12:57.128323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3268v1","created_at":"2026-05-18T04:12:57.128323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3268","created_at":"2026-05-18T04:12:57.128323+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRWRSUEHNZWB","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRWRSUEHNZWBRGX6","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRWRSUEH","created_at":"2026-05-18T12:26:42.757692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34","json":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34.json","graph_json":"https://pith.science/api/pith-number/TRWRSUEHNZWBRGX6UICY3WVA34/graph.json","events_json":"https://pith.science/api/pith-number/TRWRSUEHNZWBRGX6UICY3WVA34/events.json","paper":"https://pith.science/paper/TRWRSUEH"},"agent_actions":{"view_html":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34","download_json":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34.json","view_paper":"https://pith.science/paper/TRWRSUEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3268&json=true","fetch_graph":"https://pith.science/api/pith-number/TRWRSUEHNZWBRGX6UICY3WVA34/graph.json","fetch_events":"https://pith.science/api/pith-number/TRWRSUEHNZWBRGX6UICY3WVA34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34/action/storage_attestation","attest_author":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34/action/author_attestation","sign_citation":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34/action/citation_signature","submit_replication":"https://pith.science/pith/TRWRSUEHNZWBRGX6UICY3WVA34/action/replication_record"}},"created_at":"2026-05-18T04:12:57.128323+00:00","updated_at":"2026-05-18T04:12:57.128323+00:00"}