{"as_of":"2026-08-19T14:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e16623a4c39f916d7e53322c7a7c92d194dd647597649b63ae136218781f3690","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:17:12.239748Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.04759","last_updated":"2023-07-24T18:10:09Z","snapshot_observed_at":"2026-08-18T15:07:31.954491Z","submitted_at":"2023-04-07T23:10:39Z","title":"Similarity search in the blink of an eye with compressed indices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04759","snapshot_observed_at":"2026-08-12T17:53:50.356460Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.12229","last_updated":"2024-11-19T04:51:08Z","snapshot_observed_at":"2026-08-18T12:57:24.853143Z","submitted_at":"2024-11-19T04:51:08Z","title":"SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T17:53:50.356460Z"},"links":{"cited_paper":"/paper/2304.04759","citing_paper":"/paper/2411.12229"},"observation_digest":"sha256:43f96d56b79b8a72d2c00cfe1b3d0763b23723ad05e6c635f21db2c33304b018","observation_id":"223f7644-9363-4d5b-9aac-675e1621e7fc","resolution":{"observed_at":"2026-08-12T17:53:50.356460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04759","last_updated":"2023-07-24T18:10:09Z","snapshot_observed_at":"2026-08-18T15:07:31.954491Z","submitted_at":"2023-04-07T23:10:39Z","title":"Similarity search in the blink of an eye with compressed indices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04759","snapshot_observed_at":"2026-08-11T23:04:03.970682Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.04506","last_updated":"2024-12-14T00:13:09Z","snapshot_observed_at":"2026-08-18T22:50:31.960845Z","submitted_at":"2024-12-03T22:59:36Z","title":"Arctic-Embed 2.0: Multilingual Retrieval Without Compromise","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T23:04:03.970682Z"},"links":{"cited_paper":"/paper/2304.04759","citing_paper":"/paper/2412.04506"},"observation_digest":"sha256:efea2f149699fd638cd4c06e7e9c3b024bb7b67ce5218f9c58be80977ad343f5","observation_id":"9efa0b5e-cf7f-4eb4-805d-a847734ef44b","resolution":{"observed_at":"2026-08-11T23:04:03.970682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04759","last_updated":"2023-07-24T18:10:09Z","snapshot_observed_at":"2026-08-18T15:07:31.954491Z","submitted_at":"2023-04-07T23:10:39Z","title":"Similarity search in the blink of an eye with compressed indices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04759","snapshot_observed_at":"2026-08-10T21:24:21.234262Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.05006","last_updated":"2025-01-09T06:59:08Z","snapshot_observed_at":"2026-08-15T12:14:20.437798Z","submitted_at":"2025-01-09T06:59:08Z","title":"CHASE: A Native Relational Database for Hybrid Queries on Structured and Unstructured Data","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:21.234262Z"},"links":{"cited_paper":"/paper/2304.04759","citing_paper":"/paper/2501.05006"},"observation_digest":"sha256:e8323cd11cdf25e425eb53f2cda42ae750f98a092766081170277705434f0c18","observation_id":"77a81780-758d-49f8-9f1c-ce3f0a4d8ac4","resolution":{"observed_at":"2026-08-10T21:24:21.234262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04759","last_updated":"2023-07-24T18:10:09Z","snapshot_observed_at":"2026-08-18T15:07:31.954491Z","submitted_at":"2023-04-07T23:10:39Z","title":"Similarity search in the blink of an eye with compressed indices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04759","snapshot_observed_at":"2026-08-15T22:17:12.239748Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07621","last_updated":"2025-05-12T14:44:21Z","snapshot_observed_at":"2026-08-16T14:30:07.481934Z","submitted_at":"2025-05-12T14:44:21Z","title":"Bang for the Buck: Vector Search on Cloud CPUs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T22:17:12.239748Z"},"links":{"cited_paper":"/paper/2304.04759","citing_paper":"/paper/2505.07621"},"observation_digest":"sha256:1728fccf99027adb8740b7bb4f3abd5b7462ad54c2822f03a2373714a0d33312","observation_id":"8df13c7c-9644-4c1c-9e2c-f1d6d60d4750","resolution":{"observed_at":"2026-08-15T22:17:12.239748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04759","last_updated":"2023-07-24T18:10:09Z","snapshot_observed_at":"2026-08-18T15:07:31.954491Z","submitted_at":"2023-04-07T23:10:39Z","title":"Similarity search in the blink of an eye with compressed indices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04759","snapshot_observed_at":"2026-08-06T20:02:13.167483Z","title":"Similarity search in the blink of an eye with compressed indices,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04256","last_updated":"2025-07-06T06:18:10Z","snapshot_observed_at":"2026-08-18T21:42:25.906986Z","submitted_at":"2025-07-06T06:18:10Z","title":"OneDB: A Distributed Multi-Metric Data Similarity Search System","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:02:13.167483Z"},"links":{"cited_paper":"/paper/2304.04759","citing_paper":"/paper/2507.04256"},"observation_digest":"sha256:28a6d16c9a9400482711b1c4c8b95a91beb5be1fbf482c5a715e6de5b509e302","observation_id":"93ebef47-67de-4b89-bbe6-278d0059dbfa","resolution":{"observed_at":"2026-08-06T20:02:13.167483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04759","last_updated":"2023-07-24T18:10:09Z","snapshot_observed_at":"2026-08-18T15:07:31.954491Z","submitted_at":"2023-04-07T23:10:39Z","title":"Similarity search in the blink of an eye with compressed indices","version":2},"cited_work":{"arxiv_id":"2304.04759","doi":"10.48550/arxiv.2304.04759","metadata_source":"arxiv_reference","pith_arxiv_id":"2304.04759","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Similarity search in the blink of an eye with compressed indices,","venue":"arXiv (Cornell University)","work_id":"dc14ca5e-4004-4560-a6df-a5e4faad08cb","year":2023},"citing_paper":{"arxiv_id":"2602.23342","last_updated":"2026-05-14T05:09:37Z","snapshot_observed_at":"2026-08-13T21:00:17.000306Z","submitted_at":"2026-02-26T18:48:29Z","title":"AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-15T18:44:35.239255Z"},"links":{"cited_paper":"/paper/2304.04759","citing_paper":"/paper/2602.23342"},"observation_digest":"sha256:a0ccacac36bec55386e969e366420bff60e80cf9ef2304a754e4b9ee2f5fd0af","observation_id":"acd566e0-661b-4e21-8318-9a3e64bad671","resolution":{"observed_at":"2026-05-15T18:46:29.437765Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04759","last_updated":"2023-07-24T18:10:09Z","snapshot_observed_at":"2026-08-18T15:07:31.954491Z","submitted_at":"2023-04-07T23:10:39Z","title":"Similarity search in the blink of an eye with compressed indices","version":2},"cited_work":{"arxiv_id":"2304.04759","doi":"10.48550/arxiv.2304.04759","metadata_source":"arxiv_reference","pith_arxiv_id":"2304.04759","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Similarity search in the blink of an eye with compressed indices,","venue":"arXiv (Cornell University)","work_id":"dc14ca5e-4004-4560-a6df-a5e4faad08cb","year":2023},"citing_paper":{"arxiv_id":"2605.25522","last_updated":"2026-05-25T07:22:13Z","snapshot_observed_at":"2026-08-07T10:42:53.213259Z","submitted_at":"2026-05-25T07:22:13Z","title":"Co-Designing Graph-based Approximate Nearest Neighbor Search at Billion Scale for Processing-in-Memory","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T19:51:10.637303Z"},"links":{"cited_paper":"/paper/2304.04759","citing_paper":"/paper/2605.25522"},"observation_digest":"sha256:b283ed85c317283c4e8c2c9b7e87767e6e784dfca1b7e89eb23c0fb6ace84d27","observation_id":"aa042c35-0781-4333-b5fb-5eedf779c905","resolution":{"observed_at":"2026-06-29T19:53:54.950274Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04759","last_updated":"2023-07-24T18:10:09Z","snapshot_observed_at":"2026-08-18T15:07:31.954491Z","submitted_at":"2023-04-07T23:10:39Z","title":"Similarity search in the blink of an eye with compressed indices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04759","snapshot_observed_at":"2026-08-03T12:20:41.801856Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.29173","last_updated":"2026-08-03T06:11:24Z","snapshot_observed_at":"2026-08-17T11:16:39.589566Z","submitted_at":"2026-07-31T08:52:00Z","title":"MERIT: Efficient In-Place Deletion for Dynamic Graph-Based Approximate Nearest Neighbor Indexes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T12:20:41.801856Z"},"links":{"cited_paper":"/paper/2304.04759","citing_paper":"/paper/2607.29173"},"observation_digest":"sha256:6b97bb74eeb7098f2f753e8c6ca103a5b14c39c08b7b7e667f90ef2bcc12a6bc","observation_id":"c80ea40f-6828-4f57-993c-36045284e6a3","resolution":{"observed_at":"2026-08-03T12:20:41.801856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04759","last_updated":"2023-07-24T18:10:09Z","snapshot_observed_at":"2026-08-18T15:07:31.954491Z","submitted_at":"2023-04-07T23:10:39Z","title":"Similarity search in the blink of an eye with compressed indices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04759","snapshot_observed_at":"2026-08-04T03:23:13.321936Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.29173","last_updated":"2026-08-03T06:11:24Z","snapshot_observed_at":"2026-08-17T11:16:39.589566Z","submitted_at":"2026-07-31T08:52:00Z","title":"MERIT: Efficient In-Place Deletion for Dynamic Graph-Based Approximate Nearest Neighbor Indexes","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:13.321936Z"},"links":{"cited_paper":"/paper/2304.04759","citing_paper":"/paper/2607.29173"},"observation_digest":"sha256:2ea0ca4c18c1bcd70abed24ce9e5769c5f8919505499ddf7ce674a5d484ea1a8","observation_id":"534537c0-a237-48ad-ac6b-565e359c6ec9","resolution":{"observed_at":"2026-08-04T03:23:13.321936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2304.04759/citation-record","integrity":"/paper/2304.04759/integrity","json":"/paper/2304.04759/citation-record.json","paper":"/paper/2304.04759"},"outbound":[],"paper":{"arxiv_id":"2304.04759","last_updated":"2023-07-24T18:10:09Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T15:07:31.954491Z","submitted_at":"2023-04-07T23:10:39Z","title":"Similarity search in the blink of an eye with compressed indices"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2304.04759."}