{"as_of":"2026-08-14T01:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b6033071dd72b8a20716bc992b5c5d1b0205158be9bddc5a29782ef45643615","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T18:30:43.810863Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1907.08865/citation-record","integrity":"/paper/1907.08865/integrity","json":"/paper/1907.08865/citation-record.json","paper":"/paper/1907.08865"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ee12ce6f-746d-4e5a-873c-a762bc7c5ecb","year":2009},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:90cabe4ec9d6f1cd222f5082c10d90a7e2af5124f7b4b04578bc7d2734a75c94","observation_id":"3ebe3a74-2af8-4ace-8f1e-ef4c1a75da03","resolution":{"observed_at":"2026-05-24T18:36:19.702519Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Standardized benchmarking in the quest for orthologs","venue":null,"work_id":"fb07eb45-fc10-4c08-bc74-d9699b303427","year":2016},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:0e60570f582a84140025efaad0230a058d455f9204fd71045c8ae875e325d262","observation_id":"1b38fb19-732e-4e56-9b37-9387e4134f58","resolution":{"observed_at":"2026-05-24T18:36:19.656814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"09aed614-f9f8-451f-89cf-6e11e69ee70f","year":2004},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:8ce23937ccc4c7d00af1520f5c1b68eb898c66170f0884aa080e260a5205b163","observation_id":"21f38990-a5be-4b9a-8bb3-501e391d94cb","resolution":{"observed_at":"2026-05-24T18:36:19.688698Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e8bf32e4-b650-4cea-b8c1-9caa38f6a091","year":2008},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:88e4945d3fdc87f328599abdae5bc79f32fb249451369b0a5c5bc1031174b788","observation_id":"16f78100-9a9d-4f31-b16e-ecd027503dc0","resolution":{"observed_at":"2026-05-24T18:36:19.659819Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pardalos","venue":null,"work_id":"b81f9daf-04ea-4694-a9c3-09b05bbb97f5","year":2008},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:245f3c73eaebbf1faea348932aff5cb2dcbefd24a491d23d791b94046578bf47","observation_id":"ff8bf289-17cf-4a58-b7e8-9b6bc6ee8cfc","resolution":{"observed_at":"2026-05-24T18:36:19.679487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fixed-parameter tractability of graph modification problems for hereditary prop- erties","venue":null,"work_id":"09d796a6-1448-4fde-8f07-8a43c1b89340","year":1996},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:f952043e1fc0b5c52cc26868cfd8bc414980afc8f23b7ba1a41fc174a77f05e6","observation_id":"3ce6cd74-5dfb-4f46-8509-fffaae5647bf","resolution":{"observed_at":"2026-05-24T18:36:19.650109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sullivan, and Michael R","venue":null,"work_id":"9f280539-297f-4605-8c2b-b47e7a5e5e18","year":2013},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:8126015e9ca9c80d8841a08134712accba63dcb5be1b653da79595d9a314f485","observation_id":"9c0119eb-9a15-498b-8539-5dd4860d9cd7","resolution":{"observed_at":"2026-05-24T18:36:19.653427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Biclustering of expression data","venue":null,"work_id":"dcd8e6ba-0c12-4c5d-af39-e2fcbb3e2e8a","year":2000},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:26c12232346e594affed7a9e693841319120b78b4dfec875a6f69367caef3d30","observation_id":"0eb65d8d-ec6e-4279-863e-4fe2e00c0ff4","resolution":{"observed_at":"2026-05-24T18:36:19.673290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4fbae907-82c6-4d06-83e9-8d96671e588c","year":1979},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:97991840cd9663dafd9ef8fddef813f47d320b200c66db82b0ae86da69fbe21b","observation_id":"65c3e92f-5903-4f37-b3ae-6ee840dfc794","resolution":{"observed_at":"2026-05-24T18:36:19.682451Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f5205325-794f-48ae-883f-3d646d7213b4","year":1981},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:8ce036c663f2e0c28a6c25b4dcabe8f6be1083563152387a35bfda92fcbbf85a","observation_id":"ef8a5436-2923-4a71-99d8-2698c6cf60f2","resolution":{"observed_at":"2026-05-24T18:36:19.738500Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On bipartite and multipartite clique problems","venue":null,"work_id":"5beeebfc-c279-4dd7-b74c-0ec6a0c87868","year":2001},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:129af1e4b55b9b110fcb19fa85ad65fc7e7d808d1a23c0853f06c8f83b7ea805","observation_id":"fefc4c6b-7a8e-4a3b-b41d-c294c7090f7b","resolution":{"observed_at":"2026-05-24T18:36:19.735218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"de Sousa Filho, Teobaldo L","venue":null,"work_id":"26cc1957-fdcf-464d-88ec-a7cbee77add5","year":2017},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:6ce05955f9f6e13e9ad80f6556eaf6d3054d616d4de3ae82166fdab2821dc087","observation_id":"4d673d74-ab82-494a-85a2-a500a3e3e149","resolution":{"observed_at":"2026-05-24T18:36:19.691808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hybrid metaheuristic for bicluster editing problem","venue":null,"work_id":"e3a3617e-859e-40fb-bf9c-061d60103046","year":2012},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:908a0f48fb4db374483a1ad82372b3b0f30257924d310a3fd07443fe763cee17","observation_id":"d2042905-137a-480e-bcc4-7b4c73e40c5e","resolution":{"observed_at":"2026-05-24T18:36:19.744948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"cc1aace2-cca5-42ca-85ed-b49c50c886f2","year":2015},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:6de57fe3c20367a2fad30e3f6df07abda499e2c9d3cbc12e650afb6f0e9c275a","observation_id":"2804e621-9d15-4e67-a792-f0a238888482","resolution":{"observed_at":"2026-05-24T18:36:19.758311Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Drange, Felix Reidl, Fernando S´ anchez Villaamil, and Somnath Sikdar","venue":null,"work_id":"076dc759-de88-4ba3-9d82-ce1387fad02a","year":2015},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:a12c0e83c0c1a73d7d204c0a1bad6e17f27967a85f7e5088d06ad419bc8671f2","observation_id":"745bc0e2-a579-4a98-a9ae-e95997004472","resolution":{"observed_at":"2026-05-24T18:36:19.728875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c31c1a6c-1da8-4104-8d81-c73ac03e4c9d","year":2000},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:371a47277a7688f1cd7881758bf4af65df34c28ebd904cb72f3002495667dfc0","observation_id":"b21eb91e-5052-4d91-a636-64525a7af535","resolution":{"observed_at":"2026-05-24T18:36:19.741693Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bee30f87-38a3-4dab-b4d4-a85063165d52","year":2013},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:a94fe35432b1c5e9fdf86f513888c2d2e702037c5c29497e17cdfa94c1d3f735","observation_id":"d1922a64-6401-4c5e-a130-ede2cca3e289","resolution":{"observed_at":"2026-05-24T18:36:19.751497Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12021","last_updated":"2019-12-12T20:28:33Z","snapshot_observed_at":"2026-07-06T07:48:48.815834Z","submitted_at":"2019-04-26T19:27:17Z","title":"Best Match Graphs and Reconciliation of Gene Trees with Species Trees","version":3},"cited_work":{"arxiv_id":"1904.12021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.12021","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a1e289c3-d3af-455b-9b1e-a727f178af3d","year":2019},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"cited_paper":"/paper/1904.12021","citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:9dd507599bfaace821dd3531fe9a2930ae0d35197aad23d9c50ceed5f426ba19","observation_id":"2dcaba79-d507-4ff4-af88-8eb2cdee496e","resolution":{"observed_at":"2026-05-24T18:34:48.578154Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Valdivia, Marc Hellmuth, Maribel Hern´ andez Rosales, and Peter F Stadler","venue":null,"work_id":"3d46e05d-c6d0-4079-a823-843eac87302d","year":2015},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:63ac451d76b30996326b9be13a8befcbaee476b293a7a2a71a0a5b72023c49dc","observation_id":"cd2ae684-eaf2-486e-8d32-e2a54158525a","resolution":{"observed_at":"2026-05-24T18:36:19.732073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"734eca72-7f8b-43d6-bdbd-041c747909db","year":null},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:d25da5490e633399f169e0de0e695e04dc78b6c6ffbd99c86143443f6a94b995","observation_id":"26e0c836-f742-4ae7-9a4f-e69f0ed792eb","resolution":{"observed_at":"2026-05-24T18:36:19.685616Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.07920","last_updated":"2019-08-29T11:10:28Z","snapshot_observed_at":"2026-08-13T12:39:20.254502Z","submitted_at":"2019-03-19T10:20:42Z","title":"Reciprocal Best Match Graphs","version":5},"cited_work":{"arxiv_id":"1903.07920","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1903.07920","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"76ee32d9-ed11-4408-9665-60eec00281f0","year":2019},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"cited_paper":"/paper/1903.07920","citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:bd4157bb922ee2b89128186b5affd9e0816e7990b5d58a82abe0b69d507ec7f0","observation_id":"8fbc6b57-c019-450e-a085-2377cd865171","resolution":{"observed_at":"2026-05-24T18:34:48.582501Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"RGFA: powerful and convenient handling of assembly graphs","venue":null,"work_id":"201044c7-8e80-48c3-9a55-d2c63bdfbbf8","year":2016},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:b9f1e17846e12749dcc1ec7448bdaf38b814998b18e879ed602f2dd4939c4273","observation_id":"dd139108-4807-4fa2-a6fa-f8998426115b","resolution":{"observed_at":"2026-05-24T18:36:19.718629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improved algorithms for bicluster editing","venue":null,"work_id":"601a511d-4d50-4c67-a811-661c22b71f04","year":2008},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:2d9c69333026d316a2d1b9cc05d332201104c31fc7f97fc5aeab8878fd692937","observation_id":"0edb68f1-1b36-408c-a8c7-e25fcbd9c51e","resolution":{"observed_at":"2026-05-24T18:36:19.666308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hellmuth, M","venue":null,"work_id":"ed1567a5-8371-4911-9fd0-c8bb7a94e1ab","year":2013},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:f55d9ad5b81df78aa84a4d8690b8d20932b26da06114bde5b4e31af28449e52b","observation_id":"664a9cd5-1f3d-48db-9f82-2e87a3117c74","resolution":{"observed_at":"2026-05-24T18:36:19.662862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c3a5b04f-c385-4899-86c4-2e576a505dab","year":2058},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:d5dbdcf6f9c8023d08ecf066015a4df91ca4d699807275b91e0692ca2f4fd97a","observation_id":"5eedd384-8c79-4ff1-8027-d84d414c2b3c","resolution":{"observed_at":"2026-05-24T18:36:19.673597Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hochbaum","venue":null,"work_id":"ad586ed5-3ecc-4831-a083-ae8c51d4c48d","year":1998},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:7e7ca12aed33d0451cd30786e354b8e2effe84a8468d5d4d2fbb9a1562a4431d","observation_id":"db3a6fc8-f9be-4e98-be13-df722251307f","resolution":{"observed_at":"2026-05-24T18:36:19.714765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Jamison and S","venue":null,"work_id":"f2e20332-c096-4085-bee8-b3506e1d0dcd","year":1992},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:2904b9d3eeca25c4958c5239fc80eeb144c35b5c1eeaeefc5cc27a4b116804de","observation_id":"af09ca99-9328-4af6-a5ea-9b9c0e2cfced","resolution":{"observed_at":"2026-05-24T18:36:19.646493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Huang, and J","venue":null,"work_id":"73cb379e-292d-43ac-885f-45d887b46be3","year":2010},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:398cd860263767e2930aa8e9fcc7730cfdf24b6d766a14527968016959ddde57","observation_id":"7c9b55cf-45da-4e1b-a5e5-b84397dd1728","resolution":{"observed_at":"2026-05-24T18:36:19.721986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Complexity and parameterized algorithms for cograph editing","venue":null,"work_id":"66a98338-1982-47b2-9bcb-860954ee759f","year":2012},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:37800fde21838d7b0dd36c453e6639b39c8263a16dd32d06fa4bf4be7d5b0eca","observation_id":"d0137793-0290-4d47-ace5-239a28ef561b","resolution":{"observed_at":"2026-05-24T18:36:19.695236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a6bbd83a-521b-4d7a-9349-7465747c2610","year":2003},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:a5469c35b55bbb6dae13b6bef712bc4d6147c9667d9dfba78ae4a4d061145090","observation_id":"f6277f58-d7b7-4ff8-b98c-73578377e030","resolution":{"observed_at":"2026-05-24T18:36:19.761724Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Applying modular decom- position to parameterized cluster editing problems","venue":null,"work_id":"85eaddf9-c73c-4b56-8807-5c5755e7ac58","year":2009},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:dd05b69c4c9402ab09d2efaac88390fabec070cd351ee7e839899e206515b1ed","observation_id":"8f6621f3-8d01-4ce9-afb3-649d31630a89","resolution":{"observed_at":"2026-05-24T18:36:19.725651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Correlation clustering and biclustering with locally bounded errors","venue":null,"work_id":"c64a3d2b-a1eb-4e2c-b9e6-8d9ca74f389e","year":2018},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:8fef8617e00934d63c83302b8b913c6dbd7fbf94a3e323bde8740d20e31c2033","observation_id":"014b559b-58cf-473c-b87a-c1b7fba304bb","resolution":{"observed_at":"2026-05-24T18:36:19.748433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Setubal and Peter F","venue":null,"work_id":"41dd35b8-66b9-4bea-ae29-dd263ebc642f","year":2018},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:abac7b5f8598ab1ac8dfe6cbad3c9fc08facd2d7b3d1556e4169ecb08735e920","observation_id":"e3e84a53-84b0-4669-ae40-a61a40933fab","resolution":{"observed_at":"2026-05-24T18:36:19.754997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bi-Force: large- scale bicluster editing and its application to gene expression data biclustering","venue":null,"work_id":"4e6d6baf-f48c-4d89-b022-4b41c4add190","year":2014},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:de699235bbbbdcd50c16fbc86cba533f03d9ad4911ba97edaaf789aebce60cda","observation_id":"3a425911-6985-423c-8257-a63c1b95c8d9","resolution":{"observed_at":"2026-05-24T18:36:19.706344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tatusov, Eugene V","venue":null,"work_id":"fc385297-4d73-43d2-afb5-87d68bd6f921","year":1997},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:8a0cef35037a7b5a883b3e8e984d7953841e3759a99c4b0a196f1b72e1ca15f5","observation_id":"a2364ac1-786d-4abe-a99b-9de235c8f563","resolution":{"observed_at":"2026-05-24T18:36:19.676490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improved biclustering of microarray data demonstrated through systematic performance tests","venue":null,"work_id":"3c055308-a403-4e3e-89c7-77225c20c9f5","year":2005},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:68da3133c89f43aeebb3d3ca9683acf96243014620b6814de6b03e97af39680c","observation_id":"7814f007-beea-472c-9d9a-40a8a4374b78","resolution":{"observed_at":"2026-05-24T18:36:19.711787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.10031","last_updated":"2019-06-24T15:43:26Z","snapshot_observed_at":"2026-07-06T08:02:24.956980Z","submitted_at":"2019-06-24T15:43:26Z","title":"Hierarchical Colorings of Cographs","version":1},"cited_work":{"arxiv_id":"1906.10031","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.10031","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hierarchical Colorings of Cographs","venue":"math.CO","work_id":"a505d0db-a5eb-42f2-a4c4-26379f6b32c9","year":2019},"citing_paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-24T18:30:43.810863Z"},"links":{"cited_paper":"/paper/1906.10031","citing_paper":"/paper/1907.08865"},"observation_digest":"sha256:5a35a9c260031998df2f90fa5aadb6b4e4399085694bf9d52f1a5acdacb9e451","observation_id":"97c9d879-a4aa-47b2-bd3b-5b4bb62a5640","resolution":{"observed_at":"2026-05-24T18:34:48.572601Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1907.08865","last_updated":"2019-07-20T20:22:08Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-02T09:53:11.815591Z","submitted_at":"2019-07-20T20:22:08Z","title":"Complexity of Modification Problems for Reciprocal Best Match Graphs"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":3,"verified_fuzzy":23},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:1907.08865."}