{"as_of":"2026-08-08T20:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c492b04797ff36174a893b2b84c633d0f8a8eefbc4bfc290a0f7c8edcff28e1","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-08T06:32:00.761636+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-07T15:23:35.926768Z","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-20T08:03:08.632208Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.13336","last_updated":"2025-02-18T23:31:37Z","snapshot_observed_at":"2026-08-07T18:07:01.471280Z","submitted_at":"2025-02-18T23:31:37Z","title":"Graph-Based Algorithms for Diverse Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13336","snapshot_observed_at":"2026-08-07T15:23:35.926768Z","title":"Raykar, Kirankumar Shiragur, and Haike Xu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:35.926768Z"},"links":{"cited_paper":"/paper/2502.13336","citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:2d299703786c669c5b89eeae637bc3ef1c781ae317cf5ed00b263324d30184fe","observation_id":"fe3fa77a-6c5f-42ea-b905-1d282d49b50e","resolution":{"observed_at":"2026-08-07T15:23:35.926768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13336","last_updated":"2025-02-18T23:31:37Z","snapshot_observed_at":"2026-08-07T18:07:01.471280Z","submitted_at":"2025-02-18T23:31:37Z","title":"Graph-Based Algorithms for Diverse Similarity Search","version":1},"cited_work":{"arxiv_id":"2502.13336","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13336","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Raykar and Kirankumar Shiragur and Haike Xu , year=","venue":null,"work_id":"ebfd0ab5-014f-410b-8a15-649fdff9a3a3","year":null},"citing_paper":{"arxiv_id":"2605.18623","last_updated":"2026-05-18T16:32:40Z","snapshot_observed_at":"2026-08-02T09:30:53.436945Z","submitted_at":"2026-05-18T16:32:40Z","title":"An Approximation Algorithm for Graph Label Selection","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-20T08:02:56.487615Z"},"links":{"cited_paper":"/paper/2502.13336","citing_paper":"/paper/2605.18623"},"observation_digest":"sha256:865f7a040ea0fc2f4fca02a224605d7e60b918b9d08a331959b5653ba75d61ae","observation_id":"b7bf5282-fe4a-4e83-8c63-d7b89b41dbf5","resolution":{"observed_at":"2026-05-20T08:03:08.638700Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.13336/citation-record","integrity":"/paper/2502.13336/integrity","json":"/paper/2502.13336/citation-record.json","paper":"/paper/2502.13336"},"outbound":[],"paper":{"arxiv_id":"2502.13336","last_updated":"2025-02-18T23:31:37Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T18:07:01.471280Z","submitted_at":"2025-02-18T23:31:37Z","title":"Graph-Based Algorithms for Diverse Similarity 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.13336."}