{"as_of":"2026-08-08T21:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:793b44e6aa5fd9564732263c2a8bb482251165e297359b181a9a13b1d3283caa","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-08T06:32:00.761636+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-06T23:51:24.537652Z","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-06T23:51:24.712900Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1804.03032","last_updated":"2020-09-17T06:08:09Z","snapshot_observed_at":"2026-07-06T06:32:26.665882Z","submitted_at":"2018-04-09T14:49:19Z","title":"Approximate k-NN Graph Construction: a Generic Online Approach","version":5},"cited_work":{"arxiv_id":"1804.03032","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.03032","snapshot_observed_at":"2026-08-06T23:51:24.712900Z","title":"Approximate k-NN Graph Construction: a Generic Online Approach","venue":"cs.IR","work_id":"4965fe22-3803-4cf8-be15-e4e8b318bca2","year":2018},"citing_paper":{"arxiv_id":"2506.15986","last_updated":"2025-06-19T03:07:12Z","snapshot_observed_at":"2026-08-06T23:42:15.336450Z","submitted_at":"2025-06-19T03:07:12Z","title":"Empowering Graph-based Approximate Nearest Neighbor Search with Adaptive Awareness Capabilities","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T23:51:24.537652Z"},"links":{"cited_paper":"/paper/1804.03032","citing_paper":"/paper/2506.15986"},"observation_digest":"sha256:e70666d77711f1552036ccabcc3f622cf58dddad7ad6461f558911bc5a23cdb7","observation_id":"945a64f4-f1ad-42d0-af06-787e036f7f9c","resolution":{"observed_at":"2026-08-06T23:51:24.754035Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1804.03032/citation-record","integrity":"/paper/1804.03032/integrity","json":"/paper/1804.03032/citation-record.json","paper":"/paper/1804.03032"},"outbound":[],"paper":{"arxiv_id":"1804.03032","last_updated":"2020-09-17T06:08:09Z","latest_version":5,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T06:32:26.665882Z","submitted_at":"2018-04-09T14:49:19Z","title":"Approximate k-NN Graph Construction: a Generic Online Approach"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1804.03032."}