{"as_of":"2026-08-11T06:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15c879e06df3af66c2aaa6e9af3708059fc4e2ce5bfb18c9838b838453f018ad","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-10T06:31:04.303077+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-10T15:55:41.918732Z","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-08T18:53:00.218197Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.02077","last_updated":"2019-06-18T09:07:06Z","snapshot_observed_at":"2026-08-09T06:57:50.140452Z","submitted_at":"2019-04-03T16:12:55Z","title":"Graph based Nearest Neighbor Search: Promises and Failures","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.02077","snapshot_observed_at":"2026-08-10T15:55:41.918732Z","title":"Graph based nearest neighbor search: Promises and failures","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-10T15:49:43.445030Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.918732Z"},"links":{"cited_paper":"/paper/1904.02077","citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:41d7b5382ad442eb78fcbadf92fb58bafd7fd9defdbe2bc16e8eb294d0fa8c2f","observation_id":"e73aeea9-fd91-4eb1-91e3-d5b2f74c23ce","resolution":{"observed_at":"2026-08-10T15:55:41.918732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.02077","last_updated":"2019-06-18T09:07:06Z","snapshot_observed_at":"2026-08-09T06:57:50.140452Z","submitted_at":"2019-04-03T16:12:55Z","title":"Graph based Nearest Neighbor Search: Promises and Failures","version":5},"cited_work":{"arxiv_id":"1904.02077","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.02077","snapshot_observed_at":"2026-08-08T18:53:00.218197Z","title":"Graph based Nearest Neighbor Search: Promises and Failures","venue":"cs.IR","work_id":"65a14e5c-3d33-489c-a90d-07b317af5faa","year":2019},"citing_paper":{"arxiv_id":"2502.05575","last_updated":"2025-09-05T08:09:51Z","snapshot_observed_at":"2026-08-10T06:58:55.502595Z","submitted_at":"2025-02-08T14:03:43Z","title":"Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-08T18:52:59.148418Z"},"links":{"cited_paper":"/paper/1904.02077","citing_paper":"/paper/2502.05575"},"observation_digest":"sha256:bb526dabb01640dfbd4cc3b0202857257a867a87cf74f435e498135f13b8071a","observation_id":"cd3b193f-6b16-4196-89a4-681e61b72d8d","resolution":{"observed_at":"2026-08-08T18:53:00.223750Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.02077","last_updated":"2019-06-18T09:07:06Z","snapshot_observed_at":"2026-08-09T06:57:50.140452Z","submitted_at":"2019-04-03T16:12:55Z","title":"Graph based Nearest Neighbor Search: Promises and Failures","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.02077","snapshot_observed_at":"2026-08-01T04:31:21.474451Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27623","last_updated":"2026-07-30T03:22:17Z","snapshot_observed_at":"2026-08-09T16:32:14.877204Z","submitted_at":"2026-07-30T03:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T04:31:21.474451Z"},"links":{"cited_paper":"/paper/1904.02077","citing_paper":"/paper/2607.27623"},"observation_digest":"sha256:8d4f26a80ac9e57aca790f283485e6c7bec6d079f31b1bd8cfdf010296e6fc61","observation_id":"14a14c4d-f60c-45f3-904c-2f9941cfb09e","resolution":{"observed_at":"2026-08-01T04:31:21.474451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1904.02077/citation-record","integrity":"/paper/1904.02077/integrity","json":"/paper/1904.02077/citation-record.json","paper":"/paper/1904.02077"},"outbound":[],"paper":{"arxiv_id":"1904.02077","last_updated":"2019-06-18T09:07:06Z","latest_version":5,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-09T06:57:50.140452Z","submitted_at":"2019-04-03T16:12:55Z","title":"Graph based Nearest Neighbor Search: Promises and Failures"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1904.02077."}