{"as_of":"2026-08-13T18:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:728860bfd517ddb9ba6602c9a0ce6baa19873ad374468cca09b6caf365f6d0ad","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:41:34.136515Z","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-12T15:41:34.329046Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.02828","last_updated":"2023-01-17T08:02:58Z","snapshot_observed_at":"2026-08-13T13:08:28.465523Z","submitted_at":"2023-01-07T11:12:36Z","title":"Why do Nearest Neighbor Language Models Work?","version":2},"cited_work":{"arxiv_id":"2301.02828","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.02828","snapshot_observed_at":"2026-08-12T15:41:34.329046Z","title":"Why do Nearest Neighbor Language Models Work?","venue":"cs.CL","work_id":"916f01d2-fdf6-4aa4-99f7-5d57cb730119","year":2023},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-13T14:24:04.848449Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.136515Z"},"links":{"cited_paper":"/paper/2301.02828","citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:a30e0e25073fdc779c6f9aa84965f30d1dc78b0020d30bedfbc97e4f866d6d33","observation_id":"600bd4ea-41a5-41ab-9e81-9c643a92c62b","resolution":{"observed_at":"2026-08-12T15:41:34.333980Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2301.02828/citation-record","integrity":"/paper/2301.02828/integrity","json":"/paper/2301.02828/citation-record.json","paper":"/paper/2301.02828"},"outbound":[],"paper":{"arxiv_id":"2301.02828","last_updated":"2023-01-17T08:02:58Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T13:08:28.465523Z","submitted_at":"2023-01-07T11:12:36Z","title":"Why do Nearest Neighbor Language Models Work?"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2301.02828."}