pith. machine review for the scientific record. sign in

Title resolution pending

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers · 2025 · arXiv 2509.06046

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
read on arXiv browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CR 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Onyx: Cost-Efficient Disk-Oblivious ANN Search

cs.CR · 2026-04-22 · unverdicted · novelty 6.0

Onyx inverts ANN-ORAM optimization priorities with a compact pruning representation and locality-aware shallow tree to deliver 1.7-9.9x lower cost and 2.3-12.3x lower latency for disk-oblivious ANN search.

citing papers explorer

Showing 1 of 1 citing paper.

  • Onyx: Cost-Efficient Disk-Oblivious ANN Search cs.CR · 2026-04-22 · unverdicted · none · ref 3

    Onyx inverts ANN-ORAM optimization priorities with a compact pruning representation and locality-aware shallow tree to deliver 1.7-9.9x lower cost and 2.3-12.3x lower latency for disk-oblivious ANN search.