{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VXGMRMGVJR27IQFUQPUAO4IAWZ","short_pith_number":"pith:VXGMRMGV","schema_version":"1.0","canonical_sha256":"adccc8b0d54c75f440b483e8077100b646c37b37ba66e6ee02e8fb7bab17d9f7","source":{"kind":"arxiv","id":"1512.05656","version":1},"attestation_state":"computed","paper":{"title":"Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Benjamin Albrecht","submitted_at":"2015-12-17T16:21:47Z","abstract_excerpt":"Evolutionary scenarios displaying reticulation events are often represented by rooted phylogenetic networks. Due to biological reasons, those events occur very rarely, and, thus, networks containing a minimum number of such events, so-called minimum hybridization networks, are of particular interest for research. Moreover, to study reticulate evolution, biologist need not only a subset but all of those networks. To achieve this goal, the less complex concept of rooted phylogenetic trees can be used as building block. Here, as a first important step, the trees are disjoint into common parts, so"},"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":"1512.05656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-12-17T16:21:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3213a42bfc789a46bfd7645f260937ae59be3332c4a87351a97841cccd375448","abstract_canon_sha256":"245a4bff51f7db4251670e051f62a4f5a960fd675349c63edb5ac7668e94263d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:09.531236Z","signature_b64":"0X3P3GKkVmKW6jy2h1ErH7zPzo/ltvyn6YIVok8V/v5SPtme6qjvmC7ypQG4pihPZc4t386MVxO+B6a13EsQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adccc8b0d54c75f440b483e8077100b646c37b37ba66e6ee02e8fb7bab17d9f7","last_reissued_at":"2026-05-18T01:24:09.530717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:09.530717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Benjamin Albrecht","submitted_at":"2015-12-17T16:21:47Z","abstract_excerpt":"Evolutionary scenarios displaying reticulation events are often represented by rooted phylogenetic networks. Due to biological reasons, those events occur very rarely, and, thus, networks containing a minimum number of such events, so-called minimum hybridization networks, are of particular interest for research. Moreover, to study reticulate evolution, biologist need not only a subset but all of those networks. To achieve this goal, the less complex concept of rooted phylogenetic trees can be used as building block. Here, as a first important step, the trees are disjoint into common parts, so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05656","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":"1512.05656","created_at":"2026-05-18T01:24:09.530821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05656v1","created_at":"2026-05-18T01:24:09.530821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05656","created_at":"2026-05-18T01:24:09.530821+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXGMRMGVJR27","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXGMRMGVJR27IQFU","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXGMRMGV","created_at":"2026-05-18T12:29:47.479230+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/VXGMRMGVJR27IQFUQPUAO4IAWZ","json":"https://pith.science/pith/VXGMRMGVJR27IQFUQPUAO4IAWZ.json","graph_json":"https://pith.science/api/pith-number/VXGMRMGVJR27IQFUQPUAO4IAWZ/graph.json","events_json":"https://pith.science/api/pith-number/VXGMRMGVJR27IQFUQPUAO4IAWZ/events.json","paper":"https://pith.science/paper/VXGMRMGV"},"agent_actions":{"view_html":"https://pith.science/pith/VXGMRMGVJR27IQFUQPUAO4IAWZ","download_json":"https://pith.science/pith/VXGMRMGVJR27IQFUQPUAO4IAWZ.json","view_paper":"https://pith.science/paper/VXGMRMGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05656&json=true","fetch_graph":"https://pith.science/api/pith-number/VXGMRMGVJR27IQFUQPUAO4IAWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VXGMRMGVJR27IQFUQPUAO4IAWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXGMRMGVJR27IQFUQPUAO4IAWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXGMRMGVJR27IQFUQPUAO4IAWZ/action/storage_attestation","attest_author":"https://pith.science/pith/VXGMRMGVJR27IQFUQPUAO4IAWZ/action/author_attestation","sign_citation":"https://pith.science/pith/VXGMRMGVJR27IQFUQPUAO4IAWZ/action/citation_signature","submit_replication":"https://pith.science/pith/VXGMRMGVJR27IQFUQPUAO4IAWZ/action/replication_record"}},"created_at":"2026-05-18T01:24:09.530821+00:00","updated_at":"2026-05-18T01:24:09.530821+00:00"}