{"as_of":"2026-08-22T03:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b63f7c023bf10bd7b98a9db950aac989a764339c5e3cc7153a7f1c355cc53018","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:46:10.548090Z","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-11T06:36:03.005310Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.17911","last_updated":"2025-07-15T11:31:14Z","snapshot_observed_at":"2026-08-16T12:47:40.913752Z","submitted_at":"2025-03-23T03:16:50Z","title":"VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.17911","snapshot_observed_at":"2026-08-05T13:46:10.548090Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-17T06:37:50.252541Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.548090Z"},"links":{"cited_paper":"/paper/2503.17911","citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:263c5d38e7ec37091841c24d668fa40e76065a8bfb699a1f12b0ff48ac9dfa20","observation_id":"98091dd6-a7d9-4812-8c69-c0a371903816","resolution":{"observed_at":"2026-08-05T13:46:10.548090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.17911","last_updated":"2025-07-15T11:31:14Z","snapshot_observed_at":"2026-08-16T12:47:40.913752Z","submitted_at":"2025-03-23T03:16:50Z","title":"VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.17911","snapshot_observed_at":"2026-08-03T03:53:58.260188Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.06721","last_updated":"2026-05-28T06:51:41Z","snapshot_observed_at":"2026-08-17T22:29:37.591153Z","submitted_at":"2026-02-06T14:14:00Z","title":"E2E: Efficient Filtered AKNN Search via Adaptive Termination","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T03:53:58.260188Z"},"links":{"cited_paper":"/paper/2503.17911","citing_paper":"/paper/2602.06721"},"observation_digest":"sha256:4e95f7e4217b8f833c83420e8bbd5d82ec75e93a1811aa6e5a7e2aca8674555f","observation_id":"8cfe0016-11a6-430d-8e2d-5167ee2474dd","resolution":{"observed_at":"2026-08-03T03:53:58.260188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.17911","last_updated":"2025-07-15T11:31:14Z","snapshot_observed_at":"2026-08-16T12:47:40.913752Z","submitted_at":"2025-03-23T03:16:50Z","title":"VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search","version":3},"cited_work":{"arxiv_id":"2503.17911","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.17911","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1d7ad8e6-d45a-4712-8106-4b32a8314872","year":2025},"citing_paper":{"arxiv_id":"2604.06616","last_updated":"2026-04-30T00:32:29Z","snapshot_observed_at":"2026-08-13T21:00:16.056784Z","submitted_at":"2026-04-08T02:49:55Z","title":"CubeGraph: Efficient Retrieval-Augmented Generation for Spatial and Temporal Data","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-10T17:34:24.958030Z"},"links":{"cited_paper":"/paper/2503.17911","citing_paper":"/paper/2604.06616"},"observation_digest":"sha256:d30b2bc17a80609bd7316b6911bb9eb799f877e3f33f699f6b1e78e527f15da6","observation_id":"78954769-ef05-429a-9967-bfab2ddff0cf","resolution":{"observed_at":"2026-05-11T06:36:03.011937Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.17911/citation-record","integrity":"/paper/2503.17911/integrity","json":"/paper/2503.17911/citation-record.json","paper":"/paper/2503.17911"},"outbound":[],"paper":{"arxiv_id":"2503.17911","last_updated":"2025-07-15T11:31:14Z","latest_version":3,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-16T12:47:40.913752Z","submitted_at":"2025-03-23T03:16:50Z","title":"VSAG: An Optimized Search Framework 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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2503.17911."}