{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FET3QR3AXJVLTG5LEWVEHLLWBK","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":"3ee63348b60f5690303ee3163f372eaf80ff3129bccb358af473b85a8e12fdf0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-18T07:41:39Z","title_canon_sha256":"3f20f3cb95cabc6baf948c987c6a26fd65817040d15d80bf793637c5e2a36129"},"schema_version":"1.0","source":{"id":"1911.07469","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.07469","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1911.07469v3","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07469","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"FET3QR3AXJVL","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"pith_short_16","alias_value":"FET3QR3AXJVLTG5L","created_at":"2026-07-05T03:23:03Z"},{"alias_kind":"pith_short_8","alias_value":"FET3QR3A","created_at":"2026-07-05T03:23:03Z"}],"graph_snapshots":[{"event_id":"sha256:4766cfff8666892335df434a117453f4a7fd71347749e0b3c65c288d39fda064","target":"graph","created_at":"2026-07-05T03:23: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/1911.07469/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fitch graphs $G=(X,E)$ are digraphs that are explained by $\\{\\emptyset, 1\\}$-edge-labeled rooted trees $T$ with leaf set $X$: there is an arc $(x,y) \\in E$ if and only if the unique path in $T$ that connects the last common ancestor $\\mathrm{lca}(x,y)$ of $x$ and $y$ with $y$ contains at least one edge with label \"1\". In practice, Fitch graphs represent xenology relations, i.e., pairs of genes $x$ and $y$ for which a horizontal gene transfer happened along the path from $\\mathrm{lca}(x,y)$ to $y$.\n  In this contribution, we generalize the concept of Fitch graphs and consider trees $T$ that are","authors_text":"Carsten R. Seemann, Marc Hellmuth, Peter F. Stadler","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-18T07:41:39Z","title":"Generalized Fitch Graphs II: Sets of Binary Relations that are explained by Edge-labeled Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07469","kind":"arxiv","version":3},"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:26dbe4303d1139bc36c059e94b53ada7b828e32f2614e564d972561f134e5289","target":"record","created_at":"2026-07-05T03:23: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":"3ee63348b60f5690303ee3163f372eaf80ff3129bccb358af473b85a8e12fdf0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-18T07:41:39Z","title_canon_sha256":"3f20f3cb95cabc6baf948c987c6a26fd65817040d15d80bf793637c5e2a36129"},"schema_version":"1.0","source":{"id":"1911.07469","kind":"arxiv","version":3}},"canonical_sha256":"2927b84760ba6ab99bab25aa43ad760abb173796b47e0530dce0f6eadac6b541","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2927b84760ba6ab99bab25aa43ad760abb173796b47e0530dce0f6eadac6b541","first_computed_at":"2026-07-05T03:23:03.895709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:23:03.895709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KzzIqIWc+xOluR6TfCm3zmrh3b+7POh3mTTTxk0LrWBg/YbOdKRIVtONLXgm3eFtfZOG90QURDCpwu1ynJcJBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:23:03.896151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.07469","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26dbe4303d1139bc36c059e94b53ada7b828e32f2614e564d972561f134e5289","sha256:4766cfff8666892335df434a117453f4a7fd71347749e0b3c65c288d39fda064"],"state_sha256":"08faa18d85ca4dd77c071a4d10602e735fc9cc89b8357795eaa1dda914000bcc"}