Pith. sign in

Paper Citation Record · LEDGER

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search

As of 10 August 2026, this Paper Citation Record lists 97 of 97 outbound references and 0 inbound Pith citation observations for arXiv:2509.05750.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2509.05750 v1

Coverage vector

measured 97 of 97 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T05:11:48.367705Z

measured 97 of 97 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

97 of 97 outbound references displayed

  • verified exact2
  • verified fuzzy55
  • unresolved39
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 489e724e-3b75-4af9-adf6-92be63271731 · outbound

This paper cites write newline.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search write newline

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.090180Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.090180Z digest=sha256:dc47cf6f9a3bf7b0004edd3c0127dff389e67988c2ddcc2a4c6770abe060fd16

Observation 0dcc6648-f330-4695-8de5-81401933f663 · outbound

This paper cites https://github.com/nmslib/hnswlib, 2019.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search https://github.com/nmslib/hnswlib, 2019

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.094913Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.094913Z digest=sha256:378d5935c3dab759bbe0b9f36613cfed39559cf3c0d0ca8ac9ea0593a995c3d5

Observation 76b84346-5948-4223-bb8a-6bdb14ad3d40 · outbound

This paper cites https://github.com/scalablesimilaritysearch/ELPIS, 2022.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search https://github.com/scalablesimilaritysearch/ELPIS, 2022

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.098206Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.098206Z digest=sha256:656bdc8110f6942d64f0ed79230cabce068fc772c43e658df113d0578b41a29c

Observation e6ab047f-7221-4f99-899b-7bfe4cda5d28 · outbound

This paper cites https://github.com/iliasazizi/GVS, 2025.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search https://github.com/iliasazizi/GVS, 2025

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.101592Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.101592Z digest=sha256:7cc163e8124f5ee44d55a273112052829b8fd7823403fb06ea84a040a39375e2

Observation 8a02f68c-d7a6-4202-b3fa-5961f0a55ea8 · outbound

This paper cites and Ceccarello, M.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search and Ceccarello, M

Reference 5

Resolution
metadata mismatch
raw_fallback, observed 2026-08-05T05:11:48.647221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.105011Z digest=sha256:07a2cf4b8eb1c6218bec0f8eafa98ca3df3b0759331b750865f74cf34d1e898d

Observation 136f272f-9879-479b-a8cb-5aaf534e66b1 · outbound

This paper cites Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.108142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.108142Z digest=sha256:5234772edc68b285006ca74c40a63fbaddf83920b1ace13290156309806be1c2

Observation 6ac2eb21-e701-4373-b773-454c237cc7aa · outbound

This paper cites Voronoi diagrams and Delaunay triangulations.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Voronoi diagrams and Delaunay triangulations

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.111478Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.111478Z digest=sha256:32061446fcba1ee321622639693afac6fb02441f9cabc8dbcd4739ae0ee70436

Observation 797d7af7-ff63-4449-903f-82c57a0e1089 · outbound

This paper cites Elpis: Graph-based similarity search for scalable data science.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Elpis: Graph-based similarity search for scalable data science

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.114887Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.114887Z digest=sha256:c87e6d262b278816810e03124d471690e4f44debfb52ec9aa9a2f0c78857fe5b

Observation 8fcac87c-b202-4628-9e05-7901c1e1e833 · outbound

This paper cites Graph-based vector search: An experimental evaluation of the state-of-the-art.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Graph-based vector search: An experimental evaluation of the state-of-the-art

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.117722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.117722Z digest=sha256:6ceb27fa126bb8444c549686b69a64b15f79611fa55074dc4f0cacdc94d9b314

Observation bf559b2f-0833-4599-94ef-8c04529d676f · outbound

This paper cites and Lempitsky, V.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search and Lempitsky, V

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.121223Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.121223Z digest=sha256:b9441c67c384388d56a4f024ef25d6a3be6c0771774be6547534d6364080ee41

Observation 7c23ce53-226c-487b-b92e-cc8d3d8a776d · outbound

This paper cites and Babenko, A.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search and Babenko, A

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.124884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.124884Z digest=sha256:8228ea580deb900677eddcdd987275eaed732cc237cc2f97ac2bccc265e846be

Observation b2783a54-669c-41d7-8c20-9ac1f9a5b8c0 · outbound

This paper cites Voronet: A scalable object network based on voronoi tessellations.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Voronet: A scalable object network based on voronoi tessellations

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.128167Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.128167Z digest=sha256:6615f88a4dce2312e96cb0ad3cbf43cbf9c6070913ec6aee1bbf8528b47042d8

Observation 30730836-fb18-4ffa-9cb7-25723880786d · outbound

This paper cites Peer to peer multidimensional overlays: Approximating complex structures.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Peer to peer multidimensional overlays: Approximating complex structures

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.131038Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.131038Z digest=sha256:d32e38cd58545073a90c38951e75e263abf56b80b1f7b92f2603419a4cee6f60

Observation 5c23ea12-0ea2-495c-b350-fcd5e2b1fb58 · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.134341Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.134341Z digest=sha256:173835b6229af6d85327243dc49b497cabbe62465abfea6c0c4bb7bededd7da0

Observation 0f1943bf-f9a8-4d07-baf9-87eb177a809f · outbound

This paper cites Retrieval-augmented diffusion models.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Retrieval-augmented diffusion models

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.137252Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.137252Z digest=sha256:4561bbe51e99209769fc83604ef97e12d30b3fe086b3b584fedcbd553951c63b

Observation 896065f3-90ea-4a8b-a279-6beb9805a389 · outbound

This paper cites and Palpanas, T.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search and Palpanas, T

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.140047Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.140047Z digest=sha256:4544a6f4812b0369c89d4108bd09ce54538f885ce4c125391aea0cad10879bc8

Observation 63c23abd-a200-4011-b1b2-c0180da0778f · outbound

This paper cites and von Luxburg, U.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search and von Luxburg, U

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.142867Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.142867Z digest=sha256:df41413aa306e8a5b9fc31377a316ced56e0475bf6741c8a242b25b1f2dfd84a

Observation 3c500319-739d-4f06-b1f0-f3c18deaadf4 · outbound

This paper cites Beyond One Billion Time Series: Indexing and Mining Very Large Time Series Collections With i SAX2+.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Beyond One Billion Time Series: Indexing and Mining Very Large Time Series Collections With i SAX2+

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.145823Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.145823Z digest=sha256:808855ce0f4860eb83f27d0fd04324b0e9739d38fda491e5d2c3921c8191404a

Observation a55f49ca-722c-46aa-9217-565c1b13e2cd · outbound

This paper cites SPTAG: A library for fast approximate nearest neighbor search, 2018.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search SPTAG: A library for fast approximate nearest neighbor search, 2018

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.345158Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.148842Z digest=sha256:1afc164245b07b26cfb6dc54ba2ff724d1efe16155e420c1e05862c8080f827f

Observation 9adcc500-9408-42ee-a5bb-4ef76ccb97ac · outbound

This paper cites Efficient and reliable vector similarity search using asymmetric encoding with nand-flash for many-class few-shot learning.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Efficient and reliable vector similarity search using asymmetric encoding with nand-flash for many-class few-shot learning

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.336817Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.151573Z digest=sha256:bd023fa9fbb56549f4408910c0c2d2f4b50d055ca2fa02f73c7bfce88b7c1404

Observation 320f1776-945f-4e90-9c4f-58fd02ad7511 · outbound

This paper cites An overview of end-to-end entity resolution for big data.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search An overview of end-to-end entity resolution for big data

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.327321Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.154324Z digest=sha256:826a4396e64062d9c6805709206b9a7584b58acbb16fdcc39dd3b4f997f6c2ce

Observation 977dfee4-2b98-4a3d-bcab-0286582ccbec · outbound

This paper cites Diskann: Fast approximate nearest neighbor search on disk.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Diskann: Fast approximate nearest neighbor search on disk

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.319591Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.157102Z digest=sha256:f7e57c2d34563d51915d03eb2a2a4bfd6d62209da3131aa9a5201a47b3d89295

Observation 812a9b00-5f06-470e-8e72-be445722ca4d · outbound

This paper cites and Freund, Y.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search and Freund, Y

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.311504Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.159768Z digest=sha256:48b8a50f2a0b9b92f62c4e0d755c10fcd1e57698c7cf115b9f405d0badae9563

Observation 4ba79b55-efa4-4e69-9a0c-96f1fa8396d3 · outbound

This paper cites Nns benchmark: Evaluating approximate nearest neighbor search algorithms in high dimensional euclidean space - dpg algorithm.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Nns benchmark: Evaluating approximate nearest neighbor search algorithms in high dimensional euclidean space - dpg algorithm

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.302904Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.162513Z digest=sha256:043ea116417874ba188991242054a134d3a4a7accbd0b0aa2095b63e1e1a7717

Observation d00291d1-7706-44ed-a87d-fb98be4b0893 · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 25

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:49.294490Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.165446Z digest=sha256:66283557de34cf58f06ae66f9415533bdfa0d409d72edfc559106213f45502ec

Observation e3dd7d73-051c-4b2d-986c-d82b80242400 · outbound

This paper cites P., Friedman, S.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search P., Friedman, S

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.286306Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.168317Z digest=sha256:2e8e9cc94d7a74b8fdeffad3acc20b516210c2e3cb67d26b9084896ea214ccf1

Observation 29e8cad5-524e-4ffa-a26e-c243cf720820 · outbound

This paper cites Kgraph, an open source library for k-nn graph construction and nearest neighbor search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Kgraph, an open source library for k-nn graph construction and nearest neighbor search

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.277757Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.171180Z digest=sha256:0132694defece2eaa3d7a206cdb2689d62f44bf7d4c1e633cdfbc21ed133e5bd

Observation 8c24b7b8-2a81-49d0-9bc4-b1816e28de1a · outbound

This paper cites Efficient k-nearest neighbor graph construction for generic similarity measures.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Efficient k-nearest neighbor graph construction for generic similarity measures

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.268976Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.173889Z digest=sha256:b997c85af094c0be28b5c045f48829792709a6696ded43ac6e49196f18e1bdd5

Observation dbd64748-6e9f-4273-b22b-207f9b10acc0 · outbound

This paper cites Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.260461Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.176539Z digest=sha256:c0bc37d2367d35eeb0e492bd61d8beb0e68117daaf856d50f177b551d3c60f2f

Observation 6dcde396-ed07-4b36-9828-4b8630013468 · outbound

This paper cites High-dimensional similarity search for scalable data science.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search High-dimensional similarity search for scalable data science

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.251843Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.179095Z digest=sha256:3a9deb3199bca601bcbab6e147f95f031d5b450ecc28431405be3e9d66d573c3

Observation 12fecd9f-31d2-4369-a9bd-67e9b954f564 · outbound

This paper cites Hercules Against Data Series Similarity Search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Hercules Against Data Series Similarity Search

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.243084Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.181805Z digest=sha256:f0e3fd866e02369e40682f80837b5467d571a7ea8bf582a9752907cc38f9e3c2

Observation 1d22bf59-51ee-4363-bd6d-c279dba0bb76 · outbound

This paper cites Algorithms in Combinatorial Geometry.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Algorithms in Combinatorial Geometry

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.234441Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.184540Z digest=sha256:a8674e29a18311691dc5cf2f81b4db1e741d6cfb904b1292cbba9292a4e9bead

Observation 49e1ac64-8995-496d-be53-0d54c87e84ba · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 33

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:49.226097Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.187270Z digest=sha256:19c6c3d41304e5ec6f9d835d62467c338bd4a989cb0398c66858001cb1af62b5

Observation 3a2da735-7b8c-4527-97bd-dbb1afedadb2 · outbound

This paper cites Vector approximation based indexing for non-uniform high dimensional data sets.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Vector approximation based indexing for non-uniform high dimensional data sets

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.217084Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.190112Z digest=sha256:fa0f3c4f7adb0a1470e471bdbfea787eb8f8e4110311f006153d7a9c6ea3fb6a

Observation e82857ad-becf-4b11-99f9-bcf120d8827b · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 35

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:49.208432Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.192787Z digest=sha256:b21f01fe7a1358937ad8182edf629fa7a12fc45b5e194ab531f970c097812074

Observation e36b8795-0c74-4e1c-a0d4-61c6a9dd65dc · outbound

This paper cites Voronoi diagrams and delaunay triangulations.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Voronoi diagrams and delaunay triangulations

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.199748Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.195480Z digest=sha256:ac346a472ac3c2836928c7cd4ca85896d024d14502fec93fe753283290628c47

Observation 975c73cd-094c-4ffb-aba9-4b5dc07218b5 · outbound

This paper cites EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.198060Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.198060Z digest=sha256:3f3f8441e97c4e89cd92ff04dd74ae2ecb731c36c235c5d2e25fc9ca4c077ab8

Observation b984f8eb-5d25-4551-88b4-95f347bce80c · outbound

This paper cites Fast approximate nearest neighbor search with the navigating spreading-out graph.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Fast approximate nearest neighbor search with the navigating spreading-out graph

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.189772Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.201150Z digest=sha256:2b51fb7b259f3e6e8664183ff9325524933de1d53f7d4011798bb0fa6e70f641

Observation ef7e4ce4-632b-4bfe-8d6d-646f7c383b29 · outbound

This paper cites High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.180639Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.203737Z digest=sha256:0cc6c485111cecfc6f7c1fc11676e3c65b0b413c2859858488b7ad4b1dead80a

Observation 544cf87f-c77c-485a-b9a3-716a6fe2c66f · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 40

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:49.171238Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.206463Z digest=sha256:646c710e0254f97785fa66a4472bd6434ceb83ee4dc22315bea60cae8f5812ee

Observation 5dd7269c-d5f6-4559-a8c8-f5f4797c24e6 · outbound

This paper cites Similarity search in high dimensions via hashing.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Similarity search in high dimensions via hashing

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.161502Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.209890Z digest=sha256:f98cad0e0e3d3041fc93677e3b9193196483da31f08b8843aa00f25056ca4a20

Observation c7c44222-f5b1-4a4d-b883-0c1469bff251 · outbound

This paper cites Data Series Progressive Similarity Search with Probabilistic Quality Guarantees.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Data Series Progressive Similarity Search with Probabilistic Quality Guarantees

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.151995Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.212902Z digest=sha256:c557add9bf3e0894c3f52fa3e2d9bfae210ed238ae036d0e345ce2791c0fd117

Observation 42e51b16-8b21-4cf8-be55-576dfc79840c · outbound

This paper cites On the Difficulty of Nearest Neighbor Search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search On the Difficulty of Nearest Neighbor Search

Reference 43

Resolution
verified exact
local_arxiv, observed 2026-08-05T05:11:48.554087Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.215810Z digest=sha256:f5086e2c18cee7378cbd9984e2f7d5b90abb4c2fbb4730010ecf235cfba805c3

Observation de9b0511-cbba-4f27-91ec-d131968e75b3 · outbound

This paper cites Deep residual learning for image recognition.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Deep residual learning for image recognition

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.218998Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.218998Z digest=sha256:3b576a48efb4060fd8116aa85bab58571710294f35188f6b233218ad77e8b8fd

Observation 50090947-b2c6-4965-b740-a74447a8c2c9 · outbound

This paper cites Bore: Energy-efficient banded vector similarity search with optimized range encoding for memory-augmented neural network.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Bore: Energy-efficient banded vector similarity search with optimized range encoding for memory-augmented neural network

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.136998Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.222125Z digest=sha256:5c08b247e450518e0a32c63d6f3532aa8f8f63adf8ac29c7e2895492d7ee399a

Observation 3f4d7e01-b972-44b2-9352-1258122f3845 · outbound

This paper cites Pruned bi-directed k-nearest neighbor graph for proximity search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Pruned bi-directed k-nearest neighbor graph for proximity search

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.128130Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.225192Z digest=sha256:fccc072a2532704b491a17112e42da01120f436df69d886c59a8516d98bdd4b4

Observation b4ab816a-d203-44e3-935f-9a3e9ef3ce39 · outbound

This paper cites Product quantization for nearest neighbor search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Product quantization for nearest neighbor search

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.119586Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.228103Z digest=sha256:cc599830df8115c54ab1c9c21bc7e99c0eb66a0001f598da9949ffeabe34dac0

Observation 433a9caf-5b59-4394-81d8-d283ecb19a6d · outbound

This paper cites Fast and accurate hashing via iterative nearest neighbors expansion.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Fast and accurate hashing via iterative nearest neighbors expansion

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.111275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.230966Z digest=sha256:75fc705d2c2e2257349d8fe9ba643c34753c6f95ec3f21cf06ab8e3aa3033c27

Observation e5a6d238-4b0f-41bb-bb10-333c982c3380 · outbound

This paper cites Billion-scale similarity search with GPUs.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Billion-scale similarity search with GPUs

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.103085Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.233797Z digest=sha256:ccaa0c25d4db624c6a8b5df0ab1d8ed85fd3ab764d0c329a535725b5b887a107

Observation f9ae7f90-08a2-4b2d-ab5a-818b6082a3e6 · outbound

This paper cites Local interpretation of nonlinear regression model with k-nearest neighbors.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Local interpretation of nonlinear regression model with k-nearest neighbors

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.094508Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.239251Z digest=sha256:8e76b36f6a64dc2f27cc823959b16bc835fa93b268baacf8868c9280fa9976a5

Observation c616611c-5596-42ef-bab1-4d243ae01d7c · outbound

This paper cites Dense Passage Retrieval for Open-Domain Question Answering.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Dense Passage Retrieval for Open-Domain Question Answering

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.242133Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.242133Z digest=sha256:dbdcaf4a82b80dfbfd8e91e3e394896f12071dfbcd9c82e4a37cdaba4f852f16

Observation 56c304c8-fe65-4907-9666-d74375b9b567 · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 52

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:49.085893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.245411Z digest=sha256:7d606cf4ee47efe2d51e85f39eaa9f1ab660ce9536a6e9a29eaf78c3ca27e542

Observation edb0f4a8-419d-48c1-a517-98e93ae98860 · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 53

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:49.077263Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.248291Z digest=sha256:ebad83cc4693539a2f689057692d79033f6faef2bb7d346ab0cbea77f955daec

Observation 8bd410b1-a511-45f7-97eb-94eda147571e · outbound

This paper cites Approximate nearest neighbor search on high dimensional data: experiments, analyses, and improvement.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Approximate nearest neighbor search on high dimensional data: experiments, analyses, and improvement

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.069056Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.251216Z digest=sha256:8a9edc41e65b337c0d0653ec820e19245909ccafe49fe88be1d6d8b2390393ae

Observation a3271559-695d-4b0d-a2d4-8cb44690246e · outbound

This paper cites Hvs: Hierarchical graph structure based on voronoi diagrams for solving approximate nearest neighbor search, 2023.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Hvs: Hierarchical graph structure based on voronoi diagrams for solving approximate nearest neighbor search, 2023

Reference 55

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.060168Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.254478Z digest=sha256:2a0eec5ce6ebd957f779faf95d4cc0c34c155231a9ac014372828355cee0afce

Observation beb1deac-4fd6-4f3f-a2e7-2618b3cbaf2d · outbound

This paper cites Hvs: hierarchical graph structure based on voronoi diagrams for solving approximate nearest neighbor search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Hvs: hierarchical graph structure based on voronoi diagrams for solving approximate nearest neighbor search

Reference 56

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.051533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.257625Z digest=sha256:f6fa1bc77f94d1bccf4d26ffc5c13368e97816a58007fdfa6719555e312d0d1d

Observation 732eefc3-ee81-46b6-9f85-1e375548d268 · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 57

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:49.043158Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.260567Z digest=sha256:4b5d5800b8595871ec2959c5a371ae7dba28a15a4be423dff72d32d3bf87ea73

Observation 331fbbb8-07c4-46dd-8bdb-208dd959faf6 · outbound

This paper cites Approximate nearest neighbor algorithm based on navigable small world graphs.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Approximate nearest neighbor algorithm based on navigable small world graphs

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.035109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.263555Z digest=sha256:56281f16b28a90d9cf727b363b837bd1583043715916c0aee388d27656d36c13

Observation f084ab35-47b6-41d3-9557-a0dfd3fd9fda · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 59

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:49.026038Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.266404Z digest=sha256:24738c63e76890912c2f10d4bfb1e3816e11a7892cb5e0b74f4b2da532fe1d60

Observation 029f3b90-ffc6-43fe-9a92-081f95a7c3dc · outbound

This paper cites D., Shen, Z., Blelloch, G., Dhulipala, L., Gu, Y., Simhadri, H.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search D., Shen, Z., Blelloch, G., Dhulipala, L., Gu, Y., Simhadri, H

Reference 60

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.017650Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.269181Z digest=sha256:8607fdf622fc4bbd2b362972bae22d7cd104fd714939cf30f41f8f77795acf4f

Observation 747992db-cab9-410d-b475-ed5f91922a4c · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 61

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:49.009108Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.271907Z digest=sha256:853215fddbee41125810baba17fc403d733446736331f7ee4b53c650908b16db

Observation 642dce91-8db0-47c5-9254-9a7852f1e5cf · outbound

This paper cites and Babenko, A.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search and Babenko, A

Reference 62

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:49.000337Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.274671Z digest=sha256:d10cc7b1b178824b178211f1548cdeef7eeb96ea196c54154fdd6bc88b966f98

Observation 2db99cec-9116-4dba-9a24-33a250ccd5f7 · outbound

This paper cites V., Gon c alves, M.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search V., Gon c alves, M

Reference 63

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.992140Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.277337Z digest=sha256:74abd7e588e055ca4660ef6995059e2877ac46a1195acec2275039daabe69d0a

Observation 4eb256dc-8daf-425a-9b04-3744077ae647 · outbound

This paper cites and Torralba, A.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search and Torralba, A

Reference 64

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.983592Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.279950Z digest=sha256:cf99e0adfa184b4faee233e9deac84b86b8977f28ec7f97d6aa2fdc20115e1f7

Observation 72a02a74-70f7-410c-929d-d5b527ef9121 · outbound

This paper cites Data series management: The road to big sequence analytics.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Data series management: The road to big sequence analytics

Reference 65

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.975054Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.282539Z digest=sha256:91b389890e2dd16275cb711edc70b87140665cdedfdfb6d305efe627c3c3211f

Observation a42072a9-73c2-4bc1-aa2b-cf08d7bfd63d · outbound

This paper cites and Beckmann, V.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search and Beckmann, V

Reference 66

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.966606Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.285422Z digest=sha256:e900de417b5f1e13079601f12da5bbabe5cdda7c6ed2ac58b471cb66b50c303b

Observation 8f0fc347-93a4-436e-860f-a101840f55ad · outbound

This paper cites I., Nicholson, A.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search I., Nicholson, A

Reference 67

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.958306Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.288015Z digest=sha256:af4f0210d3a355e0a0a47bb5c81e2e571d6a2aebef206fde05859aa55d245f36

Observation b3e88420-1757-48ff-ab4a-0396924c79cb · outbound

This paper cites Approximate nearest neighbor search small world approach.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Approximate nearest neighbor search small world approach

Reference 68

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.949628Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.290668Z digest=sha256:246cefd2149df147393a86d47ef2a9ba139d1c050259af2fee104a4760863709

Observation d89fe499-8060-4ad2-a3e2-e6dec2cb0e48 · outbound

This paper cites Skip lists: a probabilistic alternative to balanced trees.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Skip lists: a probabilistic alternative to balanced trees

Reference 69

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.939879Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.293257Z digest=sha256:c12ea7a3f8635fe99399abcf4b383c4c34154bc4c58f8a41c9fe1da6068771a7

Observation e4fb21aa-515b-447e-aa3c-0f4f15f3fc78 · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 70

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:48.931039Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.296043Z digest=sha256:6f929ccf6319d40220c46176eb46220011776e62052d8b0feaaf5264c747dc61

Observation 69101b01-4514-4c45-9a2e-9b0bf3996483 · outbound

This paper cites Imagenet large scale visual recognition challenge.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Imagenet large scale visual recognition challenge

Reference 71

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.922350Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.298516Z digest=sha256:2ded77a6e45314f50bb441f7a1772f5b86aa76ae1361bc7ab8a2f592b0d82383

Observation d680723a-94e6-4a08-914b-16e36ad39a48 · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 72

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:48.913472Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.300877Z digest=sha256:20f759053a05998f6abcff82bfc26a737c7961f4f10c43d6b66d3f8365c811a1

Observation 405b0bb1-fd75-4182-ba18-aba25ba4e061 · outbound

This paper cites Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search

Reference 73

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.303480Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.303480Z digest=sha256:9d7abbc85cf54ea99f7caa45414e19511b5541a7cc2aaca8a56fe1aa7c2482d9

Observation 72fbcd82-a115-4d4b-8398-097944045ae5 · outbound

This paper cites Deep billion-scale indexing.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Deep billion-scale indexing

Reference 74

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.904498Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.306677Z digest=sha256:d967d24fe7095b83958a458b8473eb9aa5818c762d14568b29ec51b297e129ff

Observation a27fccf7-9819-444f-ba82-6ee8c932627f · outbound

This paper cites Large-scale training system for 100-million classification at alibaba.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Large-scale training system for 100-million classification at alibaba

Reference 75

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.895154Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.309246Z digest=sha256:44bf4fa542169b22749d2560af2d8c206af54798213b1b6538317d5b309c9416

Observation 5f884e51-5018-4ec4-8259-39cd80713efc · outbound

This paper cites J., Kadekodi, R., Krishaswamy, R., and Simhadri, H.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search J., Kadekodi, R., Krishaswamy, R., and Simhadri, H

Reference 76

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.886360Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.311707Z digest=sha256:17f6428a846d20fb24149d7c7b932f9ab915be04230811c2e1310f2a92db148e

Observation e0c35b2b-3950-4fc2-a75f-673f0231768b · outbound

This paper cites On approximately searching for similar word embeddings.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search On approximately searching for similar word embeddings

Reference 77

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.877649Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.314457Z digest=sha256:bfc3275cdf3ae55fc1bfd8ef3b8d1323ff71de9c82879156632c02598e0e201f

Observation ae0db2ee-b804-4412-bc5c-b0f5c7ef10ef · outbound

This paper cites SRS: Solving c-approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search SRS: Solving c-approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index

Reference 78

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.867980Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.317072Z digest=sha256:1958e0ab919bd30865093ccfa2a63426d755ed8bbbfe53c416ab6471e1ee4923

Observation 00aac86e-a6fa-4d4e-9288-ea5fa33ebf1b · outbound

This paper cites SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index

Reference 79

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.858438Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.319730Z digest=sha256:a8f54f9a9cfe3d47b5e6cfb5a3e430f3b60b8484a9a44938eb05e92c8cd44703

Observation 500de555-54a4-49bb-8cff-e23b1a331b3d · outbound

This paper cites Quality and efficiency in high dimensional nearest neighbor search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Quality and efficiency in high dimensional nearest neighbor search

Reference 80

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.848006Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.322226Z digest=sha256:7d45864a9856d562418cad7b7eca8af275f16fcc24dd2ea40db780693f32af08

Observation 70ea708b-75ce-4f46-b820-1213fc401126 · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 81

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:48.837131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.324797Z digest=sha256:983371b22529fc37f40db1cec2b38ce99fce8009bac3d09615c7be6d8103cd29

Observation dcf8736d-9008-42ed-b3ae-d3570e4bfe9d · outbound

This paper cites Datasets for approximate nearest neighbor search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Datasets for approximate nearest neighbor search

Reference 82

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.825768Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.327654Z digest=sha256:0c7b93bcf6fd701888974494d9836d7d5a07c4279f423e85447b1c552fe65f71

Observation e3ce1ad2-759c-4971-8077-ee902128b7d1 · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 83

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:48.814525Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.330216Z digest=sha256:c63276e07faa081be0052c432cbeccc227d1aee1650eb7492277a1ae00f2c282

Observation 9e697609-58f5-4248-9ece-e5fa8177e75f · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 84

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:48.801522Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.332794Z digest=sha256:59e3db203d81656c82c8d0d5f3fbb3b833e6884a471e58dd3faba0d17382750e

Observation 7b5a2f40-e0fa-4d87-89b4-05215d5bba91 · outbound

This paper cites Southwest University Adult Lifespan Dataset (SALD).

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Southwest University Adult Lifespan Dataset (SALD)

Reference 85

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.790611Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.335405Z digest=sha256:f74aae78792eab5daf28149407e2dcd0f9332c79268e6b10cc4c00daf590395c

Observation 1590598a-9839-4531-ba5d-4895a75e807e · outbound

This paper cites Trinary-projection trees for approximate nearest neighbor search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Trinary-projection trees for approximate nearest neighbor search

Reference 86

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.777802Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.337982Z digest=sha256:f73b1f73ac0592fd9df1fb2c894f3ebdaf1c02287a13faba55da644ad9070d63

Observation 978e7a8a-24ed-4d8a-b8fd-2c5c2eab039c · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 87

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:48.766228Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.340554Z digest=sha256:240d53de0456a480add472ff980284cf97edf29ac2acc1a5cb16daa2599bb8ea

Observation 9717fc9b-0c83-43d7-b932-c5374c06ef32 · outbound

This paper cites A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search

Reference 88

Resolution
unresolved
no resolver link, observed 2026-08-05T05:11:48.343212Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:11:48.343212Z digest=sha256:7981f34b516d3f72b3c04c1abdd9b8df6805629b3353439238f8dc1654e34234

Observation a0d42631-b070-4123-9eb9-fa2f5c371dab · outbound

This paper cites LeaFi: Data Series Indexes on Steroids with Learned Filters.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search LeaFi: Data Series Indexes on Steroids with Learned Filters

Reference 89

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.754139Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.345730Z digest=sha256:eb1db592b25665a7c53dc03da5b5c4ccc37f0cd4d5ecdf0b7504451e04f71fec

Observation 1ee0ae0f-3dfa-4812-bc79-052a9c2c935c · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 90

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:48.741389Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.348491Z digest=sha256:a3885fbbad38f54f39b535014f61590cf4d55bc3b642e806f87da0c142d6ded3

Observation 2da78a69-1e28-409c-8e1f-8b3e3c2f5ca2 · outbound

This paper cites A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

Reference 91

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.729949Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.350958Z digest=sha256:a2a0be873b413ce5c7d2900fc478a4e45b57dd0214d4c80da3698c5010d0bbf3

Observation 508bf351-fe19-4b05-9a76-f80a9d0f6817 · outbound

This paper cites C., and Giles , C.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search C., and Giles , C

Reference 92

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.718025Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.353725Z digest=sha256:27de8aed184a838abeccf68049fd05688adabb7a89bcbed05080465824a40797

Observation 2895d734-c2dc-4062-a2f2-ec4d56050313 · outbound

This paper cites Ngt: Neighborhood graph and tree for high-dimensional data.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Ngt: Neighborhood graph and tree for high-dimensional data

Reference 93

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.701437Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.356629Z digest=sha256:7f7aa71d685b91607c1e9f3b55414e456818fe34209917c3c85bc405feb7d4da

Observation c58b239a-b135-4d5c-bd3f-6b69641ad7fc · outbound

This paper cites an unresolved cited work.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Unresolved cited work

Reference 94

Resolution
unresolved
raw_fallback, observed 2026-08-05T05:11:48.689154Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.359304Z digest=sha256:f5eb0844c95ba9938fbad30c840578db8bfa521e1c957e50b7a5d14f7c6dbed1

Observation 36c48279-3b51-4d10-8307-4795970f9531 · outbound

This paper cites Fast knn graph construction with locality sensitive hashing.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Fast knn graph construction with locality sensitive hashing

Reference 95

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.676374Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.362074Z digest=sha256:029fdc221812b095652ca44c20123078659579d1e6dd37a5991d8896c9967daf

Observation 993326f6-455b-485b-814a-b65beab8b36b · outbound

This paper cites Towards efficient index construction and approximate nearest neighbor search in high-dimensional spaces.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Towards efficient index construction and approximate nearest neighbor search in high-dimensional spaces

Reference 96

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T05:11:48.660657Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.364790Z digest=sha256:3e81e72ec6ae0bed47f743339c77a7839eeb8469ffcfa35fd6839ba4ec52a8e3

Observation 038fa31d-3787-4258-8d0f-01693586e3fc · outbound

This paper cites Generating data series query workloads.

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search Generating data series query workloads

Reference 97

Resolution
verified exact
doi, observed 2026-08-05T05:11:48.399476Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.367705Z digest=sha256:b0e818489b0133773edc217a05818c25083e98479dc89429fd3b2487de429c96

Pith citing papers

No inbound Pith citation observations are available.