{"as_of":"2026-08-16T03:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fcdd3650adc93499bd514392757197c694805ebb36e41a3294ac1a46c1d37af4","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:37:36.654678Z","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-14T16:52:14.974071Z","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-14T15:37:36.654678Z","title":"Graph based nearest neighbor search: Promises and failures,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.00814","last_updated":"2021-07-29T11:07:40Z","snapshot_observed_at":"2026-08-15T22:10:20.083983Z","submitted_at":"2019-08-02T11:46:42Z","title":"On the Merge of k-NN Graph","version":6},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:36.654678Z"},"links":{"cited_paper":"/paper/1904.02077","citing_paper":"/paper/1908.00814"},"observation_digest":"sha256:d0a8b3037fbb4dcfdc1be1bbe53c702f21c4d0790f3d9a5edd5b06982f8bf5b0","observation_id":"e6bb3429-524b-4877-995f-f5451db44eb8","resolution":{"observed_at":"2026-08-14T15:37:36.654678Z","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-14T16:52:14.974071Z","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-15T19:25:47.938688Z","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:71e2a4e16b6eeff23eb97139180ea25efa82e745286d04c9d8cccdbadf28d725","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-14T16:52:14.974071Z","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-15T11:56:53.683789Z","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:96597f2581a323a95f47093944e8494ab109b43c1d7378c37b5c1cd4d04d7aff","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T16:52:14.974071Z","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:686fa5d74953a2b4151ecc49f3ff373d02d34c45b22dc783c512630a6ebc397f","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-14T16:52:14.974071Z","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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1904.02077."}