Paper Citation Record · LEDGER

Query-aware Routing for Filtered Approximate Nearest Neighbors Search

As of 14 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2606.19898.

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

pith.paper-citation-record.v1
2606.19898 v1

Coverage vector

measured 38 of 38 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-26T15:30:03.463197Z

measured 38 of 38 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+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

38 of 38 outbound references displayed

verified exact18
verified fuzzy0
unresolved17
parse uncertain0
malformed identifier1
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 92e28d9f-43d5-44f6-9ce7-a326f28de01a · outbound

This paper cites Houle, Ken-ichi Kawarabayashi, and Michael Nett.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Houle, Ken-ichi Kawarabayashi, and Michael Nett

Reference 1

Resolution: malformed identifier; arxiv_id, observed 2026-07-04T05:49:36.943219Z

Source-reported events for the cited work

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

Observation 395b8e6c-549e-4fd0-9adc-29439d2c39d4 · outbound

This paper cites 2020 , pages =.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search 2020 , pages =

Reference 2

Resolution: verified exact; doi, observed 2026-06-26T15:39:33.962848Z

Source-reported events for the cited work

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

Observation 2267aef3-79b3-4c56-84aa-f14da112477d · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc49f4ac-b66b-4e5c-872d-b1f31747f743 · outbound

This paper cites Navigating labels and vectors: A unified approach to filtered approximate nearest neighbor search,.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Navigating labels and vectors: A unified approach to filtered approximate nearest neighbor search,

Reference 4

Resolution: verified exact; doi, observed 2026-06-26T15:39:33.958038Z

Source-reported events for the cited work

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

Observation 3a0f5ed6-7655-4f48-93e2-ffda04ad7266 · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 5

Resolution: verified exact; arxiv_id, observed 2026-07-04T05:49:36.939557Z

Source-reported events for the cited work

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

Observation f397bec1-16eb-44f1-b683-2e656dd1ab54 · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bec55b71-0875-4065-99ec-8bb5c6bab0c9 · outbound

This paper cites InProceedings of the 41st International Conference on Machine Learning (ICML).

Query-aware Routing for Filtered Approximate Nearest Neighbors Search InProceedings of the 41st International Conference on Machine Learning (ICML)

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db874677-3f5d-4daa-9b5e-710d18d1c8c0 · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-07-04T05:49:36.929051Z

Source-reported events for the cited work

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

Observation ba46e699-935c-4529-8fab-525951147228 · outbound

This paper cites Filtered-diskann: Graph algorithms for approximate nearest neighbor search with filters.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Filtered-diskann: Graph algorithms for approximate nearest neighbor search with filters

Reference 9

Resolution: verified exact; arxiv_id, observed 2026-06-26T15:39:33.963239Z

Source-reported events for the cited work

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

Observation a885f0d1-757c-459c-b6c0-a759cf69b4eb · outbound

This paper cites CAPS: A Practical Partition Index for Filtered Similarity Search.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search CAPS: A Practical Partition Index for Filtered Similarity Search

Reference 10

Resolution: verified exact; arxiv_id, observed 2026-07-04T05:49:36.914476Z

Source-reported events for the cited work

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

Observation d5504bc9-89ed-4491-b748-3e495565b428 · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b26d558-d440-4db5-bd47-c5f6dc0ef298 · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a34a4d8-0748-4813-9a3a-040d447981ce · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 268031aa-30e7-4fa1-817b-b1d1cce6ede5 · outbound

This paper cites Unify: Unified index for range filtered approximate nearest neighbors search,.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unify: Unified index for range filtered approximate nearest neighbors search,

Reference 14

Resolution: verified exact; arxiv_id, observed 2026-06-26T15:39:33.978611Z

Source-reported events for the cited work

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

Observation a184b5db-5724-42c3-af22-b044324ac021 · outbound

This paper cites Survey of Filtered Approximate Nearest Neighbor Search over the Vector-Scalar Hybrid Data.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Survey of Filtered Approximate Nearest Neighbor Search over the Vector-Scalar Hybrid Data

Reference 15

Resolution: verified exact; arxiv_id, observed 2026-07-04T05:49:36.932268Z

Source-reported events for the cited work

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

Observation 863dca98-b3ec-4112-9ce0-db912e7cb12d · outbound

This paper cites Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs

Reference 16

Resolution: verified exact; local_arxiv, observed 2026-07-04T05:49:36.918474Z

Source-reported events for the cited work

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

Observation 328776a5-4d83-4cd8-a483-43e5bddeb678 · outbound

This paper cites ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data

Reference 17

Resolution: verified exact; arxiv_id, observed 2026-07-04T05:49:36.925628Z

Source-reported events for the cited work

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

Observation 27527028-a482-4618-b639-231d2ac43085 · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d0e83de4-650d-49f3-8e3e-c3db93e6e4a1 · outbound

This paper cites In: Advances in computers, vol.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search In: Advances in computers, vol

Reference 19

Resolution: verified exact; doi, observed 2026-06-26T15:39:33.985616Z

Source-reported events for the cited work

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

Observation 8e25002f-44bc-45d6-ae47-19fd6d79ddd2 · outbound

This paper cites Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark].

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]

Reference 20

Resolution: verified exact; arxiv_id, observed 2026-07-04T05:49:36.935805Z

Source-reported events for the cited work

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

Observation 0aa25d18-c918-4449-88e2-182ce0528d0e · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 21

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e00de880-ba4a-451b-a3ea-1f047eb26ee7 · outbound

This paper cites InProceedings of the NeurIPS 2021 Competitions and Demonstra- tions Track.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search InProceedings of the NeurIPS 2021 Competitions and Demonstra- tions Track

Reference 22

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf8e27b5-94ff-45e0-9e3b-01c09b80cd16 · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec08dfdd-afc1-46d7-b0d4-aba5da8796fe · outbound

This paper cites Shamma, Gerald Friedland, Benjamin Elizalde, Karl Ni, Douglas Poland, Damian Borth, and Li-Jia Li.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Shamma, Gerald Friedland, Benjamin Elizalde, Karl Ni, Douglas Poland, Damian Borth, and Li-Jia Li

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d5bcc2cc-918c-47c7-8b2b-076f268a2131 · outbound

This paper cites Milvus: A purpose-built vector data management system.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Milvus: A purpose-built vector data management system

Reference 25

Resolution: verified exact; arxiv_id, observed 2026-06-26T15:39:33.982838Z

Source-reported events for the cited work

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

Observation d3e18559-0955-4137-ad16-64f7cf66e984 · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 26

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37065126-ef60-4fe2-bbb9-e339821183fe · outbound

This paper cites In41st IEEE International Conference on Data Engineering, ICDE 2025, Hong Kong, May 19-23.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search In41st IEEE International Conference on Data Engineering, ICDE 2025, Hong Kong, May 19-23

Reference 27

Resolution: metadata mismatch; arxiv_id, observed 2026-06-26T15:39:33.973100Z

Source-reported events for the cited work

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

Observation 39415cef-52c9-4f5b-ab29-111dd88ba36b · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 28

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 073f7d32-9244-4cb3-a625-9ff78e453c51 · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 29

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94c50f24-1f87-495c-9747-0aa65ff0cd75 · outbound

This paper cites HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints

Reference 30

Resolution: verified exact; arxiv_id, observed 2026-07-04T05:49:36.921660Z

Source-reported events for the cited work

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

Observation 45a8783e-dcb4-4a31-bbf4-0d960dfcf833 · outbound

This paper cites Journal of Artificial Intelligence Research32, 565–606 (2008).https://doi.org/10.1613/jair.2490.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Journal of Artificial Intelligence Research32, 565–606 (2008).https://doi.org/10.1613/jair.2490

Reference 31

Resolution: metadata mismatch; doi, observed 2026-06-26T15:39:33.980251Z

Source-reported events for the cited work

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

Observation e8bf15c2-29ea-47c2-9baa-0ab1fade4737 · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 32

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fada0a74-e4e4-411a-83fd-58a0108311ef · outbound

This paper cites irangegraph: Improvising range-dedicated graphs for range-filtering nearest neighbor search,.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search irangegraph: Improvising range-dedicated graphs for range-filtering nearest neighbor search,

Reference 33

Resolution: verified exact; doi, observed 2026-06-26T15:39:33.984590Z

Source-reported events for the cited work

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

Observation c22c807c-58ac-4ebf-b77a-7d312b19e907 · outbound

This paper cites Available: https://doi.org/10.1145/3725401.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Available: https://doi.org/10.1145/3725401

Reference 34

Resolution: verified exact; doi, observed 2026-06-26T15:39:33.981005Z

Source-reported events for the cited work

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

Observation f00a45cd-7329-4faa-a689-2e884ecb87db · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 35

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9fbe122c-e82d-4c71-ae2f-b0e0cda0e6de · outbound

This paper cites an unresolved cited work.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Unresolved cited work

Reference 36

Resolution: unresolved; no resolver link, observed 2026-06-26T15:30:03.463197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ce6dbad-a112-4b00-ab4b-770dd3e650f3 · outbound

This paper cites Arkgraph: All-range approximate k-nearest-neighbor graph,.

Query-aware Routing for Filtered Approximate Nearest Neighbors Search Arkgraph: All-range approximate k-nearest-neighbor graph,

Reference 37

Resolution: verified exact; arxiv_id, observed 2026-06-26T15:39:33.983742Z

Source-reported events for the cited work

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

Observation c8f0d565-b852-4a5d-af31-91a2ac75c606 · outbound

This paper cites InProceedings of the ACM on Management of Data (SIGMOD ’24).

Query-aware Routing for Filtered Approximate Nearest Neighbors Search InProceedings of the ACM on Management of Data (SIGMOD ’24)

Reference 38

Resolution: verified exact; doi, observed 2026-06-26T15:39:33.965514Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.