{"as_of":"2026-08-19T23:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e93896dff4437c12a6c58f6e7a7816a5a35fa402a53c6dc107f09bcbc643f2a0","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-19T06:32:44.657259+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-16T05:33:54.597798Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T02:35:56.385042Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.11354","last_updated":"2024-07-10T17:05:43Z","snapshot_observed_at":"2026-08-19T16:27:22.598187Z","submitted_at":"2024-02-17T18:08:37Z","title":"Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11354","snapshot_observed_at":"2026-08-16T05:33:54.597798Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.597798Z"},"links":{"cited_paper":"/paper/2402.11354","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:2acb6f5741f713c958fae1035dbb1127c2cbf5a0f5f8057fb2baf256ce1684b2","observation_id":"a22d5e87-e25a-4d08-b206-80ae10a844ed","resolution":{"observed_at":"2026-08-16T05:33:54.597798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11354","last_updated":"2024-07-10T17:05:43Z","snapshot_observed_at":"2026-08-19T16:27:22.598187Z","submitted_at":"2024-02-17T18:08:37Z","title":"Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":"2402.11354","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.11354","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4c82f571-181d-4f73-9ea5-abe15c3cdf28","year":2024},"citing_paper":{"arxiv_id":"2505.17152","last_updated":"2026-05-16T05:33:49Z","snapshot_observed_at":"2026-08-17T22:15:54.900643Z","submitted_at":"2025-05-22T11:11:02Z","title":"LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-22T02:34:44.721256Z"},"links":{"cited_paper":"/paper/2402.11354","citing_paper":"/paper/2505.17152"},"observation_digest":"sha256:840203d2d123b40df91f447a794d8fa5c1eff5dfe949bf08297b26ef0d60bcb7","observation_id":"f9c305b5-43c5-42ab-a967-7f55ec8e313d","resolution":{"observed_at":"2026-05-22T02:35:56.388495Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.11354/citation-record","integrity":"/paper/2402.11354/integrity","json":"/paper/2402.11354/citation-record.json","paper":"/paper/2402.11354"},"outbound":[],"paper":{"arxiv_id":"2402.11354","last_updated":"2024-07-10T17:05:43Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T16:27:22.598187Z","submitted_at":"2024-02-17T18:08:37Z","title":"Probabilistic Routing 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.11354."}