Pith. sign in

Paper Citation Record · LEDGER

HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints

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

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

pith.paper-citation-record.v1
2207.07940 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-15T06:32:42.880941+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-07T11:24:03.596540Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-04T05:49:36.920024Z

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 4e2c637d-665a-4ed6-8279-e305ac44baba · inbound

Toward Understanding Bugs in Vector Database Management Systems cites this paper.

Toward Understanding Bugs in Vector Database Management Systems HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-07T11:24:03.596540Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:24:03.596540Z digest=sha256:05345c85d31251b15ec0686febf00fecbe2d9b43a337a24e4e41ae483e364b0a

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

Query-aware Routing for Filtered Approximate Nearest Neighbors Search cites this paper.

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-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-06-26T15:30:03.463197Z digest=sha256:c10ce3ba9d4008cd2cc5cef61a6cf791b90030ea48a0722cb1145af1608e234d