{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SEHLA5VYB4ASZDJWVXI3O4245M","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":"242d76b245eb2233de50c7240fab7c198725dd6be8b7ee4c37432394c58dd2db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-29T09:51:52Z","title_canon_sha256":"9da830a3c281b0c0b412b830e015e1aca33dee8595b30ff8d076bcbc1b375f82"},"schema_version":"1.0","source":{"id":"1803.10989","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10989","created_at":"2026-07-05T01:34:03Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10989v4","created_at":"2026-07-05T01:34:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10989","created_at":"2026-07-05T01:34:03Z"},{"alias_kind":"pith_short_12","alias_value":"SEHLA5VYB4AS","created_at":"2026-07-05T01:34:03Z"},{"alias_kind":"pith_short_16","alias_value":"SEHLA5VYB4ASZDJW","created_at":"2026-07-05T01:34:03Z"},{"alias_kind":"pith_short_8","alias_value":"SEHLA5VY","created_at":"2026-07-05T01:34:03Z"}],"graph_snapshots":[{"event_id":"sha256:85a1e35d503a4f94758aecc72983558af54ed53c947cb0d2d95efb2a555bb460","target":"graph","created_at":"2026-07-05T01:34:03Z","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/1803.10989/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"THIS IS A CORRECTED VERSION INCLUDING AN APPENDED CORRIGENDUM.\n  Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let $T$ be a phylogenetic (gene) tree $T$ and $\\sigma$ an assignment of leaves of $T$ to species. The best match graph $(G,\\sigma)$ is a digraph that contains an arc from $x$ to $y$ if the genes $x$ and $y$ reside in different species and $y$ is one of possibly many (evolutionary) closest relatives of $x$ compared to all other genes contained in the species $\\sigma(y)$. Here, we characterize best match graphs and show tha","authors_text":"Alitzel Lopez, B\\\"arbel M. R. Stadler, Dulce I. Valdivia, Edgar Chavez, Manuela Gei{\\ss}, Marc Hellmuth, Marcos Gonzalez, Maribel H. Rosales, Peter F. Stadler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-29T09:51:52Z","title":"Best Match Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10989","kind":"arxiv","version":4},"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:69d3c553fec78c1535dce679abd23c8c4a3f66bd57edfc2a13fc12569a155550","target":"record","created_at":"2026-07-05T01:34:03Z","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":"242d76b245eb2233de50c7240fab7c198725dd6be8b7ee4c37432394c58dd2db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-29T09:51:52Z","title_canon_sha256":"9da830a3c281b0c0b412b830e015e1aca33dee8595b30ff8d076bcbc1b375f82"},"schema_version":"1.0","source":{"id":"1803.10989","kind":"arxiv","version":4}},"canonical_sha256":"910eb076b80f012c8d36add1b7735ceb076ae9230d98e19456b83dc0526219dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"910eb076b80f012c8d36add1b7735ceb076ae9230d98e19456b83dc0526219dd","first_computed_at":"2026-07-05T01:34:03.374125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:34:03.374125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gYp0gt8P1hCcatv7qsWjeoAk8oDxGFJr62LMl4RJGXL/6//AIRinuFOCIurWqKiWeZD061aHqAKCEBWMXtiVCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:34:03.374547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10989","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69d3c553fec78c1535dce679abd23c8c4a3f66bd57edfc2a13fc12569a155550","sha256:85a1e35d503a4f94758aecc72983558af54ed53c947cb0d2d95efb2a555bb460"],"state_sha256":"18bf1c2edf9718031709aca935caea1ea723c8f480cbcb4849b9067dba6bedb6"}