{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:A2G537GIQOSIHQJLYEBJNEZPRK","short_pith_number":"pith:A2G537GI","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"},"canonical_sha256":"068dddfcc883a483c12bc10296932f8a9330412648322ac42c3a989de3717738","source":{"kind":"arxiv","id":"2011.00511","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.00511","created_at":"2026-07-05T02:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"2011.00511v2","created_at":"2026-07-05T02:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.00511","created_at":"2026-07-05T02:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"A2G537GIQOSI","created_at":"2026-07-05T02:20:58Z"},{"alias_kind":"pith_short_16","alias_value":"A2G537GIQOSIHQJL","created_at":"2026-07-05T02:20:58Z"},{"alias_kind":"pith_short_8","alias_value":"A2G537GI","created_at":"2026-07-05T02:20:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:A2G537GIQOSIHQJLYEBJNEZPRK","target":"record","payload":{"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"},"canonical_sha256":"068dddfcc883a483c12bc10296932f8a9330412648322ac42c3a989de3717738","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"},"source_kind":"arxiv","source_id":"2011.00511","source_version":2,"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-07-05T02:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0fOnf5zFdPk1abRanlL3/0XgJKLkk3NrNhrkZcbGXFKQ1ir0ncrPNqQD/BHWHZ/927WKQ97h5H5s1p4qT8lBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:51:30.592415Z"},"content_sha256":"fec7aaef1cf12671a48a773f74a3c6808bc063022b2c759f58ff2982b4efbd92","schema_version":"1.0","event_id":"sha256:fec7aaef1cf12671a48a773f74a3c6808bc063022b2c759f58ff2982b4efbd92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:A2G537GIQOSIHQJLYEBJNEZPRK","target":"graph","payload":{"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"},"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-07-05T02:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GiFizkqwxP9yWAyDlxX2D7sel5ei8z4uHYP72VJssz2R3LjAQxO33wnFkWIxLRBWX+zaumuYdnk4ROCn+3sjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:51:30.592855Z"},"content_sha256":"592af27eb9759b0ee2ee5ffaa8a4bc7e9d0f6484124ff4acb10393a9ca5043f2","schema_version":"1.0","event_id":"sha256:592af27eb9759b0ee2ee5ffaa8a4bc7e9d0f6484124ff4acb10393a9ca5043f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK/bundle.json","state_url":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2G537GIQOSIHQJLYEBJNEZPRK/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-07-07T06:51:30Z","links":{"resolver":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK","bundle":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK/bundle.json","state":"https://pith.science/pith/A2G537GIQOSIHQJLYEBJNEZPRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2G537GIQOSIHQJLYEBJNEZPRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:A2G537GIQOSIHQJLYEBJNEZPRK","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":"11587cdf3c4519b6b563fc25cbe203a9bfba38e27b671595a2131de6d6d4d6df","cross_cats_sorted":["cs.CC","cs.DM","math.CO","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-01T14:22:30Z","title_canon_sha256":"62aad5786111adf99c481840a7b7a6512855ddc5fd6d4e683d8c22456df4bd6d"},"schema_version":"1.0","source":{"id":"2011.00511","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.00511","created_at":"2026-07-05T02:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"2011.00511v2","created_at":"2026-07-05T02:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.00511","created_at":"2026-07-05T02:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"A2G537GIQOSI","created_at":"2026-07-05T02:20:58Z"},{"alias_kind":"pith_short_16","alias_value":"A2G537GIQOSIHQJL","created_at":"2026-07-05T02:20:58Z"},{"alias_kind":"pith_short_8","alias_value":"A2G537GI","created_at":"2026-07-05T02:20:58Z"}],"graph_snapshots":[{"event_id":"sha256:592af27eb9759b0ee2ee5ffaa8a4bc7e9d0f6484124ff4acb10393a9ca5043f2","target":"graph","created_at":"2026-07-05T02:20:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.00511/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"David Schaller, Manuela Gei{\\ss}, Marc Hellmuth, Peter F. Stadler","cross_cats":["cs.CC","cs.DM","math.CO","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-01T14:22:30Z","title":"Best Match Graphs with Binary Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.00511","kind":"arxiv","version":2},"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:fec7aaef1cf12671a48a773f74a3c6808bc063022b2c759f58ff2982b4efbd92","target":"record","created_at":"2026-07-05T02:20:58Z","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":"11587cdf3c4519b6b563fc25cbe203a9bfba38e27b671595a2131de6d6d4d6df","cross_cats_sorted":["cs.CC","cs.DM","math.CO","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-01T14:22:30Z","title_canon_sha256":"62aad5786111adf99c481840a7b7a6512855ddc5fd6d4e683d8c22456df4bd6d"},"schema_version":"1.0","source":{"id":"2011.00511","kind":"arxiv","version":2}},"canonical_sha256":"068dddfcc883a483c12bc10296932f8a9330412648322ac42c3a989de3717738","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"068dddfcc883a483c12bc10296932f8a9330412648322ac42c3a989de3717738","first_computed_at":"2026-07-05T02:20:58.364160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:20:58.364160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ffmoxACUqvjcscJoGu/dheqCcytJTkrpFY2w5Gj6ywFg12Kzur5YFI/9PE8GIr8K1AZ3kPvuLMtzZ/JouaGpDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:20:58.364670Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.00511","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fec7aaef1cf12671a48a773f74a3c6808bc063022b2c759f58ff2982b4efbd92","sha256:592af27eb9759b0ee2ee5ffaa8a4bc7e9d0f6484124ff4acb10393a9ca5043f2"],"state_sha256":"6e8a178322b736da4254278bc83c143120c5b74cde6c891ecd0bc57ef6f842b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wiog6NJYJaJSukdNPSSOGCCa+d+50iYbWF5kCyK8+BU7pnH7B9oVHvGx5chUul60D+IYxS9h3paJcV0j6TCyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:51:30.595100Z","bundle_sha256":"9e997f2fb6e920280070062ee0198a0e5faa644fc0999673c98aa0262be86008"}}