Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2407.11217.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-16T11:19:41.097894Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-07-09T05:36:01.273201Z
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 1572407d-75c1-46ab-8d1d-a931c388bb37 · inbound
Faster Approximation Algorithms for k-Center via Data Reduction cites this paper.
Faster Approximation Algorithms for k-Center via Data Reduction Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
Reference 35
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T17:47:03.026170Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e844e460-388e-43a7-a46d-268d9aa7cf11 · inbound
Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings cites this paper.
Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
Reference 40
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:19:41.097894Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation afff5cf9-091d-4cd4-b3bf-267ba394e50c · inbound
Faster Randomized and Deterministic k-Clustering on Graphs cites this paper.
Faster Randomized and Deterministic k-Clustering on Graphs Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
Reference 43
- Resolution
- verified exact
- local_arxiv, observed 2026-07-09T05:36:01.276322Z
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.