Pith. sign in

Paper Citation Record · LEDGER

Similarity search in the blink of an eye with compressed indices

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2304.04759 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 9 of 9 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 9 of 9 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T22:17:12.239748Z

measured 1 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

1
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 223f7644-9363-4d5b-9aac-675e1621e7fc · inbound

SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search cites this paper.

SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search Similarity search in the blink of an eye with compressed indices

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-12T17:53:50.356460Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T17:53:50.356460Z digest=sha256:43f96d56b79b8a72d2c00cfe1b3d0763b23723ad05e6c635f21db2c33304b018

Observation 9efa0b5e-cf7f-4eb4-805d-a847734ef44b · inbound

Arctic-Embed 2.0: Multilingual Retrieval Without Compromise cites this paper.

Arctic-Embed 2.0: Multilingual Retrieval Without Compromise Similarity search in the blink of an eye with compressed indices

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-11T23:04:03.970682Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:04:03.970682Z digest=sha256:efea2f149699fd638cd4c06e7e9c3b024bb7b67ce5218f9c58be80977ad343f5

Observation 77a81780-758d-49f8-9f1c-ce3f0a4d8ac4 · inbound

CHASE: A Native Relational Database for Hybrid Queries on Structured and Unstructured Data cites this paper.

CHASE: A Native Relational Database for Hybrid Queries on Structured and Unstructured Data Similarity search in the blink of an eye with compressed indices

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-10T21:24:21.234262Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T21:24:21.234262Z digest=sha256:e8323cd11cdf25e425eb53f2cda42ae750f98a092766081170277705434f0c18

Observation 8df13c7c-9644-4c1c-9e2c-f1d6d60d4750 · inbound

Bang for the Buck: Vector Search on Cloud CPUs cites this paper.

Bang for the Buck: Vector Search on Cloud CPUs Similarity search in the blink of an eye with compressed indices

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-15T22:17:12.239748Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T22:17:12.239748Z digest=sha256:1728fccf99027adb8740b7bb4f3abd5b7462ad54c2822f03a2373714a0d33312

Observation 93ebef47-67de-4b89-bbe6-278d0059dbfa · inbound

OneDB: A Distributed Multi-Metric Data Similarity Search System cites this paper.

OneDB: A Distributed Multi-Metric Data Similarity Search System Similarity search in the blink of an eye with compressed indices

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-06T20:02:13.167483Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:02:13.167483Z digest=sha256:28a6d16c9a9400482711b1c4c8b95a91beb5be1fbf482c5a715e6de5b509e302

Observation acd566e0-661b-4e21-8318-9a3e64bad671 · inbound

AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search cites this paper.

AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search Similarity search in the blink of an eye with compressed indices

Reference 1

Resolution
verified exact
arxiv_id, observed 2026-05-15T18:46:29.437765Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-05-15T18:44:35.239255Z digest=sha256:a0ccacac36bec55386e969e366420bff60e80cf9ef2304a754e4b9ee2f5fd0af

Observation aa042c35-0781-4333-b5fb-5eedf779c905 · inbound

Co-Designing Graph-based Approximate Nearest Neighbor Search at Billion Scale for Processing-in-Memory cites this paper.

Co-Designing Graph-based Approximate Nearest Neighbor Search at Billion Scale for Processing-in-Memory Similarity search in the blink of an eye with compressed indices

Reference 1

Resolution
verified exact
arxiv_id, observed 2026-06-29T19:53:54.950274Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-06-29T19:51:10.637303Z digest=sha256:b283ed85c317283c4e8c2c9b7e87767e6e784dfca1b7e89eb23c0fb6ace84d27

Observation c80ea40f-6828-4f57-993c-36045284e6a3 · inbound

MERIT: Efficient In-Place Deletion for Dynamic Graph-Based Approximate Nearest Neighbor Indexes cites this paper.

MERIT: Efficient In-Place Deletion for Dynamic Graph-Based Approximate Nearest Neighbor Indexes Similarity search in the blink of an eye with compressed indices

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-03T12:20:41.801856Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T12:20:41.801856Z digest=sha256:94f1e22475c6766dcd306d5f4ecde7a4da018d5864473c55f9c138bb9170b9eb

Observation 534537c0-a237-48ad-ac6b-565e359c6ec9 · inbound

MERIT: Efficient In-Place Deletion for Dynamic Graph-Based Approximate Nearest Neighbor Indexes cites this paper.

MERIT: Efficient In-Place Deletion for Dynamic Graph-Based Approximate Nearest Neighbor Indexes Similarity search in the blink of an eye with compressed indices

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-04T03:23:13.321936Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T03:23:13.321936Z digest=sha256:9d298561765fcbeffa8c6cec07f1afa344880e3d6c7607081a4e27a14c98fb2b