{"as_of":"2026-08-09T12:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d675ea1621d11fc91e87911d724d9c4eaba8fa160034435492eb104b52d50b06","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-09T06:31:02.800959+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-08T05:56:55.087110Z","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-08T05:56:55.520989Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.08544","last_updated":"2020-09-29T02:50:54Z","snapshot_observed_at":"2026-08-02T03:18:12.303328Z","submitted_at":"2019-01-24T18:07:59Z","title":"Learning Space Partitions for Nearest Neighbor Search","version":4},"cited_work":{"arxiv_id":"1901.08544","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.08544","snapshot_observed_at":"2026-08-08T05:56:55.520989Z","title":"Learning Space Partitions for Nearest Neighbor Search","venue":"cs.LG","work_id":"249f1841-f739-44bf-9517-37c2f999a3b7","year":2019},"citing_paper":{"arxiv_id":"2502.08246","last_updated":"2025-06-03T10:07:35Z","snapshot_observed_at":"2026-08-08T05:49:05.821041Z","submitted_at":"2025-02-12T09:39:54Z","title":"Inference-time sparse attention with asymmetric indexing","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-08T05:56:55.087110Z"},"links":{"cited_paper":"/paper/1901.08544","citing_paper":"/paper/2502.08246"},"observation_digest":"sha256:862bcac7d2d7f1af892c146fc792f0438ca47d225acf5f1330118d912df13cb4","observation_id":"f49897ef-7688-4d8c-b9ef-022941e30786","resolution":{"observed_at":"2026-08-08T05:56:55.528000Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.08544","last_updated":"2020-09-29T02:50:54Z","snapshot_observed_at":"2026-08-02T03:18:12.303328Z","submitted_at":"2019-01-24T18:07:59Z","title":"Learning Space Partitions for Nearest Neighbor Search","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.08544","snapshot_observed_at":"2026-08-02T04:16:15.829762Z","title":"Learning space partitions for nearest neighbor search, 2020.https://arxiv.org/abs/1901.08544","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.13728","last_updated":"2026-07-15T11:42:07Z","snapshot_observed_at":"2026-08-02T04:16:11.998045Z","submitted_at":"2026-07-15T11:42:07Z","title":"Cluster with Auctions for Vector Search","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:15.829762Z"},"links":{"cited_paper":"/paper/1901.08544","citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:68963fa1a61cd4c047cbfe70bd325208c08bc7ef2d4cda211ae3a5ba56242e74","observation_id":"de837c3a-76b5-4248-954a-38b9ac3e49bb","resolution":{"observed_at":"2026-08-02T04:16:15.829762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1901.08544/citation-record","integrity":"/paper/1901.08544/integrity","json":"/paper/1901.08544/citation-record.json","paper":"/paper/1901.08544"},"outbound":[],"paper":{"arxiv_id":"1901.08544","last_updated":"2020-09-29T02:50:54Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T03:18:12.303328Z","submitted_at":"2019-01-24T18:07:59Z","title":"Learning Space Partitions for 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1901.08544."}