{"as_of":"2026-08-18T08:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0723d4833c1641cf41f71462bf195755b30de2e592d9d9e05602bccab1ece812","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-18T06:34:40.430872+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-11T14:11:39.917961Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-09T18:10:53.411866Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.06210","last_updated":"2023-03-10T21:18:34Z","snapshot_observed_at":"2026-08-16T15:49:07.090582Z","submitted_at":"2023-03-10T21:18:34Z","title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.06210","snapshot_observed_at":"2026-08-11T14:11:27.292879Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":133,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.292879Z"},"links":{"cited_paper":"/paper/2303.06210","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:a09b1ef388a73d712d0f3e828ec584da817346ed4d017469292be87d5d89272e","observation_id":"1f4c443b-2264-4e8c-a448-285e89126bb0","resolution":{"observed_at":"2026-08-11T14:11:27.292879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.06210","last_updated":"2023-03-10T21:18:34Z","snapshot_observed_at":"2026-08-16T15:49:07.090582Z","submitted_at":"2023-03-10T21:18:34Z","title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.06210","snapshot_observed_at":"2026-08-11T14:11:39.917961Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12444","last_updated":"2025-03-21T15:52:39Z","snapshot_observed_at":"2026-08-16T12:25:35.685966Z","submitted_at":"2024-12-17T01:12:35Z","title":"LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers","version":3},"reference_index":123,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:39.917961Z"},"links":{"cited_paper":"/paper/2303.06210","citing_paper":"/paper/2412.12444"},"observation_digest":"sha256:a4e52167ffe55fa8a8f102b56e619dc22d252be1ed2a95e78fab68ce3c50fc6c","observation_id":"be12fd6a-ab5d-4652-9d18-9b25f7d28f1d","resolution":{"observed_at":"2026-08-11T14:11:39.917961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.06210","last_updated":"2023-03-10T21:18:34Z","snapshot_observed_at":"2026-08-16T15:49:07.090582Z","submitted_at":"2023-03-10T21:18:34Z","title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph","version":1},"cited_work":{"arxiv_id":"2303.06210","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.06210","snapshot_observed_at":"2026-08-09T18:10:53.411866Z","title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph","venue":"cs.LG","work_id":"f8af7584-2a1f-484e-a3b4-5fb111ae1987","year":2023},"citing_paper":{"arxiv_id":"2502.00688","last_updated":"2025-02-02T06:19:59Z","snapshot_observed_at":"2026-08-15T13:03:01.988904Z","submitted_at":"2025-02-02T06:19:59Z","title":"High-Order Matching for One-Step Shortcut Diffusion Models","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T18:10:53.187135Z"},"links":{"cited_paper":"/paper/2303.06210","citing_paper":"/paper/2502.00688"},"observation_digest":"sha256:8bc3c3ba54725721d495c44f6a37700d41343ac2fbd985ecc9cd33645a2ce5dc","observation_id":"03a95559-2b39-45c4-a563-e0aa47942ed0","resolution":{"observed_at":"2026-08-09T18:10:53.416965Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2303.06210/citation-record","integrity":"/paper/2303.06210/integrity","json":"/paper/2303.06210/citation-record.json","paper":"/paper/2303.06210"},"outbound":[],"paper":{"arxiv_id":"2303.06210","last_updated":"2023-03-10T21:18:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:49:07.090582Z","submitted_at":"2023-03-10T21:18:34Z","title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2303.06210."}