{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LYMTYMTLVMEQOAF6ZXRKNEORXR","short_pith_number":"pith:LYMTYMTL","schema_version":"1.0","canonical_sha256":"5e193c326bab090700becde2a691d1bc737940127284074afc831f92d27f6982","source":{"kind":"arxiv","id":"1907.08865","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Manuela Gei{\\ss}, Marc Hellmuth, Peter F. Stadler","submitted_at":"2019-07-20T20:22:08Z","abstract_excerpt":"Reciprocal best match graphs (RBMGs) are vertex colored graphs whose vertices represent genes and the colors the species where the genes reside. Edges identify pairs of genes that are most closely related with respect to an underlying evolutionary tree. In practical applications this tree is unknown and the edges of the RBMGs are inferred by quantifying sequence similarity. Due to noise in the data, these empirically determined graphs in general violate the condition of being a ``biologically feasible'' RBMG. Therefore, it is of practical interest in computational biology to correct the initia"},"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":"1907.08865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-20T20:22:08Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"06329d572590e0bc33cf59dd5cc0ebd1272c1bd2a8c7835cdbb803d6124eef31","abstract_canon_sha256":"65880c67fe3ae8fdcd3afa73e1dd3693df6f86f3b8cd9d29cb3cc00701c3e741"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:02.951571Z","signature_b64":"cafgc4DGVwvDlh5T326p1nQtg7BX++XLuikl0Ckke+nkLP1OJ/6wpN8+ouWcAUm75oVWj2eJyWOhizQMvahIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e193c326bab090700becde2a691d1bc737940127284074afc831f92d27f6982","last_reissued_at":"2026-05-17T23:40:02.950934Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:02.950934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Manuela Gei{\\ss}, Marc Hellmuth, Peter F. Stadler","submitted_at":"2019-07-20T20:22:08Z","abstract_excerpt":"Reciprocal best match graphs (RBMGs) are vertex colored graphs whose vertices represent genes and the colors the species where the genes reside. Edges identify pairs of genes that are most closely related with respect to an underlying evolutionary tree. In practical applications this tree is unknown and the edges of the RBMGs are inferred by quantifying sequence similarity. Due to noise in the data, these empirically determined graphs in general violate the condition of being a ``biologically feasible'' RBMG. Therefore, it is of practical interest in computational biology to correct the initia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08865","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":"1907.08865","created_at":"2026-05-17T23:40:02.951051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08865v1","created_at":"2026-05-17T23:40:02.951051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08865","created_at":"2026-05-17T23:40:02.951051+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYMTYMTLVMEQ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYMTYMTLVMEQOAF6","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYMTYMTL","created_at":"2026-05-18T12:33:21.387695+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/LYMTYMTLVMEQOAF6ZXRKNEORXR","json":"https://pith.science/pith/LYMTYMTLVMEQOAF6ZXRKNEORXR.json","graph_json":"https://pith.science/api/pith-number/LYMTYMTLVMEQOAF6ZXRKNEORXR/graph.json","events_json":"https://pith.science/api/pith-number/LYMTYMTLVMEQOAF6ZXRKNEORXR/events.json","paper":"https://pith.science/paper/LYMTYMTL"},"agent_actions":{"view_html":"https://pith.science/pith/LYMTYMTLVMEQOAF6ZXRKNEORXR","download_json":"https://pith.science/pith/LYMTYMTLVMEQOAF6ZXRKNEORXR.json","view_paper":"https://pith.science/paper/LYMTYMTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08865&json=true","fetch_graph":"https://pith.science/api/pith-number/LYMTYMTLVMEQOAF6ZXRKNEORXR/graph.json","fetch_events":"https://pith.science/api/pith-number/LYMTYMTLVMEQOAF6ZXRKNEORXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYMTYMTLVMEQOAF6ZXRKNEORXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYMTYMTLVMEQOAF6ZXRKNEORXR/action/storage_attestation","attest_author":"https://pith.science/pith/LYMTYMTLVMEQOAF6ZXRKNEORXR/action/author_attestation","sign_citation":"https://pith.science/pith/LYMTYMTLVMEQOAF6ZXRKNEORXR/action/citation_signature","submit_replication":"https://pith.science/pith/LYMTYMTLVMEQOAF6ZXRKNEORXR/action/replication_record"}},"created_at":"2026-05-17T23:40:02.951051+00:00","updated_at":"2026-05-17T23:40:02.951051+00:00"}