{"as_of":"2026-08-20T12:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1573bcc7543a6b6a521fc07f4ab111f7e8e3669a7c08116663976b3f75d4a33","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:02:38.372805Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:20:02.681670Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T10:20:02.874023Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"cited_work":{"arxiv_id":"1908.10410","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.10410","snapshot_observed_at":"2026-08-14T10:20:02.874023Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","venue":"cs.HC","work_id":"a38454a0-d511-48e1-bffa-28cac22a768e","year":2019},"citing_paper":{"arxiv_id":"1909.05114","last_updated":"2020-04-16T18:25:28Z","snapshot_observed_at":"2026-08-18T03:05:15.005673Z","submitted_at":"2019-08-29T18:27:27Z","title":"PaccMann$^{RL}$: Designing anticancer drugs from transcriptomic data via reinforcement learning","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T10:20:02.681670Z"},"links":{"cited_paper":"/paper/1908.10410","citing_paper":"/paper/1909.05114"},"observation_digest":"sha256:832634fd2bd6cbb6b70cd3503984c50df1acf8ac71ea422fd52590da84d1ebbf","observation_id":"4907c644-6dcb-4129-a8d7-2fcff8dd8c00","resolution":{"observed_at":"2026-08-14T10:20:02.878735Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.10410/citation-record","integrity":"/paper/1908.10410/integrity","json":"/paper/1908.10410/citation-record.json","paper":"/paper/1908.10410"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:38.153216Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.153216Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:3c2663ac25e55e44f6f980a394c0fbefe99e2da05c28b0e8e796c97e9bdd1265","observation_id":"c22c9458-ab93-4f30-b46b-8552d232a2d6","resolution":{"observed_at":"2026-08-14T13:02:38.153216Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:39.472737Z","title":"& Hendler, J","venue":null,"work_id":"131187b7-3533-4a14-940d-d127f5c6b6f1","year":2011},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.157697Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:4e842b1d153d5fbc95f7bb8dceb1dee47854579b3269fd1eb3473918040da553","observation_id":"b557cdcd-6c8d-4a42-8880-d1fe71ada770","resolution":{"observed_at":"2026-08-14T13:02:39.476090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.462380Z","title":null,"venue":null,"work_id":"4643eac0-e66b-4c45-9bef-b20d7802a87c","year":2011},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.161625Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:21205b655599a0b46dfb61d70bf0a31620c718d57d1ab05712750d6bf8935b15","observation_id":"9e05c829-f022-4123-bc40-0300294c3615","resolution":{"observed_at":"2026-08-14T13:02:39.465891Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.451804Z","title":null,"venue":null,"work_id":"6061d4cd-ff20-4104-9a59-eb155bb44bd1","year":2013},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.166101Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:ba425724667574dbc1dfa87f5a00546004c8d58d2f211deccb1507822d31c8d1","observation_id":"1766f7f6-909f-4c05-bd4d-334bf4d6b5c0","resolution":{"observed_at":"2026-08-14T13:02:39.455215Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.439774Z","title":null,"venue":null,"work_id":"baac32b1-0035-409d-aa1b-253d50013707","year":2014},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.170401Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:331dcd148f6cf69bdfa8923eddfffa8c8ab3c754cfb5f8a71603aa07ca19a70b","observation_id":"40e20bd1-ebe0-462a-8dd3-a3ed4a5a282e","resolution":{"observed_at":"2026-08-14T13:02:39.443816Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.429353Z","title":null,"venue":null,"work_id":"08cbd808-7cc0-40cf-bcd1-9e5a8e7f73cd","year":2015},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.174006Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:1dcfdede09f0c1dd82e46975b2b69a8d628ee417622040748380f1acc73ddc21","observation_id":"bccafb9a-d478-49d2-8b98-93358ad997ae","resolution":{"observed_at":"2026-08-14T13:02:39.433070Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1601.08059","last_updated":"2016-01-29T11:30:44Z","snapshot_observed_at":"2026-08-16T03:00:11.224578Z","submitted_at":"2016-01-29T11:30:44Z","title":"Exploration and Visualization in the Web of Big Linked Data: A Survey of the State of the Art","version":1},"cited_work":{"arxiv_id":"1601.08059","doi":null,"metadata_source":"pith","pith_arxiv_id":"1601.08059","snapshot_observed_at":"2026-08-14T13:02:38.848013Z","title":"Exploration and Visualization in the Web of Big Linked Data: A Survey of the State of the Art","venue":"cs.HC","work_id":"781180c0-0745-4c12-816e-e2c0a7f28b82","year":2016},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.178352Z"},"links":{"cited_paper":"/paper/1601.08059","citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:e91e7ddef79ec67de799f36c58d5432f412c1092f86a57825650d024042aa483","observation_id":"d0770612-d787-433e-9552-064200cb9af1","resolution":{"observed_at":"2026-08-14T13:02:38.852010Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.418794Z","title":null,"venue":null,"work_id":"b86ef514-d166-4315-84d9-e31b5cf3ea76","year":2018},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.182597Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:da99931a8840ed83f45acf8aa56ec0607d4e6be225187bd6bb3a8d150b146e85","observation_id":"4cc37bf4-5971-489f-8275-0fbdd9e914dc","resolution":{"observed_at":"2026-08-14T13:02:39.422658Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.407848Z","title":null,"venue":null,"work_id":"4eb7c78a-9bf2-453e-8775-5aba27114b6d","year":2019},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.185914Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:58e947adf1d443371d15c8ac21f76a25e817fd3f7d57b7ebf36ee08b757ca0b8","observation_id":"3ffbba81-a94e-4551-9b4e-1156cd72fea2","resolution":{"observed_at":"2026-08-14T13:02:39.411410Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.397434Z","title":"van der, Postma, E","venue":null,"work_id":"321b5b76-fd41-4206-90ec-1b279db4808c","year":2009},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.189285Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:c1b6c590941ff17ba79830ab10b0672b1dae778b8ea7d4b673bd3e70373f069f","observation_id":"3ccb807c-75d9-4b2f-86a8-cb6700ddd32c","resolution":{"observed_at":"2026-08-14T13:02:39.401149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.386531Z","title":null,"venue":null,"work_id":"2122730e-325f-4fd7-8ff9-6c8de6cd22c9","year":2017},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.192889Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:b8f7071867ecd42b5abf4dda3b83e5f0495953d726316dea024533ef8b6c1757","observation_id":"13e312e9-56d1-45cd-8b3c-cd848397382d","resolution":{"observed_at":"2026-08-14T13:02:39.390122Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.375518Z","title":null,"venue":null,"work_id":"542fa0ad-a95d-492f-bf03-41982e1d8def","year":2012},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.196521Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:cfb6f82467b60c6af0feca5303614a75c232a5748ed83ecd0ddef9287fef06ad","observation_id":"82fbddcb-9c77-48fe-b5c9-4dfd0b6e0fc4","resolution":{"observed_at":"2026-08-14T13:02:39.378984Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.364389Z","title":"& Reymond, J.-L","venue":null,"work_id":"2a2136c7-7ef5-4a08-a24e-46752b057543","year":2017},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.199674Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:0f10ffe14c9d76e89c2efbb5236d5866295f55d8edfade4b48085fee612c82b7","observation_id":"4264864d-427b-4281-9d09-fc94331712a6","resolution":{"observed_at":"2026-08-14T13:02:39.368030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.353755Z","title":"& Reymond, J.-L","venue":null,"work_id":"57d8e4c0-d773-41df-9dbb-ef286829a8d6","year":2017},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.202905Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:d55e5f5f680c5d6059e7abccf6ef1dff500800dc4dde701ec2452caffd04231c","observation_id":"948f7322-b571-4d39-bd9d-6a1cf26f8072","resolution":{"observed_at":"2026-08-14T13:02:39.357442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.342753Z","title":null,"venue":null,"work_id":"0412373d-6f84-4231-be11-ea6c2e3bf4d3","year":2002},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.206502Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:341a5111f3079e41940554304e13be0e12f3ce3d71e5f666e254477a6b5cd0c4","observation_id":"cab02658-95ff-45a2-b071-a7e2aa97f9d7","resolution":{"observed_at":"2026-08-14T13:02:39.346577Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.332084Z","title":"https://www.npatlas.org/joomla/","venue":null,"work_id":"5f8993cc-68a8-43f0-b3ca-ede0a50ecf7b","year":null},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.209849Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:c1b6944eb2894a5d52ff779207bc9a47565f09931421e3213baf268a542b0905","observation_id":"80e7986d-0aba-4ccc-b230-ffc82ae07a84","resolution":{"observed_at":"2026-08-14T13:02:39.335712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.319909Z","title":null,"venue":null,"work_id":"72296531-6eb6-46cb-a7b7-3e118eb6e575","year":null},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.213410Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:362b81c7df16d1e9a6af1a286ef7ae959e0fcd82bd300b830d6f691d9acf4d06","observation_id":"e9af0fd9-1904-4484-bd91-acf7128eb085","resolution":{"observed_at":"2026-08-14T13:02:39.323556Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.00564","last_updated":"2018-10-26T00:52:38Z","snapshot_observed_at":"2026-08-19T04:02:14.412485Z","submitted_at":"2017-03-02T00:39:53Z","title":"MoleculeNet: A Benchmark for Molecular Machine Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.00564","snapshot_observed_at":"2026-08-14T13:02:38.220475Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.220475Z"},"links":{"cited_paper":"/paper/1703.00564","citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:49a7454ef7a82ca8a488e03dc62a0addc982c6bf3f47fc3bdf37bcec49822146","observation_id":"f034bba8-b487-4b64-842e-bff38cb255f8","resolution":{"observed_at":"2026-08-14T13:02:38.220475Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:39.298879Z","title":null,"venue":null,"work_id":"d5d94cb4-154d-4860-a61d-f63a5880dc55","year":2001},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.223835Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:a184a698fe5d35b50aa7f16dd07cbd2ddb4c4e3793f6c41291f328029a8850c9","observation_id":"d26a0918-eed3-4db7-9aba-18d5c50dc1db","resolution":{"observed_at":"2026-08-14T13:02:39.302264Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.287071Z","title":"& Reymond, J.-L","venue":null,"work_id":"2c6810d1-c630-4646-acba-f8e72e0acf19","year":2013},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.227130Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:e225f72706536faa5fb7585aa48a1ab0a2fabd0d5aeb494fecb212f002938547","observation_id":"a3fc2ad6-1875-4986-a748-a0d2ffb32f9e","resolution":{"observed_at":"2026-08-14T13:02:39.291235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.273871Z","title":"& Reymond, J.-L","venue":null,"work_id":"4e5f1140-fc23-498d-aa57-235451943a18","year":2015},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.230397Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:ce8281752cd75164abbb65eaffcb19322433b13046d235f0d2e2c8744b1c8699","observation_id":"24824f78-b874-42a9-8cfa-0730d5f3a0bb","resolution":{"observed_at":"2026-08-14T13:02:39.279318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.262622Z","title":null,"venue":null,"work_id":"9bda3a62-9cdb-42a1-b3c2-d7b8f44575b3","year":2015},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.234019Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:68ea9cd0e3e2666738c8f687fa4dab84636b99844813129fbbf590c2f7827acb","observation_id":"b0e690a2-cf41-4854-95cd-2d33f1fa46d9","resolution":{"observed_at":"2026-08-14T13:02:39.266864Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.251780Z","title":"& Reymond, J.-L","venue":null,"work_id":"a95b5d31-e55f-4a92-8c1e-a90bb49833be","year":2016},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.237957Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:c9222038f387bb7c83c8419e1e1b94604775a320a712cb5fd18c871bd61c3217","observation_id":"b6b69e71-ef19-48ac-9de6-cb22643ae549","resolution":{"observed_at":"2026-08-14T13:02:39.255181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.240570Z","title":"& Reymond, J.-L","venue":null,"work_id":"f88a1aeb-af78-4898-95c1-76d0a0a474ca","year":2017},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.241464Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:fd23fb026d8834c8fdce92aa39169f0247e1f24357ede85f1410b6a1f4ad7f50","observation_id":"66a41fd0-7f4d-42f9-93ef-eac289e5234a","resolution":{"observed_at":"2026-08-14T13:02:39.244289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.227587Z","title":"& Reymond, J.-L","venue":null,"work_id":"8231ce88-f69f-43cb-bffb-8d4baabcc707","year":2018},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.245193Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:446e54c550aca4ec4f45a9cbaf08e384988066605d6bafc544c001267ea2d0fc","observation_id":"4bd0f590-8393-44b8-b481-6a23693ceb3e","resolution":{"observed_at":"2026-08-14T13:02:39.231614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03426","last_updated":"2020-09-18T01:56:41Z","snapshot_observed_at":"2026-08-02T15:32:07.466568Z","submitted_at":"2018-02-09T19:39:33Z","title":"UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.03426","snapshot_observed_at":"2026-08-14T13:02:38.249059Z","title":"& Melville, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.249059Z"},"links":{"cited_paper":"/paper/1802.03426","citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:698e4ad7d3358aa3a44dbc3e733e3545059ad23a5ae797c51e37390d5d70097b","observation_id":"78fcc0be-bac5-4261-94e3-e968b5913532","resolution":{"observed_at":"2026-08-14T13:02:38.249059Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:39.216640Z","title":"van der & Hinton, G","venue":null,"work_id":"b00b1674-b8b7-4391-9726-f14657e9b757","year":2008},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.253220Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:b384501553cdab576887ff536da5620fd95fe233ba0379b28c0ff45e98a8862a","observation_id":"941b4564-a821-4feb-87b9-6493ee15cebf","resolution":{"observed_at":"2026-08-14T13:02:39.220349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.205911Z","title":null,"venue":null,"work_id":"2b18a1b2-2dca-4f3a-bc1a-1250e8972fe2","year":2006},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.256839Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:7f6826d728a788780e644d7ce53ef4e5cb1416d3319bb7e97f193fe5966ac584","observation_id":"c219f093-f8ae-42ef-be9c-f5c173f6cb67","resolution":{"observed_at":"2026-08-14T13:02:39.209497Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.194526Z","title":"M., Svensén, M","venue":null,"work_id":"9da0382d-e4f5-4ab9-a1eb-64581539e7ed","year":1998},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.260197Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:437cef17a652a430bd4869c516276d53503279280b45dc07bb632f444a48cbe4","observation_id":"95d7ef88-bf98-4df9-8b03-e6e40b71dca7","resolution":{"observed_at":"2026-08-14T13:02:39.198309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.179300Z","title":"Exploration of very large databases by self-organizing maps","venue":null,"work_id":"400a147e-2619-4a04-82c8-0cf9105b91b9","year":1997},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.264337Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:163980f1817aff2497893f88269c5c66af0e402830aad920637b855deb10c51b","observation_id":"5e922c6b-277c-4066-a876-73368976a565","resolution":{"observed_at":"2026-08-14T13:02:39.185083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:38.267660Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.267660Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:cb5bb178aa9328dc578ccef6c266290003fcb4b5c30096d8e9a7e48300aedaee","observation_id":"a505aad2-d7a8-48d9-b3d8-3c9789658478","resolution":{"observed_at":"2026-08-14T13:02:38.267660Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:39.160114Z","title":"& Nei, M","venue":null,"work_id":"dabb204a-2e46-495a-ae56-00a3c94c0928","year":1987},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.271260Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:370c7e845a3dd0d9c776f1be0b93ca9e5019f9f1fe5a663adc27c41fc5fb2091","observation_id":"2618ca14-94c8-4ad4-97fe-f85f8075d4d9","resolution":{"observed_at":"2026-08-14T13:02:39.164950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.145921Z","title":null,"venue":null,"work_id":"7f1d778e-d31d-4994-acee-32499aa9d624","year":2018},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.274827Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:b46cafdc464aa21aef5f232967fdca9b026cd793e36693f119b671ccfcd62a47","observation_id":"c6ef2c55-afae-483e-936c-459b9031d207","resolution":{"observed_at":"2026-08-14T13:02:39.150531Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.133518Z","title":"& Carlson, H","venue":null,"work_id":"8b7762af-1298-45ce-9f58-50e4e1aee0a8","year":2016},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.278052Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:e7e8bf4a3a79fa731bf8a1d5caa4e6d26211acbed602a4c06a0b5b6413af57d9","observation_id":"80785042-bdd0-442c-9a72-a7fb969dfb21","resolution":{"observed_at":"2026-08-14T13:02:39.138156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.122068Z","title":null,"venue":null,"work_id":"9232c62c-3256-4bf6-b9de-c0b4bb199e1f","year":2019},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.281857Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:d90179d5ee6aafb1354a3b63a13c9132181460e79fd8ba8833b48c17472ca6c9","observation_id":"2c355ae8-ebf1-433c-8498-36f377850107","resolution":{"observed_at":"2026-08-14T13:02:39.126007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3372.27310","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:38.753637Z","title":"& Chaudhuri, S","venue":null,"work_id":"5ff06acc-0898-4c94-b8ed-cb629fd3fc48","year":2015},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.284858Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:ef96ff736c1f83495b7bef5a1cdd61e1f87e5bdcf2766d73249528daabb26b10","observation_id":"6b146840-1667-4966-a6ee-f52eedc6e459","resolution":{"observed_at":"2026-08-14T13:02:38.759545Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611974782.5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:38.422758Z","title":"& Nosatzki, N","venue":null,"work_id":"864847ba-15e0-490b-bc06-2b28cc6d4b0a","year":2017},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.288729Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:e35f1b6630b53b11d2e2c8eda9e205f1e4479beae8371851d88ad10293738a0f","observation_id":"7c27b8e3-f96c-4049-a215-3ef28008d2a3","resolution":{"observed_at":"2026-08-14T13:02:38.426261Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:38.292194Z","title":"& Ganesan, P","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.292194Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:042eddea6d605d955c7be8f8ca7a3c2e6c51e1b8af27befc8afe94394f5135de","observation_id":"c32f94ec-6d08-4ccc-9f28-7c2e43eab356","resolution":{"observed_at":"2026-08-14T13:02:38.292194Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:39.109064Z","title":null,"venue":null,"work_id":"57ec2686-61f9-426a-b2e6-705871fffbe6","year":1956},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.295598Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:abdab4640a1a9776b798fed709ee7bd811db12f13fdc3882502ef4f2e62dbb78","observation_id":"734eeb6b-0474-4475-9be1-98b70b6b8f30","resolution":{"observed_at":"2026-08-14T13:02:39.112695Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.097899Z","title":null,"venue":null,"work_id":"7e5088f3-38ed-4171-89b6-44de9a76e839","year":2013},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.298731Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:146829a97a8fef5c02e8df324abcfdc2147972a9f7088f5667c187d6b6cc3a9f","observation_id":"83565c3c-da90-4089-998d-f3c2a18377ae","resolution":{"observed_at":"2026-08-14T13:02:39.101955Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:38.302520Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.302520Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:f37be4108172f4d562766ea5cbcf1e08e0fe7820288faa1889102b21ccd8e3c0","observation_id":"24a60661-b5cf-45a6-a26e-eaded0bcffc9","resolution":{"observed_at":"2026-08-14T13:02:38.302520Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:39.085565Z","title":"Finding Similar Files in a Large File System","venue":null,"work_id":"793f987b-4473-40dc-a14d-2faf2e606367","year":1994},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.305849Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:918b787ec4f9d868f5ceb7ca4201b5d433c3097954bf61929f4ac761f97e51db","observation_id":"65df8802-ec78-44c6-a106-1faf3bc5ffc3","resolution":{"observed_at":"2026-08-14T13:02:39.089613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.01172","last_updated":"2017-06-05T01:17:13Z","snapshot_observed_at":"2026-08-19T06:55:53.504130Z","submitted_at":"2017-06-05T01:17:13Z","title":"Improved Consistent Weighted Sampling Revisited","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.01172","snapshot_observed_at":"2026-08-14T13:02:38.309389Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.309389Z"},"links":{"cited_paper":"/paper/1706.01172","citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:313c34480b56ce6e9cb1a08ecb58715359892e7fea526e95712e61d3ff1344ab","observation_id":"5410eed2-b7be-4113-aacd-81475abd6e7b","resolution":{"observed_at":"2026-08-14T13:02:38.309389Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:39.073320Z","title":"& Héberger, K","venue":null,"work_id":"50c02c96-81c9-4571-8bbd-2a6739ca2e7a","year":2015},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.313549Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:1a249c959a61803d4222cb247fbb84d2a64655808c1f18a4373e2b11dd86e849","observation_id":"75a5841c-9cff-4b6e-9f78-c44c56cb5ce0","resolution":{"observed_at":"2026-08-14T13:02:39.077952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.059514Z","title":"& Reymond, J.-L","venue":null,"work_id":"18daed3f-5a38-482f-bfa3-da0512f4c176","year":2018},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.316987Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:e1d06ea8c6e3bbb2779aeb76ecec07d9707e40d903e6134cc7d9adeae6b8ae92","observation_id":"22e1e1c5-164c-48c2-ac57-1527ee139e04","resolution":{"observed_at":"2026-08-14T13:02:39.063319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.046642Z","title":"& Hahn, M","venue":null,"work_id":"4bf15288-a1f0-4e5e-a2da-95e772abe1fc","year":2010},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.320753Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:645860dba690f29ff1c1cda28af94a53c49e53a66f2c8c221565627b678dc220","observation_id":"0315fe5e-e7d4-4e7c-bdeb-2b2d3cbe9508","resolution":{"observed_at":"2026-08-14T13:02:39.051889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.033085Z","title":"& Landrum, G","venue":null,"work_id":"1f7f5789-af0f-452f-b02c-772961785c93","year":2013},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.324564Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:c4bd9a2eba81f2bcd73cd37c036415230b08e007ec766f4f1f8ecdb111742d8e","observation_id":"f6d0660b-2db2-456b-9677-00b88c0f61fa","resolution":{"observed_at":"2026-08-14T13:02:39.037424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.021051Z","title":"& Reymond, J.-L","venue":null,"work_id":"0009c41d-afd3-4e53-a8a9-e34164553b66","year":2019},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.328356Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:119278d0bdfe47f41b0c67748f8617b3591046a86cf693e5b89e4724753a2f91","observation_id":"657c3d1a-f432-4299-af41-285a571f39b9","resolution":{"observed_at":"2026-08-14T13:02:39.024439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7270/q24q7sns","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:38.411830Z","title":"BindingDB Entry 6310: Compounds and compositions as Syk kinase inhibitors","venue":null,"work_id":"5e817f1e-0f5f-4ad1-b970-bf5f32bd502d","year":2014},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.332239Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:09aaddcd10acd29891c9e4218f216c95fb1bc9191673be0ecf864ce6ee013823","observation_id":"0b49a446-6050-4cb5-9a72-a659d2531c6a","resolution":{"observed_at":"2026-08-14T13:02:38.416130Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1408.2927","last_updated":"2014-08-13T07:29:12Z","snapshot_observed_at":"2026-08-14T23:23:19.723333Z","submitted_at":"2014-08-13T07:29:12Z","title":"Hashing for Similarity Search: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1408.2927","snapshot_observed_at":"2026-08-14T13:02:38.336086Z","title":"T., Song, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.336086Z"},"links":{"cited_paper":"/paper/1408.2927","citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:9bcdd10de1188cf8d89b97fa066f294b22fdabe1b31048f5b998d18b94822660","observation_id":"9850b700-ffe5-41ce-801a-3a4b540555a8","resolution":{"observed_at":"2026-08-14T13:02:38.336086Z","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.1101/534446","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:38.400050Z","title":"& Kingsford, C","venue":null,"work_id":"3aac73c2-3567-40d7-81bb-664cec399bbf","year":2019},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.339887Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:db16c4d358df1f9b9ca1da396bfad53678f1093c3f93cecdd5199fa59e0d75ae","observation_id":"9a9af988-c76d-4a1a-90c1-123f6ca05ef8","resolution":{"observed_at":"2026-08-14T13:02:38.404584Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.010630Z","title":"& Reymond, J.-L","venue":null,"work_id":"0c22bad6-8a92-4aaa-8b0a-4dcb700ca723","year":2018},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.343492Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:57b6e4e22ed896fc5bc29e5f5e9358d159f463270a8ea910e4be65dfe2cbf0d0","observation_id":"225d7b6f-bbe9-47f4-b531-e71c97993c41","resolution":{"observed_at":"2026-08-14T13:02:39.013987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.000311Z","title":"& Lilienfeld, O","venue":null,"work_id":"52530cc5-8d1e-4702-b6ab-b4197e5fce23","year":2015},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.346820Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:ef176bc2f5c65568e4f9283834d92f59aa9058cdd6052ef03116bb6f6bc884f3","observation_id":"912afb2a-3d36-431b-9478-94c0aa44d0c3","resolution":{"observed_at":"2026-08-14T13:02:39.003650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:38.988689Z","title":null,"venue":null,"work_id":"124bfb5f-0de9-4fcc-a9f5-594c39113e5a","year":2000},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.350150Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:fe55277fbb9d63260b9e8829f6d04e32c79fc20970a1dccb68c14b3cfb5d741c","observation_id":"e0113fcb-9e00-4324-9360-4b5b9de18f6d","resolution":{"observed_at":"2026-08-14T13:02:38.993050Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:38.977236Z","title":"& Reymond, J.-L","venue":null,"work_id":"9436dd8b-937e-4a77-94b9-ba86ebb9113f","year":2014},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.353088Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:74165a1453269827d4983432346a4c5a97ad4ba9199b87f729c2e28a74981515","observation_id":"821759fb-409d-4067-b7a7-ef5d73e24170","resolution":{"observed_at":"2026-08-14T13:02:38.980986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:38.965369Z","title":"The Cancer Genome Atlas Pan- Cancer analysis project","venue":null,"work_id":"5de4b733-1c70-4bf7-bdd6-01615dff11af","year":2013},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.356080Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:737266911527a7091b00a5ad43ed8a4eec7266e2a0c770af6965a2eb2f6b5440","observation_id":"b869472d-62f8-4690-b99e-62b365bf91a1","resolution":{"observed_at":"2026-08-14T13:02:38.969255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:38.954229Z","title":null,"venue":null,"work_id":"713d8614-1fc8-4655-ab00-25cf46063037","year":2019},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.359034Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:54d273a4ae38b4a1781c3ab707f30871f272f223e073ba4e9b6d87142d90adad","observation_id":"bc986416-ece6-4d50-9282-963ad9cd3d8b","resolution":{"observed_at":"2026-08-14T13:02:38.957933Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:38.943322Z","title":"B., Lomas, W., Mittar, D., Maino, V","venue":null,"work_id":"6f87b883-7f0d-496e-9048-2bb2a88373b5","year":2013},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.362376Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:e16c30a80e693eefd46513cbfd2769def03ede207de40e317dffb1408e9811e0","observation_id":"bd0e485f-e4eb-4331-8a62-fd5729a1f1ad","resolution":{"observed_at":"2026-08-14T13:02:38.946738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:38.930164Z","title":null,"venue":null,"work_id":"2875371f-57c5-4e2c-90a5-0e3275e26740","year":2005},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.365772Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:ac7789bc7002b1a7b32741fd09091fbcbf4d1a52a9cdf31db24a59a646feef45","observation_id":"8bac78fa-511f-4779-a7ba-10e94a5a622d","resolution":{"observed_at":"2026-08-14T13:02:38.933489Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:38.919418Z","title":"Annoy (Approximate Nearest Neighbors Oh Yeah)","venue":null,"work_id":"b4484f79-d4e5-4a74-8674-dc00bf85ef6f","year":null},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.369169Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:7c26a251c23a7cb961403ff316c12494193b95532133332004bafc251d8d64d4","observation_id":"604cf851-59e6-41d0-bfff-be8e39eee4fb","resolution":{"observed_at":"2026-08-14T13:02:38.923084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1310.5111","last_updated":"2014-03-06T18:47:40Z","snapshot_observed_at":"2026-08-14T23:58:27.110647Z","submitted_at":"2013-10-18T17:56:28Z","title":"Complexity of Word Collocation Networks: A Preliminary Structural Analysis","version":5},"cited_work":{"arxiv_id":"1310.5111","doi":null,"metadata_source":"pith","pith_arxiv_id":"1310.5111","snapshot_observed_at":"2026-08-14T13:02:38.437467Z","title":"Complexity of Word Collocation Networks: A Preliminary Structural Analysis","venue":"cs.SI","work_id":"03a25663-118d-4123-bb3e-0eca4c36242d","year":2013},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.372805Z"},"links":{"cited_paper":"/paper/1310.5111","citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:c847fc3371846dcc6ed4040c9f41a2e06f28b31a94950ffbdf063a9301ea7fc6","observation_id":"f5ee1d36-2c50-4d84-b83c-d0c8e7ed1cb7","resolution":{"observed_at":"2026-08-14T13:02:38.442133Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T13:02:39.309280Z","title":"46, D1074–D1082 (2018)","venue":null,"work_id":"95ed783c-fc46-4e91-9b4f-1f26b8abf58c","year":2018},"citing_paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.216754Z"},"links":{"citing_paper":"/paper/1908.10410"},"observation_digest":"sha256:96d874d386a6053bd7af1e8ebac1931ab8f76be69f0c67a54ca5ec7b637783b4","observation_id":"d889fc6c-9fdc-48ea-8eeb-6e932679d316","resolution":{"observed_at":"2026-08-14T13:02:39.312975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.10410","last_updated":"2020-01-06T14:32:02Z","latest_version":3,"primary_category":"cs.HC","snapshot_observed_at":"2026-08-20T12:09:42.848726Z","submitted_at":"2019-08-16T15:14:19Z","title":"Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":28,"verified_exact":5,"verified_fuzzy":28},"total_outbound_references":62},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 1 inbound Pith citation observation for arXiv:1908.10410."}