{"as_of":"2026-08-11T15:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0fd4c9f6c033c73f1ea5d52e017b9aedc2ff2e5713fbf45906d7f849eea87b8","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T13:29:54.632420Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2510.00566/citation-record","integrity":"/paper/2510.00566/integrity","json":"/paper/2510.00566/citation-record.json","paper":"/paper/2510.00566"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:48.099307Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:48.099307Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:1bd3ef33772b3264659ba9ae471889603b5d6d3bc1ddc48919b1bbec38754f3a","observation_id":"cc006115-8976-49b4-b04a-ac92e72c5e2f","resolution":{"observed_at":"2026-08-04T13:29:48.099307Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:48.160952Z","title":"Absil, R","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:48.160952Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:da3968a4bbd19baa5fe316d8a4bd1ec3bab3ec05cc25beae9ce27a7c5e0cdfc6","observation_id":"dcb4a177-2779-405f-bc54-0fff4a3b38ce","resolution":{"observed_at":"2026-08-04T13:29:48.160952Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:48.307434Z","title":"DeWitt, Mark D","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:48.307434Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:8be6a453c74579e3bb1474e17da639110c2ee40ee58509bd328e3f58c562b1a7","observation_id":"73e316d6-d417-43c7-b1f7-2177d370f25f","resolution":{"observed_at":"2026-08-04T13:29:48.307434Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:48.442822Z","title":"Basic local alignment search tool","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:48.442822Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:b98610248350b7597cee47fd2878a53910bd34df9ca6e04e26946a7caed57bbe","observation_id":"ff46372d-f8f2-4bfe-8917-a9c27e2dd30b","resolution":{"observed_at":"2026-08-04T13:29:48.442822Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:48.593843Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:48.593843Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:7805c5b438cdebd060250eb8f7c1c956cef7bb92b030fecbba6c0646730ece19","observation_id":"195332f9-6785-4231-9480-a0dc3d234b28","resolution":{"observed_at":"2026-08-04T13:29:48.593843Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:48.709199Z","title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:48.709199Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:e5141f9a800af4fd263d41ca31443216341457100d7555ff1e4fe40fc90beede","observation_id":"3e98f3a5-9ae3-4ad3-9054-57469eace796","resolution":{"observed_at":"2026-08-04T13:29:48.709199Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:48.838797Z","title":"Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:48.838797Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:4fd2c584ebd6c63c98fd818b4fee1dfbe020e807987a7def8797dea061df6385","observation_id":"2fb5b632-f82d-4a11-9667-27f9e3df7afb","resolution":{"observed_at":"2026-08-04T13:29:48.838797Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:48.997444Z","title":"Efficient indexing of billion-scale datasets of deep descriptors","venue":null,"work_id":null,"year":2055},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:48.997444Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:47a02777c15761dff1f1d812b5fb9824c333ebb0781d14323894cca6b0ded136","observation_id":"edff3134-3f50-4afb-9960-51c60e08e4b0","resolution":{"observed_at":"2026-08-04T13:29:48.997444Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:49.081453Z","title":"Multidimensional binary search trees used for associative searching","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:49.081453Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:0722bf4fbfd4d7d0235ed2d30fff37b39322c72d0d47526a851535442308ed67","observation_id":"6d78f208-44b8-45c3-894c-98a38289130f","resolution":{"observed_at":"2026-08-04T13:29:49.081453Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:49.203364Z","title":"Annoy: Approximate nearest neighbors oh yeah, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:49.203364Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:7f2611ce7347aa341040ada0937aa1f0c1fa1d6b0f53794c02776127ad81b48e","observation_id":"a259c168-ecb7-42b8-96e8-cb2ac81cff94","resolution":{"observed_at":"2026-08-04T13:29:49.203364Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:49.330720Z","title":"Evaluating and generating query workloads for high dimensional vector similarity search","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:49.330720Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:d2081359fef89de009f9cff0540da3ede2c6d279c7d42f8e692efe9be8a254ee","observation_id":"992d3513-287d-4099-84bd-8e46009ac9b7","resolution":{"observed_at":"2026-08-04T13:29:49.330720Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:49.465455Z","title":null,"venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:49.465455Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:dc5e45cecfcfb6ec2eba6ff5cc0eeae37ed626e394ce43080924cb20007fe0bf","observation_id":"71d2854b-c830-4be7-9c6f-d96271688a9a","resolution":{"observed_at":"2026-08-04T13:29:49.465455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08281","last_updated":"2025-10-23T09:36:08Z","snapshot_observed_at":"2026-07-31T05:45:37.385210Z","submitted_at":"2024-01-16T11:12:36Z","title":"The Faiss library","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08281","snapshot_observed_at":"2026-08-04T13:29:49.581352Z","title":"The faiss library","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:49.581352Z"},"links":{"cited_paper":"/paper/2401.08281","citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:b3bf83c0eb940d2af13d45be00ccb6b1ec86690fec91df383311ee6eb6ffaa70","observation_id":"a80e4672-9b9b-44e7-a14f-ecd6abb33793","resolution":{"observed_at":"2026-08-04T13:29:49.581352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"physics/9806030","last_updated":"1998-06-19T20:00:22Z","snapshot_observed_at":"2026-07-07T06:58:48.831507Z","submitted_at":"1998-06-19T20:00:22Z","title":"The Geometry of Algorithms with Orthogonality Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"physics/9806030","snapshot_observed_at":"2026-08-04T13:29:49.699335Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:49.699335Z"},"links":{"cited_paper":"/paper/physics/9806030","citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:fc99178685c31b0333247f29dc5afaca103e78450af4621300bf9714726b188b","observation_id":"b8c8a948-0c87-47ab-adbf-80845a5a9fcf","resolution":{"observed_at":"2026-08-04T13:29:49.699335Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:49.815279Z","title":"Byteslice: Pushing the envelop of main memory data processing with a new storage layout","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:49.815279Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:6855d6002e67b3fea29d04891cb4adf304bb918a3ec99ebd662e635ca8b893ec","observation_id":"b0255df6-e102-4124-8177-0ab616fcb78a","resolution":{"observed_at":"2026-08-04T13:29:49.815279Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:49.950624Z","title":"High-dimensional approximate nearest neighbor search: with reliable and efficient distance comparison operations","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:49.950624Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:3da81f3141ff92bbe9846a04e44ca641acfdadfb8da4131088f355d767995fc7","observation_id":"f351008c-d702-49d0-b977-995e238fa712","resolution":{"observed_at":"2026-08-04T13:29:49.950624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-04T13:29:50.095298Z","title":"Retrieval-augmented generation for large language models: A survey","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:50.095298Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:1312b76d6a692560129d5a29305526c05d72e92842b67007dd2aadb32291eab6","observation_id":"8163a5ec-038d-419d-987b-e908a49997c9","resolution":{"observed_at":"2026-08-04T13:29:50.095298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0106004","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of the Society for Industrial and Applied Mathematics","work_id":"42f08e78-e2e7-4dcc-946b-f0ccd45e1e5f","year":1958},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:50.232590Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:8a0fde5ebef0be5d7e92ed865f6146c1a8fc7616f80f2a66ebd2b56b5fa6e0e5","observation_id":"58bf8e51-6c68-4777-b9c8-78f1dcc46aba","resolution":{"observed_at":"2026-08-04T13:34:09.917740Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-04T13:29:50.348072Z","title":"Accelerating large-scale inference with anisotropic vector quantization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:50.348072Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:db94a2847acf95021bafe2281e807d8534c6fb15a2006ca4e91077c5582704db","observation_id":"10b16bf2-b3c3-4cbe-bf6e-3d9414b32d8a","resolution":{"observed_at":"2026-08-04T13:29:50.348072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.laa.2008.08.010","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hadjidimos and M","venue":"Linear Algebra and its Applications","work_id":"42d88c3d-3fb1-4c35-8971-b6c990490332","year":2009},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:50.540076Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:c85aefedf025ba8bd2ea368da696a31138d49bf0a89b6fb92e93d6592ee8353d","observation_id":"c377fd68-154e-4360-9b6f-4efd87d2e14e","resolution":{"observed_at":"2026-08-04T13:34:09.515495Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4614-7116-5_16","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Graduate texts in mathematics","work_id":"41502fe2-cc33-4ba1-8dc9-6cc9cc302a93","year":2013},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:50.663171Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:833d959ae303ec653c523ecb33166af9cd78f299e486cab8135851b5fd5dcd3c","observation_id":"3ac718ca-e7a0-455e-a5d8-c00b3ba40cf0","resolution":{"observed_at":"2026-08-04T13:34:09.251144Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-04T13:29:50.800561Z","title":"A comprehensive survey on vector database: Storage and retrieval technique, challenge","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:50.800561Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:74789f254cd2f44d82ab33d85ff4bbc7db18191a3a7c60aea8fced6df01617f4","observation_id":"a2fd70af-90c3-46f5-b539-ef0f8e31e0d2","resolution":{"observed_at":"2026-08-04T13:29:50.800561Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:50.966127Z","title":"Harris, K","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:50.966127Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:87c87a836663194ebd8230b1f1dd48dbbbad98f31ac00ba697fbeccade07b521","observation_id":"f1faa222-7e95-4bdd-a297-7cde0b9ddd63","resolution":{"observed_at":"2026-08-04T13:29:50.966127Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:51.082245Z","title":"Horn and Charles R","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:51.082245Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:7dc0d4f21900bed72f5549256726d6f3a3f6edb198ad9fa21b95c3c3a299b720","observation_id":"fdc5d888-f34c-45a7-9be8-6468d9849dfa","resolution":{"observed_at":"2026-08-04T13:29:51.082245Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:51.233486Z","title":null,"venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:51.233486Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:acc92853377a75f183140b5e3883f8b8896bf11971c2dc84735a5daae02948eb","observation_id":"afef8eeb-b59d-4885-b6ad-40b24ab0c5fd","resolution":{"observed_at":"2026-08-04T13:29:51.233486Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:51.376927Z","title":"o nen, Teemu Pitk \\","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:51.376927Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:cb0ed75180b40af3d24cf73f0ea6dcda8644cdc5d1d850d85a14ee7a3115ebb9","observation_id":"9519e753-473c-4521-8848-b03c854c2d64","resolution":{"observed_at":"2026-08-04T13:29:51.376927Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:51.541912Z","title":"MRPT : Multi-resolution hashing for proximity search","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:51.541912Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:1ea545e1475bbde7e64816dc18b83d9df2722888509cd7ebe90117a9852f5a6c","observation_id":"7e081848-e492-4942-b1aa-fda2f5cc9c75","resolution":{"observed_at":"2026-08-04T13:29:51.541912Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:51.745269Z","title":"Approximate nearest neighbors: towards removing the curse of dimensionality","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:51.745269Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:c565a72d503c2ae45315d0478b6dd9d1e95f5dcb661e4c009bb238e49d5c0d91","observation_id":"c743e338-49aa-40c5-a466-f4e824625348","resolution":{"observed_at":"2026-08-04T13:29:51.745269Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:51.900268Z","title":"a \\\"a saari, Ville Hyv \\","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:51.900268Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:f063f8d3f22757388766086a5236b9aab1c7343254af9beb5895c6eb18397536","observation_id":"6714cc90-a098-4ba9-aa6d-399d3697f7e6","resolution":{"observed_at":"2026-08-04T13:29:51.900268Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:51.997614Z","title":"a \\\"a saari, Ville Hyv \\","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:51.997614Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:af5f3bcea89925522394be9a004570ad63eb712e3673078e0a32dcb816386ebf","observation_id":"3b7cc104-5839-4610-b956-a9ca5e5f6f6c","resolution":{"observed_at":"2026-08-04T13:29:51.997614Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:52.171513Z","title":"Jégou, M","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:52.171513Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:a31c2588403b60f68793fb4867e304a8dc8ffb651be9ea819b26a057d12d263f","observation_id":"f02acec5-b7d8-487f-acb4-16312356d56a","resolution":{"observed_at":"2026-08-04T13:29:52.171513Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:52.274990Z","title":"Hamming embedding and weak geometric consistency for large scale image search","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:52.274990Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:df5c2ab7936e3d8bf31a19e6e27838a84a4f38b2a63b11fd9585ef2d84c2e93c","observation_id":"56c773ef-cf1c-489a-bc14-5bb34b9b783d","resolution":{"observed_at":"2026-08-04T13:29:52.274990Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:52.419266Z","title":"Scalable k NN search on vertically stored time series","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:52.419266Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:198b95e57a27df2aa25aefeb57992ddff2e0b49d6b633d1ff97bcd8afbe2f825","observation_id":"f73634bf-d9f5-454e-a33a-4f1407d4bc4c","resolution":{"observed_at":"2026-08-04T13:29:52.419266Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:52.606357Z","title":"Matrix factorization techniques for recommender systems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:52.606357Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:2ecc0289bf658a5ba8d312345b787ed58f03bb379da66cecc5d2cfe0cededabc","observation_id":"81b2510a-70f2-423d-82ac-66d10f92e8f5","resolution":{"observed_at":"2026-08-04T13:29:52.606357Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:52.764183Z","title":"Kuffo, Elena Krippner, and Peter A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:52.764183Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:8e8e01d7ebe7d62662e3d82d4971ab7472e5cead448abec7fec96054e93af916","observation_id":"b2a30bb0-7f57-4b99-b43d-de8be10c33bc","resolution":{"observed_at":"2026-08-04T13:29:52.764183Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:52.941448Z","title":"u ttler, Mike Lewis, Wen-tau Yih, Tim Rockt \\","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:52.941448Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:05c3ae24a709bc1fa845ae8e7002a0ab6913c02e93867b7a0933f96db3d47dae","observation_id":"f4eb3c9f-398f-4dc9-a825-58f5c3b6f823","resolution":{"observed_at":"2026-08-04T13:29:52.941448Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:53.065336Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:53.065336Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:4f0804c2efda65431e6aefc7df0d9282dbb77a166263d8ee087f85094c853fcf","observation_id":"65697067-7110-4078-8054-e92ca5e5251e","resolution":{"observed_at":"2026-08-04T13:29:53.065336Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:53.218536Z","title":"Distinctive image features from scale-invariant keypoints","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:53.218536Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:c7e183705a69b8be6179367e7712c65bc545f92d7ce084f6940f912cf0781baa","observation_id":"b4ce3149-53ab-4aad-b5cf-06394d538a50","resolution":{"observed_at":"2026-08-04T13:29:53.218536Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:53.350979Z","title":"Multi-probe LSH : efficient indexing for high-dimensional similarity search","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:53.350979Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:c6117497fbe860293ad4dae870a346f4331a8adcad71a9920564627d24f59c01","observation_id":"bfb61460-954f-4e92-b255-3325b0ff86cd","resolution":{"observed_at":"2026-08-04T13:29:53.350979Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:53.464756Z","title":"Malkov and Dmitry A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:53.464756Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:6960150f634361c9c316dbb6f2687cf439b2282a4ce75427a7c940deff8839e5","observation_id":"42cf5c1d-95e1-4aff-854b-4329e933fcfb","resolution":{"observed_at":"2026-08-04T13:29:53.464756Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:53.649051Z","title":"A Wavelet Tour of Signal Processing","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:53.649051Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:203d39e44ef79bca022464c5db25b57add03c5e6554dd5f6f4cdb566356a30b9","observation_id":"0e06b43f-0e4a-4cb9-b147-c0eb96152b33","resolution":{"observed_at":"2026-08-04T13:29:53.649051Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:53.798468Z","title":"The tight constant in the dvoretzky–kiefer–wolfowitz inequality","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:53.798468Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:a28219380f0d3017a87a632cfcca034fb1a4bae56f43ee875aa0b6538b0d42a1","observation_id":"7de9a694-ce63-4688-9bf2-7f5aa594ad2b","resolution":{"observed_at":"2026-08-04T13:29:53.798468Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:53.912686Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:53.912686Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:4413a901a4d77416bd368672352c72326190241385a4c6fd287c0414e82749a6","observation_id":"f774f412-19de-443a-9f8a-3b671a31b7c5","resolution":{"observed_at":"2026-08-04T13:29:53.912686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.10005","last_updated":"2022-01-24T23:36:20Z","snapshot_observed_at":"2026-07-06T12:30:51.934079Z","submitted_at":"2022-01-24T23:36:20Z","title":"Text and Code Embeddings by Contrastive Pre-Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.10005","snapshot_observed_at":"2026-08-04T13:29:54.035989Z","title":"Text and code embeddings by contrastive pre-training, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:54.035989Z"},"links":{"cited_paper":"/paper/2201.10005","citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:d2db6a611da9eea207b2a2f5821bbea597b1023a51bb621f06eebd81802f2450","observation_id":"2a11b54e-21ca-4636-92e9-a24caecd6482","resolution":{"observed_at":"2026-08-04T13:29:54.035989Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:54.223825Z","title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:54.223825Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:91fd740b474b192e799be4f8b9b9057adc26665d5e475393721f2d4f26deb73d","observation_id":"24f6298a-b582-489c-a681-ca7f57f83174","resolution":{"observed_at":"2026-08-04T13:29:54.223825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11424-015-4071-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Smoothing non-stationary time series using the Discrete Cosine Transform","venue":"Journal of Systems Science and Complexity","work_id":"dd485261-b575-44c0-8691-41323e5736e3","year":2015},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:54.376665Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:6255e2c6cd290195f6f05382bd57a103ef3ecf75dcc88441a6036ce469555184","observation_id":"a2315a0e-f95b-4bc8-9649-eb1d41877e60","resolution":{"observed_at":"2026-08-04T13:34:08.894902Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-04T13:29:54.506708Z","title":"Dvoretzky–kiefer–wolfowitz inequality","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:54.506708Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:44d35e74204e2f19f221d5db295b97a3df0b93c91f2f2476e67f9886117b7de0","observation_id":"3102d352-940a-4813-a79d-daeff4576431","resolution":{"observed_at":"2026-08-04T13:29:54.506708Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:29:54.632420Z","title":"Effective and general distance computation for approximate nearest neighbor search","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors","version":4},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-04T13:29:54.632420Z"},"links":{"citing_paper":"/paper/2510.00566"},"observation_digest":"sha256:e8e3b2584cb66946ab7c3ae6a521a65810226efee97d6975f40b645103f65461","observation_id":"c5f08e8e-7f13-482c-9a6e-0733ecf276ef","resolution":{"observed_at":"2026-08-04T13:29:54.632420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.00566","last_updated":"2026-07-02T20:43:38Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T13:29:45.317549Z","submitted_at":"2025-10-01T06:38:45Z","title":"Panorama: Fast-Track Nearest Neighbors"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":48},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2510.00566."}