{"as_of":"2026-08-23T05:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f643af2332f60da3be90f281cf730fc670efcc5691b8f06ce773d0360cde15f","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-22T06:32:14.747728+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-12T00:11:50.562828Z","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-04T21:44:50.267202Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.03221","last_updated":"2021-04-07T16:18:15Z","snapshot_observed_at":"2026-08-16T18:33:15.497078Z","submitted_at":"2021-04-07T16:18:15Z","title":"Graph Reordering for Cache-Efficient Near Neighbor Search","version":1},"cited_work":{"arxiv_id":"2104.03221","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.03221","snapshot_observed_at":"2026-08-04T21:44:50.267202Z","title":"Graph Reordering for Cache-Efficient Near Neighbor Search","venue":"cs.DS","work_id":"388238c1-7fc0-4b08-8b94-3eb7d3b25f82","year":2021},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-13T05:28:45.073121Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:43.111749Z"},"links":{"cited_paper":"/paper/2104.03221","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:d3727834f52b7848ef08871a46f473a8c0e6489ebad339d8c6717b3fac883350","observation_id":"7d4dc1c2-d61b-497b-8786-02ee5d1e9633","resolution":{"observed_at":"2026-08-04T21:44:50.325544Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.03221","last_updated":"2021-04-07T16:18:15Z","snapshot_observed_at":"2026-08-16T18:33:15.497078Z","submitted_at":"2021-04-07T16:18:15Z","title":"Graph Reordering for Cache-Efficient Near Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.03221","snapshot_observed_at":"2026-08-12T00:11:50.562828Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09077","last_updated":"2026-08-10T03:27:04Z","snapshot_observed_at":"2026-08-16T00:56:43.618985Z","submitted_at":"2026-08-10T03:27:04Z","title":"RVANNS: Mixed-Precision Indexing and Locality-Aware Graph Traversal on RISC-V","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T00:11:50.562828Z"},"links":{"cited_paper":"/paper/2104.03221","citing_paper":"/paper/2608.09077"},"observation_digest":"sha256:c2888120dbada4fdd3f3a480ce155e1564ac46d895b87871666e42b2fd2fa989","observation_id":"2a6d585e-e5b4-49a7-b362-10864fc20959","resolution":{"observed_at":"2026-08-12T00:11:50.562828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2104.03221/citation-record","integrity":"/paper/2104.03221/integrity","json":"/paper/2104.03221/citation-record.json","paper":"/paper/2104.03221"},"outbound":[],"paper":{"arxiv_id":"2104.03221","last_updated":"2021-04-07T16:18:15Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T18:33:15.497078Z","submitted_at":"2021-04-07T16:18:15Z","title":"Graph Reordering for Cache-Efficient Near 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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2104.03221."}