Paper Citation Record · LEDGER

Fully Scalable MPC Algorithms for Euclidean k-Center

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

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

pith.paper-citation-record.v1
2504.16382 v2

Coverage vector

measured 49 of 49 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T11:21:03.198666Z

measured 49 of 49 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 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

49 of 49 outbound references displayed

verified exact14
verified fuzzy8
unresolved27
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation db8e5c67-0f04-41a6-8871-c250eae485f2 · outbound

This paper cites Massively parallel minimum spanning tree in general metric spaces.

Fully Scalable MPC Algorithms for Euclidean k-Center Massively parallel minimum spanning tree in general metric spaces

Reference 2

Resolution: verified exact; doi, observed 2026-08-16T11:21:03.399565Z

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 2ed272d5-7d2a-4462-baa7-fcbc92d66faf · outbound

This paper cites A 2-Approximation Algorithm for Data-Distributed Metric k-Center.

Fully Scalable MPC Algorithms for Euclidean k-Center A 2-Approximation Algorithm for Data-Distributed Metric k-Center

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-08-16T11:21:04.274004Z

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 5d78c367-681a-45ae-a0f0-a8dde58e9b52 · outbound

This paper cites Network decomposition and locality in distributed computation.

Fully Scalable MPC Algorithms for Euclidean k-Center Network decomposition and locality in distributed computation

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.033019Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c561657-399d-4ba9-a5d7-ccadc9de6659 · outbound

This paper cites $k$-Center Clustering with Outliers in the MPC and Streaming Model.

Fully Scalable MPC Algorithms for Euclidean k-Center $k$-Center Clustering with Outliers in the MPC and Streaming Model

Reference 5

Resolution: verified exact; local_arxiv, observed 2026-08-16T11:21:04.206514Z

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 aee54f2d-0d0c-4c3b-ae04-d43188c748a6 · outbound

This paper cites Mirrokni.

Fully Scalable MPC Algorithms for Euclidean k-Center Mirrokni

Reference 6

Resolution: verified exact; doi, observed 2026-08-16T11:21:03.390050Z

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 2e3c6fc1-4897-4ddd-b35e-b79c13da74f8 · outbound

This paper cites Communication steps for parallel query processing.

Fully Scalable MPC Algorithms for Euclidean k-Center Communication steps for parallel query processing

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.045538Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a913dbb-84c1-46e8-abf8-0e02a39bc715 · outbound

This paper cites k -center clustering in distributed models.

Fully Scalable MPC Algorithms for Euclidean k-Center k -center clustering in distributed models

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.049079Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 652562f7-103b-4a64-a042-4817089ba8e3 · outbound

This paper cites Distributed clustering via LSH based data partitioning.

Fully Scalable MPC Algorithms for Euclidean k-Center Distributed clustering via LSH based data partitioning

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:21:04.415797Z

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 a6eba71b-2ca5-4785-beaa-c80664a28c8e · outbound

This paper cites Streaming Facility Location in High Dimension via Geometric Hashing.

Fully Scalable MPC Algorithms for Euclidean k-Center Streaming Facility Location in High Dimension via Geometric Hashing

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.060689Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b238b38b-ecdc-4d46-b02e-cf11cb9993d9 · outbound

This paper cites an unresolved cited work.

Fully Scalable MPC Algorithms for Euclidean k-Center Unresolved cited work

Reference 12

Resolution: verified exact; doi, observed 2026-08-16T11:21:03.368332Z

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 40ec70b7-4b5e-4886-b931-20d529fe7f40 · outbound

This paper cites an unresolved cited work.

Fully Scalable MPC Algorithms for Euclidean k-Center Unresolved cited work

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.067863Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82d2a9e9-1709-4bbf-bed4-8e0fe72cf5f0 · outbound

This paper cites Time and space optimal massively parallel algorithm for the 2-ruling set problem.

Fully Scalable MPC Algorithms for Euclidean k-Center Time and space optimal massively parallel algorithm for the 2-ruling set problem

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.071190Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce8d9929-7e1d-40ec-856b-cb6e994c1841 · outbound

This paper cites Parallel and efficient hierarchical k -median clustering.

Fully Scalable MPC Algorithms for Euclidean k-Center Parallel and efficient hierarchical k -median clustering

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:21:04.404975Z

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 c7a11bf3-da70-4887-9477-bb11505de9cf · outbound

This paper cites Mirrokni, and Peilin Zhong.

Fully Scalable MPC Algorithms for Euclidean k-Center Mirrokni, and Peilin Zhong

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:21:04.394046Z

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 996a71f7-6570-4559-8644-6e59c6108a46 · outbound

This paper cites Solving k-center clustering (with outliers) in mapreduce and streaming, almost as accurately as sequentially.

Fully Scalable MPC Algorithms for Euclidean k-Center Solving k-center clustering (with outliers) in mapreduce and streaming, almost as accurately as sequentially

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:21:04.382334Z

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 37d940ef-3688-422a-8aaf-2d6aa5f60ac8 · outbound

This paper cites MapReduce : Simplified data processing on large clusters.

Fully Scalable MPC Algorithms for Euclidean k-Center MapReduce : Simplified data processing on large clusters

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.084736Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e48e9448-1525-418c-b903-d909e76ee0ec · outbound

This paper cites Fast clustering using MapReduce.

Fully Scalable MPC Algorithms for Euclidean k-Center Fast clustering using MapReduce

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.088432Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32eb5bc9-6baf-449d-a4aa-d691ee9278b4 · outbound

This paper cites Mirrokni, and Peilin Zhong.

Fully Scalable MPC Algorithms for Euclidean k-Center Mirrokni, and Peilin Zhong

Reference 20

Resolution: verified exact; doi, observed 2026-08-16T11:21:03.352225Z

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 622645d5-98aa-4348-8e22-91b83f025604 · outbound

This paper cites Scattering and sparse partitions, and their applications.

Fully Scalable MPC Algorithms for Euclidean k-Center Scattering and sparse partitions, and their applications

Reference 21

Resolution: verified exact; doi, observed 2026-08-16T11:21:03.342561Z

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 32cda7a3-53be-4ade-9101-f59dea44c25d · outbound

This paper cites Improved MPC algorithms for MIS , matching, and coloring on trees and beyond.

Fully Scalable MPC Algorithms for Euclidean k-Center Improved MPC algorithms for MIS , matching, and coloring on trees and beyond

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.097485Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a0ef780-1a83-44cc-947e-94ced717beca · outbound

This paper cites Massively parallel algorithms, 2019.

Fully Scalable MPC Algorithms for Euclidean k-Center Massively parallel algorithms, 2019

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:21:04.371037Z

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 9bf4b429-0b4a-4213-a992-64e4aac5c4ed · outbound

This paper cites Distributed graph algorithms, 2022.

Fully Scalable MPC Algorithms for Euclidean k-Center Distributed graph algorithms, 2022

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:21:04.360531Z

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 01e1790c-dd6c-4aca-b92a-2f7c62070573 · outbound

This paper cites Gonzalez.

Fully Scalable MPC Algorithms for Euclidean k-Center Gonzalez

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.109742Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7885fbf-8669-4fd8-bcd7-2a011b339b97 · outbound

This paper cites Massively parallel ruling set made deterministic.

Fully Scalable MPC Algorithms for Euclidean k-Center Massively parallel ruling set made deterministic

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.113146Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9fbd0668-3c01-48c2-9b47-94af9f70253c · outbound

This paper cites Sorting, Searching, and Simulation in the MapReduce Framework.

Fully Scalable MPC Algorithms for Euclidean k-Center Sorting, Searching, and Simulation in the MapReduce Framework

Reference 28

Resolution: verified exact; local_arxiv, observed 2026-08-16T11:21:03.997487Z

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 f89687f0-e06d-4203-8078-d68091b99217 · outbound

This paper cites Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation.

Fully Scalable MPC Algorithms for Euclidean k-Center Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.120679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6825045f-7b98-4ff8-a037-73deaabdc6a9 · outbound

This paper cites No, coreset, no cry.

Fully Scalable MPC Algorithms for Euclidean k-Center No, coreset, no cry

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.123993Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e2068265-2bf9-4fd5-9067-3c0504e2a82c · outbound

This paper cites On coresets for k -means and k -median clustering.

Fully Scalable MPC Algorithms for Euclidean k-Center On coresets for k -means and k -median clustering

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.127484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5dbc9973-b52f-43d4-8573-6b8c3aee7964 · outbound

This paper cites Hochbaum and David B.

Fully Scalable MPC Algorithms for Euclidean k-Center Hochbaum and David B

Reference 32

Resolution: verified exact; doi, observed 2026-08-16T11:21:03.300039Z

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 4e0f6776-42aa-47cf-bbfd-f514e4baa675 · outbound

This paper cites Hochbaum and David B.

Fully Scalable MPC Algorithms for Euclidean k-Center Hochbaum and David B

Reference 33

Resolution: verified exact; raw_fallback, observed 2026-08-16T11:21:03.924737Z

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 75ee9de1-9d5d-4275-b247-eeb872139141 · outbound

This paper cites Almost optimal massively parallel algorithms for k -center clustering and diversity maximization.

Fully Scalable MPC Algorithms for Euclidean k-Center Almost optimal massively parallel algorithms for k -center clustering and diversity maximization

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.137664Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd1978eb-0580-4034-956b-c995ed031a6d · outbound

This paper cites Dryad: Distributed data-parallel programs from sequential building blocks.

Fully Scalable MPC Algorithms for Euclidean k-Center Dryad: Distributed data-parallel programs from sequential building blocks

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.141023Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d06695f-1d5d-4629-af5c-2f1a209cc014 · outbound

This paper cites Massively parallel computation: Algorithms and applications.

Fully Scalable MPC Algorithms for Euclidean k-Center Massively parallel computation: Algorithms and applications

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.145260Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d3eb907-3769-4246-b6a3-80da3a568994 · outbound

This paper cites Brief announcement: Fast and better distributed mapreduce algorithms for k -center clustering.

Fully Scalable MPC Algorithms for Euclidean k-Center Brief announcement: Fast and better distributed mapreduce algorithms for k -center clustering

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.148813Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7bcb3011-f095-4edd-a43c-cefd21f6cb0b · outbound

This paper cites Pemmaraju, and Ajitanshu Singh.

Fully Scalable MPC Algorithms for Euclidean k-Center Pemmaraju, and Ajitanshu Singh

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.151799Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6b37f948-f2b8-456a-90a8-5b3dcbfa7da3 · outbound

This paper cites Extensions of Lipschitz maps into a Hilbert space.

Fully Scalable MPC Algorithms for Euclidean k-Center Extensions of Lipschitz maps into a Hilbert space

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.155253Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b685ccd-8c6f-43f7-a637-3a7c94f6695c · outbound

This paper cites Universal approximations for TSP , Steiner tree, and set cover.

Fully Scalable MPC Algorithms for Euclidean k-Center Universal approximations for TSP , Steiner tree, and set cover

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.158903Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7302e847-19de-435a-9dde-cd1d3a106a5f · outbound

This paper cites Massively parallel algorithms for high-dimensional Euclidean minimum spanning tree.

Fully Scalable MPC Algorithms for Euclidean k-Center Massively parallel algorithms for high-dimensional Euclidean minimum spanning tree

Reference 41

Resolution: verified exact; doi, observed 2026-08-16T11:21:03.277010Z

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 2ac3b33d-0cf0-4684-84ec-e0d0ca7fefe0 · outbound

This paper cites Karloff, Siddharth Suri, and Sergei Vassilvitskii.

Fully Scalable MPC Algorithms for Euclidean k-Center Karloff, Siddharth Suri, and Sergei Vassilvitskii

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.166203Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cefa361b-506e-42d8-88f6-76024a41f427 · outbound

This paper cites Improved approximation algorithm for the distributed lower-bounded k -center problem.

Fully Scalable MPC Algorithms for Euclidean k-Center Improved approximation algorithm for the distributed lower-bounded k -center problem

Reference 43

Resolution: verified exact; doi, observed 2026-08-16T11:21:03.255992Z

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 ce6381cf-cd58-4991-ae8b-b1a89aafe3df · outbound

This paper cites A simple parallel algorithm for the maximal independent set problem.

Fully Scalable MPC Algorithms for Euclidean k-Center A simple parallel algorithm for the maximal independent set problem

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.173461Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcd20380-4d12-41ee-bfb7-96f0883054fa · outbound

This paper cites Kusner, Wenlin Chen, Kilian Q.

Fully Scalable MPC Algorithms for Euclidean k-Center Kusner, Wenlin Chen, Kilian Q

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:21:04.350827Z

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 efd21560-bf1a-4b9a-8c11-6fc3dcf02242 · outbound

This paper cites Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space.

Fully Scalable MPC Algorithms for Euclidean k-Center Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.179204Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5fafd1d0-d54c-4b39-ae42-f6a87e42cfe4 · outbound

This paper cites Empirical Processes: Theory and Applications , chapter 4: Packing and Covering in Euclidean Spaces, pages 14--20.

Fully Scalable MPC Algorithms for Euclidean k-Center Empirical Processes: Theory and Applications , chapter 4: Packing and Covering in Euclidean Spaces, pages 14--20

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.182185Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3caedcea-ec67-4860-823f-1ed9824f3265 · outbound

This paper cites Polylogarithmic-time deterministic network decomposition and distributed derandomization.

Fully Scalable MPC Algorithms for Euclidean k-Center Polylogarithmic-time deterministic network decomposition and distributed derandomization

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.184881Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation caa29fa8-7b29-4856-9bc7-3b12264fba36 · outbound

This paper cites an unresolved cited work.

Fully Scalable MPC Algorithms for Euclidean k-Center Unresolved cited work

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-16T11:21:03.187659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5d213d5-8d64-4054-8d8f-af7c63bbd469 · outbound

This paper cites An optimal maximal independent set algorithm for bounded-independence graphs.

Fully Scalable MPC Algorithms for Euclidean k-Center An optimal maximal independent set algorithm for bounded-independence graphs

Reference 50

Resolution: verified exact; doi, observed 2026-08-16T11:21:03.234201Z

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 b697263c-4d95-4a05-ba3d-814843135d95 · outbound

This paper cites Hadoop: The Definitive Guide.

Fully Scalable MPC Algorithms for Euclidean k-Center Hadoop: The Definitive Guide

Reference 51

Resolution: verified exact; raw_fallback, observed 2026-08-16T11:21:03.460954Z

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 7324d0b8-e719-4054-9164-f0edbe7ddd98 · outbound

This paper cites Franklin, Scott Shenker, and Ion Stoica.

Fully Scalable MPC Algorithms for Euclidean k-Center Franklin, Scott Shenker, and Ion Stoica

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:21:04.339113Z

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.