Pith. sign in

Paper Citation Record · LEDGER

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

As of 16 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-15T06:32:42.880941+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:c1d940bc7585190344457af93dfae52a10275a304ac1adada47a8649106a8a82

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:3f22567626ecaad4670a950c6e846a292ca877be07a5646c5ece72c99b92c416

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:b5b50ec110fdf986cf90ebe601680b3496941a705930d540f45ea92ca7768ca7

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:2986a20ebfd999624cce3160525ff94629cfa2c01b29b138ca8e3d0bca99fd66

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-15T06:32:42.880941+00:00.

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

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:72e27695c83fbdf4f37209ec9b623f489a03b25f486d0fd023a2b1379d044d3a

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:bd6f9c80db2db2191557c0da076bad6ab962a3e66e863bef06377a9c981a1758

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:7dff00b4cb34794b7b2e763ac698ef7f465cdc98c87d85acba9e7ff2d7a74319

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:6a890eec3d27d8f78bc96b2510ca10b0e234aab071ab935dca6d37c44bc21cb2

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:0c57d6b20c94cac33bbc0256897c01925f9a427616990f30964557248f3f6bd4

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:08e828bd7d787453e02effdf15bb7643115eb2615ded3a3a776f1fb7bb518991

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:20c1ee60e1bdbd5c2b80d87c60662b24c5ce52421a8500eeb13fea33ec48b087

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:c28925f819ffd7df7cf9e17855018a351ee696beaad71fceaa4eabd86ab90b1f

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:8e214d23e39bbde7cabe5755dbacbafeeab1916127a6a5e24a986d898e6b0c4d

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:4af3573b199c4c7ce051ddbcb1b1645905916b4e9fe4ac57f5d256d7637b89a1

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:d3749f6bf00e8ff1f8363ecc4bd78cfc468cb4bfd136c2f020e9cf2ddaf80912

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:8e9ece5f4f8e52f484a1d012609b0eb48e2dfa63fff72fc7560c949b65f9e9fa

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:bd4ce25aba7ed6f437b5e8cd55e59be8669eb570e5439ac1746c6f8b7530a51e

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.154324Z digest=sha256:23fd2d7a230dc93789abf398791059dde956f246b9267fda26a095c770638a79

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.168317Z digest=sha256:699aa86d431443e393bcfbdd52a939df524baf02f7f2b96350ca5e706c96f138

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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:c3b669a964c51e077bffa0c7bd3ff276dbbc387daea99f0d536c5e16e10b2e53

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.206463Z digest=sha256:2283ee1df2eb7ee3a01351b427243d1dc36c1a9e97dea858270aa8f68ce3775a

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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:294b3dfd46fdf27fa24051f152404cd5538c13c7b933e0df8a77dd625c96f4a4

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.230966Z digest=sha256:3dc03632685f8a9d8264c95819cf4783306d38cea8b59d57bd6ea1e04f3355b4

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.239251Z digest=sha256:7cff56233daff8d56f62d325e9621129a6fa0b1feef1fdecbb8fccf63c7515c3

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:89c97379583052ee04f1ee27bb56cd8f91064a3bf7c5b59c1307b24d6a9d308f

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.245411Z digest=sha256:63d4eedfa310638e9348f6de9a0cb59406730769bf3586b5938ac4deaff83efd

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.251216Z digest=sha256:173849cb394ca4009364269f77e491203d57a9c1df7a95d4e7826de59c6eb907

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.254478Z digest=sha256:582b4c5415c5bb422d4c1c44dd3e466ad219927c004a3764df445bcbb1a0654b

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.263555Z digest=sha256:30d04feebeada198fa88ec2422310d3703888bb5ca0b3a7f36411ad89e1c6af1

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.266404Z digest=sha256:94659d80f5f54f0eddae5482fed72dd530ce8c64f71983f992c1178f84e5f964

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.271907Z digest=sha256:7049fc184ba694c7160fecf67c849dc8c3343f010d4295eb385df4d16954e9e2

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.277337Z digest=sha256:6dc293fd713732c6c4896fb984144fd176b0b92967c97f17d6792198a7529187

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.282539Z digest=sha256:3a16ed3c75cb7287f7b94cd80b0b29f2476bce1005b9df6b6fc03633cba9bd41

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.298516Z digest=sha256:4bc6011328dc3699a07e0aeff7f6a27c69cb16d6790c49806c6eca6532c3e403

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-15T06:32:42.880941+00:00.

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

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:5778bbf3ef5eefda4e818b7a2d9107f92ce90fe24001eed9546aaa58c55d4c03

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.311707Z digest=sha256:45c6c4c28addc5d2c4d831b5eef6d481bc9f2ea26e2cf9c5c545e312597eac24

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.317072Z digest=sha256:4354a5164d1338b07b781b0ae8cbcac76ed0d684cebcee5514747c659aa1e991

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.324797Z digest=sha256:9a72ca066416037da9b2c83b3c560214629f78a24a8ba04f9b70d106f4ff2f54

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.327654Z digest=sha256:1e2b87f95bf8b1484754530f3cf701e85d6fe51ae68320ea920fea1c75c593b8

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.340554Z digest=sha256:5baedf1428063eea2ede561d987029a9c40729d3c2728f941993bd904a814b7b

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:06336f38c6fe2f237a89461ff0ac2c94823d5e1f9c82fe835a1264a84233d073

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.353725Z digest=sha256:93a6bce013f2c6ea2fb192dd5710c4b469165b8dc7db9d74c2dcebb526717f1f

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.356629Z digest=sha256:48ab60e294ff19840c035d2c26aa39d3c5ded053d00cfe292e8f0cddbb3da750

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T05:11:48.362074Z digest=sha256:3cc3fb7221b128ee174f735d884dd111c4666bf1284477c6c53db3333129d077

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-15T06:32:42.880941+00:00.

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

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-15T06:32:42.880941+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.