{"as_of":"2026-08-21T06:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1dae5d40e90e4a83503341d7c0877e8aac418a9272650f716cf2892fec676195","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:25:50.338220Z","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-06T15:01:17.715010Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.10839","last_updated":"2022-06-22T04:35:57Z","snapshot_observed_at":"2026-08-20T22:22:29.780969Z","submitted_at":"2022-06-22T04:35:57Z","title":"Proximity Graph Maintenance for Fast Online Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2206.10839","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.10839","snapshot_observed_at":"2026-08-06T15:01:17.715010Z","title":"Proximity Graph Maintenance for Fast Online Nearest Neighbor Search","venue":"cs.IR","work_id":"879210b8-1139-463d-9461-36e8ed629954","year":2022},"citing_paper":{"arxiv_id":"2507.17094","last_updated":"2025-07-23T00:19:27Z","snapshot_observed_at":"2026-08-08T11:06:13.689212Z","submitted_at":"2025-07-23T00:19:27Z","title":"PathWeaver: A High-Throughput Multi-GPU System for Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.558305Z"},"links":{"cited_paper":"/paper/2206.10839","citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:42295916453a0fc6e84ed561e93391912dee6b3771b11ee9bf7472b03df3360e","observation_id":"01a84044-6861-4450-b848-068890ac93de","resolution":{"observed_at":"2026-08-06T15:01:17.721984Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.10839","last_updated":"2022-06-22T04:35:57Z","snapshot_observed_at":"2026-08-20T22:22:29.780969Z","submitted_at":"2022-06-22T04:35:57Z","title":"Proximity Graph Maintenance for Fast Online Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.10839","snapshot_observed_at":"2026-08-15T15:25:50.338220Z","title":"CoRRabs/2206.10839(2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-20T22:20:47.351554Z","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.338220Z"},"links":{"cited_paper":"/paper/2206.10839","citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:a2c807aa2ecc0391eb202e3357c80d5efae6c37a017e2da504dca3cd6668b42d","observation_id":"09c2a2cb-0304-49bd-a035-52f4b9192a61","resolution":{"observed_at":"2026-08-15T15:25:50.338220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.10839/citation-record","integrity":"/paper/2206.10839/integrity","json":"/paper/2206.10839/citation-record.json","paper":"/paper/2206.10839"},"outbound":[],"paper":{"arxiv_id":"2206.10839","last_updated":"2022-06-22T04:35:57Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-20T22:22:29.780969Z","submitted_at":"2022-06-22T04:35:57Z","title":"Proximity Graph Maintenance for Fast Online 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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2206.10839."}