{"as_of":"2026-08-23T08:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:70ace20b1ebf98ccf190e7e2045a4bc5fe51489cc63c261ccd2902611ed781d6","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-23T06:30:58.430688+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-15T22:45:39.711351Z","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-05-11T06:36:03.014051Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.02571","last_updated":"2024-09-04T09:41:52Z","snapshot_observed_at":"2026-08-16T13:21:28.742709Z","submitted_at":"2024-09-04T09:41:52Z","title":"iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02571","snapshot_observed_at":"2026-08-15T22:45:39.711351Z","title":"CoRR abs/2409.02571, DOI 10.48550/ARXIV","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.06501","last_updated":"2025-05-10T04:02:14Z","snapshot_observed_at":"2026-08-22T04:15:41.296271Z","submitted_at":"2025-05-10T04:02:14Z","title":"Survey of Filtered Approximate Nearest Neighbor Search over the Vector-Scalar Hybrid Data","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-15T22:45:39.711351Z"},"links":{"cited_paper":"/paper/2409.02571","citing_paper":"/paper/2505.06501"},"observation_digest":"sha256:7a597fe54893960dea6c188e6c5608fda627a6e10856d54bbe980a0a7053df87","observation_id":"d9ffb762-3a39-48aa-ab63-1eeed0b46f86","resolution":{"observed_at":"2026-08-15T22:45:39.711351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02571","last_updated":"2024-09-04T09:41:52Z","snapshot_observed_at":"2026-08-16T13:21:28.742709Z","submitted_at":"2024-09-04T09:41:52Z","title":"iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02571","snapshot_observed_at":"2026-08-03T03:53:57.327373Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.06721","last_updated":"2026-05-28T06:51:41Z","snapshot_observed_at":"2026-08-17T22:29:37.591153Z","submitted_at":"2026-02-06T14:14:00Z","title":"E2E: Efficient Filtered AKNN Search via Adaptive Termination","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T03:53:57.327373Z"},"links":{"cited_paper":"/paper/2409.02571","citing_paper":"/paper/2602.06721"},"observation_digest":"sha256:431de00ba20973071735daab735e56e374b6f3c22b9b51fd7139cd02e67802b9","observation_id":"cd510ff6-6474-408a-87b2-5dc7e04a621b","resolution":{"observed_at":"2026-08-03T03:53:57.327373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02571","last_updated":"2024-09-04T09:41:52Z","snapshot_observed_at":"2026-08-16T13:21:28.742709Z","submitted_at":"2024-09-04T09:41:52Z","title":"iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2409.02571","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.02571","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c7186a15-ec6f-4c4a-bd19-03c68b34770b","year":2024},"citing_paper":{"arxiv_id":"2604.06616","last_updated":"2026-04-30T00:32:29Z","snapshot_observed_at":"2026-08-13T21:00:16.056784Z","submitted_at":"2026-04-08T02:49:55Z","title":"CubeGraph: Efficient Retrieval-Augmented Generation for Spatial and Temporal Data","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-10T17:34:24.958030Z"},"links":{"cited_paper":"/paper/2409.02571","citing_paper":"/paper/2604.06616"},"observation_digest":"sha256:ea823c561d589e2c897bb7e0c2df8ad86cd37e4e1a3a9c237cc7067fc554ae9b","observation_id":"7082880e-8134-4d20-8547-6cb6d3110436","resolution":{"observed_at":"2026-05-11T06:36:03.016487Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2409.02571/citation-record","integrity":"/paper/2409.02571/integrity","json":"/paper/2409.02571/citation-record.json","paper":"/paper/2409.02571"},"outbound":[],"paper":{"arxiv_id":"2409.02571","last_updated":"2024-09-04T09:41:52Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-16T13:21:28.742709Z","submitted_at":"2024-09-04T09:41:52Z","title":"iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2409.02571."}