{"as_of":"2026-08-18T18:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0286ed5954b37fc6671efb7cd101b705047e36915f15ba57c076187f53f571b","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-18T06:34:40.430872+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-15T22:17:12.436044Z","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-15T15:25:50.482736Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.19651","last_updated":"2024-06-28T04:46:11Z","snapshot_observed_at":"2026-08-18T13:37:45.388937Z","submitted_at":"2024-06-28T04:46:11Z","title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.19651","snapshot_observed_at":"2026-08-15T22:17:12.436044Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07621","last_updated":"2025-05-12T14:44:21Z","snapshot_observed_at":"2026-08-16T14:30:07.481934Z","submitted_at":"2025-05-12T14:44:21Z","title":"Bang for the Buck: Vector Search on Cloud CPUs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T22:17:12.436044Z"},"links":{"cited_paper":"/paper/2406.19651","citing_paper":"/paper/2505.07621"},"observation_digest":"sha256:2355f1315bda3abdf48ab2da2205e682f390c655bd4f5d406a10c5f1031c2054","observation_id":"9d26a83c-4b79-4baa-aa52-7d0e540c12af","resolution":{"observed_at":"2026-08-15T22:17:12.436044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19651","last_updated":"2024-06-28T04:46:11Z","snapshot_observed_at":"2026-08-18T13:37:45.388937Z","submitted_at":"2024-06-28T04:46:11Z","title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion","version":1},"cited_work":{"arxiv_id":"2406.19651","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.19651","snapshot_observed_at":"2026-08-15T15:25:50.482736Z","title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion","venue":"cs.DB","work_id":"97d8d5a2-e07c-42e4-85ba-546c217efc63","year":2024},"citing_paper":{"arxiv_id":"2607.27640","last_updated":"2026-07-30T03:50:40Z","snapshot_observed_at":"2026-08-18T15:05:56.188024Z","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":30,"source":"pdf_text","source_observed_at":"2026-08-15T15:25:50.350713Z"},"links":{"cited_paper":"/paper/2406.19651","citing_paper":"/paper/2607.27640"},"observation_digest":"sha256:011be8236bb20c7bc777f47b62b810ab21892393ae23fcaafad7a835bdbf91b0","observation_id":"97959720-9ead-4ab0-bea9-e1d9d207e1dd","resolution":{"observed_at":"2026-08-15T15:25:50.487162Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.19651/citation-record","integrity":"/paper/2406.19651/integrity","json":"/paper/2406.19651/citation-record.json","paper":"/paper/2406.19651"},"outbound":[],"paper":{"arxiv_id":"2406.19651","last_updated":"2024-06-28T04:46:11Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-18T13:37:45.388937Z","submitted_at":"2024-06-28T04:46:11Z","title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.19651."}