{"as_of":"2026-08-15T19:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cbd8816e1ec95bbfb18079d59248bb9881f5473a61cf2f360a8864cd600f5478","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:24:03.596540Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T05:49:36.920024Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.07940","last_updated":"2022-07-16T13:29:26Z","snapshot_observed_at":"2026-08-14T10:47:47.335812Z","submitted_at":"2022-07-16T13:29:26Z","title":"HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.07940","snapshot_observed_at":"2026-08-07T11:24:03.596540Z","title":"Hqann: Efficient and robust similarity search for hybrid queries with structured and unstructured constraints,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.02617","last_updated":"2025-06-03T08:34:01Z","snapshot_observed_at":"2026-08-12T13:20:24.422940Z","submitted_at":"2025-06-03T08:34:01Z","title":"Toward Understanding Bugs in Vector Database Management Systems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T11:24:03.596540Z"},"links":{"cited_paper":"/paper/2207.07940","citing_paper":"/paper/2506.02617"},"observation_digest":"sha256:05345c85d31251b15ec0686febf00fecbe2d9b43a337a24e4e41ae483e364b0a","observation_id":"4e2c637d-665a-4ed6-8279-e305ac44baba","resolution":{"observed_at":"2026-08-07T11:24:03.596540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.07940","last_updated":"2022-07-16T13:29:26Z","snapshot_observed_at":"2026-08-14T10:47:47.335812Z","submitted_at":"2022-07-16T13:29:26Z","title":"HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":"2207.07940","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.07940","snapshot_observed_at":"2026-07-04T05:49:36.920024Z","title":null,"venue":null,"work_id":"def035de-07b2-4b6d-9db3-48f765fc032c","year":2022},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-15T08:03:03.231323Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"cited_paper":"/paper/2207.07940","citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:c10ce3ba9d4008cd2cc5cef61a6cf791b90030ea48a0722cb1145af1608e234d","observation_id":"94c50f24-1f87-495c-9747-0aa65ff0cd75","resolution":{"observed_at":"2026-07-04T05:49:36.921660Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2207.07940/citation-record","integrity":"/paper/2207.07940/integrity","json":"/paper/2207.07940/citation-record.json","paper":"/paper/2207.07940"},"outbound":[],"paper":{"arxiv_id":"2207.07940","last_updated":"2022-07-16T13:29:26Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-14T10:47:47.335812Z","submitted_at":"2022-07-16T13:29:26Z","title":"HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"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."}