Pith. sign in

Paper Citation Record · LEDGER

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search

As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2403.01797.

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

pith.paper-citation-record.v1
2403.01797 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T14:49:55.586866Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-17T00:01:22.779631Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 2c4aee9a-7394-4ebe-b193-69d9c934dc70 · inbound

SHINE: A Scalable HNSW Index in Disaggregated Memory cites this paper.

SHINE: A Scalable HNSW Index in Disaggregated Memory Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-06T14:49:55.586866Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T14:49:55.586866Z digest=sha256:1402bbe3db827fa7710e29b45c214096459367ad82050640a323aed06665ded2

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

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers cites this paper.

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.

source=arxiv_source observed=2026-08-05T04:38:33.076265Z digest=sha256:cfba6c1909c31893247cdc197295273c87639c828f408ccbf21e71f641b0d68a

Observation 60fc7218-a058-4e74-beb5-ecca2d0c98ed · inbound

Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN cites this paper.

Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search

Reference 12

Resolution
verified exact
arxiv_id, observed 2026-05-17T00:01:22.783183Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-17T00:01:17.281452Z digest=sha256:fcbaf342a619069272e5f0dd3e8e23a159b229f8ec551c346884b8f11bfdf9c8