{"as_of":"2026-08-14T13:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5ae914c1104e496e350e4b18d8c3e3b98bcc23032313df81901fd7eec2d7290b","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T17:38:26.087240Z","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-03T13:38:18.628944Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.00943","last_updated":"2024-06-04T15:38:08Z","snapshot_observed_at":"2026-08-14T08:13:05.206971Z","submitted_at":"2024-02-01T19:00:40Z","title":"Approximate Nearest Neighbor Search with Window Filters","version":2},"cited_work":{"arxiv_id":"2402.00943","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.00943","snapshot_observed_at":"2026-07-03T13:38:18.628944Z","title":null,"venue":null,"work_id":"83af5ed0-10e6-46fe-9c4d-a29aa6f5e154","year":2024},"citing_paper":{"arxiv_id":"2606.00734","last_updated":"2026-05-30T13:56:00Z","snapshot_observed_at":"2026-08-14T10:53:24.717765Z","submitted_at":"2026-05-30T13:56:00Z","title":"EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T17:58:06.658283Z"},"links":{"cited_paper":"/paper/2402.00943","citing_paper":"/paper/2606.00734"},"observation_digest":"sha256:e0aa5f02d78cb3cd3b4cfc2b8703a56d148722854a6087208e676d42b33b0a14","observation_id":"985b3d46-76b1-4b41-bfed-bd827782e9fd","resolution":{"observed_at":"2026-06-28T18:02:26.952449Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00943","last_updated":"2024-06-04T15:38:08Z","snapshot_observed_at":"2026-08-14T08:13:05.206971Z","submitted_at":"2024-02-01T19:00:40Z","title":"Approximate Nearest Neighbor Search with Window Filters","version":2},"cited_work":{"arxiv_id":"2402.00943","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.00943","snapshot_observed_at":"2026-07-03T13:38:18.628944Z","title":null,"venue":null,"work_id":"83af5ed0-10e6-46fe-9c4d-a29aa6f5e154","year":2024},"citing_paper":{"arxiv_id":"2606.11789","last_updated":"2026-06-10T08:21:52Z","snapshot_observed_at":"2026-08-06T05:47:55.997746Z","submitted_at":"2026-06-10T08:21:52Z","title":"Efficient Graph Indexing for Interval-Aware Vector Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2402.00943","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:2415056abae00f9b277efb70d6ed5eed1f4b537d26785527b4412b9ccfe0885f","observation_id":"c0def2c0-3688-4943-9464-d0286e5f05f4","resolution":{"observed_at":"2026-07-03T13:38:18.630311Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00943","last_updated":"2024-06-04T15:38:08Z","snapshot_observed_at":"2026-08-14T08:13:05.206971Z","submitted_at":"2024-02-01T19:00:40Z","title":"Approximate Nearest Neighbor Search with Window Filters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00943","snapshot_observed_at":"2026-08-01T17:38:26.087240Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17582","last_updated":"2026-07-20T05:59:59Z","snapshot_observed_at":"2026-08-08T05:54:18.738135Z","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T17:38:26.087240Z"},"links":{"cited_paper":"/paper/2402.00943","citing_paper":"/paper/2607.17582"},"observation_digest":"sha256:90f58fbd19d44c56e1bb1ac66fc408a9f28a17c0bcd97b190efa30120378f6c2","observation_id":"c0eb75bf-82be-49d1-a8d6-a6eb1d718676","resolution":{"observed_at":"2026-08-01T17:38:26.087240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.00943/citation-record","integrity":"/paper/2402.00943/integrity","json":"/paper/2402.00943/citation-record.json","paper":"/paper/2402.00943"},"outbound":[],"paper":{"arxiv_id":"2402.00943","last_updated":"2024-06-04T15:38:08Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T08:13:05.206971Z","submitted_at":"2024-02-01T19:00:40Z","title":"Approximate Nearest Neighbor Search with Window Filters"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.00943."}