{"as_of":"2026-08-13T06:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca7c8b58c246c58155277c14100a718997431f4146396de2cf01617fe088ec81","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T16:12:05.921820Z","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-25T04:55:23.324205Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.14210","last_updated":"2021-06-09T07:25:23Z","snapshot_observed_at":"2026-08-12T23:31:35.255000Z","submitted_at":"2020-12-28T12:25:25Z","title":"The Curse of Dense Low-Dimensional Information Retrieval for Large Index Sizes","version":2},"cited_work":{"arxiv_id":"2012.14210","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.14210","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"URL https://arxiv.org/abs/2012.14210","venue":null,"work_id":"9963ba3f-1506-4674-869a-6e1cd9810753","year":2012},"citing_paper":{"arxiv_id":"2104.08663","last_updated":"2021-10-21T01:18:28Z","snapshot_observed_at":"2026-08-09T23:22:21.200279Z","submitted_at":"2021-04-17T23:29:55Z","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","version":4},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-12T14:42:11.242060Z"},"links":{"cited_paper":"/paper/2012.14210","citing_paper":"/paper/2104.08663"},"observation_digest":"sha256:dd54baf92c3cfd8d36973107e1a663f232473d6d6d87c6ae6df3d0bb6186fe22","observation_id":"a5cc00a4-868f-4524-9f02-dbeee916eb99","resolution":{"observed_at":"2026-05-12T14:42:11.304714Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.14210","last_updated":"2021-06-09T07:25:23Z","snapshot_observed_at":"2026-08-12T23:31:35.255000Z","submitted_at":"2020-12-28T12:25:25Z","title":"The Curse of Dense Low-Dimensional Information Retrieval for Large Index Sizes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.14210","snapshot_observed_at":"2026-08-11T16:12:05.921820Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.10313","last_updated":"2024-12-13T17:53:29Z","snapshot_observed_at":"2026-08-11T20:38:27.858962Z","submitted_at":"2024-12-13T17:53:29Z","title":"MST-R: Multi-Stage Tuning for Retrieval Systems and Metric Evaluation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T16:12:05.921820Z"},"links":{"cited_paper":"/paper/2012.14210","citing_paper":"/paper/2412.10313"},"observation_digest":"sha256:cf07e4044c2dc31b83ffb4205a2f5f5963542031a552872edc8246c39320da6a","observation_id":"607bb9d6-f8b3-4d79-b444-3f8a8b47ee0c","resolution":{"observed_at":"2026-08-11T16:12:05.921820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.14210","last_updated":"2021-06-09T07:25:23Z","snapshot_observed_at":"2026-08-12T23:31:35.255000Z","submitted_at":"2020-12-28T12:25:25Z","title":"The Curse of Dense Low-Dimensional Information Retrieval for Large Index Sizes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.14210","snapshot_observed_at":"2026-08-10T21:35:34.789037Z","title":"://arxiv.org/abs/2012.14210, 2012.14210","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.04591","last_updated":"2025-01-08T16:11:31Z","snapshot_observed_at":"2026-08-13T00:53:28.320601Z","submitted_at":"2025-01-08T16:11:31Z","title":"Quantum-inspired Embeddings Projection and Similarity Metrics for Representation Learning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:34.789037Z"},"links":{"cited_paper":"/paper/2012.14210","citing_paper":"/paper/2501.04591"},"observation_digest":"sha256:f5153ad5839ad6febf5ede46327be08ea9d31103ab1883631901c123c5c2f925","observation_id":"37787164-d7a8-4aa4-a0cf-db909819e45b","resolution":{"observed_at":"2026-08-10T21:35:34.789037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.14210","last_updated":"2021-06-09T07:25:23Z","snapshot_observed_at":"2026-08-12T23:31:35.255000Z","submitted_at":"2020-12-28T12:25:25Z","title":"The Curse of Dense Low-Dimensional Information Retrieval for Large Index Sizes","version":2},"cited_work":{"arxiv_id":"2012.14210","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.14210","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"URL https://arxiv.org/abs/2012.14210","venue":null,"work_id":"9963ba3f-1506-4674-869a-6e1cd9810753","year":2012},"citing_paper":{"arxiv_id":"2605.23753","last_updated":"2026-05-22T15:26:31Z","snapshot_observed_at":"2026-07-06T23:33:53.870540Z","submitted_at":"2026-05-22T15:26:31Z","title":"SeedER: Seed-and-Expand Retrieval from Knowledge Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-25T04:53:52.372584Z"},"links":{"cited_paper":"/paper/2012.14210","citing_paper":"/paper/2605.23753"},"observation_digest":"sha256:c75f44be16b10fcf0679d6db1c553f6bda5c2dcd8882d5f38d454f42bed301d1","observation_id":"2f8bc47c-3009-4de4-9d99-531fcd99667d","resolution":{"observed_at":"2026-05-25T04:55:23.327274Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2012.14210/citation-record","integrity":"/paper/2012.14210/integrity","json":"/paper/2012.14210/citation-record.json","paper":"/paper/2012.14210"},"outbound":[],"paper":{"arxiv_id":"2012.14210","last_updated":"2021-06-09T07:25:23Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-12T23:31:35.255000Z","submitted_at":"2020-12-28T12:25:25Z","title":"The Curse of Dense Low-Dimensional Information Retrieval for Large Index Sizes"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2012.14210."}