Pith. sign in

Paper Citation Record · LEDGER

Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data

As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1802.00459.

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

pith.paper-citation-record.v1
1802.00459 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-08T12:08:16.088201Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T16:18:21.697769Z

Reference resolution

0 of 0 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation fa4b4756-40a1-4b32-8164-79287e850a21 · inbound

Coresets for Robust Clustering via Black-box Reductions to Vanilla Case cites this paper.

Coresets for Robust Clustering via Black-box Reductions to Vanilla Case Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-08T12:08:16.088201Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T12:08:16.088201Z digest=sha256:4dd9ce752238665177d33421587d06192a5ae16c52c40ab6c86436e8a2e76273

Observation 777c2475-a9ad-482a-b5f8-4c91aca176c1 · inbound

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem cites this paper.

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data

Reference 43

Resolution
metadata mismatch
local_arxiv, observed 2026-08-06T16:18:21.811376Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-06T16:18:21.583437Z digest=sha256:f2782c155e4aa828f16c9095d7c67fd747f76a266cbcc1c61d1a985ff426b2a6