Pith. sign in

Paper Citation Record · LEDGER

Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search

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

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

pith.paper-citation-record.v1
2402.04713 v1

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-20T06:33:59.587034+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-15T15:25:50.298604Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T10:37:34.976241Z

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 5aa0a325-7e53-4177-a54e-6af1958e8de2 · inbound

LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table cites this paper.

LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search

Reference 35

Resolution
verified exact
local_arxiv, observed 2026-08-07T10:37:35.040405Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T10:37:33.278187Z digest=sha256:5e5ebfb5610cd4f7dcc2d5c8e16a06c9cc31a3d23c1208da96fc3203ecbbfab9

Observation 9da08dcf-8ffb-49c0-b3a7-35591f3c38c0 · inbound

Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets cites this paper.

Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-15T15:25:50.298604Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T15:25:50.298604Z digest=sha256:eb34045b3c5739812d0a6d6f66cf0f61f7f6646cba7bd71fc8e408ac291de186