Paper Citation Record · LEDGER

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers

As of 24 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 2 inbound Pith citation observations for arXiv:2509.06046.

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

pith.paper-citation-record.v1
2509.06046 v1

Coverage vector

measured 24 of 24 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T04:38:34.676450Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-05-19T22:11:08.273883Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-19T22:12:50.673092Z

Reference resolution

24 of 24 outbound references displayed

verified exact0
verified fuzzy15
unresolved9
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e2b7f569-beb3-406d-999e-3214a7875c39 · outbound

This paper cites write newline.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers write newline

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-05T04:38:31.937768Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00f98d1a-cb32-46e2-ad5d-4b62a5e1fc9e · outbound

This paper cites and Indyk, P.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers and Indyk, P

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:38.860109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 60826c42-d94c-4fc5-84f2-2cf9aa1cd103 · outbound

This paper cites ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-05T04:38:32.120149Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e488598f-63a1-4d83-81f3-e89e5a316da9 · outbound

This paper cites and Lempitsky, V.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers and Lempitsky, V

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:38.626420Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 8cfd66dd-193d-454a-bd19-3dc4dd724693 · outbound

This paper cites Big-ann benchmarks: Neurips 2023.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Big-ann benchmarks: Neurips 2023

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:38.383083Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation d1ff0965-0418-4206-8586-fd77a3a79a80 · outbound

This paper cites and Barroso, L.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers and Barroso, L

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:38.116961Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation e67ad181-215f-440a-a3d3-8b786393b87c · outbound

This paper cites Dynamo: Amazon's highly available key-value store.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Dynamo: Amazon's highly available key-value store

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:37.868978Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation ff92dc10-3237-4448-8a60-429b11d6d740 · outbound

This paper cites P., and Wagner, T.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers P., and Wagner, T

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:37.545844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation a31e952f-0afc-458a-aa01-d1ffd8a22334 · outbound

This paper cites and Long, C.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers and Long, C

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:37.308299Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 5a311658-04aa-465a-ad28-0a95b140db5d · outbound

This paper cites Optimized product quantization.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Optimized product quantization

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-05T04:38:32.956795Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dcbdb107-3cbb-4818-86de-e85426951a7a · outbound

This paper cites Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-05T04:38:33.076265Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f30b96a9-ebad-4e52-a2a0-e61d1ea3356e · outbound

This paper cites CXL-ANNS : Software-Hardware collaborative memory disaggregation and computation for Billion-Scale approximate nearest neighbor search.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers CXL-ANNS : Software-Hardware collaborative memory disaggregation and computation for Billion-Scale approximate nearest neighbor search

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:37.077851Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 6a4cfb1b-de3e-465e-a60a-c2e1aa69ca50 · outbound

This paper cites Product quantization for nearest neighbor search.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Product quantization for nearest neighbor search

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:36.834239Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 38c231a9-3352-433a-b997-f1ebafa1f9cc · outbound

This paper cites Billion-scale similarity search with gpus.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Billion-scale similarity search with gpus

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:36.592366Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation ab8f11f4-3d6d-4cd9-972b-84e4316acef8 · outbound

This paper cites BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-05T04:38:33.558372Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bd97bfd-81da-4919-abbf-4344b3f7f001 · outbound

This paper cites u ttler, H., Lewis, M., Yih, W.-t., Rockt \.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers u ttler, H., Lewis, M., Yih, W.-t., Rockt \

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:36.376864Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 8a9dce86-9db2-439d-a21b-e5de2f3fe17f · outbound

This paper cites an unresolved cited work.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Unresolved cited work

Reference 17

Resolution: unresolved; raw_fallback, observed 2026-08-05T04:38:36.173516Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation a4d5b317-ba92-4f6b-b87b-e20f75b6f5f2 · outbound

This paper cites Cagra: Highly parallel graph construction and approximate nearest neighbor search for gpus.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Cagra: Highly parallel graph construction and approximate nearest neighbor search for gpus

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:35.969737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation f40f7036-a1a6-4d7f-8ede-03971411cc17 · outbound

This paper cites Lm-diskann: Low memory footprint in disk-native dynamic graph-based ann indexing.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Lm-diskann: Low memory footprint in disk-native dynamic graph-based ann indexing

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:35.773683Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 01f363a3-cee0-46f4-bcd5-dc125a61e3d2 · outbound

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

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers J., Devvrit, Kadekodi, R., Krishaswamy, R., and Simhadri, H

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:35.538741Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation b2bedc99-5cc4-4e43-9ef2-d2776599c4c9 · outbound

This paper cites AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-05T04:38:34.393729Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 223a456c-566f-4aef-be62-18e082373b94 · outbound

This paper cites an unresolved cited work.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Unresolved cited work

Reference 22

Resolution: unresolved; raw_fallback, observed 2026-08-05T04:38:35.382394Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 69f4b813-17a6-4df8-a0fd-7c16b60ff276 · outbound

This paper cites an unresolved cited work.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Unresolved cited work

Reference 23

Resolution: unresolved; raw_fallback, observed 2026-08-05T04:38:35.144511Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation dd5545bf-6d1f-483a-8c5b-354334f5e1ca · outbound

This paper cites Song: Approximate nearest neighbor search on gpu.

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers Song: Approximate nearest neighbor search on gpu

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T04:38:34.952429Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Pith citing papers

Observation 6a198959-4c3f-4293-93eb-3ea0da29df0c · inbound

Onyx: Cost-Efficient Disk-Oblivious ANN Search cites this paper.

Onyx: Cost-Efficient Disk-Oblivious ANN Search DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers

Reference 3

Resolution: verified exact; arxiv_id, observed 2026-05-10T00:24:46.871126Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 5759dc13-77a2-4bf3-8a39-87bd815d9add · inbound

Ascend-RaBitQ: Heterogeneous NPU-CPU Acceleration of Billion-Scale Similarity Search with 1-bit Quantization cites this paper.

Ascend-RaBitQ: Heterogeneous NPU-CPU Acceleration of Billion-Scale Similarity Search with 1-bit Quantization DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers

Reference 1

Resolution: verified exact; arxiv_id, observed 2026-05-19T22:12:50.676586Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.