{"as_of":"2026-08-17T22:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdd49b4a771e2045067c697b4912d5f54e51bfc6123a1babba89c53823f7a9f5","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:19:41.152464Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.16229/citation-record","integrity":"/paper/2504.16229/integrity","json":"/paper/2504.16229/citation-record.json","paper":"/paper/2504.16229"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.762671Z","title":"k-means++: the advantages of careful seeding","venue":null,"work_id":"5c7cfe22-cd52-428f-a9fb-85f8861c16e1","year":2007},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.938470Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:e1e3dd1729a6bab5cd10a0434acdc32536fcca00baba433c059743c8c9ed5ebd","observation_id":"e707f7c3-d8af-402f-b500-892eec0cef57","resolution":{"observed_at":"2026-08-16T11:19:41.766497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.750672Z","title":"Oblivious dimension reduction for k-means: beyond subspaces and the johnson-lindenstrauss lemma","venue":null,"work_id":"30b4ff9c-edaa-4ebb-a1f0-ece62adda246","year":2019},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.943695Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:783c445499f8b1516118700183356f812121a39454922cc3562d289c079b10fd","observation_id":"53c22501-fb93-4a68-b224-c0ac3ac54550","resolution":{"observed_at":"2026-08-16T11:19:41.754876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03121","last_updated":"2024-11-05T14:08:43Z","snapshot_observed_at":"2026-08-16T19:22:49.096250Z","submitted_at":"2024-11-05T14:08:43Z","title":"Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03121","snapshot_observed_at":"2026-08-16T11:19:40.947493Z","title":"Fully dynamic k-median with near-optimal update time and recourse","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.947493Z"},"links":{"cited_paper":"/paper/2411.03121","citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:d5e81aa443fe4ad305efb47196c6c71d56c49ee0e49cd77ef72b482583834013","observation_id":"4eba1ade-4c88-47e1-bb11-b8dfc1a5f6d8","resolution":{"observed_at":"2026-08-16T11:19:40.947493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.738853Z","title":"Fully dynamic k-clustering with fast update time and small recourse","venue":null,"work_id":"96657745-0fd3-496b-95b5-b732f3880965","year":2024},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.952154Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:51a1031c398d4b56341b1e1ed44b0268feaa148ce7c8b1ee70c618d6a2bb1fc9","observation_id":"71f66126-08e5-41e1-8bc0-04e49e82caf5","resolution":{"observed_at":"2026-08-16T11:19:41.742708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.727323Z","title":"Fully dynamic k-clustering in O (k) update time","venue":null,"work_id":"33aa7a1b-c0ab-4dff-87a1-39f980be9642","year":2023},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.956307Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:1078e30963259b2084a499971c47cd97dfd95f0f79e3f5a9fd8b8f4a42a18048","observation_id":"b0157c6a-e959-4b6d-86ba-fc38c73513d2","resolution":{"observed_at":"2026-08-16T11:19:41.731161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:40.960841Z","title":"Woodruff, and Samson Zhou","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.960841Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:670ad2ea5d33674b499ebdc1c6e578ad767959bc35fa1116dc1ceb377315f6e5","observation_id":"8bf3d976-f46f-4f7f-ab3e-05da53191fbb","resolution":{"observed_at":"2026-08-16T11:19:40.960841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.707855Z","title":"Efficient coreset constructions via sensitivity sampling","venue":null,"work_id":"54efb075-b077-4aea-9dea-5f6617d4f7d1","year":2021},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.965655Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:15bb5ff2f82f99c2612cc0633e150d16e1d7a00c1ecb66a56c0f131278f0c883","observation_id":"aa5dc288-3bf7-4b5e-aec5-61ac43bcbdee","resolution":{"observed_at":"2026-08-16T11:19:41.712206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.695553Z","title":"Streaming coreset constructions for m -estimators","venue":null,"work_id":"5eb2ff27-09aa-4ea8-a52a-a33b616b5f5a","year":2019},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.969946Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:c398ffae00c45966eb68602eb55b8854cdc9b65af953cd33f5e71277432a7abe","observation_id":"01d929ed-1e0f-40d8-ab93-678b396b76cc","resolution":{"observed_at":"2026-08-16T11:19:41.700168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:40.973538Z","title":"Razenshteyn, and David P","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.973538Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:3a5077e25671bffe799beac10260ee23edf416b124242da9275d784394d97ddc","observation_id":"2ffab3a9-c7b8-45f4-8c21-78504d8575f2","resolution":{"observed_at":"2026-08-16T11:19:40.973538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.675395Z","title":null,"venue":null,"work_id":"4abb6d56-11aa-4cf1-997f-373f37cacd49","year":1980},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.977125Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:6d9998956861c83b34f885418eabb48ea604fba044947b21d4f11a37d55f4900","observation_id":"f5231311-028c-48bd-a255-6a7997de3d8d","resolution":{"observed_at":"2026-08-16T11:19:41.679803Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.663348Z","title":"Query complexity of least absolute deviation regression via robust uniform convergence","venue":null,"work_id":"f85168cf-14e7-4219-a63b-3bd0829d1f7a","year":2021},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.981137Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:581a590eed506a800f43985135e5fa9db7f7572b50772b67c4aa164ec0ca0fde","observation_id":"67ad7d54-434e-4d9f-af33-c1f794b79817","resolution":{"observed_at":"2026-08-16T11:19:41.668000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.652422Z","title":"Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu","venue":null,"work_id":"530ce17d-d9b4-4405-9756-1df9313054e6","year":2015},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.985127Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:cb3e939c6b419445c22421cbe40ce64251ca940bb4f8437ca433118a278253b1","observation_id":"5c24e943-e8f8-41d3-b67b-02dc2ed0da10","resolution":{"observed_at":"2026-08-16T11:19:41.656118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:40.988648Z","title":"On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.988648Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:05e4081c7a4c22c353cc04642e8efe8cf19a533a4247fa31ec04cd19c9ce9f1e","observation_id":"243f73da-1712-493d-b205-b58135da936d","resolution":{"observed_at":"2026-08-16T11:19:40.988648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.634088Z","title":"Fast and accurate k -means++ via rejection sampling","venue":null,"work_id":"3d0d4e6d-0609-4f37-9f52-130b2dea9eef","year":2020},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.992414Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:b847229184d67025f213755033e717d5a1ebd1ab2c2f83edf310fa6472a57134","observation_id":"3f126589-c4d1-4d1e-8085-99e5b125e2a1","resolution":{"observed_at":"2026-08-16T11:19:41.638113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:40.996765Z","title":"Improved coresets for euclidean k-means","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.996765Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:131c3eab100335ba62bdb2fc8b73129936e6ea8cd9075e358909d946958c508f","observation_id":"fea6aafe-a628-440b-b011-5e2b4be1abfe","resolution":{"observed_at":"2026-08-16T11:19:40.996765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.614865Z","title":"Towards optimal lower bounds for k-median and k-means coresets","venue":null,"work_id":"8bb3d721-2830-48c5-9e3e-c4ae31e67dc7","year":2022},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.000306Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:dde4e492067ce5533745302b8c4b70be6bfcc94d15c6b703c605836a118baa8e","observation_id":"6af3e46b-a510-4644-ae9a-a4f29a60947e","resolution":{"observed_at":"2026-08-16T11:19:41.618747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.603436Z","title":"Cohen, Cameron Musco, and Jakub Pachocki","venue":null,"work_id":"0613833e-0470-4aeb-8d1d-5af76f22a1c6","year":2020},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.003982Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:b20e0be9848a41ab63ad80a6c90e5e9246f0401703f86aa4726d9331b1de5da0","observation_id":"c6228811-e6df-46ed-92fd-37b27dc77ac0","resolution":{"observed_at":"2026-08-16T11:19:41.607069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.592376Z","title":"Cohen and Richard Peng","venue":null,"work_id":"d99dec58-bc6e-4be1-a577-5c8c33923ed5","year":2015},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.008270Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:20e1bd6a93bbbd3fdeca10bac1d327dd4f2b6a08e8f2fe159eaa42368ee7daea","observation_id":"ea1c0e32-9b5b-4b44-aec9-612f664b3958","resolution":{"observed_at":"2026-08-16T11:19:41.596010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.580708Z","title":"A new coreset framework for clustering","venue":null,"work_id":"cb3fa7e3-31e0-47e4-807a-c506a3504199","year":2021},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.012622Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:1cb0a7235e74963a7e10dff8ea80a67a4840fbe7bc8951e4f8e0a56e57e5e4a1","observation_id":"8d608852-aa28-4dbd-83cb-ceed2b56bc33","resolution":{"observed_at":"2026-08-16T11:19:41.585312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.570065Z","title":"Woodruff, and Samson Zhou","venue":null,"work_id":"69d1c2d0-5123-42de-af44-33e23ac38189","year":2023},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.018103Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:253b7a32f91b96ba7466d4ee71e0ea18967bb0e1aa827583d749599ca58bd0e8","observation_id":"af40a72d-4903-4ba7-9571-8a1ac3337fb0","resolution":{"observed_at":"2026-08-16T11:19:41.573676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.021982Z","title":"Clarkson and David P","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.021982Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:c32d5790a011ab3fd13486bca5e4ff96db233f7dfb26af6d00a3c3e6483ba54e","observation_id":"a1293d6c-db91-4472-831c-b06ce1323092","resolution":{"observed_at":"2026-08-16T11:19:41.021982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.551967Z","title":"Clarkson and David P","venue":null,"work_id":"d4e6bef9-8d8a-427f-92fe-b1b8fbeb8fb1","year":2013},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.025925Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:409e51fb5b7b47a2354d246dea1cdb66d25f91fcc8ecdea375b83d51b2af81ed","observation_id":"477c47a6-7210-43f7-b8a7-a79a7902fe41","resolution":{"observed_at":"2026-08-16T11:19:41.555655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.541234Z","title":"Woodruff, and Samson Zhou","venue":null,"work_id":"ad4a2de9-be1a-4e91-bd2e-e109dd411bad","year":2023},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.029724Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:e4d38c5678429c103c0555b5b925d0b7299fc4ceb668bae00f27d51940665d6b","observation_id":"c963dc9b-0791-4098-b75c-6ba576eec5b5","resolution":{"observed_at":"2026-08-16T11:19:41.544733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.528620Z","title":null,"venue":null,"work_id":"e37690a2-2057-4719-a9ee-6c50c6771ff5","year":2009},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.034041Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:c7c5d19afeb4bf7eb739428d38aeeb203748017958235b5d920b0133bac32611","observation_id":"0be490e4-9853-4e44-a0ab-87bee4fac0f6","resolution":{"observed_at":"2026-08-16T11:19:41.533247Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.516651Z","title":"Mahoney, and S","venue":null,"work_id":"fa880775-1ace-436e-a201-c20237ecd566","year":2006},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.037973Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:ced711a57a4a4f0c6e6206ae2997aa1bb4ba050072f76aae9c43604c593b3cff","observation_id":"91418b57-9624-402d-b579-d286be2153e3","resolution":{"observed_at":"2026-08-16T11:19:41.520913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.042385Z","title":"Mahoney, and S","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.042385Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:7f25c9b4ed70e9c073bfcf5fb8b0262cb8c5f349574483a856bc4c70fc1010ac","observation_id":"0a4a4c0b-f072-404d-aaf9-3d423fa324df","resolution":{"observed_at":"2026-08-16T11:19:41.042385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.046392Z","title":"Settling time vs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.046392Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:f4134e0df7acb4a9a747c11d9ededde027180fa54de377c323765b29ed3b9eb0","observation_id":"528aaa14-2e5e-45ef-83ae-1c64203bbebc","resolution":{"observed_at":"2026-08-16T11:19:41.046392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.491706Z","title":"A unified framework for approximating and clustering data","venue":null,"work_id":"23774378-1118-4788-8629-a4ad1836101e","year":2011},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.050505Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:aba88cd43fc3e4829d013d180bb5586b101e04c8f2efbe539257eb0d18ce67ac","observation_id":"756eb882-a541-4514-87bc-5b016576d173","resolution":{"observed_at":"2026-08-16T11:19:41.496158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.480171Z","title":"Schulman","venue":null,"work_id":"35824fdf-ba69-4be3-9018-f508a4469d34","year":2012},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.054446Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:8a3d0a0dbbcaf3df37f994bbffa4556d03a7ddd1ad43612ffdbe544ca3e9c41a","observation_id":"bc60a159-5ee3-454e-86d5-7470020a7cec","resolution":{"observed_at":"2026-08-16T11:19:41.485012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0809.2554","last_updated":"2008-09-15T15:42:47Z","snapshot_observed_at":"2026-08-16T19:21:44.451593Z","submitted_at":"2008-09-15T15:42:47Z","title":"Simpler Analyses of Local Search Algorithms for Facility Location","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0809.2554","snapshot_observed_at":"2026-08-16T11:19:41.058059Z","title":"Simpler analyses of local search algorithms for facility location","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.058059Z"},"links":{"cited_paper":"/paper/0809.2554","citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:91cca9f87f38e5af5223eb0175ef8db4fbb0e6fb0f368b290b9f03e087ed4936","observation_id":"dec4c67c-4b22-4549-b013-4baf36b2290e","resolution":{"observed_at":"2026-08-16T11:19:41.058059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.469561Z","title":"Smaller coresets for k-median and k-means clustering","venue":null,"work_id":"27c42857-f790-4d06-a355-52c4b5211a3a","year":2007},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.062843Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:8b7439090e503173f2c6036c224c0325a898f4a8eac2ece94589970d4976d7a4","observation_id":"c3404c39-5546-402c-bddb-cfcd1d54b12f","resolution":{"observed_at":"2026-08-16T11:19:41.473143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.459363Z","title":"Fully-dynamic coresets","venue":null,"work_id":"af274d3e-2ee1-44c5-ba62-7a656e4a1227","year":2020},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.066677Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:f039bacbdbb490bf4c0ad024fecd4c4f4b10ca13397befcbdb7fdabe6fdc8870","observation_id":"170153d0-a6ec-4da2-851a-d9352469a556","resolution":{"observed_at":"2026-08-16T11:19:41.462781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.449402Z","title":"On optimal coreset construction for euclidean (k,z) -clustering, 2023","venue":null,"work_id":"cd45567e-f8df-4ffd-b17d-ce6c45af7bc5","year":2023},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.070125Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:972953337c1abd4f83df366babc77196ab326d2c6de6f2a9f72f478b0274089a","observation_id":"2bfca1b8-712d-489f-beb1-0ee0921c290f","resolution":{"observed_at":"2026-08-16T11:19:41.452742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.437960Z","title":"On coresets for k-means and k-median clustering","venue":null,"work_id":"55645f98-1318-46ca-92fe-9cc3d468c6bd","year":2004},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.074563Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:022c97691a072658afed4f6e0c07265e17e17bd6ddd52aa49b4aba81ef08679c","observation_id":"b89fff2a-84b7-400c-9f1d-a3f732275e90","resolution":{"observed_at":"2026-08-16T11:19:41.441812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.426818Z","title":null,"venue":null,"work_id":"a19bc066-8d14-4a5e-9a85-d04e63bbba9b","year":2020},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.077930Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:1fe8314ec532218da78d0127bb67c55a9773252dbdbf124e077990e26affdeee","observation_id":"b806a2b2-cd97-4c22-b85c-edac0cbe68b7","resolution":{"observed_at":"2026-08-16T11:19:41.430828Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.415410Z","title":"Dimensionality reduction for wasserstein barycenter","venue":null,"work_id":"358f4db2-9a2e-43f8-ba08-a619c7793e33","year":2021},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.082236Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:3ad9eb4d596ea405efa9b41443c6a0edae844aed2d802771283762ab2a796d82","observation_id":"00f0d3c6-70f7-439a-9258-5ac96f8af108","resolution":{"observed_at":"2026-08-16T11:19:41.419396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.404308Z","title":"Fast image retrieval via embeddings","venue":null,"work_id":"ac1ebb47-c34c-4705-8e51-bdd1e13b9d54","year":2003},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.086550Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:bb5b0839b5b416b4bf12ce0a4fc8ec3929b668d2dcefa39040d2c1a396f9eb08","observation_id":"19b5daa7-ddf2-4458-8e7d-1de996554059","resolution":{"observed_at":"2026-08-16T11:19:41.408211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.389845Z","title":"Extensions of lipschitz mappings into a hilbert space","venue":null,"work_id":"ac3d7be0-5a03-4d92-92ae-957f539ec960","year":1982},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.090763Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:f91cfc1a33c1e254613c905618dd2c4e190cf3e8a67353d2ea2e085320ab48c3","observation_id":"f372a3d8-272e-40be-9919-4d0ff5a35ed6","resolution":{"observed_at":"2026-08-16T11:19:41.395745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.378019Z","title":"Fully dynamic k-means coreset in near-optimal update time","venue":null,"work_id":"34d0ec71-ba82-4e3a-9843-e4538bc49d50","year":2024},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.094424Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:60ecc9f90db8c6fc6ccc29bc1581d5510213f4edc3f39a55d7b7ef5306078f82","observation_id":"c0fe30a9-fcd2-4530-a2f5-c892c9dec031","resolution":{"observed_at":"2026-08-16T11:19:41.381820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11217","last_updated":"2026-07-08T14:27:00Z","snapshot_observed_at":"2026-08-17T06:24:43.030973Z","submitted_at":"2024-07-15T20:04:06Z","title":"Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11217","snapshot_observed_at":"2026-08-16T11:19:41.097894Z","title":"Almost-linear time approximation algorithm to euclidean k-median and k-means","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.097894Z"},"links":{"cited_paper":"/paper/2407.11217","citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:fea2a74a39ef8518ebba406823e32fc597a49c0a6b74ac9ce08e233d67a45ad4","observation_id":"e844e460-388e-43a7-a46d-268d9aa7cf11","resolution":{"observed_at":"2026-08-16T11:19:41.097894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.366433Z","title":"Woodruff","venue":null,"work_id":"07e19e52-1322-455e-b726-2b5ad694e908","year":2021},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.102389Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:d3c272df0cf6e9cd93022fa9d7cda73f74963bc22aebbf5923f250d83aecf00d","observation_id":"8ddf542c-3632-4187-8906-6080210ac62c","resolution":{"observed_at":"2026-08-16T11:19:41.370564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1008.0587","last_updated":"2010-08-03T16:28:10Z","snapshot_observed_at":"2026-08-15T05:12:16.251032Z","submitted_at":"2010-08-03T16:28:10Z","title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1008.0587","snapshot_observed_at":"2026-08-16T11:19:41.106274Z","title":"Row sampling for matrix algorithms via a non-commutative bernstein bound","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.106274Z"},"links":{"cited_paper":"/paper/1008.0587","citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:1db5a5326ec7fa87187b56f7b4094cf4a0672809243b9f7cc553d4eda3f5b72a","observation_id":"69f99dc9-76f7-4e83-9c94-23764b994fb0","resolution":{"observed_at":"2026-08-16T11:19:41.106274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.354798Z","title":"Meyer, Cameron Musco, Christopher Musco, David P","venue":null,"work_id":"56565b41-8dc9-434d-bea9-c6653b5d05d7","year":2022},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.110994Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:06dd224b6b2c23cb3f0b56b8eb8b023384769386d491257b89b36b14f8e322bb","observation_id":"3fc85162-29b0-4d1c-91a8-9e77b5ae5604","resolution":{"observed_at":"2026-08-16T11:19:41.358678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.342419Z","title":"Meyer, Cameron Musco, Christopher Musco, David P","venue":null,"work_id":"6131d54a-130c-4067-a42b-f03cc35e8048","year":2023},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.115765Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:7eb38537667084b56c6b5b80550e37394df6c2394d8c5d27145398e1342f5445","observation_id":"dea86fb0-98e0-4a8b-8ae7-5e9494beb3d9","resolution":{"observed_at":"2026-08-16T11:19:41.346465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.330373Z","title":"Razenshteyn","venue":null,"work_id":"d9cb8ba9-6245-4356-916d-812e2025b400","year":2019},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.119189Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:46f913bbf6cb8e8a5532cc4c43cbecc1b86dd27c5fb7f7ba927d959389b5cbc7","observation_id":"95152697-b962-41bd-af67-b3fca1ba0fe9","resolution":{"observed_at":"2026-08-16T11:19:41.334025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.317979Z","title":"Woodruff, and Taisuke Yasuda","venue":null,"work_id":"8f172781-eea3-4d04-94b2-3251d85c49d3","year":2022},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.122649Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:c9617d7cd7cbc2a3db053ac6d05a5b88d93f18a151e19633c4792380d26afe44","observation_id":"8ae8075b-a530-47b0-9c89-a87ce165e50d","resolution":{"observed_at":"2026-08-16T11:19:41.322191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.306081Z","title":"Woodruff, and Samson Zhou","venue":null,"work_id":"16a51a88-dec2-4ab4-b18e-b0dd14d3f11e","year":2022},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.126239Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:571b12ec4b9f6ef5270d70c8159a5a2dd9510d44eaf3f3afa1142de07349322b","observation_id":"c29918d7-e002-4636-af5c-c6ce7a999343","resolution":{"observed_at":"2026-08-16T11:19:41.309755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.293475Z","title":"L1 regression with lewis weights subsampling","venue":null,"work_id":"2d4a6c15-3ee9-4494-9bf7-4a78ec0a8a10","year":2021},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.129903Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:ef42a519b7678f787a03aa72abab66ccee85d6a834a27a49f1410e6bf350895d","observation_id":"c7f5bacb-14f3-4839-9fbe-be486f1ecd51","resolution":{"observed_at":"2026-08-16T11:19:41.297355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.280633Z","title":"Improved approximation algorithms for large matrices via random projections","venue":null,"work_id":"cdff12cd-9127-472c-a72b-81bbf35f1167","year":2006},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.133398Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:9f8cf866d7a1835a52f381f432ab7a978c72bf3ff86fd146d3479675f7672bd0","observation_id":"e31680d1-3e0c-44f3-a0f4-214c7fa78051","resolution":{"observed_at":"2026-08-16T11:19:41.284999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.136876Z","title":"Woodruff","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.136876Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:f4afdac5bddc82b07d480af416e79c2fe8b2797f50a838934b5377260060d0c4","observation_id":"5648d5bc-b477-45bd-b85a-fd4d8035a1b0","resolution":{"observed_at":"2026-08-16T11:19:41.136876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.140427Z","title":"Woodruff","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.140427Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:7d2752e8105630912b958419fee3ab561def7b5a803755fd5d23c77a93619edf","observation_id":"ed43c98a-56df-4c3e-8de6-5527f321263d","resolution":{"observed_at":"2026-08-16T11:19:41.140427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.144142Z","title":"Woodruff and Taisuke Yasuda","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.144142Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:3bf71eb0d0cb1c0d1c3c138d1664ebfc48afb4533af136bf0928aac0c05d5fe6","observation_id":"15dc950f-0846-4694-87f2-11aeab436a35","resolution":{"observed_at":"2026-08-16T11:19:41.144142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:41.244107Z","title":"Woodruff, Peilin Zhong, and Samson Zhou","venue":null,"work_id":"7fe966cd-b8a5-4d93-8ba0-f82ab35d423e","year":2023},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.148382Z"},"links":{"citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:23c5629c9de3ee5db9778b84fea1450314332b5c948ba798eee311dae1449b34","observation_id":"dac163cb-a4f4-4ce1-9657-301a0b213c73","resolution":{"observed_at":"2026-08-16T11:19:41.248811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02971","last_updated":"2025-03-15T01:58:29Z","snapshot_observed_at":"2026-08-16T14:12:39.174234Z","submitted_at":"2024-03-05T13:49:32Z","title":"Space Complexity of Euclidean Clustering","version":3},"cited_work":{"arxiv_id":"2403.02971","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.02971","snapshot_observed_at":"2026-08-16T11:19:41.184978Z","title":"Space Complexity of Euclidean Clustering","venue":"cs.CG","work_id":"a118f7d2-79b1-45f1-abf2-7df10bcaeb05","year":2024},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.152464Z"},"links":{"cited_paper":"/paper/2403.02971","citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:651e0415fdf4615ade31389d10d4b40d70e1eab4eca4a0a9b93b35d56fa79176","observation_id":"282d1108-b281-464b-99f3-82bcd7527f7d","resolution":{"observed_at":"2026-08-16T11:19:41.191214Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":1,"verified_fuzzy":36},"total_outbound_references":54},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"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."}