Paper Citation Record · LEDGER

Faster Approximation Algorithms for k-Center via Data Reduction

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

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

pith.paper-citation-record.v1
2502.05888 v1

Coverage vector

measured 41 of 41 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T17:47:03.053543Z

measured 41 of 41 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

41 of 41 outbound references displayed

verified exact0
verified fuzzy21
unresolved20
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation daec0138-e8f6-4f86-9f6d-f3cff95aaab6 · outbound

This paper cites Emiris, Loukas Kavouras, and Ioannis Psarros.

Faster Approximation Algorithms for k-Center via Data Reduction Emiris, Loukas Kavouras, and Ioannis Psarros

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.620946Z

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 8fa17f31-9cb9-4fec-893a-dac96b2b92c4 · outbound

This paper cites Agarwal, Sariel Har - Peled, and Kasturi R.

Faster Approximation Algorithms for k-Center via Data Reduction Agarwal, Sariel Har - Peled, and Kasturi R

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:02.874181Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 03dae84d-9d2e-4dce-b063-1272371e6050 · outbound

This paper cites Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions.

Faster Approximation Algorithms for k-Center via Data Reduction Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.595621Z

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 2f07e46b-bae0-4d10-b5b5-c4425b8d5c6f · outbound

This paper cites Reporting neighbors in high-dimensional euclidean space.

Faster Approximation Algorithms for k-Center via Data Reduction Reporting neighbors in high-dimensional euclidean space

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.581110Z

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 8e7832d9-72c5-46c6-9b82-253775abda0c · outbound

This paper cites Ellis Hershkowitz, and Rajmohan Rajaraman.

Faster Approximation Algorithms for k-Center via Data Reduction Ellis Hershkowitz, and Rajmohan Rajaraman

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.566397Z

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 1daec34d-6870-4360-9fe1-9a4a6df6b937 · outbound

This paper cites Split and join: Strong partitions and universal steiner trees for graphs.

Faster Approximation Algorithms for k-Center via Data Reduction Split and join: Strong partitions and universal steiner trees for graphs

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.551604Z

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 7cfbd905-2896-4b56-8789-f461c0d309d2 · outbound

This paper cites Mirrokni.

Faster Approximation Algorithms for k-Center via Data Reduction Mirrokni

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.536099Z

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 7099bc47-5acc-4493-9832-ca4793f06106 · outbound

This paper cites Distributed k-means and k-median clustering on general communication topologies.

Faster Approximation Algorithms for k-Center via Data Reduction Distributed k-means and k-median clustering on general communication topologies

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:02.903636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54edd68a-1c49-4587-908a-40e288b7ba3c · outbound

This paper cites an unresolved cited work.

Faster Approximation Algorithms for k-Center via Data Reduction Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:02.907738Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c06349d-1804-4dbc-a527-e302de612f04 · outbound

This paper cites Covertype.

Faster Approximation Algorithms for k-Center via Data Reduction Covertype

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:02.912570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c20814ac-dd1c-482a-94ae-ed1ec2beea08 · outbound

This paper cites On parallel k-center clustering.

Faster Approximation Algorithms for k-Center via Data Reduction On parallel k-center clustering

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.502861Z

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 5732b42c-a928-48c3-a009-a2670c8949dc · outbound

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

Faster Approximation Algorithms for k-Center via Data Reduction Streaming Facility Location in High Dimension via Geometric Hashing

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:02.922470Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 50481fd7-1470-4625-859a-05936e80362d · outbound

This paper cites an unresolved cited work.

Faster Approximation Algorithms for k-Center via Data Reduction Unresolved cited work

Reference 13

Resolution: unresolved; raw_fallback, observed 2026-08-08T17:47:03.487938Z

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 e1ca5f7d-dd42-4507-8b95-ec38114cef43 · outbound

This paper cites an unresolved cited work.

Faster Approximation Algorithms for k-Center via Data Reduction Unresolved cited work

Reference 14

Resolution: unresolved; raw_fallback, observed 2026-08-08T17:47:03.472135Z

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 36957b74-898e-48c1-908f-2abf643007ac · outbound

This paper cites an unresolved cited work.

Faster Approximation Algorithms for k-Center via Data Reduction Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:02.936774Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5fb36755-9540-426c-82ae-165632a83c0f · outbound

This paper cites Streaming algorithms for robust distinct elements.

Faster Approximation Algorithms for k-Center via Data Reduction Streaming algorithms for robust distinct elements

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.447798Z

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 23d02388-4fb3-419f-a354-59e9ed818996 · outbound

This paper cites Data fusion: resolving data conflicts for integration.

Faster Approximation Algorithms for k-Center via Data Reduction Data fusion: resolving data conflicts for integration

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.432645Z

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 ba9926a4-9e4e-4fc8-bc8c-d0e6e8487242 · outbound

This paper cites Approximate greedy clustering and distance selection for graph metrics.

Faster Approximation Algorithms for k-Center via Data Reduction Approximate greedy clustering and distance selection for graph metrics

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.416697Z

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 8f0ea391-2e4a-4441-adaa-7ef06b437993 · outbound

This paper cites Fast clustering using mapreduce.

Faster Approximation Algorithms for k-Center via Data Reduction Fast clustering using mapreduce

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.402978Z

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 a6679058-3e06-481d-b683-609d95c13416 · outbound

This paper cites an unresolved cited work.

Faster Approximation Algorithms for k-Center via Data Reduction Unresolved cited work

Reference 20

Resolution: unresolved; raw_fallback, observed 2026-08-08T17:47:03.388913Z

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 77b14b6e-4723-47e3-a46b-c4a77fecee70 · outbound

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

Faster Approximation Algorithms for k-Center via Data Reduction Scattering and sparse partitions, and their applications

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.374527Z

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 0bfaae38-3009-4889-b367-a24058a0ae3e · outbound

This paper cites A PTAS for k-means clustering based on weak coresets.

Faster Approximation Algorithms for k-Center via Data Reduction A PTAS for k-means clustering based on weak coresets

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.359964Z

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 60fc7aad-e687-4057-890a-5c23aa1007cb · outbound

This paper cites Gonzalez.

Faster Approximation Algorithms for k-Center via Data Reduction Gonzalez

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:02.972809Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bda099e9-383e-4fd2-a134-6083c2c839c6 · outbound

This paper cites an unresolved cited work.

Faster Approximation Algorithms for k-Center via Data Reduction Unresolved cited work

Reference 24

Resolution: unresolved; raw_fallback, observed 2026-08-08T17:47:03.336432Z

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 35398bde-2ece-4b01-b6fd-4402c79bfa32 · outbound

This paper cites Fully-dynamic coresets.

Faster Approximation Algorithms for k-Center via Data Reduction Fully-dynamic coresets

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:02.981775Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bacb1de1-53c8-4f0d-ad46-36e827e26903 · outbound

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

Faster Approximation Algorithms for k-Center via Data Reduction On coresets for k-means and k-median clustering

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.311861Z

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 2852d5f7-e0db-4d6f-a1c2-446caf8089d8 · outbound

This paper cites Hochbaum and David B.

Faster Approximation Algorithms for k-Center via Data Reduction Hochbaum and David B

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.295691Z

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 24064cf4-e675-4c82-b38d-48b29b24a472 · outbound

This paper cites Hochbaum and David B.

Faster Approximation Algorithms for k-Center via Data Reduction Hochbaum and David B

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.280765Z

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 d2a2d8af-96cc-4cb6-8ab2-b6399d3bafa4 · outbound

This paper cites Data quality and record linkage techniques , volume 1.

Faster Approximation Algorithms for k-Center via Data Reduction Data quality and record linkage techniques , volume 1

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.266120Z

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 086f808e-20ab-418d-95c7-4a963b40f571 · outbound

This paper cites Product quantization for nearest neighbor search.

Faster Approximation Algorithms for k-Center via Data Reduction Product quantization for nearest neighbor search

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.251902Z

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 8067673d-1550-4202-b312-710b89772aa4 · outbound

This paper cites an unresolved cited work.

Faster Approximation Algorithms for k-Center via Data Reduction Unresolved cited work

Reference 31

Resolution: unresolved; raw_fallback, observed 2026-08-08T17:47:03.236886Z

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 56cb8c36-c6dd-4079-9059-6f142dcd74ca · outbound

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

Faster Approximation Algorithms for k-Center via Data Reduction Extensions of Lipschitz maps into a Hilbert space

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:03.012605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d1c64d1-69df-4a87-a063-d4bf8688cd11 · outbound

This paper cites Universal approximations for tsp, steiner tree, and set cover.

Faster Approximation Algorithms for k-Center via Data Reduction Universal approximations for tsp, steiner tree, and set cover

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:03.017173Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa6d2fca-2fb1-4379-b0bf-d825bd988fd8 · outbound

This paper cites Record linkage: similarity measures and algorithms.

Faster Approximation Algorithms for k-Center via Data Reduction Record linkage: similarity measures and algorithms

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.213634Z

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 1572407d-75c1-46ab-8d1d-a931c388bb37 · outbound

This paper cites Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means.

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 d108bd05-74da-44d0-bb35-51427f796573 · outbound

This paper cites Coresets-methods and history: A theoreticians design pattern for approximation and streaming algorithms.

Faster Approximation Algorithms for k-Center via Data Reduction Coresets-methods and history: A theoreticians design pattern for approximation and streaming algorithms

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:03.031190Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c5448e9-92ce-4764-9ab0-5ce67e3d4970 · outbound

This paper cites New results on the complexity of p-center problems.

Faster Approximation Algorithms for k-Center via Data Reduction New results on the complexity of p-center problems

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.189944Z

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 369d9b10-867c-4e63-a206-814291028502 · outbound

This paper cites US Census Data (1990).

Faster Approximation Algorithms for k-Center via Data Reduction US Census Data (1990)

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:03.040274Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 509f0c23-6ea5-44ed-8de4-4f8fee88a66b · outbound

This paper cites KDD Cup 1999 Data.

Faster Approximation Algorithms for k-Center via Data Reduction KDD Cup 1999 Data

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:03.044799Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e732c46c-69f1-4afe-a1ff-a635bc3bcb58 · outbound

This paper cites High-Dimensional Probability: An Introduction with Applications in Data Science.

Faster Approximation Algorithms for k-Center via Data Reduction High-Dimensional Probability: An Introduction with Applications in Data Science

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:47:03.174782Z

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 fb5974c2-67d3-4b37-850f-3b4c0cad6183 · outbound

This paper cites Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms.

Faster Approximation Algorithms for k-Center via Data Reduction Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-08T17:47:03.053543Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.