{"as_of":"2026-08-08T17:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ef2f1b4defcc05dccb0698967b3e3c16dc68885134554adff0b0e1899865fa5f","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T04:16:15.914483Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.08091","last_updated":"2022-10-19T07:15:47Z","snapshot_observed_at":"2026-07-06T13:21:35.473469Z","submitted_at":"2022-06-16T11:17:03Z","title":"Unsupervised Space Partitioning for Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.08091","snapshot_observed_at":"2026-08-02T04:16:15.914483Z","title":"Unsupervised space partitioning for nearest neighbor search, 2022.https://arxiv.org/abs/2206.08091","venue":null,"work_id":null,"year":2022},"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":7,"source":"pdf_text","source_observed_at":"2026-08-02T04:16:15.914483Z"},"links":{"cited_paper":"/paper/2206.08091","citing_paper":"/paper/2607.13728"},"observation_digest":"sha256:3eb13a733fe7f4ca667ca95d95c8c21b7a5686bcaa4c0156e769af78e9793917","observation_id":"dd109f6f-a838-41d4-ae8d-99247b7bf0c9","resolution":{"observed_at":"2026-08-02T04:16:15.914483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.08091/citation-record","integrity":"/paper/2206.08091/integrity","json":"/paper/2206.08091/citation-record.json","paper":"/paper/2206.08091"},"outbound":[],"paper":{"arxiv_id":"2206.08091","last_updated":"2022-10-19T07:15:47Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:21:35.473469Z","submitted_at":"2022-06-16T11:17:03Z","title":"Unsupervised Space Partitioning 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2206.08091."}