{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IZP4NHOJMV2QNKURVHVYQPQQHC","short_pith_number":"pith:IZP4NHOJ","schema_version":"1.0","canonical_sha256":"465fc69dc9657506aa91a9eb883e1038b2cedbc1664c1e49f68caafa19dafcbb","source":{"kind":"arxiv","id":"1512.05703","version":1},"attestation_state":"computed","paper":{"title":"Computing a Relevant Set of Nonbinary Maximum Acyclic Agreement Forests","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-17T18:10:20Z","abstract_excerpt":"There exist several methods dealing with the reconstruction of rooted phylogenetic networks explaining different evolutionary histories given by rooted binary phylogenetic trees. In practice, however, due to insufficient information of the underlying data, phylogenetic trees are in general not completely resolved and, thus, those methods can often not be applied to biological data. In this work, we make a first important step to approach this goal by presenting the first algorithm --- called allMulMAAFs --- that enables the computation of all relevant nonbinary maximum acyclic agreement forest"},"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.05703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2015-12-17T18:10:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"de585179cb73cc6cfe24a92595fb4d6a7cef3a0ae86d034e8d5d8f961fcc9bf9","abstract_canon_sha256":"fd5f5b75fc894dfdebae8b0a11019f97a97f197985f1c51ba7a782d287daf0f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:09.459968Z","signature_b64":"CkKw1JYB7BTwIiq+g7Ha+tciS6FpqGuBaHQkfMjNajVlsudhD88Rd0Y9hNzwEL/Z0OY8pYm4QEHBwBscNi2CAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"465fc69dc9657506aa91a9eb883e1038b2cedbc1664c1e49f68caafa19dafcbb","last_reissued_at":"2026-05-18T01:24:09.459287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:09.459287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing a Relevant Set of Nonbinary Maximum Acyclic Agreement Forests","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-17T18:10:20Z","abstract_excerpt":"There exist several methods dealing with the reconstruction of rooted phylogenetic networks explaining different evolutionary histories given by rooted binary phylogenetic trees. In practice, however, due to insufficient information of the underlying data, phylogenetic trees are in general not completely resolved and, thus, those methods can often not be applied to biological data. In this work, we make a first important step to approach this goal by presenting the first algorithm --- called allMulMAAFs --- that enables the computation of all relevant nonbinary maximum acyclic agreement forest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05703","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.05703","created_at":"2026-05-18T01:24:09.459390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05703v1","created_at":"2026-05-18T01:24:09.459390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05703","created_at":"2026-05-18T01:24:09.459390+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZP4NHOJMV2Q","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZP4NHOJMV2QNKUR","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZP4NHOJ","created_at":"2026-05-18T12:29:27.538025+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/IZP4NHOJMV2QNKURVHVYQPQQHC","json":"https://pith.science/pith/IZP4NHOJMV2QNKURVHVYQPQQHC.json","graph_json":"https://pith.science/api/pith-number/IZP4NHOJMV2QNKURVHVYQPQQHC/graph.json","events_json":"https://pith.science/api/pith-number/IZP4NHOJMV2QNKURVHVYQPQQHC/events.json","paper":"https://pith.science/paper/IZP4NHOJ"},"agent_actions":{"view_html":"https://pith.science/pith/IZP4NHOJMV2QNKURVHVYQPQQHC","download_json":"https://pith.science/pith/IZP4NHOJMV2QNKURVHVYQPQQHC.json","view_paper":"https://pith.science/paper/IZP4NHOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05703&json=true","fetch_graph":"https://pith.science/api/pith-number/IZP4NHOJMV2QNKURVHVYQPQQHC/graph.json","fetch_events":"https://pith.science/api/pith-number/IZP4NHOJMV2QNKURVHVYQPQQHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZP4NHOJMV2QNKURVHVYQPQQHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZP4NHOJMV2QNKURVHVYQPQQHC/action/storage_attestation","attest_author":"https://pith.science/pith/IZP4NHOJMV2QNKURVHVYQPQQHC/action/author_attestation","sign_citation":"https://pith.science/pith/IZP4NHOJMV2QNKURVHVYQPQQHC/action/citation_signature","submit_replication":"https://pith.science/pith/IZP4NHOJMV2QNKURVHVYQPQQHC/action/replication_record"}},"created_at":"2026-05-18T01:24:09.459390+00:00","updated_at":"2026-05-18T01:24:09.459390+00:00"}