{"as_of":"2026-08-16T02:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:70e85a97d4dcc9001066c8fd92590a57dc1bc60d2872a8e2a32b33398772b9aa","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-15T06:32:42.880941+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-08T18:52:59.037682Z","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-05T05:11:48.550580Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1206.6411","last_updated":"2012-06-27T19:59:59Z","snapshot_observed_at":"2026-08-15T00:55:10.793267Z","submitted_at":"2012-06-27T19:59:59Z","title":"On the Difficulty of Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1206.6411","snapshot_observed_at":"2026-08-08T18:52:59.037682Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.05575","last_updated":"2025-09-05T08:09:51Z","snapshot_observed_at":"2026-08-15T11:56:53.683789Z","submitted_at":"2025-02-08T14:03:43Z","title":"Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-08T18:52:59.037682Z"},"links":{"cited_paper":"/paper/1206.6411","citing_paper":"/paper/2502.05575"},"observation_digest":"sha256:1aed5eced526651ffacaee29d9b0a0fff2fd6643072f26743355edff984bce87","observation_id":"b6d6ba54-8cdc-4855-b66a-75bae3c25071","resolution":{"observed_at":"2026-08-08T18:52:59.037682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1206.6411","last_updated":"2012-06-27T19:59:59Z","snapshot_observed_at":"2026-08-15T00:55:10.793267Z","submitted_at":"2012-06-27T19:59:59Z","title":"On the Difficulty of Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"1206.6411","doi":null,"metadata_source":"pith","pith_arxiv_id":"1206.6411","snapshot_observed_at":"2026-08-05T05:11:48.550580Z","title":"On the Difficulty of Nearest Neighbor Search","venue":"cs.LG","work_id":"4165e363-be7a-46b4-9939-fe1b6ef215f8","year":2012},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-11T22:25:44.973361Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.215810Z"},"links":{"cited_paper":"/paper/1206.6411","citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:a8094cda8eac07d13b80227fbefe675714d7ac8737b50c8a4229178926ece734","observation_id":"42e51b16-8b21-4cf8-be55-576dfc79840c","resolution":{"observed_at":"2026-08-05T05:11:48.554087Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1206.6411/citation-record","integrity":"/paper/1206.6411/integrity","json":"/paper/1206.6411/citation-record.json","paper":"/paper/1206.6411"},"outbound":[],"paper":{"arxiv_id":"1206.6411","last_updated":"2012-06-27T19:59:59Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T00:55:10.793267Z","submitted_at":"2012-06-27T19:59:59Z","title":"On the Difficulty of 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1206.6411."}