{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:A2G537GIQOSIHQJLYEBJNEZPRK","short_pith_number":"pith:A2G537GI","schema_version":"1.0","canonical_sha256":"068dddfcc883a483c12bc10296932f8a9330412648322ac42c3a989de3717738","source":{"kind":"arxiv","id":"2011.00511","version":2},"attestation_state":"computed","paper":{"title":"Best Match Graphs with Binary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO","q-bio.PE"],"primary_cat":"cs.DS","authors_text":"David Schaller, Manuela Gei{\\ss}, Marc Hellmuth, Peter F. Stadler","submitted_at":"2020-11-01T14:22:30Z","abstract_excerpt":"Best match graphs (BMG) are a key intermediate in graph-based orthology detection and contain a large amount of information on the gene tree. We provide a near-cubic algorithm to determine whether a BMG is binary-explainable, i.e., whether it can be explained by a fully resolved gene tree and, if so, to construct such a tree. Moreover, we show that all such binary trees are refinements of the unique binary-resolvable tree (BRT), which in general is a substantial refinement of the also unique least resolved tree of a BMG. Finally, we show that the problem of editing an arbitrary vertex-colored "},"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":"2011.00511","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-01T14:22:30Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO","q-bio.PE"],"title_canon_sha256":"62aad5786111adf99c481840a7b7a6512855ddc5fd6d4e683d8c22456df4bd6d","abstract_canon_sha256":"11587cdf3c4519b6b563fc25cbe203a9bfba38e27b671595a2131de6d6d4d6df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:20:58.364670Z","signature_b64":"ffmoxACUqvjcscJoGu/dheqCcytJTkrpFY2w5Gj6ywFg12Kzur5YFI/9PE8GIr8K1AZ3kPvuLMtzZ/JouaGpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"068dddfcc883a483c12bc10296932f8a9330412648322ac42c3a989de3717738","last_reissued_at":"2026-07-05T02:20:58.364160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:20:58.364160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best Match Graphs with Binary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO","q-bio.PE"],"primary_cat":"cs.DS","authors_text":"David Schaller, Manuela Gei{\\ss}, Marc Hellmuth, Peter F. Stadler","submitted_at":"2020-11-01T14:22:30Z","abstract_excerpt":"Best match graphs (BMG) are a key intermediate in graph-based orthology detection and contain a large amount of information on the gene tree. We provide a near-cubic algorithm to determine whether a BMG is binary-explainable, i.e., whether it can be explained by a fully resolved gene tree and, if so, to construct such a tree. Moreover, we show that all such binary trees are refinements of the unique binary-resolvable tree (BRT), which in general is a substantial refinement of the also unique least resolved tree of a BMG. Finally, we show that the problem of editing an arbitrary vertex-colored "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.00511","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.00511/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.00511","created_at":"2026-07-05T02:20:58.364207+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.00511v2","created_at":"2026-07-05T02:20:58.364207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.00511","created_at":"2026-07-05T02:20:58.364207+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2G537GIQOSI","created_at":"2026-07-05T02:20:58.364207+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2G537GIQOSIHQJL","created_at":"2026-07-05T02:20:58.364207+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2G537GI","created_at":"2026-07-05T02:20:58.364207+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/A2G537GIQOSIHQJLYEBJNEZPRK","json":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK.json","graph_json":"https://pith.science/api/pith-number/A2G537GIQOSIHQJLYEBJNEZPRK/graph.json","events_json":"https://pith.science/api/pith-number/A2G537GIQOSIHQJLYEBJNEZPRK/events.json","paper":"https://pith.science/paper/A2G537GI"},"agent_actions":{"view_html":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK","download_json":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK.json","view_paper":"https://pith.science/paper/A2G537GI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.00511&json=true","fetch_graph":"https://pith.science/api/pith-number/A2G537GIQOSIHQJLYEBJNEZPRK/graph.json","fetch_events":"https://pith.science/api/pith-number/A2G537GIQOSIHQJLYEBJNEZPRK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK/action/storage_attestation","attest_author":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK/action/author_attestation","sign_citation":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK/action/citation_signature","submit_replication":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK/action/replication_record"}},"created_at":"2026-07-05T02:20:58.364207+00:00","updated_at":"2026-07-05T02:20:58.364207+00:00"}