{"as_of":"2026-08-13T22:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ecb3147a03f02a85999242b6ffa8ab0a307958969c6d2ace1a53e8d19c8bd97c","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T23:12:58.525983Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"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/2503.16186/citation-record","integrity":"/paper/2503.16186/integrity","json":"/paper/2503.16186/citation-record.json","paper":"/paper/2503.16186"},"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":"Addison-Wesley","venue":null,"work_id":"74ce90e9-dba5-4823-a2b2-2e5feb539399","year":2006},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:9cb2ad08637f2bcfda471673f0a569aeb70667286072c5da2667aadc132f6997","observation_id":"46a89ada-a9f5-4f2f-b1ba-2c1f0ee52704","resolution":{"observed_at":"2026-05-22T23:15:14.240164Z","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":"Pren- tice Hall","venue":null,"work_id":"618705b3-60e5-4f50-a26b-3cf123dfc4d2","year":1993},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:e50daed32af1495f8ee5655d1be95ebd45fe020fc4979ebab7b60c101b981d9b","observation_id":"c2ddb54a-da22-430f-9241-0ae0912eaff0","resolution":{"observed_at":"2026-05-22T23:15:14.245567Z","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":"10.1007/s00025-025-02354-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Results in Math 80:45, DOI 10.1007/s00025-025-02354-0","venue":"Results in Mathematics","work_id":"a0d42e3b-f5b3-4fd0-bc38-7d4664f5c0d2","year":2025},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:5b9f734f029103a5b30a5ee201cea921465d1da07d93abd96b93f257498fc171","observation_id":"a4c68a76-d00f-4b5e-89ac-d6b61420885c","resolution":{"observed_at":"2026-05-22T23:15:12.771494Z","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","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T01:07:42.960769Z","title":"Masset, R","venue":null,"work_id":"238df2e4-a3e5-46f3-860e-3ae2b0094b97","year":2019},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:9d3254c1c14da407c22aac41bfe6ed4834de9c402f4368edc32d89f5d7b87042","observation_id":"c38c3529-df0d-44b7-bbb9-a5902de76998","resolution":{"observed_at":"2026-05-22T23:15:12.729808Z","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":"10.1109/tcbb.2007","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"IEEE/ACM Transactions on Computational Biology and Bioinformatics 6(4):552–569, DOI 10.1109/TCBB.2007","venue":null,"work_id":"fecf01f7-f55e-45c9-be56-53001a731ac6","year":2009},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:802fdf8398d13f838663734d0a93b27743a90ed007599f53ca15648e25dd1e07","observation_id":"d51bf607-e45b-4a61-8ac9-cac2544f5959","resolution":{"observed_at":"2026-05-22T23:15:12.747006Z","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":"9770.1260","doi":"10.26493/2590-9770.1260.989","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Art Discr Appl Math 2:P1.01, DOI 10.26493/2590-9770.1260.989","venue":"The Art of Discrete and Applied Mathematics","work_id":"93093774-c4d4-4aa4-a84d-d8a9301a5592","year":2019},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:c39a11852cdc3216c70ce9ebc56170263a8c5abf281c057f392b8227b7fc5040","observation_id":"a8c93510-06ff-40aa-a5c6-58c8c41277b1","resolution":{"observed_at":"2026-05-22T23:15:12.774483Z","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":"MIT press","venue":null,"work_id":"4d2f094a-66d7-4a17-8e19-fdad03373774","year":2022},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:9af40ec77e499904f622c01d4e9c12f8a0e5f5d21fa5909d558eddfbc6ec8787","observation_id":"89349847-2b71-4f6b-b599-5ae75f0d0d26","resolution":{"observed_at":"2026-05-22T23:15:14.229420Z","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":"Academic Press","venue":null,"work_id":"01f7ecdb-9c79-4f9f-9c6f-40ccd78c8053","year":2006},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:189b170b10a60f79f43d515e12b68691256a25eb92f3035c291a328207c34577","observation_id":"3174a8e6-f297-4c67-8a1a-69f63d902fca","resolution":{"observed_at":"2026-05-22T23:15:14.235684Z","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":"10.1073/pnas.1307712111","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the National Academy of Sciences 111(11):4332–4337, DOI 10.1073/pnas.1307712111","venue":"Proceedings of the National Academy of Sciences","work_id":"6506f284-996f-47a2-98ec-b4857686b3c9","year":2014},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:28b5d278a768add4211e05ce6c2bc5132c8b08ad83668a1f0caeb7192d31962f","observation_id":"eb557470-ce69-41f1-9efe-5e8ea3195329","resolution":{"observed_at":"2026-05-22T23:15:12.756664Z","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-642-67678-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Springer Berlin Heidelberg, DOI 10.1007/978-3-642-67678-9","venue":null,"work_id":"cbabf6ac-3d1f-4814-be7b-911f5c5cc729","year":1980},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:2f937c7e486d3abb433f1dbc65555ac21df180dff7d516fb2246561411eb9a10","observation_id":"f6f4e8a6-358c-470a-87f4-b5ab4c186dbe","resolution":{"observed_at":"2026-05-22T23:15:12.743608Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Birkh¨auser Verlag, Basel, Switzerland","venue":null,"work_id":"3a0f3834-f64e-4952-b4d3-c69704e56e3a","year":2007},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:610196f1552e4d9b94412370d2aaa7d17a7c59ae1bdb2f4c567b6ed0daa2c39f","observation_id":"e84f73fb-944c-4fb5-8fbf-d71a1146ab5c","resolution":{"observed_at":"2026-05-22T23:15:14.225174Z","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":"10.1016/j.mbs.2006.11.005","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mathematical Bio- sciences 208(2):521–537, DOI 10.1016/j.mbs.2006.11.005","venue":"Mathematical Biosciences","work_id":"ba5b2104-816f-412c-97d7-6d4f467ac5c3","year":2007},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:4b648f5e075366002e7a683781e8f99575cb09ce5239c936c99eb770c8f81c38","observation_id":"9f3bd2aa-56b8-467e-986e-a0a96e63899a","resolution":{"observed_at":"2026-05-22T23:15:12.745212Z","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":"2003.122733","doi":"10.1109/csb.2003.1227337","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Markstein P, Xu Y (eds) Computational Systems Bioinformatics","venue":null,"work_id":"86ba4e89-2d19-4f8c-bcce-e3997e7ccef6","year":2003},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:dbdf14d4513ddcae82cdcd84a8bbf9d82f91a59bbf01a49b3af4b4bb164fdb6d","observation_id":"ab039a7a-d9b7-4d81-bdbe-e4be82f22e6b","resolution":{"observed_at":"2026-05-22T23:15:12.768283Z","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/978-1-4757-1645-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Undergraduate Texts in Mathematics, Springer, New York, DOI 10.1007/978-1-4757-1645-0","venue":"Undergraduate texts in mathematics","work_id":"1418fb94-fd69-497a-8d2a-4d50c39b9f1d","year":1974},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:ad706763653ca5682964f9893487ccb47e214309973dd139d999fcb9b5bc8fb3","observation_id":"f321aa67-e128-4c94-b0a6-f2abe87810e7","resolution":{"observed_at":"2026-05-22T23:15:12.785839Z","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-07-12T04:49:10.896684+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:10.896684+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14057","last_updated":"2025-08-11T11:36:18Z","snapshot_observed_at":"2026-08-12T15:32:56.052202Z","submitted_at":"2024-11-21T12:09:21Z","title":"Characterizing and Transforming DAGs within the I-LCA Framework","version":2},"cited_work":{"arxiv_id":"2411.14057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.14057","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"URL https://arxiv.org/abs/2411.14057, 2411.14057","venue":null,"work_id":"af59c065-9d6f-413a-be3f-67b551097886","year":2024},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"cited_paper":"/paper/2411.14057","citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:56ef123b8d902a5628d4f713aa4da3668718212f32b12eca064e73be7b14df58","observation_id":"9a69de60-9fe8-4256-a336-a6040247673b","resolution":{"observed_at":"2026-05-22T23:15:13.207566Z","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/s12064-023-00398-w","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theory in Biosciences 142(4):301–358, DOI 10.1007/s12064-023-00398-w","venue":"Theory in Biosciences","work_id":"e7cc6ea1-c069-4cb8-8a1e-2303d4c6647e","year":2023},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:38b304fc2c9584bf8d7a0c598e0835b0cac4860507778ac7a335edbbf167665a","observation_id":"a7769950-4d48-4ea2-81fa-91f441a443f4","resolution":{"observed_at":"2026-05-22T23:15:12.781818Z","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:50.926684+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T19:24:50.926684+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.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":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:a5d187600d72404dcd83f22d07fc86cbf1bcb119f45ef84325a5d0833076f646","observation_id":"2765171b-4ba4-4e22-ac04-9cce3cb13e22","resolution":{"observed_at":"2026-05-22T23:15:12.778270Z","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":"8996.36902","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Commun ACM 5(11):558–562, DOI 10.1145/ 368996.369025","venue":null,"work_id":"7e895065-fd84-49d5-a834-7399dc2c8c52","year":1962},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:100b61ddc9ac8cefe982b72fc08c0d6162a0ee9ee80fe3a9ee5bf71e6ba83913","observation_id":"3be07b3d-9115-4458-9bdd-df5c6eaca537","resolution":{"observed_at":"2026-05-22T23:15:13.202875Z","resolver_source":"arxiv_id","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"MIT Press 19","venue":null,"work_id":"d8991318-84aa-41e0-b823-2cd4932ea4d0","year":2009},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:da6bcaa7a661a9d6f2877f4966dae8de8440408038f281919adf10a53786ef32","observation_id":"568fc025-0263-477d-9ca5-e120631e7556","resolution":{"observed_at":"2026-05-22T23:15:14.219023Z","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":"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":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:c5c447f3155a68cc1d83f791f57508b136b2bb1f8cd29ca3e8fcf098ade5581e","observation_id":"2df24b1d-dc3f-447d-a269-b701444416f1","resolution":{"observed_at":"2026-05-22T23:15:12.774885Z","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":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:fe12615ed1de55e6d84332453775ee81e629c1356066e8608163763f732ba83d","observation_id":"b539ace0-f3fc-41e8-b17c-04df1b360fa1","resolution":{"observed_at":"2026-05-22T23:15:12.722953Z","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.4230/lipics.icalp.2022.94","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds , booktitle =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"893292c6-ed04-4eae-bb29-90ef21cd0768","year":2022},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:bed82c6c78d86386749c460832004ea5ce097355c178e07e86083ac0cc24830d","observation_id":"dfb4b6e9-e92a-423c-87b3-0cc01c8e0a7a","resolution":{"observed_at":"2026-05-22T23:15:12.762655Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Morgan Kaufmann","venue":null,"work_id":"a612aa5d-63a1-44a8-b5da-edfa35c3f1cb","year":1997},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:a03a0f2e8e28d0f81e586906c17acf5a100ca8fbfda8da8eb42b6669e05f4064","observation_id":"0b9fbce3-d2d1-4cc5-9dab-ec2f2e3d9582","resolution":{"observed_at":"2026-05-22T23:15:14.209750Z","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":"10.1007/11567752","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Priami C, Zelikovsky A (eds) Transactions on Computational Systems Biology II, Springer, Berlin, Heidelberg, Lect","venue":"Lecture notes in computer science","work_id":"971cf851-dc76-48fd-a866-a72979ed3b23","year":2005},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:5357d7d7b17e4de628c4d8d4449fe215516ae9084c81951177444bd9d8a5b064","observation_id":"7b8d8601-e79d-4771-9100-83a8aea6b9eb","resolution":{"observed_at":"2026-05-22T23:15:12.756987Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cambridge University Press","venue":null,"work_id":"e9e5aa15-89fa-46c7-bd30-b5ca14c98024","year":2009},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:dab411cc8c26118582691b6baeb95b1328f5819d6a0fdbab12e28505e47aaa7d","observation_id":"8146824b-9a62-4d0b-ab78-5e4cea9619fe","resolution":{"observed_at":"2026-05-22T23:15:14.214505Z","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":"Springer","venue":null,"work_id":"7ba8c5da-f241-4390-9d91-08fe3fc25e54","year":2016},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:269d15ea3c9224f21f539fe0afcc85475f37ba972a65f05831d4a8a920c52ba0","observation_id":"2991a4c0-7bce-4021-a7a1-dbffd262fd98","resolution":{"observed_at":"2026-05-22T23:15:14.203735Z","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":"10.1016/j.mbs.2009.06.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mathematical Biosciences 221:54–59, DOI 10.1016/j.mbs.2009.06.007","venue":"Mathematical Biosciences","work_id":"0f555b4b-358b-493c-9955-6b0f28dd4a74","year":2009},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:3022843edce29a09fe13c87ba9a6e7417e04cc32b89bf3d789487d6de5f0501e","observation_id":"bde30425-9244-4dd1-9eb6-33e9fbc4fd54","resolution":{"observed_at":"2026-05-22T23:15:12.733176Z","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-031-52213-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Kalyanasundaram S, Maheshwari A (eds) Algorithms and Discrete Applied Mathematics","venue":"Lecture notes in computer science","work_id":"dfff36f4-e1a2-4724-aca1-898431672194","year":2024},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:45975babc39d902cfbdda4d56efd2f774959502fbd0b56cc4b387a3d15e6bfd3","observation_id":"34aae307-892d-4d8c-b339-ae065547949a","resolution":{"observed_at":"2026-05-22T23:15:12.740207Z","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.996752+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T15:53:15.996752+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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"North Holland, Amsterdam 20","venue":null,"work_id":"b62aa284-dc52-4591-a07d-acafbb0d47e2","year":1993},"citing_paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-22T23:12:58.525983Z"},"links":{"citing_paper":"/paper/2503.16186"},"observation_digest":"sha256:a7f11cabc81f46a7956d2d8922dc368af367de44e74c5a22ae42e31dda58badd","observation_id":"00b5ebc0-0d88-4c41-bd79-a8951bfd806f","resolution":{"observed_at":"2026-05-22T23:15:14.198597Z","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"}}],"paper":{"arxiv_id":"2503.16186","last_updated":"2026-04-17T08:57:25Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T20:56:05.172444Z","submitted_at":"2025-03-20T14:37:25Z","title":"Global Least Common Ancestor (LCA) Networks"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":16,"verified_fuzzy":10},"total_outbound_references":29},"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 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2503.16186."}