Pith. sign in

Paper Citation Record · LEDGER

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings

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

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

pith.paper-citation-record.v1
2504.16229 v1

Coverage vector

measured 54 of 54 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T11:19:41.152464Z

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

54 of 54 outbound references displayed

  • verified exact1
  • verified fuzzy36
  • unresolved17
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e707f7c3-d8af-402f-b500-892eec0cef57 · outbound

This paper cites k-means++: the advantages of careful seeding.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings k-means++: the advantages of careful seeding

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.766497Z

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-16T11:19:40.938470Z digest=sha256:e1e3dd1729a6bab5cd10a0434acdc32536fcca00baba433c059743c8c9ed5ebd

Observation 53c22501-fb93-4a68-b224-c0ac3ac54550 · outbound

This paper cites Oblivious dimension reduction for k-means: beyond subspaces and the johnson-lindenstrauss lemma.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Oblivious dimension reduction for k-means: beyond subspaces and the johnson-lindenstrauss lemma

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.754876Z

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-16T11:19:40.943695Z digest=sha256:783c445499f8b1516118700183356f812121a39454922cc3562d289c079b10fd

Observation 4eba1ade-4c88-47e1-bb11-b8dfc1a5f6d8 · outbound

This paper cites Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:40.947493Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:40.947493Z digest=sha256:d5e81aa443fe4ad305efb47196c6c71d56c49ee0e49cd77ef72b482583834013

Observation 71f66126-08e5-41e1-8bc0-04e49e82caf5 · outbound

This paper cites Fully dynamic k-clustering with fast update time and small recourse.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Fully dynamic k-clustering with fast update time and small recourse

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.742708Z

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-16T11:19:40.952154Z digest=sha256:51a1031c398d4b56341b1e1ed44b0268feaa148ce7c8b1ee70c618d6a2bb1fc9

Observation b0157c6a-e959-4b6d-86ba-fc38c73513d2 · outbound

This paper cites Fully dynamic k-clustering in O (k) update time.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Fully dynamic k-clustering in O (k) update time

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.731161Z

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-16T11:19:40.956307Z digest=sha256:1078e30963259b2084a499971c47cd97dfd95f0f79e3f5a9fd8b8f4a42a18048

Observation 8bf3d976-f46f-4f7f-ab3e-05da53191fbb · outbound

This paper cites Woodruff, and Samson Zhou.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Woodruff, and Samson Zhou

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:40.960841Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:40.960841Z digest=sha256:670ad2ea5d33674b499ebdc1c6e578ad767959bc35fa1116dc1ceb377315f6e5

Observation aa5dc288-3bf7-4b5e-aec5-61ac43bcbdee · outbound

This paper cites Efficient coreset constructions via sensitivity sampling.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Efficient coreset constructions via sensitivity sampling

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.712206Z

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-16T11:19:40.965655Z digest=sha256:15bb5ff2f82f99c2612cc0633e150d16e1d7a00c1ecb66a56c0f131278f0c883

Observation 01d929ed-1e0f-40d8-ab93-678b396b76cc · outbound

This paper cites Streaming coreset constructions for m -estimators.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Streaming coreset constructions for m -estimators

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.700168Z

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-16T11:19:40.969946Z digest=sha256:c398ffae00c45966eb68602eb55b8854cdc9b65af953cd33f5e71277432a7abe

Observation 2ffab3a9-c7b8-45f4-8c21-78504d8575f2 · outbound

This paper cites Razenshteyn, and David P.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Razenshteyn, and David P

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:40.973538Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:40.973538Z digest=sha256:3a5077e25671bffe799beac10260ee23edf416b124242da9275d784394d97ddc

Observation f5231311-028c-48bd-a255-6a7997de3d8d · outbound

This paper cites an unresolved cited work.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Unresolved cited work

Reference 10

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:19:41.679803Z

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-16T11:19:40.977125Z digest=sha256:6d9998956861c83b34f885418eabb48ea604fba044947b21d4f11a37d55f4900

Observation 67ad7d54-434e-4d9f-af33-c1f794b79817 · outbound

This paper cites Query complexity of least absolute deviation regression via robust uniform convergence.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Query complexity of least absolute deviation regression via robust uniform convergence

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.668000Z

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-16T11:19:40.981137Z digest=sha256:581a590eed506a800f43985135e5fa9db7f7572b50772b67c4aa164ec0ca0fde

Observation 5c24e943-e8f8-41d3-b67b-02dc2ed0da10 · outbound

This paper cites Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.656118Z

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-16T11:19:40.985127Z digest=sha256:cb3e939c6b419445c22421cbe40ce64251ca940bb4f8437ca433118a278253b1

Observation 243f73da-1712-493d-b205-b58135da936d · outbound

This paper cites On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:40.988648Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:40.988648Z digest=sha256:05e4081c7a4c22c353cc04642e8efe8cf19a533a4247fa31ec04cd19c9ce9f1e

Observation 3f126589-c4d1-4d1e-8085-99e5b125e2a1 · outbound

This paper cites Fast and accurate k -means++ via rejection sampling.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Fast and accurate k -means++ via rejection sampling

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.638113Z

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-16T11:19:40.992414Z digest=sha256:b847229184d67025f213755033e717d5a1ebd1ab2c2f83edf310fa6472a57134

Observation fea6aafe-a628-440b-b011-5e2b4be1abfe · outbound

This paper cites Improved coresets for euclidean k-means.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Improved coresets for euclidean k-means

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:40.996765Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:40.996765Z digest=sha256:131c3eab100335ba62bdb2fc8b73129936e6ea8cd9075e358909d946958c508f

Observation 6af3e46b-a510-4644-ae9a-a4f29a60947e · outbound

This paper cites Towards optimal lower bounds for k-median and k-means coresets.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Towards optimal lower bounds for k-median and k-means coresets

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.618747Z

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-16T11:19:41.000306Z digest=sha256:dde4e492067ce5533745302b8c4b70be6bfcc94d15c6b703c605836a118baa8e

Observation c6228811-e6df-46ed-92fd-37b27dc77ac0 · outbound

This paper cites Cohen, Cameron Musco, and Jakub Pachocki.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Cohen, Cameron Musco, and Jakub Pachocki

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.607069Z

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-16T11:19:41.003982Z digest=sha256:b20e0be9848a41ab63ad80a6c90e5e9246f0401703f86aa4726d9331b1de5da0

Observation ea1c0e32-9b5b-4b44-aec9-612f664b3958 · outbound

This paper cites Cohen and Richard Peng.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Cohen and Richard Peng

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.596010Z

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-16T11:19:41.008270Z digest=sha256:20e1bd6a93bbbd3fdeca10bac1d327dd4f2b6a08e8f2fe159eaa42368ee7daea

Observation 8d608852-aa28-4dbd-83cb-ceed2b56bc33 · outbound

This paper cites A new coreset framework for clustering.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings A new coreset framework for clustering

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.585312Z

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-16T11:19:41.012622Z digest=sha256:1cb0a7235e74963a7e10dff8ea80a67a4840fbe7bc8951e4f8e0a56e57e5e4a1

Observation af40a72d-4903-4ba7-9571-8a1ac3337fb0 · outbound

This paper cites Woodruff, and Samson Zhou.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Woodruff, and Samson Zhou

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.573676Z

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-16T11:19:41.018103Z digest=sha256:253b7a32f91b96ba7466d4ee71e0ea18967bb0e1aa827583d749599ca58bd0e8

Observation a1293d6c-db91-4472-831c-b06ce1323092 · outbound

This paper cites Clarkson and David P.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Clarkson and David P

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:41.021982Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:41.021982Z digest=sha256:c32d5790a011ab3fd13486bca5e4ff96db233f7dfb26af6d00a3c3e6483ba54e

Observation 477c47a6-7210-43f7-b8a7-a79a7902fe41 · outbound

This paper cites Clarkson and David P.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Clarkson and David P

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.555655Z

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-16T11:19:41.025925Z digest=sha256:409e51fb5b7b47a2354d246dea1cdb66d25f91fcc8ecdea375b83d51b2af81ed

Observation c963dc9b-0791-4098-b75c-6ba576eec5b5 · outbound

This paper cites Woodruff, and Samson Zhou.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Woodruff, and Samson Zhou

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.544733Z

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-16T11:19:41.029724Z digest=sha256:e4d38c5678429c103c0555b5b925d0b7299fc4ceb668bae00f27d51940665d6b

Observation 0be490e4-9853-4e44-a0ab-87bee4fac0f6 · outbound

This paper cites an unresolved cited work.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Unresolved cited work

Reference 24

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:19:41.533247Z

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-16T11:19:41.034041Z digest=sha256:c7c5d19afeb4bf7eb739428d38aeeb203748017958235b5d920b0133bac32611

Observation 91418b57-9624-402d-b579-d286be2153e3 · outbound

This paper cites Mahoney, and S.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Mahoney, and S

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.520913Z

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-16T11:19:41.037973Z digest=sha256:ced711a57a4a4f0c6e6206ae2997aa1bb4ba050072f76aae9c43604c593b3cff

Observation 0a4a4c0b-f072-404d-aaf9-3d423fa324df · outbound

This paper cites Mahoney, and S.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Mahoney, and S

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:41.042385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:41.042385Z digest=sha256:7f25c9b4ed70e9c073bfcf5fb8b0262cb8c5f349574483a856bc4c70fc1010ac

Observation 528aaa14-2e5e-45ef-83ae-1c64203bbebc · outbound

This paper cites Settling time vs.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Settling time vs

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:41.046392Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:41.046392Z digest=sha256:f4134e0df7acb4a9a747c11d9ededde027180fa54de377c323765b29ed3b9eb0

Observation 756eb882-a541-4514-87bc-5b016576d173 · outbound

This paper cites A unified framework for approximating and clustering data.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings A unified framework for approximating and clustering data

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.496158Z

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-16T11:19:41.050505Z digest=sha256:aba88cd43fc3e4829d013d180bb5586b101e04c8f2efbe539257eb0d18ce67ac

Observation bc60a159-5ee3-454e-86d5-7470020a7cec · outbound

This paper cites Schulman.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Schulman

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.485012Z

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-16T11:19:41.054446Z digest=sha256:8a3d0a0dbbcaf3df37f994bbffa4556d03a7ddd1ad43612ffdbe544ca3e9c41a

Observation dec4c67c-4b22-4549-b013-4baf36b2290e · outbound

This paper cites Simpler Analyses of Local Search Algorithms for Facility Location.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Simpler Analyses of Local Search Algorithms for Facility Location

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:41.058059Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:41.058059Z digest=sha256:91cca9f87f38e5af5223eb0175ef8db4fbb0e6fb0f368b290b9f03e087ed4936

Observation c3404c39-5546-402c-bddb-cfcd1d54b12f · outbound

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

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Smaller coresets for k-median and k-means clustering

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.473143Z

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-16T11:19:41.062843Z digest=sha256:8b7439090e503173f2c6036c224c0325a898f4a8eac2ece94589970d4976d7a4

Observation 170153d0-a6ec-4da2-851a-d9352469a556 · outbound

This paper cites Fully-dynamic coresets.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Fully-dynamic coresets

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.462781Z

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-16T11:19:41.066677Z digest=sha256:f039bacbdbb490bf4c0ad024fecd4c4f4b10ca13397befcbdb7fdabe6fdc8870

Observation 2bfca1b8-712d-489f-beb1-0ee0921c290f · outbound

This paper cites On optimal coreset construction for euclidean (k,z) -clustering, 2023.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings On optimal coreset construction for euclidean (k,z) -clustering, 2023

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.452742Z

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-16T11:19:41.070125Z digest=sha256:972953337c1abd4f83df366babc77196ab326d2c6de6f2a9f72f478b0274089a

Observation b89fff2a-84b7-400c-9f1d-a3f732275e90 · outbound

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

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings On coresets for k-means and k-median clustering

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.441812Z

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-16T11:19:41.074563Z digest=sha256:022c97691a072658afed4f6e0c07265e17e17bd6ddd52aa49b4aba81ef08679c

Observation b806a2b2-cd97-4c22-b85c-edac0cbe68b7 · outbound

This paper cites an unresolved cited work.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Unresolved cited work

Reference 35

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:19:41.430828Z

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-16T11:19:41.077930Z digest=sha256:1fe8314ec532218da78d0127bb67c55a9773252dbdbf124e077990e26affdeee

Observation 00f0d3c6-70f7-439a-9258-5ac96f8af108 · outbound

This paper cites Dimensionality reduction for wasserstein barycenter.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Dimensionality reduction for wasserstein barycenter

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.419396Z

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-16T11:19:41.082236Z digest=sha256:3ad9eb4d596ea405efa9b41443c6a0edae844aed2d802771283762ab2a796d82

Observation 19b5daa7-ddf2-4458-8e7d-1de996554059 · outbound

This paper cites Fast image retrieval via embeddings.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Fast image retrieval via embeddings

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.408211Z

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-16T11:19:41.086550Z digest=sha256:bb5b0839b5b416b4bf12ce0a4fc8ec3929b668d2dcefa39040d2c1a396f9eb08

Observation f372a3d8-272e-40be-9919-4d0ff5a35ed6 · outbound

This paper cites Extensions of lipschitz mappings into a hilbert space.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Extensions of lipschitz mappings into a hilbert space

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.395745Z

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-16T11:19:41.090763Z digest=sha256:f91cfc1a33c1e254613c905618dd2c4e190cf3e8a67353d2ea2e085320ab48c3

Observation c0fe30a9-fcd2-4530-a2f5-c892c9dec031 · outbound

This paper cites Fully dynamic k-means coreset in near-optimal update time.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Fully dynamic k-means coreset in near-optimal update time

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.381820Z

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-16T11:19:41.094424Z digest=sha256:60ecc9f90db8c6fc6ccc29bc1581d5510213f4edc3f39a55d7b7ef5306078f82

Observation e844e460-388e-43a7-a46d-268d9aa7cf11 · outbound

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

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.

source=arxiv_source observed=2026-08-16T11:19:41.097894Z digest=sha256:fea2a74a39ef8518ebba406823e32fc597a49c0a6b74ac9ce08e233d67a45ad4

Observation 8ddf542c-3632-4187-8906-6080210ac62c · outbound

This paper cites Woodruff.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Woodruff

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.370564Z

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-16T11:19:41.102389Z digest=sha256:d3c272df0cf6e9cd93022fa9d7cda73f74963bc22aebbf5923f250d83aecf00d

Observation 69f99dc9-76f7-4e83-9c94-23764b994fb0 · outbound

This paper cites Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:41.106274Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:41.106274Z digest=sha256:1db5a5326ec7fa87187b56f7b4094cf4a0672809243b9f7cc553d4eda3f5b72a

Observation 3fc85162-29b0-4d1c-91a8-9e77b5ae5604 · outbound

This paper cites Meyer, Cameron Musco, Christopher Musco, David P.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Meyer, Cameron Musco, Christopher Musco, David P

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.358678Z

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-16T11:19:41.110994Z digest=sha256:06dd224b6b2c23cb3f0b56b8eb8b023384769386d491257b89b36b14f8e322bb

Observation dea86fb0-98e0-4a8b-8ae7-5e9494beb3d9 · outbound

This paper cites Meyer, Cameron Musco, Christopher Musco, David P.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Meyer, Cameron Musco, Christopher Musco, David P

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.346465Z

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-16T11:19:41.115765Z digest=sha256:7eb38537667084b56c6b5b80550e37394df6c2394d8c5d27145398e1342f5445

Observation 95152697-b962-41bd-af67-b3fca1ba0fe9 · outbound

This paper cites Razenshteyn.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Razenshteyn

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.334025Z

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-16T11:19:41.119189Z digest=sha256:46f913bbf6cb8e8a5532cc4c43cbecc1b86dd27c5fb7f7ba927d959389b5cbc7

Observation 8ae8075b-a530-47b0-9c89-a87ce165e50d · outbound

This paper cites Woodruff, and Taisuke Yasuda.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Woodruff, and Taisuke Yasuda

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.322191Z

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-16T11:19:41.122649Z digest=sha256:c9617d7cd7cbc2a3db053ac6d05a5b88d93f18a151e19633c4792380d26afe44

Observation c29918d7-e002-4636-af5c-c6ce7a999343 · outbound

This paper cites Woodruff, and Samson Zhou.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Woodruff, and Samson Zhou

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.309755Z

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-16T11:19:41.126239Z digest=sha256:571b12ec4b9f6ef5270d70c8159a5a2dd9510d44eaf3f3afa1142de07349322b

Observation c7f5bacb-14f3-4839-9fbe-be486f1ecd51 · outbound

This paper cites L1 regression with lewis weights subsampling.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings L1 regression with lewis weights subsampling

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.297355Z

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-16T11:19:41.129903Z digest=sha256:ef42a519b7678f787a03aa72abab66ccee85d6a834a27a49f1410e6bf350895d

Observation e31680d1-3e0c-44f3-a0f4-214c7fa78051 · outbound

This paper cites Improved approximation algorithms for large matrices via random projections.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Improved approximation algorithms for large matrices via random projections

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.284999Z

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-16T11:19:41.133398Z digest=sha256:9f8cf866d7a1835a52f381f432ab7a978c72bf3ff86fd146d3479675f7672bd0

Observation 5648d5bc-b477-45bd-b85a-fd4d8035a1b0 · outbound

This paper cites Woodruff.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Woodruff

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:41.136876Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:41.136876Z digest=sha256:f4afdac5bddc82b07d480af416e79c2fe8b2797f50a838934b5377260060d0c4

Observation ed43c98a-56df-4c3e-8de6-5527f321263d · outbound

This paper cites Woodruff.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Woodruff

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:41.140427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:41.140427Z digest=sha256:7d2752e8105630912b958419fee3ab561def7b5a803755fd5d23c77a93619edf

Observation 15dc950f-0846-4694-87f2-11aeab436a35 · outbound

This paper cites Woodruff and Taisuke Yasuda.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Woodruff and Taisuke Yasuda

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:41.144142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:41.144142Z digest=sha256:3bf71eb0d0cb1c0d1c3c138d1664ebfc48afb4533af136bf0928aac0c05d5fe6

Observation dac163cb-a4f4-4ce1-9657-301a0b213c73 · outbound

This paper cites Woodruff, Peilin Zhong, and Samson Zhou.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Woodruff, Peilin Zhong, and Samson Zhou

Reference 53

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:19:41.248811Z

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-16T11:19:41.148382Z digest=sha256:23c5629c9de3ee5db9778b84fea1450314332b5c948ba798eee311dae1449b34

Observation 282d1108-b281-464b-99f3-82bcd7527f7d · outbound

This paper cites Space Complexity of Euclidean Clustering.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Space Complexity of Euclidean Clustering

Reference 54

Resolution
verified exact
local_arxiv, observed 2026-08-16T11:19:41.191214Z

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-16T11:19:41.152464Z digest=sha256:651e0415fdf4615ade31389d10d4b40d70e1eab4eca4a0a9b93b35d56fa79176

Pith citing papers

No inbound Pith citation observations are available.