Pith. sign in

Paper Citation Record · LEDGER

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search

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

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

pith.paper-citation-record.v1
2402.11354 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+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-08-16T05:33:54.597798Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-22T02:35:56.385042Z

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 a22d5e87-e25a-4d08-b206-80ae10a844ed · inbound

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss cites this paper.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-16T05:33:54.597798Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.597798Z digest=sha256:2acb6f5741f713c958fae1035dbb1127c2cbf5a0f5f8057fb2baf256ce1684b2

Observation f9c305b5-43c5-42ab-a967-7f55ec8e313d · inbound

LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search cites this paper.

LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search

Reference 31

Resolution
verified exact
arxiv_id, observed 2026-05-22T02:35:56.388495Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-05-22T02:34:44.721256Z digest=sha256:840203d2d123b40df91f447a794d8fa5c1eff5dfe949bf08297b26ef0d60bcb7