Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T16:18:21.583437Z
Paper Citation Record · LEDGER
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
As of 17 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2507.14089.
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
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
43 of 43 outbound references displayed
- verified exact0
- verified fuzzy37
- unresolved5
- parse uncertain0
- malformed identifier0
- metadata mismatch1
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 844de8c1-31b8-48d9-8c1b-9b1ddf96b1d5 · outbound
This paper cites an unresolved cited work.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Unresolved cited work
Reference 1
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T16:18:31.257471Z
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.
Observation 83c2ca94-c5b7-4100-99c8-3321f5656ecb · outbound
This paper cites Awerbuch, A.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Awerbuch, A
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:31.113513Z
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.
Observation f7fcb878-bcf2-4b6b-9c6b-73118643fdde · outbound
This paper cites Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:30.828788Z
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.
Observation c81ceef7-998f-4f2d-a947-27ba4f45dbb3 · outbound
This paper cites Streaming k-means approximation.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Streaming k-means approximation
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:30.504204Z
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.
Observation be496cda-aa28-4c14-8e99-ad84935093fe · outbound
This paper cites Better guarantees for \ k\ -means and euclidean \ k\ -median by primal-dual algorithms.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Better guarantees for \ k\ -means and euclidean \ k\ -median by primal-dual algorithms
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:30.239467Z
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.
Observation cb03af5e-e6da-4b01-abf7-6c11ddceb353 · outbound
This paper cites Oblivious dimension reduction for k-means: beyond subspaces and the johnson-lindenstrauss lemma.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Oblivious dimension reduction for k-means: beyond subspaces and the johnson-lindenstrauss lemma
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:30.014350Z
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.
Observation ae061f2b-2f6e-4318-8f9e-25c8b6c72a00 · outbound
This paper cites Distributed k-means and k-median clustering on general topologies.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Distributed k-means and k-median clustering on general topologies
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:29.808384Z
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.
Observation e7f26bb7-032b-4ac7-978e-28280c1d5279 · outbound
This paper cites Node and edge averaged complexities of local graph problems.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Node and edge averaged complexities of local graph problems
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:29.561222Z
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.
Observation a23a0c64-0969-487d-ab1c-a16e6191bfcb · outbound
This paper cites Blelloch, Anupam Gupta, and Kanat Tangwongsan.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Blelloch, Anupam Gupta, and Kanat Tangwongsan
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:29.372181Z
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.
Observation 9ea24b59-b1b7-4ef9-a462-c77dff2ab4c3 · outbound
This paper cites Efficient k-anonymization using clustering techniques.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Efficient k-anonymization using clustering techniques
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:29.158833Z
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.
Observation 2e7b30a6-f757-4e55-a54a-d9f3332b062c · outbound
This paper cites Scalable k-means clustering via lightweight coresets.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Scalable k-means clustering via lightweight coresets
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:28.933691Z
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.
Observation c1544c45-35f2-4236-b4ac-06ddf7eee528 · outbound
This paper cites Blelloch and Kanat Tangwongsan.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Blelloch and Kanat Tangwongsan
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:28.676813Z
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.
Observation bf6e2507-1f32-4a99-9fd5-977a97885787 · outbound
This paper cites Distributed clustering via LSH based data partitioning.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Distributed clustering via LSH based data partitioning
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:28.384214Z
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.
Observation a004bda0-aa5e-43de-9f7e-010b4f7f7402 · outbound
This paper cites Breaching the 2 LMP approximation barrier for facility location with applications to k -median.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Breaching the 2 LMP approximation barrier for facility location with applications to k -median
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:28.099815Z
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.
Observation dd1f96c4-1802-433c-84f3-afc93a8de9cc · outbound
This paper cites Near-optimal private and scalable k -clustering.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Near-optimal private and scalable k -clustering
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:27.909140Z
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.
Observation 0c932541-db52-43fe-9add-8a404eeef097 · outbound
This paper cites an unresolved cited work.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Unresolved cited work
Reference 16
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T16:18:27.559927Z
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.
Observation d1392b1b-c59f-4f2b-96c7-6df21f227b06 · outbound
This paper cites an unresolved cited work.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Unresolved cited work
Reference 17
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T16:18:27.251559Z
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.
Observation c308941a-4d5b-404d-835b-91b468755403 · outbound
This paper cites Online k-means clustering.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Online k-means clustering
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:27.048830Z
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.
Observation 8c2e9797-e065-4bd4-b4d3-8f0bafa6b66d · outbound
This paper cites Jiang, Robert Krauthgamer, Pavel Veselý, and Mingwei Yang.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Jiang, Robert Krauthgamer, Pavel Veselý, and Mingwei Yang
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:26.718155Z
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.
Observation 92727a96-99fe-47ce-9ffe-9957ee9a1526 · outbound
This paper cites Time and space optimal massively parallel algorithm for the 2-ruling set problem.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Time and space optimal massively parallel algorithm for the 2-ruling set problem
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:26.421764Z
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.
Observation 8c8273d1-ff76-4d23-9dde-490b9e12d3bf · outbound
This paper cites Parallel and efficient hierarchical k-median clustering.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Parallel and efficient hierarchical k-median clustering
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:26.208620Z
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.
Observation b21031b3-c331-4788-9886-4f275a407a42 · outbound
This paper cites Mirrokni, and Peilin Zhong.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Mirrokni, and Peilin Zhong
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:25.973278Z
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.
Observation 47e65763-eb42-480d-b01b-36a70066771c · outbound
This paper cites Better streaming algorithms for clustering problems.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Better streaming algorithms for clustering problems
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:25.681179Z
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.
Observation 1ae61768-b6b1-4d31-85c0-b1aadeca199d · outbound
This paper cites Mirrokni.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Mirrokni
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:25.473399Z
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.
Observation 134a389e-d927-4598-b769-4cc3f9b30125 · outbound
This paper cites Fast clustering using mapreduce.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Fast clustering using mapreduce
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:25.129721Z
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.
Observation 498765fd-9705-4501-874e-78b004b3adbd · outbound
This paper cites Ghaffari.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Ghaffari
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:24.898172Z
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.
Observation 74414436-4d8c-459b-8748-93d72797c47e · outbound
This paper cites Massively parallel ruling set made deterministic.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Massively parallel ruling set made deterministic
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:24.733551Z
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.
Observation eb4c6a23-1ed6-46fa-a946-370cb15e4524 · outbound
This paper cites Goodrich, Nodari Sitchinava, and Qin Zhang.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Goodrich, Nodari Sitchinava, and Qin Zhang
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:24.612513Z
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.
Observation 1ad405ce-7d2a-40c8-a6a0-bf00bb9460f7 · outbound
This paper cites Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:24.360416Z
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.
Observation e3e36943-7ca1-48cd-993f-ed443f1335b8 · outbound
This paper cites Massively parallel computation: A lgorithms and applications.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Massively parallel computation: A lgorithms and applications
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:24.111534Z
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.
Observation 77e0c870-f990-4285-b5f2-0ed57c05cc8a · outbound
This paper cites Nearest neighbors in high-dimensional spaces.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Nearest neighbors in high-dimensional spaces
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:23.911873Z
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.
Observation 04c0e060-3f29-471c-afd7-f758fee9719e · outbound
This paper cites Vazirani.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Vazirani
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:23.751014Z
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.
Observation a231c319-f22a-44a2-9088-a1b462cb1b4d · outbound
This paper cites Deterministic distributed ruling sets of line graphs.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Deterministic distributed ruling sets of line graphs
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:23.636942Z
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.
Observation da7ab2ca-780c-497e-b1fd-2240b20972ce · outbound
This paper cites Kothapalli and S.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Kothapalli and S
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:23.455437Z
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.
Observation 7c300c5f-048d-4e53-9392-09721af6d368 · outbound
This paper cites Pemmaraju.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Pemmaraju
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:23.287821Z
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.
Observation 1d2a64d8-747e-4b53-9c2a-4174ea5714fd · outbound
This paper cites Karloff, Siddharth Suri, and Sergei Vassilvitskii.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Karloff, Siddharth Suri, and Sergei Vassilvitskii
Reference 36
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:23.104185Z
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.
Observation c4128765-1eb8-481f-81e5-08a2c965a6df · outbound
This paper cites Least squares quantization in pcm.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Least squares quantization in pcm
Reference 37
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:22.981223Z
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.
Observation ea31001a-a72c-46e2-8112-00d5cd625313 · outbound
This paper cites an unresolved cited work.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Unresolved cited work
Reference 38
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T16:18:22.809520Z
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.
Observation 737eaa32-99bf-42c6-9a69-754c3880bd03 · outbound
This paper cites Quantizing for minimum distortion.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Quantizing for minimum distortion
Reference 39
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:22.618170Z
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.
Observation d57f4445-9248-4d2d-874a-d15e7f817a3c · outbound
This paper cites Online facility location.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Online facility location
Reference 40
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:22.397189Z
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.
Observation 6e57d935-d388-4c43-8a2a-13864b0ee303 · outbound
This paper cites Fast distributed algorithms for computing separable functions.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Fast distributed algorithms for computing separable functions
Reference 41
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T16:18:22.210738Z
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.
Observation 21c00e1c-0507-4726-92fc-c7ceb147ac8f · outbound
This paper cites an unresolved cited work.
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem Unresolved cited work
Reference 42
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T16:18:22.028895Z
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.
Observation 777c2475-a9ad-482a-b5f8-4c91aca176c1 · outbound
This paper cites Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data.
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.
Pith citing papers
No inbound Pith citation observations are available.