Pith. sign in

Paper Citation Record · LEDGER

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

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

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

pith.paper-citation-record.v1
2504.20461 v2

Coverage vector

measured 72 of 72 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T05:33:54.755093Z

measured 72 of 72 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 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

72 of 72 outbound references displayed

  • verified exact0
  • verified fuzzy3
  • unresolved69
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 36357a89-b44f-4dea-bf55-0feab7293dcf · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 1

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:56.127080Z

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-08-16T05:33:54.395948Z digest=sha256:c801971cc44e3d96795608c0b51711c675422464dc82cb4d75e13fbc3d2402f3

Observation b48cbcb5-efba-44a8-a31e-4028e60cf3d2 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 2

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:56.113166Z

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-08-16T05:33:54.405918Z digest=sha256:3adf54581cbb04c93bae0e078fbfdf67dd44983f4e4d585914d50f032124c346

Observation 074f1991-782c-44cc-82fc-8828594d0e41 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 3

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.412006Z digest=sha256:108b692b6a02c69eba4beca15a80b204afb20361ded36d768b972970b54678ee

Observation 6ebbdce9-9290-4f68-a8f2-07d2dabe438a · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:56.089727Z

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-08-16T05:33:54.417223Z digest=sha256:10bf1e6ad24f05550bf911ab94cc8b50a9f5ee84fd49cef4572fc2eaaed4710f

Observation 0567d884-f6d7-42e1-a6fb-85818bab8b28 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 5

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.422447Z digest=sha256:b54bbcdfe7ba1d88be1aeaeed0253037fa7bef82317a4eebfe99b3356cd841fb

Observation 70e4f78f-80f2-414d-ae08-f460a7aeaa88 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 6

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.427312Z digest=sha256:94a41ceb974837e9582306d0051cd6f6d7406801379173c516f3d46427b69441

Observation ffae6a49-f932-4e84-bb6a-c175f29fab9e · outbound

This paper cites SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search

Reference 7

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.433300Z digest=sha256:355354bfd8e511bf0bcbd7ed81d2cdc8133760361a6f952b8c5b3bb9c4e47305

Observation 785be2cd-2995-4a84-bbdd-c51d510a640f · outbound

This paper cites MagicPIG: LSH Sampling for Efficient LLM Generation.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss MagicPIG: LSH Sampling for Efficient LLM Generation

Reference 8

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.438647Z digest=sha256:fab4a635d609f4c3c97b73789a2cc3afde46a959bdc59d553c190a458fed120e

Observation f25870b6-7b94-46c6-ac57-366808fe99d0 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:56.058012Z

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-08-16T05:33:54.444408Z digest=sha256:cb2ce6945384d671b09e0a4c82b435fd73c62b1314788bb39f88105ada1de606

Observation 63c419f3-4200-4273-a13a-44de7947544a · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 10

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:56.043761Z

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-08-16T05:33:54.448927Z digest=sha256:ef1d4db59ce7c3d811fd74b39ef3407f599a825579ad8f400f8e049369f3f87e

Observation 2d198f85-1dc0-4907-be1c-b8f3c3c7ec21 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 11

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:56.029550Z

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-08-16T05:33:54.453236Z digest=sha256:b085fb94fe07ca950a01f4d29d10310a800b21fd5be9162f84527c5c818ae2e1

Observation d7add33a-092c-49a2-b093-e00a13037ff6 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 12

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:56.015906Z

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-08-16T05:33:54.458800Z digest=sha256:0cdcc35d4c5956041a25af5028e0c97f9adbae937482a92a80aec2d388844834

Observation 33477532-f0e8-407c-9377-65694e22322b · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 13

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.463063Z digest=sha256:db9d81adbd425de52a478856ba7664b0224b253f012bbe0874087281ed6665f1

Observation 7f8328a4-25a5-4c15-ba75-1cb98939b584 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 14

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.992901Z

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-08-16T05:33:54.467617Z digest=sha256:c1b8299e1c79fd0e3111189cc3d453a99b9904d1a60323d129b24a88b42c6a9f

Observation 5fd8bb18-376b-4993-89d8-a210f4ebff6e · outbound

This paper cites The Faiss library.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss The Faiss library

Reference 15

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.473455Z digest=sha256:789e98f3b14532a05033e2e2e8f94b6ce500c1b32f965eef5e8461aeb719b34c

Observation a98a8081-44fe-4a0e-ba64-ba72bac4a662 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 16

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.978423Z

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-08-16T05:33:54.478004Z digest=sha256:08d129faedf24eac9a49d73eaf4a4d921282706dd5293a49f71de15e5d5db2cc

Observation eeaee1ac-5ce2-4133-bed7-a933bb35d71e · outbound

This paper cites EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph

Reference 17

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.482475Z digest=sha256:7a516d6fef4b6d517d46b63f26864108119e6873074e2ab84aea61d095ef1d3b

Observation 7a15353c-dade-4ae8-b136-3122568e1962 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 18

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.487916Z digest=sha256:edc1140c856adc6fbedd023a86c94b13cd672ca2d33f7ffcd90405b8f09de5bf

Observation 5acdcdff-7269-41d0-ba7d-ca718f6e1c3d · outbound

This paper cites Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph

Reference 19

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.492933Z digest=sha256:0a80a3947f1fad45bb8b42fb21927a867c3e5ddb4224d7e8d1cc0cc765594bfd

Observation 50604ee0-0d71-4762-a306-9269a202583a · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 20

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.953856Z

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-08-16T05:33:54.499785Z digest=sha256:412a56437dc0551f4b4e8d34bf3cd18fb1004ef26bc43b4438e89f8aebd94c3e

Observation e2c9e6ea-fb54-4679-9e89-72f60c34f850 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 21

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.506078Z digest=sha256:4f4e2a6aeeabf71d8dec9e24647519a231b635904669deb1bc0bb569d047c52c

Observation a3ace44d-b0a3-42d6-9373-ea75e7200e3d · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 22

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.511161Z digest=sha256:c89919973f95f6c8ad27fd05f0861993eba4b51e0009bcca3dd967d4a42eb8fd

Observation 6fd3fa1a-a0bf-4ebe-b004-a1a75ebfb539 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 23

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.920659Z

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-08-16T05:33:54.517373Z digest=sha256:998f910897600db2ac5e89ed9072342042e9be07cd3d513dea90650d1e503844

Observation cab309a3-db00-4f17-ab92-63d35a367857 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 24

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.906479Z

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-08-16T05:33:54.522653Z digest=sha256:2faaa996eed0e10ce912a2d7dc307643a0f17ecf1d175c0a9481e5ccd098d6d4

Observation adc631d3-7735-4a2d-9732-be347539bfaa · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 25

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.527669Z digest=sha256:fd3c74a0cf061eb33ae74698e046335d05787f8c40abc7c2529831cde733e00d

Observation 539241f1-92bd-4a84-ae1e-6c29e1098e28 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 26

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.883318Z

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-08-16T05:33:54.533971Z digest=sha256:569087a948a7aa42370ddbeec2d2b02c12d1fede463ab34b9593dd96dc0ba362

Observation 77335e3a-a729-4b61-922e-733d57f11df9 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 27

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.868895Z

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-08-16T05:33:54.540165Z digest=sha256:c7f37208780490b364aef8190b70efc2e53346c3cb2a676aebd84533bda73097

Observation eca3ce57-0c19-491e-bc6d-deaa0ede46b6 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 28

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.855720Z

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-08-16T05:33:54.545641Z digest=sha256:4e21aecabf408162341e66ed237dfadecda142312552a01f5b753cc69ccd2ab5

Observation abae76da-0f1f-4f80-bc13-ad9a64f7681e · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 29

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.550525Z digest=sha256:7f575be560edbaa3129e11d87ea9fe2c8e784ebbf4d4e5b475980f1190fd0d5f

Observation eec17613-a799-4982-ab21-10a8739db47f · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 30

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.832331Z

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-08-16T05:33:54.554765Z digest=sha256:63755fe6a1d39b69831cdfc63b7416833bddc7852387705fdd26199817c78a27

Observation 11073ddb-1a25-4e6d-99d6-162dc88e540d · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 31

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.558788Z digest=sha256:e13811b4d3c702793a4f374b1a07b597554777914c0102a369ed7d7b459ef117

Observation 53237b3b-53ec-48a7-b0bd-5b8b27d83fc0 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 32

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.568384Z digest=sha256:164fab49ea1970f71f56db4db11d1dbe57db184f547ad43056f33e69a45df0fd

Observation 8232b8a3-e8fa-4f74-a340-508be1c6eb9a · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 33

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.783896Z

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-08-16T05:33:54.573804Z digest=sha256:ec1cd16b75d0d556a08740a92ae09f735ab3f3881c07f2a8ff06830fd5520801

Observation 0b69caec-80b5-4995-b4b9-62bddc6b26a3 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 34

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.769424Z

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-08-16T05:33:54.578135Z digest=sha256:fea72f6584b0df8f184d58ed4ec2ba6b5e39e943a96e3fd16814d58e987da7f0

Observation cd00238b-dcb7-471d-a2f7-b2178ab1eaad · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 35

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.583133Z digest=sha256:0c1cffd55f69e7c6efced073dcc7c7a40a5dd57f0fe0f9d7f4613fb27798e0a7

Observation 9817ce52-938f-41d5-8c5f-8ea07d5a877b · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 36

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.745522Z

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-08-16T05:33:54.592321Z digest=sha256:c728e07899f0cf7e93123ac1cce66754c87a8beccf17610baeaa527ded0c3975

Observation a22d5e87-e25a-4d08-b206-80ae10a844ed · outbound

This paper cites Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search.

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:4ebe4556404a58ba09aea3b223ed813d0728a3e85ae238e65885937b67d4022e

Observation 7fdcb397-2c1b-47ed-aa9f-86b3d55a6c7a · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 38

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.604389Z digest=sha256:220c8c9ee328d6d5695348c4cc34945497739d0298f71228551c7406de47ed65

Observation e03a6148-e5ab-49b1-b8f6-c05ea8f0c1ca · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 39

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.722995Z

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-08-16T05:33:54.608924Z digest=sha256:6ba9e8ebc50e25113324653e65884e2466c5e3be7b9f2ff41053856c7554d07a

Observation edcf9f59-16c0-4bcb-a5f2-a5eb713914e7 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 40

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.708746Z

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-08-16T05:33:54.613557Z digest=sha256:0c0dca9c7f263cea171a5bc8f3392af54d9a6506a47f73c2ef3444ef0b11edc4

Observation fba1a2ec-9441-4a15-8f60-1bb82dfe50f6 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 41

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.618013Z digest=sha256:42b05fc671f1511bc7f0fb13b55ab8c3cb9e0f0d13e5e8feeb83ede35097ceb4

Observation 534a5d8c-c1f5-4645-902f-4e93126cde3a · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 42

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.686320Z

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-08-16T05:33:54.622326Z digest=sha256:9442dbf8e74e946ceb1f2af952b328e269541eeb444e2d4639be1dbf2277fda4

Observation 66346280-2e0b-4538-bdde-c551928c3307 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 43

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.672239Z

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-08-16T05:33:54.626701Z digest=sha256:ca4614bfa7990960ae360dcefa3d8dfbf476a94b3a0fd9f0dbd83adf2fd2b398

Observation 95adc5af-b445-40a6-86b6-11a2aacffcde · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 44

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.657969Z

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-08-16T05:33:54.631711Z digest=sha256:74d6c54e6080090a8840fa8151850d3ac55d307e3d2cb27033d509a7852643f0

Observation 5cba8a87-515b-461b-b584-1fd07f52838d · outbound

This paper cites CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs

Reference 45

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.635878Z digest=sha256:b9eb56f259a9569c6f0696effac59820c2dadd1adcd9affe4d19da4d0d26a7d6

Observation ae0db7e4-b84b-464b-8314-1a02fd646c8a · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 46

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.643504Z

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-08-16T05:33:54.640666Z digest=sha256:a74fa9ebb8157fa6be11d79c0a0670bd858f53d4add77d29a8cd4b99696f8813

Observation accb3a44-f529-44d7-b549-4d4c189c4e45 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 47

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.629069Z

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-08-16T05:33:54.645054Z digest=sha256:bbd836d8479b3aebe345aa632ddd16817b8022511c3f92ba3d6b214e7920e193

Observation 0fb035a0-8859-484d-b4a2-73f0bcd882b3 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 48

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.614603Z

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-08-16T05:33:54.649524Z digest=sha256:a4cc2825ee3bc0a2c42deb9eaf46d1b395423dd245c34a0b284db4093ed107f3

Observation e5c31611-7c1a-425e-844d-ab4f15073cc7 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 49

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.601465Z

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-08-16T05:33:54.654067Z digest=sha256:d36afa6190b0a6eeef5765adf700c1b6d10a62fbb756c76af026c68a142fdc9d

Observation 75112693-400f-4f00-81e1-d11ed27a516b · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 50

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.588526Z

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-08-16T05:33:54.658926Z digest=sha256:4d6a558dca996cc27f3637b60317ae59575dca5526def70be0b990a988c566fe

Observation fceb0e6e-2eeb-412f-a0c7-205d3e69d311 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 51

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.574951Z

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-08-16T05:33:54.663582Z digest=sha256:6489797b1c771759c345f67aa22cd89ad8f62dee6c32b44a6b8fb9c132606f5e

Observation db2215bb-271f-4635-9878-9da324d49505 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 52

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.560531Z

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-08-16T05:33:54.668176Z digest=sha256:0318e2bdcc5875577a9a4e8643026e076f53e32f700f4645c3e84e66850c734f

Observation 789489d2-68ab-4274-85a8-fa06140973d2 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 53

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.547124Z

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-08-16T05:33:54.674242Z digest=sha256:a02e31e80e015783453961ca66839905748195407ba70e59f4897ab8cf282440

Observation 138e7c46-91ad-408c-a3f6-2e7b83dbb7ce · outbound

This paper cites , , Jingjia Luo, Mingxing Zhang, Kang Chen Xia Liao, Yingdi Shan, Jinlei Jiang, Yongwei Wu.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss , , Jingjia Luo, Mingxing Zhang, Kang Chen Xia Liao, Yingdi Shan, Jinlei Jiang, Yongwei Wu

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T05:33:55.382299Z

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-08-16T05:33:54.678253Z digest=sha256:018978fb364c9e898e8670d34c99ca8afe863de866fe420e45aebce090640a40

Observation f2a51f18-78ca-433c-b95d-9fddd587c8eb · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 55

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.336302Z

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-08-16T05:33:54.688192Z digest=sha256:8e3e3f4d1026374f5fd7d415cf2fae601bdd6457bc83b1a2f3fcded5b730a78a

Observation 9e5bef8d-c810-4cd5-9bcf-bf3873cb4209 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 56

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.692582Z digest=sha256:9582c435a1b841a6eb8c354f712706e22da2480e400803e25fbf628774b55938

Observation dd30a57c-e81f-4036-8377-4e925726e920 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 57

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.311196Z

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-08-16T05:33:54.697744Z digest=sha256:1c417d6c6d9c6c76eb8181d0dd98d1c9b06e8a5696bd1aa72c1d345ca224e97f

Observation 34467b91-ab3b-4dca-aa2d-8e442343e4da · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 58

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.295747Z

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-08-16T05:33:54.703104Z digest=sha256:c3cfff84d1ce204f6ed77c28a7c49834e6404d5c87840773349d1f3ebedabb48

Observation 0de1b343-3280-4126-9a36-77a0ec14e1da · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 59

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.279156Z

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-08-16T05:33:54.708124Z digest=sha256:3336667c7cf37ddc94ead925b769e396a75a4d32bf0259093e7fba20efb13829

Observation cad45b1a-6b1f-40a2-acd5-0233ff3dd6af · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 60

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.246740Z

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-08-16T05:33:54.712460Z digest=sha256:e4cc9c54ae0b4c8d804233ef9fa6e9c170f19003336b6680dd7f76cb2b1ae506

Observation e076cbe5-4477-4b93-956c-f87ba9b37162 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 61

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.717708Z digest=sha256:a3b0e751d5b5318d71bef61582114de318e22d098968b9ce1757149e15606b10

Observation 51d9a9ed-68ce-4859-a98c-f5817428604d · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 62

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.224468Z

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-08-16T05:33:54.722180Z digest=sha256:6860c7ffda8fb8093dca176fa8b83fde6d9a39cc3c03c8aac6fa7d1ee5de4485

Observation 2bd45648-ae82-403d-90b7-c45653c360bf · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 63

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.209606Z

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-08-16T05:33:54.726367Z digest=sha256:5a12bd525b2820fac3f18f5441cdacd8d56a58e024f2277ba9cef4504c137c03

Observation 7b581076-018e-4d34-945c-e147a5bc5017 · outbound

This paper cites Inference Scaling for Long-Context Retrieval Augmented Generation.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Inference Scaling for Long-Context Retrieval Augmented Generation

Reference 64

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.730663Z digest=sha256:99f749da3da12825725043cfb70ea9a6b11725f67d71887bb24a37d2240b9e08

Observation edf9dca0-ccde-488a-a0bf-9c5219ce3dce · outbound

This paper cites PQCache: Product Quantization-based KVCache for Long Context LLM Inference.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss PQCache: Product Quantization-based KVCache for Long Context LLM Inference

Reference 65

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.735667Z digest=sha256:94d6316ef5189a9f972d4f04b80d657ccab3a7f942fec324e6488de8fbdd9814

Observation 0bc84bab-58d9-4f9f-9a0f-8a73ab33ac5d · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 66

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.179597Z

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-08-16T05:33:54.740234Z digest=sha256:2b731b13032c30b908245d9188b6c7aae03a6b0c3003c7af73f609dbf460dd97

Observation cc6fa91a-06fc-4c72-bf28-250e5f29c37f · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 67

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.745579Z digest=sha256:54bf358f4a816ae0cbefd8f81afe2391f1f3c8d5211e4c7ee7697670130d0b6e

Observation c73a990c-19fd-4b6e-b477-9441b81d58a4 · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 68

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.118301Z

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-08-16T05:33:54.749935Z digest=sha256:1aac2d3894c9d839b0bd8abd76f813cd8c6828d30dc3dc1040f3f61a08d53e0b

Observation 6d316be5-38ae-45a2-83c0-064b270de01e · outbound

This paper cites In 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss In 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

Reference 2011

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T05:33:55.808108Z

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-08-16T05:33:54.564055Z digest=sha256:41a6198b490795a15753d3a5f9b5fb93d7dcf547eb3cfe15f8a71142e92c1867

Observation 7c4e3175-e734-4d54-8e4a-95c693942604 · outbound

This paper cites In Proceedings of the 2021 International Conference on Management of Data.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss In Proceedings of the 2021 International Conference on Management of Data

Reference 2021

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T05:33:55.352245Z

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-08-16T05:33:54.683722Z digest=sha256:362a571692eba3a40f8dc3bd349d99931dc41932f2d78ec0ff6b3b5d679f7dbf

Observation 7f514457-83be-4776-b790-3e479edca74b · outbound

This paper cites an unresolved cited work.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss Unresolved cited work

Reference 2023

Resolution
unresolved
raw_fallback, observed 2026-08-16T05:33:55.065026Z

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-08-16T05:33:54.755093Z digest=sha256:e3bcfd00a44fee915bbb4e0cc21c8a83eda47b8c205d3636b40da950fc3e5c71

Observation 66dc8508-4e68-48e1-9e95-256559bf92ce · outbound

This paper cites RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval.

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval

Reference 2024

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T05:33:54.587621Z digest=sha256:4afe9299733992fe02edc0f165e45355dc847da4c5d0f6e7239330a985081b4a

Pith citing papers

No inbound Pith citation observations are available.