Paper Citation Record · LEDGER

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version)

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

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

pith.paper-citation-record.v1
2607.24173 v1

Coverage vector

measured 36 of 36 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-31T21:59:00.063625Z

measured 36 of 36 standing notices

One-hop event checks from named stored sources.

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

36 of 36 outbound references displayed

verified exact0
verified fuzzy0
unresolved36
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 06ca5b96-d20b-424f-ac60-cc791e87ab52 · outbound

This paper cites In: IEEE Big Data.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: IEEE Big Data

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.125909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6490a161-14cd-4dd9-8dce-d1cbbc71f809 · outbound

This paper cites In: SIGMOD.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: SIGMOD

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.197384Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29326f64-b2da-4852-9de0-ed5fe11bf8fd · outbound

This paper cites The VLDB Journal 31(4), 797–821 (2022).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) The VLDB Journal 31(4), 797–821 (2022)

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.287176Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b4e5bfc6-81f8-45a0-b3b5-2a8785c7b993 · outbound

This paper cites Proceedings of the ACM on Management of Data 3(1), 1–31 (2025).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Proceedings of the ACM on Management of Data 3(1), 1–31 (2025)

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.348049Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d45fcf4-9bc2-4256-ae13-122b179ee843 · outbound

This paper cites Proceedings of the ACM on Management of Data2(6), 1–27 (2024).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Proceedings of the ACM on Management of Data2(6), 1–27 (2024)

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.408323Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8284b3d7-4fb5-4fdd-a0af-029d89ec163a · outbound

This paper cites In: Asilomar Conference on Signals, Systems and Computers.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: Asilomar Conference on Signals, Systems and Computers

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.493633Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e813b226-c9d8-4b7d-9084-d3f98429da4c · outbound

This paper cites In: World Wide Web.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: World Wide Web

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.565218Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d475d5c-3706-4675-9263-0b19478d442b · outbound

This paper cites In: ICML (2024).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: ICML (2024)

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.650795Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37d27683-5b74-4143-b5cd-53ea3955e192 · outbound

This paper cites IEEE Transac- tions on Pattern Analysis and Machine Intelligence44(8), 4139–4150 (2021).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) IEEE Transac- tions on Pattern Analysis and Machine Intelligence44(8), 4139–4150 (2021)

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.728325Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b84d47d-3903-4a59-beda-3be557a12beb · outbound

This paper cites Proceedings of the VLDB Endowment 12(5), 461–474 (2019).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Proceedings of the VLDB Endowment 12(5), 461–474 (2019)

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.810581Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f97bf921-c1f1-45f7-bae0-1d163114514a · outbound

This paper cites In: Web Conference.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: Web Conference

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.890546Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation deec3681-150a-403d-9004-9a449b31ed9e · outbound

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

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) CAPS: A Practical Partition Index for Filtered Similarity Search

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:57.964862Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 10b563d1-ac27-4859-b849-7ca64de71cbc · outbound

This paper cites Proceedings of the ACM on Management of Data3(3), 1–26 (2025) Simple and Fast Algorithm for Graph-based Filtered ANNS 13.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Proceedings of the ACM on Management of Data3(3), 1–26 (2025) Simple and Fast Algorithm for Graph-based Filtered ANNS 13

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.064481Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38b618ae-dca1-4069-b9e0-76e1432064b5 · outbound

This paper cites In: PAKDD.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: PAKDD

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.149400Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8828578b-44d5-4913-b0d8-13d04f694ac5 · outbound

This paper cites Proceedings of the ACM on Management of Data3(6), 1–26 (2025).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Proceedings of the ACM on Management of Data3(6), 1–26 (2025)

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.281807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8732fd3-760e-4b2c-b603-5a9cdd6e3595 · outbound

This paper cites IEEE Transactions on Knowledge and Data Engineering32(8), 1475–1488 (2019).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) IEEE Transactions on Knowledge and Data Engineering32(8), 1475–1488 (2019)

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.357323Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f8e61c3-6dc8-4c07-ad62-f8eebb275cfb · outbound

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

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Survey of Filtered Approximate Nearest Neighbor Search over the Vector-Scalar Hybrid Data

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.471982Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e388f4a-176c-4d1c-acd9-a2d63fbae713 · outbound

This paper cites IEEE Transactions on Pattern Analysis and Machine Intelligencee42(4), 824–836 (2018).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) IEEE Transactions on Pattern Analysis and Machine Intelligencee42(4), 824–836 (2018)

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.532762Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9f42c0cd-f23b-4403-9785-2af5d0c50de6 · outbound

This paper cites Information Systems 45, 61–68 (2014).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Information Systems 45, 61–68 (2014)

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.611318Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6e04e057-15b5-4bb1-909e-48f19f7b044a · outbound

This paper cites Proceedings of the ACM on Management of Data2(3), 1–27 (2024).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Proceedings of the ACM on Management of Data2(3), 1–27 (2024)

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.711699Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8641bd9-dfba-4913-a1a3-4f2b45fa042b · outbound

This paper cites Proceedings of the ACM on Man- agement of Data1(1), 1–27 (2023).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Proceedings of the ACM on Man- agement of Data1(1), 1–27 (2023)

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.763832Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf3de15e-8106-4d22-ac71-f30d038460f7 · outbound

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

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.866193Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 17d4557b-ac90-4873-b53d-3425c12157d3 · outbound

This paper cites In: NeurIPS.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: NeurIPS

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:58.942553Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f748f09-2762-4fc1-83d8-ca1015870b77 · outbound

This paper cites Pattern Recognition12(4), 261–268 (1980).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Pattern Recognition12(4), 261–268 (1980)

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.020692Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f270bfd5-50b2-4bc7-b8cb-7a5e6d8d8824 · outbound

This paper cites In: IEEE International Conference on Big Data.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: IEEE International Conference on Big Data

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.101073Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9cc9d981-09e9-4e78-b642-7e58214044a3 · outbound

This paper cites In: SISAP (2024).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: SISAP (2024)

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.196992Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 705f9099-0b64-4703-8c2e-c5299949e14c · outbound

This paper cites In: SISAP (2026).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: SISAP (2026)

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.317649Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6428e2ff-70ec-4e82-b5a9-b9a293978bd2 · outbound

This paper cites In: SIGMOD.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: SIGMOD

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.408457Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a76358a-5f19-49bb-8264-de1c711e6d7c · outbound

This paper cites Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.454756Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89cf8110-ebda-45f6-ae55-089722c0085a · outbound

This paper cites In: NeurIPS.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: NeurIPS

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.559736Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c22e3b5-20dc-4a29-8fa1-75b9848bc380 · outbound

This paper cites In: CIKM.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) In: CIKM

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.638082Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 34eebf6a-901b-4e4f-9ebc-2375a732451e · outbound

This paper cites Proceedings of the ACM on Management of Data2(6), 1–26 (2024).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Proceedings of the ACM on Management of Data2(6), 1–26 (2024)

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.741192Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2223e4a1-bab8-482b-86e7-a03a01a7e6f8 · outbound

This paper cites an unresolved cited work.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Unresolved cited work

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.820405Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 614de366-4f3b-44e7-beb7-f4b32b3b76ed · outbound

This paper cites PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search.

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.869190Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8973284f-3875-4fe1-a752-0749f9ac200d · outbound

This paper cites Proceedings of the VLDB Endowment19(2), 183–195 (2025).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Proceedings of the VLDB Endowment19(2), 183–195 (2025)

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-31T21:58:59.967385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2186be44-8780-4384-8fef-3ec110cb9056 · outbound

This paper cites Proceedings of the ACM on Man- agement of Data2(1), 1–26 (2024).

Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version) Proceedings of the ACM on Man- agement of Data2(1), 1–26 (2024)

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-31T21:59:00.063625Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.