{"as_of":"2026-08-20T22:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:245912be693c9f8860ecf8d8593c1f017c748dd1e257011a331719f0a1493ad7","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-20T06:33:59.587034+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.298604Z","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-07T10:37:34.976241Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.04713","last_updated":"2024-02-07T10:05:42Z","snapshot_observed_at":"2026-08-20T17:49:59.394327Z","submitted_at":"2024-02-07T10:05:42Z","title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2402.04713","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.04713","snapshot_observed_at":"2026-08-07T10:37:34.976241Z","title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search","venue":"cs.IR","work_id":"71db0a0b-8131-40f6-8374-40b9dc451c36","year":2024},"citing_paper":{"arxiv_id":"2506.04790","last_updated":"2025-06-05T09:17:30Z","snapshot_observed_at":"2026-08-20T09:54:27.473204Z","submitted_at":"2025-06-05T09:17:30Z","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:33.278187Z"},"links":{"cited_paper":"/paper/2402.04713","citing_paper":"/paper/2506.04790"},"observation_digest":"sha256:5e5ebfb5610cd4f7dcc2d5c8e16a06c9cc31a3d23c1208da96fc3203ecbbfab9","observation_id":"5aa0a325-7e53-4177-a54e-6af1958e8de2","resolution":{"observed_at":"2026-08-07T10:37:35.040405Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04713","last_updated":"2024-02-07T10:05:42Z","snapshot_observed_at":"2026-08-20T17:49:59.394327Z","submitted_at":"2024-02-07T10:05:42Z","title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04713","snapshot_observed_at":"2026-08-15T15:25:50.298604Z","title":"ArXiv abs/2402.04713(2024)","venue":null,"work_id":null,"year":2024},"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":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.298604Z"},"links":{"cited_paper":"/paper/2402.04713","citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:7526a55d0e0721ab5c8ba6fd050400ac456ff0b9a9a32e6928601216a82ea798","observation_id":"9da08dcf-8ffb-49c0-b3a7-35591f3c38c0","resolution":{"observed_at":"2026-08-15T15:25:50.298604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.04713/citation-record","integrity":"/paper/2402.04713/integrity","json":"/paper/2402.04713/citation-record.json","paper":"/paper/2402.04713"},"outbound":[],"paper":{"arxiv_id":"2402.04713","last_updated":"2024-02-07T10:05:42Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-20T17:49:59.394327Z","submitted_at":"2024-02-07T10:05:42Z","title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate 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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.04713."}