{"as_of":"2026-08-13T11:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c14920c3575f1ac8fc01260ed9ecb083d4b285ab61d8fa50c6d5b26bfe13777","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:10:06.771979Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T14:06:32.542639Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T20:48:15.205167Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"cited_work":{"arxiv_id":"2411.17483","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.17483","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0ec8d7bd-6a25-4009-a21c-72825a6bec94","year":2024},"citing_paper":{"arxiv_id":"2604.01960","last_updated":"2026-06-02T03:45:45Z","snapshot_observed_at":"2026-07-13T14:06:07.705156Z","submitted_at":"2026-04-02T12:22:38Z","title":"BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-05-13T20:47:04.696419Z"},"links":{"cited_paper":"/paper/2411.17483","citing_paper":"/paper/2604.01960"},"observation_digest":"sha256:31fbc37c2580561c9cab8b6abc7bae64815a88ca485357ebf01987f57479d838","observation_id":"4355c264-d34f-4f23-bf0e-0327674cc9f6","resolution":{"observed_at":"2026-05-13T20:48:15.206792Z","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":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.17483","snapshot_observed_at":"2026-07-13T14:06:32.542639Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.01960","last_updated":"2026-06-02T03:45:45Z","snapshot_observed_at":"2026-07-13T14:06:07.705156Z","submitted_at":"2026-04-02T12:22:38Z","title":"BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector","version":3},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-07-13T14:06:32.542639Z"},"links":{"cited_paper":"/paper/2411.17483","citing_paper":"/paper/2604.01960"},"observation_digest":"sha256:245422fa886af167cbe37ec8b9ff48e5d1a64a339ae0b3c0fc09f087a089f429","observation_id":"ed5086d1-4fc5-40ba-92f9-6ebd37da77cb","resolution":{"observed_at":"2026-07-13T14:06:32.542639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.17483/citation-record","integrity":"/paper/2411.17483/integrity","json":"/paper/2411.17483/citation-record.json","paper":"/paper/2411.17483"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:10:08.378436Z","title":"Data series management: The road to big sequence analytics,","venue":null,"work_id":"b3b3c2d4-0450-4c1d-980f-a4681ef38efa","year":2015},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.319041Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:f6132870a5bd46eab290655d6821f7039b1aae59fb7a739398903a8fb2fe278b","observation_id":"810b9586-e2dc-474f-860e-444ee2ac7f55","resolution":{"observed_at":"2026-08-12T12:10:08.384968Z","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-08-12T12:10:08.350788Z","title":"Report on the first and second interdisciplinary time series analysis workshop (ITISA),","venue":null,"work_id":"c694ce48-8496-44d4-ae65-7ddfaf303cc7","year":2019},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.326308Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:b2c4a1445443f8cebc58e0ed0262a9abaa8f9d3df57c5646a6446a1c4927bb3f","observation_id":"8921ccc7-822e-4c6d-828e-b2168df2aabc","resolution":{"observed_at":"2026-08-12T12:10:08.358387Z","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-08-12T12:10:08.325810Z","title":"Data series management (dagstuhl seminar 19282),","venue":null,"work_id":"1f6e33b9-6d9f-4453-a536-c0b1abaeb006","year":2019},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.333617Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:48202121fc7a9ae304d6fd61ff9423031be971f2d935dc83635db8b8a9d33839","observation_id":"419608dd-2bad-4c84-9f29-68597e1159da","resolution":{"observed_at":"2026-08-12T12:10:08.335074Z","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-08-12T12:10:08.301618Z","title":"Scal- able machine learning on high-dimensional vectors: From data series to deep network embeddings,","venue":null,"work_id":"3d036dac-b22e-4f05-b59e-b2c46de9a915","year":2020},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.339937Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:6fce107146b117c84aed654730a69fb11983ab1ff899bc2ffb58d87a3a1e7ae9","observation_id":"318bdfdc-434a-4cc9-a27b-68d7f7b1d226","resolution":{"observed_at":"2026-08-12T12:10:08.310303Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:10:06.346733Z","title":"The ucr time series archive,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.346733Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:d19d9cd70c8fa1378e47644e68d7cd5ab896f51a559f781db6f2c43386d558a9","observation_id":"0d386bd4-45b0-4453-a15c-d6c4e5bcf243","resolution":{"observed_at":"2026-08-12T12:10:06.346733Z","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-12T12:10:08.258335Z","title":"The lernaean hydra of data series similarity search: an experimental evaluation of the state of the art,","venue":null,"work_id":"297da182-e031-4ea4-b930-ad6fcc34a644","year":2018},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.352787Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:448fde67e3f78135d3dea3413600e22882aad4791384790a12c08906f77ccef0","observation_id":"229f705e-0c92-43e2-9c2b-6b9eae0dcfc6","resolution":{"observed_at":"2026-08-12T12:10:08.265459Z","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-08-12T12:10:08.234685Z","title":"Bake off redux: a review and experimental evaluation of recent time series classification algorithms,","venue":null,"work_id":"f71e8d68-d407-4cb3-93f1-4690b0b2c1b7","year":2024},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.359530Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:fcefb5e67a4c3d945b362c807067388808ed3b79bf132863c0143e0c0ed99285","observation_id":"f27c1f59-fef9-4b31-8aa0-08f8b618e15d","resolution":{"observed_at":"2026-08-12T12:10:08.242023Z","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-08-12T12:10:08.208083Z","title":"A review and evaluation of elastic distance functions for time series clustering,","venue":null,"work_id":"c2c06e4d-99f6-4a12-a4c2-e294f2187146","year":2024},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.368994Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:268a407dca75691538095ead195e9bd7ff83320aa92c16f54736822335316c20","observation_id":"32ca3028-16ec-4306-aa7e-7514b3cdd86e","resolution":{"observed_at":"2026-08-12T12:10:08.216826Z","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-08-12T12:10:08.181549Z","title":"Timeeval: A benchmarking toolkit for time series anomaly detec- tion algorithms,","venue":null,"work_id":"6b95d666-7731-43e7-9b29-fc9b169bd69d","year":2022},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.377109Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:e653a288521047e398e8e0714b0abc0fbe9c93e5dd39cae761316fd5e0c70174","observation_id":"af57eb4a-05e8-40b0-906e-cb144f9e3e54","resolution":{"observed_at":"2026-08-12T12:10:08.188200Z","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-08-12T12:10:08.161486Z","title":"isax: indexing and mining terabyte sized time series,","venue":null,"work_id":"f960c2a5-1c30-464b-ba85-4e77b5513776","year":2008},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.384949Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:bc2b44629d2d90d915da38bf7625afa1163be45e5d90e3561cb40b9545145047","observation_id":"4d90e421-6427-4890-8909-485be961029b","resolution":{"observed_at":"2026-08-12T12:10:08.169325Z","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-08-12T12:10:08.141720Z","title":"Evolution of a data series index: The isax family of data series indexes,","venue":null,"work_id":"742b1a3a-cb47-4546-81ef-f6f2e7cb29fc","year":2019},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.393881Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:e5699f878e8595f6d5ab5a72474800b6d8597ff7b2bdc1d7735927fd900e9120","observation_id":"5cb3d1f5-d055-4391-bffd-e7a3b50d2f18","resolution":{"observed_at":"2026-08-12T12:10:08.148562Z","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-08-12T12:10:08.115549Z","title":"Fast subsequence matching in time-series databases,","venue":null,"work_id":"57aa3cbc-d41f-4ce0-85c1-e2079774987f","year":1994},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.400730Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:a5361cc7baf1edbf5e2aaf05c4a1da0934ab78844d7192324be484486f9fc814","observation_id":"bdec3a83-3032-4667-9c8d-60ab7b02c020","resolution":{"observed_at":"2026-08-12T12:10:08.123134Z","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-08-12T12:10:08.083232Z","title":"Efficient similarity search in sequence databases,","venue":null,"work_id":"56def555-c5d0-4f27-9af9-5b780fe6ed4e","year":1993},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.406794Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:fe7400ac5ec5536d0183d2af5814cb8e549d0e6991a678fddf5903e32fe79344","observation_id":"5546e72b-c4b9-49c6-9c75-30abde70cc13","resolution":{"observed_at":"2026-08-12T12:10:08.101524Z","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-08-12T12:10:08.058677Z","title":"Sfa: a symbolic fourier approximation and index for similarity search in high dimensional datasets,","venue":null,"work_id":"95baa309-64ad-4521-8326-cf52c3f3d611","year":2012},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.413849Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:608ffe65069cd64f27ca5fed500db245b011f5f001fe1845cd9630ed60ed43db","observation_id":"1352179d-fadd-4d26-a70d-76cde4e026b3","resolution":{"observed_at":"2026-08-12T12:10:08.064724Z","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-08-12T12:10:08.038843Z","title":"Messi: In- memory data series indexing,","venue":null,"work_id":"8566cd31-4800-483c-9147-d0e7564dc5f7","year":2020},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.418954Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:4523fdc445e74c5f3ed861e73ec6029e490e1a45e3a0c216d3f68c6672b21393","observation_id":"acce930c-3d63-4b4d-8e5c-0b5e6504138a","resolution":{"observed_at":"2026-08-12T12:10:08.045532Z","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-08-12T12:10:08.017044Z","title":"Fast data series indexing for in-memory data,","venue":null,"work_id":"ff4e8543-a913-40cf-8664-aaebdec95806","year":2021},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.424503Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:dfdef91e08e1733bb442d816066867b777398c7e62007f55f27d93112cb961b8","observation_id":"d529c4f3-98f5-4060-8c76-9422dfabdcf9","resolution":{"observed_at":"2026-08-12T12:10:08.024665Z","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-08-12T12:10:07.994170Z","title":"Search- ing and mining trillions of time series subsequences under dynamic time warping,","venue":null,"work_id":"c5543569-3b4c-45a6-8234-a4076b22d517","year":2012},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.430074Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:ad068d50a22cd128ab987eb4f526c8cb5e178013de1b7e33f137267094b325e1","observation_id":"43a22ff4-5886-427b-829d-82494ee0588a","resolution":{"observed_at":"2026-08-12T12:10:08.001712Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:10:06.437703Z","title":"Billion-scale similarity search with gpus,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.437703Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:54cb523d68bcdd43cc9c7e5d9245060829574e9adabfeef600e112ce1ccde458","observation_id":"2b6aebfb-ae4a-490d-b41f-c1d0b1b8f884","resolution":{"observed_at":"2026-08-12T12:10:06.437703Z","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-12T12:10:07.948814Z","title":"Dimensionality reduction for fast similarity search in large time series databases,","venue":null,"work_id":"56c18a06-fd00-4816-9e25-4d1ed03afc7b","year":2001},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.444223Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:7b5de1fde7bac09b3d39c650434627db7e9dd52f193aecd610d336c2bd534dc5","observation_id":"b742f3ea-7a8d-48d3-b542-ec3f8a7651a8","resolution":{"observed_at":"2026-08-12T12:10:07.956499Z","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-08-12T12:10:07.924230Z","title":"The input/output com- plexity of sorting and related problems,","venue":null,"work_id":"5cf9ea0c-3b70-4dd5-a135-d31b09e0dea1","year":1988},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.449560Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:a7bf46ca80bc5954f646b67bad6e929a607da7f5e03e1efa678cdaad9203e260","observation_id":"089f2e78-ce2d-4a7a-a3d2-6a87d9a7140b","resolution":{"observed_at":"2026-08-12T12:10:07.930371Z","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-08-12T12:10:07.902521Z","title":"On adaptive control pro- cesses,","venue":null,"work_id":"beef7f74-1b67-4d2e-be98-19211b27116f","year":1959},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.458187Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:5c3b30e1759d808c549460252cdc95c1286724f50c4eddb26445139321dfaae3","observation_id":"2a706f24-5e26-4429-b9f5-712613eb727e","resolution":{"observed_at":"2026-08-12T12:10:07.908037Z","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-08-12T12:10:07.878727Z","title":"Multidimensional range queries on modern hardware,","venue":null,"work_id":"630c841b-b51f-4045-9297-f55d32cae521","year":2018},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.465224Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:536d9ed73e54c383ced489d132ac1517437a2810fc6aa2e765baa30ecfe17016","observation_id":"bcf9ed9b-b9f2-4ae0-8991-62b94644a09e","resolution":{"observed_at":"2026-08-12T12:10:07.883817Z","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-08-12T12:10:07.858809Z","title":"A sym- bolic representation of time series, with implications for streaming algorithms,","venue":null,"work_id":"27e3793d-5277-4078-84b3-0a3b7e205581","year":2003},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.475803Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:9b87bfecde0aca648a611432e36512260a239610074bbe3b1027b39f5dde796e","observation_id":"651a9f7d-760c-4078-86e5-02450e2eafeb","resolution":{"observed_at":"2026-08-12T12:10:07.866731Z","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-08-12T12:10:07.834357Z","title":"Introduction to intel advanced vector exten- sions,","venue":null,"work_id":"3a3b5a5e-7112-48bf-a815-e5ec021cfcea","year":2011},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.481304Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:45d98e51330d39cc1d760cd6bd526b66e4f1f686e2213c0875b314fc76c2de94","observation_id":"008c466d-87d2-4050-929e-d572698f7066","resolution":{"observed_at":"2026-08-12T12:10:07.842065Z","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-08-12T12:10:07.809897Z","title":"Exploit every cycle: Vectorized time series algorithms on modern commodity cpus,","venue":null,"work_id":"9684d706-cce9-4e58-b2b6-dcceaeb64c18","year":2016},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.486967Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:4d09d710e5cda1fe88135f3573f677c6518f542f47684d7d53c8ad1ffc2418b0","observation_id":"756cfdc4-0a11-4326-938f-6f3cf5e3a34a","resolution":{"observed_at":"2026-08-12T12:10:07.817675Z","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-08-12T12:10:07.788613Z","title":"Paris+: Data series indexing on multi-core architectures,","venue":null,"work_id":"c2a29a7e-fcb9-4dca-81ac-eb77a96c1c72","year":2020},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.492185Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:f1d6743e93b4018c6ca1cf79a075368ac76d7fa3bff7fae98ff4873a71fdb0bc","observation_id":"d0d36063-094b-47a0-b0fe-db585cb639a2","resolution":{"observed_at":"2026-08-12T12:10:07.795165Z","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-08-12T12:10:07.756963Z","title":"Paris: The next destination for fast data series in- dexing and query answering,","venue":null,"work_id":"bd971df0-f377-46b8-9fdf-b026b3b53dcd","year":2018},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.498019Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:6b6e9d36c7022758177a5cdb8a70000c50e0a527015b32d14bda9831111ad796","observation_id":"dbb6beba-4ce4-41a6-b324-2d9a1f54af75","resolution":{"observed_at":"2026-08-12T12:10:07.765576Z","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-08-12T12:10:07.735014Z","title":"Sofa repository,","venue":null,"work_id":"f73d09d5-5cc5-4e93-bd49-df278a3af855","year":2024},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.503620Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:fe42dcc59f9bb001ab56c76e63f167c4f05d31d064c497d9a5e7de1cc508666f","observation_id":"00db0d8b-deb1-4fe3-9dd9-74c598758996","resolution":{"observed_at":"2026-08-12T12:10:07.742343Z","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-08-12T12:10:07.714729Z","title":"Locally adaptive dimensionality reduction for indexing large time series databases,","venue":null,"work_id":"4129a929-8e7c-4170-ab39-505766a2e329","year":2002},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.508922Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:16c2570abd6a64b196b2ac624d4cb4b6a06e844c18434582c6b0967dde6ab86b","observation_id":"6a372bd7-3b74-4922-a155-e26000f6612c","resolution":{"observed_at":"2026-08-12T12:10:07.721433Z","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-08-12T12:10:07.690747Z","title":"Index- able pla for efficient similarity search,","venue":null,"work_id":"8e51e34a-a376-4367-9e91-eda6acb8ccec","year":2007},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.517161Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:fcce3b16df74ce7685007e0ea311c12e5d4663d7272b45af0d6224af1d5f4694","observation_id":"3c467cab-10b6-445c-bcb7-8f94ccafe122","resolution":{"observed_at":"2026-08-12T12:10:07.697692Z","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-08-12T12:10:07.668085Z","title":"Indexing spatio-temporal trajectories with chebyshev polynomials,","venue":null,"work_id":"81c930c3-52c2-4ff4-bbec-06cf93b3b34f","year":2004},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.524167Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:c833b8725eea169803c6b8ccfd3622dea93239cef2f9608d218ce5c2a6835a5c","observation_id":"c91c99af-4917-4bea-a48d-5a7245be6c46","resolution":{"observed_at":"2026-08-12T12:10:07.676387Z","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-08-12T12:10:07.647676Z","title":"Similarity search over time-series data using wavelets,","venue":null,"work_id":"2125feae-2edb-4394-8ab9-ab8574545807","year":2002},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.530143Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:1f2881022d6c1bc306f1274bdb5fdbea41c0bfd1f52d214b9d78d0f9d9c634ee","observation_id":"cd8c8c38-1e5f-4776-8f80-3b0a6eca24ed","resolution":{"observed_at":"2026-08-12T12:10:07.654489Z","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-08-12T12:10:07.626833Z","title":"isax: disk-aware mining and indexing of massive time series datasets,","venue":null,"work_id":"a18383c4-c9f3-4635-9cbb-c1cc4731e23e","year":2009},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.537697Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:51329859ced8b44d0938df024bd1eb002c09432bcb244813de32234014a57679","observation_id":"86ae307a-b696-44d0-9bb6-ab0f11ce1bcb","resolution":{"observed_at":"2026-08-12T12:10:07.634193Z","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-08-12T12:10:07.602066Z","title":"isax 2.0: Indexing and mining one billion time series,","venue":null,"work_id":"82c17e32-9f22-4643-8f2f-04360b862215","year":2010},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.547282Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:a0232f44ce6b58f52ea40985fb3a7944dc2dadd7d0f1b2254755d9ae2b0684f3","observation_id":"04d31b0a-6ae2-4869-9cc2-152a75aee92d","resolution":{"observed_at":"2026-08-12T12:10:07.609584Z","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-08-12T12:10:07.581713Z","title":"Beyond one billion time series: indexing and mining very large time series collections with sax2+,","venue":null,"work_id":"4fbdc6d1-ec22-4d2d-92d9-5d5200cf87a6","year":2014},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.555596Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:b31aa74d6ecc56e52109bf49d64273569876e79c8d32645c11238246d91db562","observation_id":"96cba321-93d5-4238-8623-b2852dbe60ce","resolution":{"observed_at":"2026-08-12T12:10:07.587857Z","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-08-12T12:10:07.560322Z","title":"Ads: the adaptive data series index,","venue":null,"work_id":"7c4753d6-3e34-4da5-b7fe-8c4767d8de2f","year":2016},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.561900Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:d139271591fc111ff44f7af6744243f7e4acb5239fd8ccc54e1199db8fb8313d","observation_id":"00a4cc29-6073-4e33-9f55-72dee9df9aef","resolution":{"observed_at":"2026-08-12T12:10:07.566661Z","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-08-12T12:10:07.531015Z","title":"Dpisax: Massively distributed partitioned isax,","venue":null,"work_id":"ca57a27b-6db1-4c9d-8236-9b566622227f","year":2017},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.569522Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:96e166222befd770875f562e18c7dc4b45d988283447188c7c421b1ecd4fdf49","observation_id":"cc30ff03-4e7d-47f7-ae9e-9654e6e4cc95","resolution":{"observed_at":"2026-08-12T12:10:07.541563Z","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-08-12T12:10:07.509108Z","title":"Massively distributed time series indexing and querying,","venue":null,"work_id":"8c327d55-39fb-4e9b-ad84-6456d9120474","year":2020},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.577816Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:fafe9068895f5f909efb3703edb2e93ff4d1d58efdc7cd4435d574121f4d4f15","observation_id":"fe68add1-a775-4576-92f7-9278081ffefe","resolution":{"observed_at":"2026-08-12T12:10:07.516202Z","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-08-12T12:10:07.487132Z","title":"ULISSE: ULtra compact Index for Variable-Length Similarity SEarch in Data Series,","venue":null,"work_id":"018dff5d-50c6-4df9-82b2-f5a5cdf72c45","year":2018},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.584738Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:c477b15a723d98563b490471b0b62a906de259bf1ef322f1501865574710512d","observation_id":"44deb40b-c193-425c-9e63-a54f0c5494ae","resolution":{"observed_at":"2026-08-12T12:10:07.494129Z","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-08-12T12:10:07.446876Z","title":"Scalable data series subsequence matching with ulisse,","venue":null,"work_id":"9b9afda6-c084-4072-bf05-5662de8c59b4","year":2020},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.590068Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:e4a94c7f15fff60bc4fe38105d7c646c5291167249d8daf8cf232a843d6d55f0","observation_id":"f9f29b5f-d198-42d7-90a7-4ccbcfe5b18e","resolution":{"observed_at":"2026-08-12T12:10:07.453713Z","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-08-12T12:10:07.428166Z","title":"Coconut: A scalable bottom-up approach for building data series indexes,","venue":null,"work_id":"dfa9d56a-54de-4ec3-ad90-b4b5dd6d047b","year":2018},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.597414Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:59e8a7749ed3beb2b2d2cb43d4c3faf186946b2d039161cd10eb011edd56c728","observation_id":"64989c7f-e75c-4470-a7cd-73c632aa19c2","resolution":{"observed_at":"2026-08-12T12:10:07.433871Z","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-08-12T12:10:07.408063Z","title":"Coconut: sortable summarizations for scalable indexes over static and streaming data series,","venue":null,"work_id":"da0ab080-f6fb-449c-af4a-cae8070d1f79","year":2019},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.602769Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:05e5054c5a3380a066cdc09e4febee5cacfdc273191abee266e7988aff01f4f1","observation_id":"37f4b18c-2818-439d-8240-41a7ebdaac29","resolution":{"observed_at":"2026-08-12T12:10:07.414004Z","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-08-12T12:10:07.387225Z","title":"Hercules against data series similarity search,","venue":null,"work_id":"da9dd9cf-b70d-4719-9dcb-3b173491832f","year":2005},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.615371Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:1c7ac82764ef0d9c53e9c967513632d94a6fba7efb441ceb73cc2afde5841c1e","observation_id":"249ac876-1e9b-4c1d-ac04-b074ceaa9c87","resolution":{"observed_at":"2026-08-12T12:10:07.393760Z","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.1145/3588965","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:10:06.814102Z","title":"Dumpy: A compact and adaptive index for large data series collections,","venue":null,"work_id":"28ff694f-8989-4d7d-b46d-8bbb4d11f0ad","year":2023},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.623611Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:674de50a118b7021080b75ae1ef523de090d74a8dd420be9f21b3dd1c1abf0f5","observation_id":"3cdc7360-90a7-405f-92bc-2582e879d6b9","resolution":{"observed_at":"2026-08-12T12:10:06.822492Z","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-08-12T12:10:07.371478Z","title":"Elastic similarity and distance measures for multivari- ate time series,","venue":null,"work_id":"62d67ca9-debf-4464-a121-f4d96ab1bb39","year":2023},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.629621Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:2cebac8897c35c5f857516f3570f00a57d96a92bb02d2a48992d68ea82831ea7","observation_id":"4d64a80b-0368-4d1c-989d-c1ba361ce371","resolution":{"observed_at":"2026-08-12T12:10:07.376839Z","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-08-12T12:10:07.347436Z","title":"iSAX: indexing and mining terabyte sized time series,","venue":null,"work_id":"141eba58-bd45-4d00-ba37-571e177fdcea","year":2008},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.634805Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:88d6fa6bc0d893f467dabfb78d3acbb4c500766fa6c738af37319fc43f289112","observation_id":"ce849c07-30e7-47ca-af10-d73100ae2ac5","resolution":{"observed_at":"2026-08-12T12:10:07.358667Z","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-08-12T12:10:07.323075Z","title":"Evolution of a Data Series Index,","venue":null,"work_id":"8df7c5b1-6532-4b4b-be6b-394ac592b1fa","year":2020},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.640038Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:519c60d54af42d41c5806e4fa925d1a8545a6fa1c2243833773d72d2dafcd544","observation_id":"668a4eb4-9524-475f-b481-edc73ade88d9","resolution":{"observed_at":"2026-08-12T12:10:07.331568Z","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-08-12T12:10:07.292976Z","title":"A brief survey of vector databases,","venue":null,"work_id":"8a019c4a-3307-41c4-9d3f-397f18826069","year":2023},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.646421Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:abea6779057c62441fe375e312b3e7cdab592618db17b8498e684fb32e84443c","observation_id":"e04da997-733b-402e-b992-37230f9946ef","resolution":{"observed_at":"2026-08-12T12:10:07.307840Z","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-08-12T12:10:07.272341Z","title":"Approximate nearest neighbor search in high dimensional vector databases: Current research and fu- ture directions","venue":null,"work_id":"b783d457-ab76-4082-8703-8accdbc982b8","year":2023},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.651395Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:01ff09169c21dd2103bcd187876928d805fc74b0a4791c6268882e8f856c333e","observation_id":"7fe6ca86-3951-4bc5-ae73-d6f875a78eec","resolution":{"observed_at":"2026-08-12T12:10:07.278252Z","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-08-12T12:10:07.254728Z","title":"Mass: distance profile of a query over a time series,","venue":null,"work_id":"022aa66b-9ca2-494a-8d83-1678bcf6f55c","year":2024},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.656397Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:7594fc4d5f784e5aeb4392ae6cb2fdab41260903baa1bd82834d8b71f8debc39","observation_id":"ada653c1-5b43-4cda-a263-265c4f796e24","resolution":{"observed_at":"2026-08-12T12:10:07.259906Z","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-08-12T12:10:07.237810Z","title":"Return of the Lernaean Hydra: Experimen- tal Evaluation of Data Series Approximate Similarity Search,","venue":null,"work_id":"879ad8b6-7f8c-4117-8ed5-977b893d7aaf","year":2019},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.661821Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:1c7f432dce24b397842a266ef2c1aed22ce98b34d52729c8b7c1b0bc32f6b3e2","observation_id":"5e2bfe83-e73e-44c2-b5b4-32ce905ac165","resolution":{"observed_at":"2026-08-12T12:10:07.244048Z","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-08-12T12:10:07.218083Z","title":"Efficient retrieval of simi- lar time sequences using DFT,","venue":null,"work_id":"b3b9e2d6-cdf7-4a5e-b18b-c7f70f0d3b13","year":1998},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.668226Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:4ebb681474678301c954e4aa05493a3a02a1cfc5d4cf000b158a68027fafa76b","observation_id":"4e59a6d4-c65a-444e-83e6-21a93b0a65e0","resolution":{"observed_at":"2026-08-12T12:10:07.225761Z","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-08-12T12:10:07.193384Z","title":"Intel 64 and ia-32 architectures opti- mization reference manual,","venue":null,"work_id":"f7e28f51-e54f-4cb6-b47d-804834de1963","year":2016},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.675047Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:55734cb91020f71942e884b0650e09a4a500da337739299e5ffa8d4deff0c2f8","observation_id":"98510d37-d024-42e8-abeb-4bd036f36f0a","resolution":{"observed_at":"2026-08-12T12:10:07.200883Z","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-08-12T12:10:07.172948Z","title":"Seisbench—a toolbox for machine learning in seismology,","venue":null,"work_id":"74d4a160-495f-4c91-bc08-f1f327619213","year":2022},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.683084Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:ba83cea1c7be50c8faab4a5289afedffb2a47a82df745bdaaad9b12d9afc9cab","observation_id":"d0c59994-2ba5-414f-8d81-f91d997594cd","resolution":{"observed_at":"2026-08-12T12:10:07.179198Z","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-08-12T12:10:07.150611Z","title":"Long-term variability of agn at hard x-rays,","venue":null,"work_id":"9de35536-fdd4-498e-9596-d0b033ae6ed2","year":2014},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.688696Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:6681787b5253308cd7988b868a63489b1d1814f91e69c2ea7b312034d786747c","observation_id":"2cfb2bda-6ea8-462e-8eef-1b6a10b93d7a","resolution":{"observed_at":"2026-08-12T12:10:07.157778Z","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-08-12T12:10:07.131506Z","title":"Results of the neurips’21 challenge on billion-scale approximate nearest neighbor search,","venue":null,"work_id":"290eb6bc-de1e-4359-82fe-2058ab3b1076","year":2021},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.695446Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:336c092ff75acbfabd617949230f066d63178ea30d8c268b3bf84a9d0d0b97b4","observation_id":"4e8f88a2-e1bc-4cdc-974c-60d7b273ab0b","resolution":{"observed_at":"2026-08-12T12:10:07.138351Z","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-08-12T12:10:07.109162Z","title":"Efficient indexing of billion-scale datasets of deep descriptors,","venue":null,"work_id":"99dddcab-dc47-40a0-96d1-51f1f5734e80","year":2016},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.700331Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:5303cd090a616c5edd050bd4fb515597b0ef1c2c95f077afbddd1853a9603df6","observation_id":"5b21958c-4466-40df-96d8-577340a857f5","resolution":{"observed_at":"2026-08-12T12:10:07.117109Z","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-08-12T12:10:07.082845Z","title":"Convolutional neural network for seismic phase clas- sification, performance demonstration over a local seis- mic network,","venue":null,"work_id":"8a250e7f-cbbd-4d7f-9967-39ffa4c2b2b3","year":2019},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.705901Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:d456bdbf677de3636b978f359e2b2af424e0b4e34dcee3d3f956f0f045b397b4","observation_id":"c26baaf5-4577-4277-9d8d-9de526880f5f","resolution":{"observed_at":"2026-08-12T12:10:07.090438Z","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-08-12T12:10:07.059491Z","title":"Learning the deep and the shallow: Deep-learning-based depth phase picking and earthquake depth estimation,","venue":null,"work_id":"bd9cf14c-c5a2-4c3a-bbe0-f9629170ad76","year":2024},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.712137Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:7b694bf1f24507a6e15c8c1e80f3ade55c0009da112e2b0c9d40c44b9289153d","observation_id":"ce206c2c-2b19-40bb-b84c-9a7a8a9404a5","resolution":{"observed_at":"2026-08-12T12:10:07.065382Z","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-08-12T12:10:07.038703Z","title":"Local earthquakes detection: A benchmark dataset of 3-component seismograms built on a global scale,","venue":null,"work_id":"bed98387-a06a-45eb-b469-c3e89a1adc1b","year":2020},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.717384Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:47a75a650efb1400cd35438446c4a463443bb9939771214883d7a06aa377a7ce","observation_id":"d3261034-9bdd-49dc-b6cf-abd314f6ac96","resolution":{"observed_at":"2026-08-12T12:10:07.044141Z","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-08-12T12:10:07.015041Z","title":"Leveraging deep learning in global 24/7 real- time earthquake monitoring at the national earthquake information center,","venue":null,"work_id":"144dd96e-10d6-40bf-8a60-7aa335bc403c","year":2021},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.722988Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:207551797c60b80e0d853c65e3e77bc0b1c068bf43f3f12bea671f1d2f52eb8f","observation_id":"ee5dfa71-dd36-4cbc-9fb9-d99ed250998f","resolution":{"observed_at":"2026-08-12T12:10:07.025191Z","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-08-12T12:10:06.987130Z","title":"Pickblue: Seismic phase picking for ocean bottom seismometers with deep learning,","venue":null,"work_id":"21b16a31-30c9-4c5d-b264-0cedf1b4ad7e","year":2024},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.728783Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:2e6beac9f282d4f3ce3beade1fbd9916f780b62bb9910916ddc01ec4714f2810","observation_id":"a622c12b-96f2-4eed-83a9-6252f0b73993","resolution":{"observed_at":"2026-08-12T12:10:06.995891Z","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-08-12T12:10:06.966228Z","title":"Obstransformer: a deep- learning seismic phase picker for obs data using au- tomated labelling and transfer learning,","venue":null,"work_id":"6df8df64-584e-4838-a589-911a91bd7604","year":2024},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.735062Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:58b45f5f87499546a89e36770476af1eb7246dd5a56073e637e1a165d0d7fc71","observation_id":"ebd2a003-5791-4cf1-a591-3261682c0659","resolution":{"observed_at":"2026-08-12T12:10:06.972799Z","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-08-12T12:10:06.940351Z","title":"Curated pacific northwest ai-ready seismic dataset,","venue":null,"work_id":"55ee737c-aa5c-4dfd-aaa7-74423141330b","year":2023},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.741107Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:30d61cfe12cd5692d7f59dfcdf8a67c8a9de84bd292d5d3421df56f3876b8d67","observation_id":"965d8f1d-5e19-4104-9c0a-7bdacfb0a7f5","resolution":{"observed_at":"2026-08-12T12:10:06.946341Z","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-08-12T12:10:06.917755Z","title":"Southwest university adult lifespan dataset (sald),","venue":null,"work_id":"75a96b9d-0b53-46b6-b404-1b88d660ea3c","year":2018},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.747554Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:caf96b87d1bf9a4072de38198b70ca0df73c055996d0dcf2d7855514233d1b1a","observation_id":"17c4397c-bf0e-4810-806c-80fe11aa2eb7","resolution":{"observed_at":"2026-08-12T12:10:06.924343Z","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-08-12T12:10:06.895884Z","title":"Southern california earthquake center (scedc),","venue":null,"work_id":"6075a69b-a257-4b1f-a95d-7ce16f4f680c","year":2013},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.753368Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:4db46bd9f84e0c032b990ffcde63b51b7d30f102b3a4212d54dbb0bd1afd3495","observation_id":"0bfb68eb-12a8-4a02-ad96-1e5d20f45e50","resolution":{"observed_at":"2026-08-12T12:10:06.900941Z","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-08-12T12:10:06.876093Z","title":"Searching in one billion vectors: re-rank with source coding,","venue":null,"work_id":"c2f62bb5-af2f-421a-b659-b68ff937f00c","year":2011},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.759951Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:8f4f54ae8cd898b10b753e054652d676701e9f9bcc1285e25c8ed6318ebdc9fe","observation_id":"0d26b1a9-055f-4a5b-81ee-653d94c45d9f","resolution":{"observed_at":"2026-08-12T12:10:06.881839Z","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-08-12T12:10:06.858315Z","title":"Stanford earthquake dataset (stead): A global data set of seismic signals for ai,","venue":null,"work_id":"cca17e72-7978-4290-bb1f-316e17087fe4","year":2019},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.765952Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:61fb4424a7908c820f2936e0d6b29b149bc04408d6c649612554aebf3b888622","observation_id":"84c2232d-48d8-4f7f-9221-cc9348e4e5b1","resolution":{"observed_at":"2026-08-12T12:10:06.864167Z","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-08-12T12:10:06.836782Z","title":"Txed: The texas earthquake dataset for ai,","venue":null,"work_id":"1fca668f-3122-4da5-88d4-ab75ec50f73b","year":2013},"citing_paper":{"arxiv_id":"2411.17483","last_updated":"2024-12-03T07:41:46Z","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-12T12:10:06.771979Z"},"links":{"citing_paper":"/paper/2411.17483"},"observation_digest":"sha256:6423234bfdbf480986830ff0e0d487625cf8e785653c1fd7cd993878db49dd1e","observation_id":"37a969c1-d1b7-4450-bae0-5c5ed7d52d46","resolution":{"observed_at":"2026-08-12T12:10:06.843275Z","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":"2411.17483","last_updated":"2024-12-03T07:41:46Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-12T12:02:01.949803Z","submitted_at":"2024-11-26T14:47:59Z","title":"Fast and Exact Similarity Search in less than a Blink of an Eye"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":66},"total_outbound_references":69},"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 69 of 69 outbound references and 2 inbound Pith citation observations for arXiv:2411.17483."}