{"as_of":"2026-08-13T22:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4a7d9335fab6be5e0d722ae9809ae3e45bbb2a145295a6ca4482518ca6067c57","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-25T21:35:32.608194Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"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/2606.24415/citation-record","integrity":"/paper/2606.24415/integrity","json":"/paper/2606.24415/citation-record.json","paper":"/paper/2606.24415"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0210030","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SIAM Journal on Com- puting 10(3):405–421, DOI 10.1137/0210030","venue":"SIAM Journal on Computing","work_id":"5815b0e5-ccd5-4f98-a695-aea0f57ad90a","year":1981},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:7ca4dfc9691278e1a729b1480455ddd702a9c029654a67547cb8b88d181d0b32","observation_id":"9b9fe06d-e828-4e2c-9b65-c4a93d45e03e","resolution":{"observed_at":"2026-06-25T21:38:28.469596Z","resolver_source":"doi","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-06T21:38:24.144393+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-06T21:38:24.144393+00:00","source":"openalex_status_cache"},{"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T21:35:32.608194Z","title":"Springer Monographs in Mathematics, Springer","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:4e0065c45fa7e50a4738cf5997267dd30305012d8b7e2a0036c6b8199e136f04","observation_id":"fbab74cc-9889-4f28-9248-1ecb59b837e9","resolution":{"observed_at":"2026-06-25T21:35:32.608194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.26021/2479","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"theory and methods in phyloge- netic analysis","venue":"University of Canterbury Research Repository (University of Canterbury)","work_id":"c1a94802-d345-4052-b2e4-4074d9f11281","year":1997},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:f8499e08d767c0f6d1806df8e4f0f4b9cecea7d3719eebec7df07c48a8fa442e","observation_id":"aa1b648b-8a5d-4e35-ba4f-8e1e315c9353","resolution":{"observed_at":"2026-06-25T21:38:28.474788Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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":"1995.1020","doi":"10.1006/aama.1995.1020","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Stanley , abstract =","venue":"Advances in Applied Mathematics","work_id":"c69958e2-1d80-4150-9a59-5a0b208e9768","year":1995},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:3c8495a16f1efb616430a3108ac28dcbec5aec3d2a9989a4793ad134e5730d42","observation_id":"38eaa552-9a74-463d-9306-c6b1292a9195","resolution":{"observed_at":"2026-06-25T21:38:28.478238Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"10.1016/s0166-218x(02","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T21:38:28.479182Z","title":"Discrete Applied Mathematics 127(2):241–269, DOI 10.1016/S0166-218X(02) 00209-3","venue":null,"work_id":"baa0e542-5d20-41c0-a924-be13b501987d","year":2003},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:6a2b47bde52d944bf7ac68af1e236193cd371da52485a164feccdb4ae192df30","observation_id":"ef544842-457d-471e-a876-910d5fd308db","resolution":{"observed_at":"2026-06-25T21:38:28.480672Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T21:35:32.608194Z","title":"MIT press","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:7e63b07d1973ae2f44917b356bebee0c74aaedde9a2dd16d9af22ab8a8d4bc67","observation_id":"574c4f78-2042-48fe-9d61-d0b0b38d313c","resolution":{"observed_at":"2026-06-25T21:35:32.608194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.03827","last_updated":"2026-08-06T12:06:12Z","snapshot_observed_at":"2026-08-13T21:40:04.501832Z","submitted_at":"2026-05-05T14:54:42Z","title":"Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints","version":3},"cited_work":{"arxiv_id":"2605.03827","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.03827","snapshot_observed_at":"2026-07-04T19:10:05.859089Z","title":"Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints","venue":"cs.DM","work_id":"c00bce4e-6f5d-4a7e-a424-a3ddbb9bb2ee","year":2026},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"cited_paper":"/paper/2605.03827","citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:66aa1f812c0b3e86ebd827ee41190680f49322f8cb5c3e1b53b6a457f023c00d","observation_id":"e1107a5d-27ef-4cf5-935a-2510bd199ab6","resolution":{"observed_at":"2026-07-04T19:10:05.860825Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"10.1007/s00285-016-1068-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Mathematical Biology 74(7):1729–1751, DOI 10.1007/s00285-016-1068-3","venue":"Journal of Mathematical Biology","work_id":"aa53785d-ee9e-4607-9421-49d93cdfca42","year":2017},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:459656edce4654a62cbd2ecb3cbcaae82477195f1c29d814aa757e0b5d2549f1","observation_id":"f982bd23-4edb-439f-8e64-c46e986d7fc9","resolution":{"observed_at":"2026-06-25T21:38:28.483100Z","resolver_source":"doi","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":"10.1007/s00285-019-01332-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Mathematical Biology 78(7):2015–2057, DOI 10.1007/s00285-019-01332-9","venue":"Journal of Mathematical Biology","work_id":"b8450b23-d245-49d7-a6ca-48ed809c47ec","year":2019},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:72e84c5df9098951807692904271095ade354c903c9d3f4b00d68783057c7134","observation_id":"5b229e0c-d6b1-4153-8354-b9846a70ab8c","resolution":{"observed_at":"2026-06-25T21:38:28.485862Z","resolver_source":"doi","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":"10.1007/s00285-019-01444-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Mathematical Biology 80(3):865–953, DOI 10.1007/s00285-019-01444-2","venue":"Journal of Mathematical Biology","work_id":"2f1ad3ee-d57f-4491-b69f-9ec8a0b4f446","year":2020},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:a18d6705954c31e78d3a404e3eb172746503d8a6ed99fdddd47490c06344d8dd","observation_id":"f27bcfdc-a51f-406d-a5a6-3d07387aadb8","resolution":{"observed_at":"2026-06-25T21:38:28.467462Z","resolver_source":"doi","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-05-22T19:24:49.595522+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T19:24:49.595522+00:00","source":"openalex_status_cache"},{"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":"10.1109/tcbb.2013.8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"IEEE/ACM Transactions on Computational Biology and Bioinformatics 10(1):151– 160, DOI 10.1109/TCBB.2013.8","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","work_id":"d6a7dd53-3f09-4cf9-9d32-010d9d0962f2","year":2013},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:eee8b4d575b159d6d82499f3b119a82ce60c4e4255f028aa50928700c653862d","observation_id":"b74a895e-3b75-48ac-8795-3ad0328b907e","resolution":{"observed_at":"2026-06-25T21:38:28.472060Z","resolver_source":"doi","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":"10.1142/s0219720006001709","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Bioinformatics and Computational Biology 04(01):59–74, DOI 10.1142/S0219720006001709","venue":"Journal of Bioinformatics and Computational Biology","work_id":"258d548e-4d2b-426a-a34f-cea90214503a","year":2006},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:097cc1bac3f18702b210257bf1296a9164c361e6a5c6bd4b7ce5359f95401afb","observation_id":"f6211c70-1834-4fcb-a9d8-cb5d343e51f4","resolution":{"observed_at":"2026-06-25T21:38:28.517812Z","resolver_source":"doi","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":"2606.16963","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T19:10:05.854895Z","title":"URLhttps://arxiv.org/abs/2606.16963,2606.16963","venue":null,"work_id":"678be4e8-c48a-494d-8877-2ec4fac429c5","year":2026},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:26b1b0ba674a03f157bbc7b502c270d7f10f99255f1f77f520551bc921b70d68","observation_id":"8dcde002-aef0-4760-bb45-813b9101a530","resolution":{"observed_at":"2026-07-04T19:10:05.856466Z","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":"10.1007/s00453-012-9659-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithmica 66(3):714–738, DOI 10.1007/s00453-012-9659-x","venue":"Algorithmica","work_id":"b6232fad-7782-4030-b7c1-2a293b491033","year":2013},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:c4c1ee705e79c4ce81a6b31f41901e2b35fe8ed7a61f878dae444385e98a8c36","observation_id":"5cf3ed83-7f0e-430f-a843-f2fcda4ea9b6","resolution":{"observed_at":"2026-06-25T21:38:28.527492Z","resolver_source":"doi","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":"10.1109/tcbb.2010.17","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(3):635–649, DOI 10.1109/TCBB.2010.17","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","work_id":"b823539b-9342-47ce-967f-596258cc087e","year":2011},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:0ff7c09097d64510babcfc78d7eace62a14c82059bbd3b5546242330a015eff0","observation_id":"05d1c545-c753-4262-9857-b1419fdad06d","resolution":{"observed_at":"2026-06-25T21:38:28.505808Z","resolver_source":"doi","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":"10.1007/s00453-015-0069-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithmica 77(1):173–200, DOI 10.1007/s00453-015-0069-8","venue":"Algorithmica","work_id":"8cb1aa15-3f01-49d9-a1db-eaa6d8814c54","year":2017},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:cf4b7b0cf97d382a877ba6464ddb92b82fc76602b92ce534ab8aeb47cadc0e16","observation_id":"2a55d620-0b53-4be4-a3fa-220c6b109891","resolution":{"observed_at":"2026-06-25T21:38:28.531491Z","resolver_source":"doi","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":"10.1109/tcbb.2004.44","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"IEEE/ACM Transactions on Computational Biology and Bioinformatics 1(4):151–158, DOI 10.1109/TCBB.2004.44","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","work_id":"af6a5915-8c34-42a8-8653-a2e7e52f861d","year":2004},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:893df9167c4f397da2f9f85d97a0d6259c2d54bcfb9c6de3fbee95279122e5f6","observation_id":"58ccf14f-dde7-42b4-8412-821621d5dd30","resolution":{"observed_at":"2026-06-25T21:38:28.520106Z","resolver_source":"doi","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":"10.1093/gbe/evq077","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Genome Biol Evol 3:23–35, DOI 10.1093/gbe/evq077","venue":"Genome Biology and Evolution","work_id":"0b2f7c51-9ff0-4bf6-bd1e-22afd32444bd","year":2011},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:35cdfeaf6bbec29d70d11330a2f6ea7f497a34c034c542628a229641dc85ef9f","observation_id":"af25ac3d-2392-434e-bb38-da1a3cfa93da","resolution":{"observed_at":"2026-06-25T21:38:28.490728Z","resolver_source":"doi","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-05-22T15:53:11.681496+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T15:53:11.681496+00:00","source":"openalex_status_cache"},{"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":"10.1007/978-3-540-30219-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T21:38:28.542206Z","title":"In: Jonassen I, Kim J (eds) Algorithms in Bioinformatics, Springer Berlin Heidelberg, Berlin, Heidelberg, pp 388–399, DOI 10.1007/978-3-540-30219-3 33","venue":null,"work_id":"07bee7b2-ab45-4323-a0b5-62a3b4c5b32e","year":2004},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:fc2d3607204eea244f421c54de5fecaa18ef3c8317c49de467fe41c8e25ef129","observation_id":"6bb43609-3b2b-4c90-8cab-9b23d5bb08ac","resolution":{"observed_at":"2026-06-25T21:38:28.543891Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T21:35:32.608194Z","title":"Cambridge University Press","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:f56561c6b33a493538357b6c30c6a0afb9fb6db6fe1d2348ceaa9de13cb70755","observation_id":"fd44ded2-bdd0-4424-a609-aa745fc36928","resolution":{"observed_at":"2026-06-25T21:35:32.608194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-009-9333-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithmica 60(2):207–235, DOI 10.1007/s00453-009-9333-0","venue":"Algorithmica","work_id":"0824f323-14f9-4be0-8b4a-c450b4b5fee7","year":2011},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:fcd1df568bba618e41c74388ca52b7ad35d92c3daed5fcf8f01fd3b50d9fc980","observation_id":"07a56bc2-4105-40c1-80af-42ef7e0fed28","resolution":{"observed_at":"2026-06-25T21:38:28.516847Z","resolver_source":"doi","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":"10.1007/s00285-013-0683-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Mathe- matical Biology 68(7):1707–1729, DOI 10.1007/s00285-013-0683-5","venue":"Journal of Mathematical Biology","work_id":"3923e509-2900-474c-a547-d436e6473d4a","year":2014},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:bd0b405f99a7aeef5a44ad06cacede3655fcc2f3a1c2a0d169cd660acf600691","observation_id":"1681ae01-4660-4b03-a050-6611a0b3c274","resolution":{"observed_at":"2026-06-25T21:38:28.493096Z","resolver_source":"doi","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":"10.1109/tcbb.2009.22","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"van Iersel, J","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","work_id":"0008051a-9407-4d06-858c-ce79be487ab5","year":2009},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:6676f5a39f140ec26ed4aea26b11896a3c81f41d18b01834526ab15c0d9472f0","observation_id":"7edb8483-e7e0-4912-8919-6d50d6a62e56","resolution":{"observed_at":"2026-06-25T21:38:28.534177Z","resolver_source":"doi","status":"metadata_mismatch"},"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":"10.1142/s0219720009004308","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Bioinformatics and Computational Biology 07(04):597–623, DOI 10.1142/S0219720009004308","venue":"Journal of Bioinformatics and Computational Biology","work_id":"a97dc9c2-702f-4bb5-ab12-40afea27e4b6","year":2009},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:5f7f23660c7ac9ab521e7d46332552df8a2fad86b5bb74f335ce05049c2aa02d","observation_id":"be2cb403-f8a1-4fb6-bffe-83711357e4dc","resolution":{"observed_at":"2026-06-25T21:38:28.524492Z","resolver_source":"doi","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":"2022.106300","doi":"10.1016/j.ipl.2022.106300","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Information Processing Letters 178:106300, DOI 10.1016/j.ipl.2022.106300","venue":"Information Processing Letters","work_id":"4969f766-854e-4b13-ad7d-12f753383c41","year":2022},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:c3548237159eab3c111209c23b74795324db31b44e831ca479e1dfb34430d1cb","observation_id":"6fbbf5c6-6659-4251-904c-9b9b133fd502","resolution":{"observed_at":"2026-06-25T21:38:28.509616Z","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":"10.1016/j.tcs.2006.06.022","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theoret- ical Computer Science 363(1):60–68, DOI 10.1016/j.tcs.2006.06.022, computing and Combinatorics","venue":"Theoretical Computer Science","work_id":"b2489092-e25b-4ddd-897d-fb3d27fe932b","year":2006},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:5f6dca6ec05ea3559d260e9b34d4531ac93655bc13b630e5c17fb6c43c43a8b3","observation_id":"2c132903-30f2-4cad-8565-003b35edb1f1","resolution":{"observed_at":"2026-06-25T21:38:28.521265Z","resolver_source":"doi","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":"10.1137/s0097539704446529","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SIAM Journal on Computing 35(5):1098–1121, DOI 10.1137/S0097539704446529","venue":"SIAM Journal on Computing","work_id":"ed3303fe-61df-4385-bf39-943923c25508","year":2006},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:30d2ee92244cdadf6227c3078c1baddd4efae213ca561996cd4e14e900434179","observation_id":"9f8ec73c-f793-48d8-be77-7ddc8010789a","resolution":{"observed_at":"2026-06-25T21:38:28.538916Z","resolver_source":"doi","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":"10.1007/978-3-540-75520-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Nash equilibria in V oronoi games on graphs","venue":null,"work_id":"dafdfc54-4a9d-49f3-8e38-8607e449cb58","year":2007},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:b70376ec46f82016d0a6e60b264870e05024c9e81280b20d6b9948b87515a730","observation_id":"128f7bf5-3425-4195-831c-266f78e244cf","resolution":{"observed_at":"2026-06-25T21:38:28.488477Z","resolver_source":"doi","status":"metadata_mismatch"},"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":"10.1007/s11538-025-01419-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bull Math Biol 87(3):44, DOI 10.1007/s11538-025-01419-z","venue":"Bulletin of Mathematical Biology","work_id":"dc172a24-69fb-47bb-a784-1983ea158b05","year":2025},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:2922ffc21a7878ef3e6e0a844778008197b209bbf9a5bbfaa0487d0ee162c910","observation_id":"5cebd6a7-94ca-4537-a329-13b6c8942bca","resolution":{"observed_at":"2026-06-25T21:38:28.536658Z","resolver_source":"doi","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":"10.1016/j.tcs","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno","venue":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","work_id":"b4fc9e91-7fe2-4ebf-8b5d-fdb12379e17e","year":2014},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:6b0cf3ecdb0e59c9d3dc50404264249db610032ddc568b815ec13f2f2fa2d644","observation_id":"7cbfecd6-b936-489e-9fb9-a5c227ea8a1c","resolution":{"observed_at":"2026-06-25T21:38:28.523275Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T21:35:32.608194Z","title":"Oxford University Press","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:e1d4737457b5a9b3a45a7d9c4a58b2a345dd7ef520df841874bd52c45c153980","observation_id":"d5c9bbfc-8265-486e-9e4e-67b08b8c6f95","resolution":{"observed_at":"2026-06-25T21:35:32.608194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0166-218x(99)00160-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete Applied Mathematics 98(3):227–235, DOI 10.1016/S0166-218X(99)00160-2","venue":"Discrete Applied Mathematics","work_id":"2fb13edd-ad23-4be1-9c5d-03331312fae4","year":2000},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:579e14518777d4dd5abd4b0e4a889a082a1b291b01ef9c0e5bee80d1217ba50c","observation_id":"33743283-1c99-4cac-876f-f25a639e17e0","resolution":{"observed_at":"2026-06-25T21:38:28.525289Z","resolver_source":"doi","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":"10.1371/journal.pone.0106531","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PLOS ONE 9(9):1–1, DOI 10.1371/journal.pone.0106531","venue":"PLoS ONE","work_id":"2cb92d50-d1b6-4869-a8d6-8f760b1510d2","year":2014},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:6b214ccdb3f68b53acf0ba1670b6a9ea2039bf45a8986972919e9768670e3bc1","observation_id":"ece0789c-7240-46ba-aa11-8d81ab42d40e","resolution":{"observed_at":"2026-06-25T21:38:28.495237Z","resolver_source":"doi","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":"10.1016/j.tcs.2021.02.037","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theo- retical Computer Science 865:63–84, DOI 10.1016/j.tcs.2021.02.037","venue":"Theoretical Computer Science","work_id":"b236e2bd-eba0-4b25-b59b-cad408ed6f6d","year":2021},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:e80bf8b49dc70e078403f3eb2b6c91d420e2d300362e416e253fa80184500769","observation_id":"2b1a3d09-4417-48f4-a85c-7a3a2d1a98be","resolution":{"observed_at":"2026-06-25T21:38:28.518983Z","resolver_source":"doi","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":"10.1007/978-1-4612-0053-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Birkh¨auser Boston, DOI 10.1007/978-1-4612-0053-6","venue":"Birkhäuser Boston eBooks","work_id":"bc2cbebc-5138-454e-b6c8-42741879f6fc","year":2003},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:300e2dc4e15d42db56b0a3b9402388dcd7c20e8afd4d2b933c689be11483ed4b","observation_id":"aefd2968-24f4-490b-94f9-ff6e3ef7a5ad","resolution":{"observed_at":"2026-06-25T21:38:28.513235Z","resolver_source":"doi","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":"10.1016/j.ejc.2018.02.013","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"European Journal of Combinatorics 70:384–407, DOI 10.1016/j.ejc.2018.02.013","venue":"European Journal of Combinatorics","work_id":"46497770-5f58-496f-a98a-5941eeca78e4","year":2018},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:d2d1897168ed37cb01fe8bf09ef8c56ee915c87f6c46cc5670c8bb8747a010f2","observation_id":"1660751a-701a-4732-9274-49f54ed5a653","resolution":{"observed_at":"2026-06-25T21:38:28.529492Z","resolver_source":"doi","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":"10.1007/s00285-021-01654-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Mathematical Biology 83(3):28, DOI 10.1007/s00285-021-01654-7","venue":"Journal of Mathematical Biology","work_id":"1b2971f2-6aca-4e3e-aea5-ebccfc4f2821","year":2021},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:f188777c197d92fe17ddced1b9311921317825736ae0627ce9e5db4b17480c4d","observation_id":"d7d8bb42-be6a-4d43-91f6-54e15d21e204","resolution":{"observed_at":"2026-06-25T21:38:28.512059Z","resolver_source":"doi","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":"10.1109/tcbb.2010.69","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(3):785–796, DOI 10.1109/TCBB.2010.69 31","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","work_id":"5377eff8-7be2-4016-9f3e-2efc5737e621","year":2011},"citing_paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-25T21:35:32.608194Z"},"links":{"citing_paper":"/paper/2606.24415"},"observation_digest":"sha256:34d84e51d7f0c944ffc8485d9d3fb7b895399280c3542e1b0399922015aa2389","observation_id":"ea32173f-96a8-4a87-8086-40c51944a18e","resolution":{"observed_at":"2026-06-25T21:38:28.541306Z","resolver_source":"doi","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-05-22T15:53:15.63085+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T15:53:15.63085+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.24415","last_updated":"2026-06-23T10:52:25Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-13T21:38:49.280757Z","submitted_at":"2026-06-23T10:52:25Z","title":"Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":2,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":4,"verified_exact":28,"verified_fuzzy":0},"total_outbound_references":38},"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 13 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2606.24415."}