{"as_of":"2026-08-17T13:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f2505aebad318ea96f766395a68e1def799b7a957a6b384719b8d1f65558365","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T17:47:03.053543Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"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/2502.05888/citation-record","integrity":"/paper/2502.05888/integrity","json":"/paper/2502.05888/citation-record.json","paper":"/paper/2502.05888"},"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-08T17:47:03.615900Z","title":"Emiris, Loukas Kavouras, and Ioannis Psarros","venue":null,"work_id":"c884ef07-2045-4052-b8f8-0fd09c222a0a","year":2020},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.868854Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:08fe12371aeecae0188be1399a04bad335eddd5e198fed4b0dfe9636e8dfd338","observation_id":"daec0138-e8f6-4f86-9f6d-f3cff95aaab6","resolution":{"observed_at":"2026-08-08T17:47:03.620946Z","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-08T17:47:02.874181Z","title":"Agarwal, Sariel Har - Peled, and Kasturi R","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.874181Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:a16ea6c1a86c47bf69a3c4c200bc54335717fc8905881df3c75088b6e3a90750","observation_id":"8fa17f31-9cb9-4fec-893a-dac96b2b92c4","resolution":{"observed_at":"2026-08-08T17:47:02.874181Z","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-08T17:47:03.590943Z","title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions","venue":null,"work_id":"3f735b4c-03c1-4b96-b783-31cfa02694c9","year":2006},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.879055Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:293b3db6a30f678d2b4d88c41bec32cab4222c9d24f0709ae7563f052b4e99b6","observation_id":"03dae84d-9d2e-4dce-b063-1272371e6050","resolution":{"observed_at":"2026-08-08T17:47:03.595621Z","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-08T17:47:03.576330Z","title":"Reporting neighbors in high-dimensional euclidean space","venue":null,"work_id":"999f607e-241d-4f5a-9d61-ef570c3f1f3a","year":2014},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.883845Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:4e66c22502981dbcbb4503f737b27b12abcb67ce39cb5c3d2e18d2ed84f76684","observation_id":"2f07e46b-bae0-4d10-b5b5-c4425b8d5c6f","resolution":{"observed_at":"2026-08-08T17:47:03.581110Z","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-08T17:47:03.561722Z","title":"Ellis Hershkowitz, and Rajmohan Rajaraman","venue":null,"work_id":"8c57689f-42a2-4041-8db1-dda94d58da33","year":2023},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.889407Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:d6cfb533c182aeb4206f38d4a21372749cebed57e96f1b6b88bb91e3f80f489e","observation_id":"8e7832d9-72c5-46c6-9b82-253775abda0c","resolution":{"observed_at":"2026-08-08T17:47:03.566397Z","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-08T17:47:03.546053Z","title":"Split and join: Strong partitions and universal steiner trees for graphs","venue":null,"work_id":"6b860f36-1ec7-4649-a291-03ac8a8af4b1","year":2012},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.894079Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:496c973b13a151767dd86f7ce4525ee879c25a5ba222e196ebd869fa9161bbed","observation_id":"1daec34d-6870-4360-9fe1-9a4a6df6b937","resolution":{"observed_at":"2026-08-08T17:47:03.551604Z","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-08T17:47:03.531393Z","title":"Mirrokni","venue":null,"work_id":"40223370-9f78-401b-b974-50bd66f86a9d","year":2021},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.899287Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:fc0be5dad2ad8ebd387372abedc6d0115e872fa520b39535cc48057596485716","observation_id":"7cfbd905-2896-4b56-8789-f461c0d309d2","resolution":{"observed_at":"2026-08-08T17:47:03.536099Z","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-08T17:47:02.903636Z","title":"Distributed k-means and k-median clustering on general communication topologies","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.903636Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:f3f85f777c79c89ea3a7988e025327dda9fcc24f097082785cbe2adb46e45903","observation_id":"7099bc47-5acc-4493-9832-ca4793f06106","resolution":{"observed_at":"2026-08-08T17:47:02.903636Z","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-08T17:47:02.907738Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.907738Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:26c369d6872384bf52223dcaf502ccb1066e091fd02b68f6ff918dd24c446bf0","observation_id":"54edd68a-1c49-4587-908a-40e288b7ba3c","resolution":{"observed_at":"2026-08-08T17:47:02.907738Z","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-08T17:47:02.912570Z","title":"Covertype","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.912570Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:e6383954fcac2325b4f4426da30a26f981fa7f90b1a0bb0c691c25ef1796e030","observation_id":"0c06349d-1804-4dbc-a527-e302de612f04","resolution":{"observed_at":"2026-08-08T17:47:02.912570Z","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-08T17:47:03.497709Z","title":"On parallel k-center clustering","venue":null,"work_id":"6b8fd883-ae2b-411c-8746-126c30ed667a","year":2023},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.917168Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:03631c8da67815751c8875088061cf142696315197b0de2f7c77cfa8f9915698","observation_id":"c20814ac-dd1c-482a-94ae-ed1ec2beea08","resolution":{"observed_at":"2026-08-08T17:47:03.502861Z","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":"2204.02095","last_updated":"2023-01-29T01:48:03Z","snapshot_observed_at":"2026-08-17T09:14:01.587970Z","submitted_at":"2022-04-05T10:12:00Z","title":"Streaming Facility Location in High Dimension via Geometric Hashing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.02095","snapshot_observed_at":"2026-08-08T17:47:02.922470Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.922470Z"},"links":{"cited_paper":"/paper/2204.02095","citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:637e6c1e6c709ebf909d2c18d267499e6e5d72b1dc0382c434874f28ff813f8f","observation_id":"5732b42c-a928-48c3-a009-a2670c8949dc","resolution":{"observed_at":"2026-08-08T17:47:02.922470Z","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-08T17:47:03.481947Z","title":null,"venue":null,"work_id":"a1a6adf5-98f3-44a9-bb78-c804395f42d8","year":2024},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.927353Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:c8e8c94185b92f2f8fb506b814df071288953fdb63084606c1c68e81b75c7e66","observation_id":"50481fd7-1470-4625-859a-05936e80362d","resolution":{"observed_at":"2026-08-08T17:47:03.487938Z","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-08T17:47:03.467614Z","title":null,"venue":null,"work_id":"065f60de-536d-4d87-bdb8-dbda0a736817","year":2025},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.932321Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:73dd31923d5f9d88d8d1318d4ac2a8af0f24a5a739958dc0b61872c9f2ad3289","observation_id":"e1ca5f7d-dd42-4507-8b95-ec38114cef43","resolution":{"observed_at":"2026-08-08T17:47:03.472135Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:47:02.936774Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.936774Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:18a3b7117315b579074a2d07452d4e144d25084a1853451181fc8823202e1b79","observation_id":"36957b74-898e-48c1-908f-2abf643007ac","resolution":{"observed_at":"2026-08-08T17:47:02.936774Z","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-08T17:47:03.443208Z","title":"Streaming algorithms for robust distinct elements","venue":null,"work_id":"81cfb8d4-4579-44f1-96d0-58bec90516ef","year":2016},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.941432Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:4397230eb774e7e07b065229dc57cd6a117b8b252f1f85d9e0bb21ee8988f1f2","observation_id":"5fb36755-9540-426c-82ae-165632a83c0f","resolution":{"observed_at":"2026-08-08T17:47:03.447798Z","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-08T17:47:03.427587Z","title":"Data fusion: resolving data conflicts for integration","venue":null,"work_id":"71aa21cf-dd69-4a25-bfb2-add8847de8e6","year":2009},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.945883Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:7b7fd03ef923c821a3f9c07dd09cf205396a6a17874db577f1eb87ae685c74a3","observation_id":"23d02388-4fb3-419f-a354-59e9ed818996","resolution":{"observed_at":"2026-08-08T17:47:03.432645Z","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-08T17:47:03.412084Z","title":"Approximate greedy clustering and distance selection for graph metrics","venue":null,"work_id":"74fb87cd-aef5-4a85-8f3e-c3d659a8a91b","year":2020},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.950331Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:d2b2e9add50a92018fa5984e7d2adbf42a67796ece01eeb9720ed9dd81665cdb","observation_id":"ba9926a4-9e4e-4fc8-bc8c-d0e6e8487242","resolution":{"observed_at":"2026-08-08T17:47:03.416697Z","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-08T17:47:03.398462Z","title":"Fast clustering using mapreduce","venue":null,"work_id":"4d5632a5-bb14-47ec-b92b-fe54362bc798","year":2011},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.954645Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:5737cdc77a55a57d54ec21b33c1c094132f5a26f21cf57590843646da002e6e0","observation_id":"8f0ea391-2e4a-4441-adaa-7ef06b437993","resolution":{"observed_at":"2026-08-08T17:47:03.402978Z","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-08T17:47:03.384466Z","title":null,"venue":null,"work_id":"dd09ba3f-c42d-4ff4-8aaa-aeba506a1897","year":1988},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.959324Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:202fa614626685ab84a4ba920517804a8200f65795942eb63a7fb2c0bc44fb7a","observation_id":"a6679058-3e06-481d-b683-609d95c13416","resolution":{"observed_at":"2026-08-08T17:47:03.388913Z","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-08T17:47:03.369902Z","title":"Scattering and sparse partitions, and their applications","venue":null,"work_id":"519b58bc-4269-429e-8842-34eb494ba32c","year":2024},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.964051Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:f869da5681de424844e3ffa806582ddadeba2777a2e55d5d98bc8709161373b6","observation_id":"77b14b6e-4723-47e3-a46b-c4a77fecee70","resolution":{"observed_at":"2026-08-08T17:47:03.374527Z","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-08T17:47:03.355328Z","title":"A PTAS for k-means clustering based on weak coresets","venue":null,"work_id":"bde0bdf1-2a80-4ee5-b202-f66fc77bbd52","year":2007},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.968288Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:a8de24e99c017f13e3baa336349b962aa4083cbf8a4ca2dc3b44fdc527f1b0aa","observation_id":"0bfaae38-3009-4889-b367-a24058a0ae3e","resolution":{"observed_at":"2026-08-08T17:47:03.359964Z","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-08T17:47:02.972809Z","title":"Gonzalez","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.972809Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:5000ae1790a7c09344d45cf1cd6ee842d1af12ee5f638826cea29789d5390cfd","observation_id":"60fc7aad-e687-4057-890a-5c23aa1007cb","resolution":{"observed_at":"2026-08-08T17:47:02.972809Z","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-08T17:47:03.332108Z","title":null,"venue":null,"work_id":"c6d0759a-b114-4099-a8d8-2ef7922ee453","year":2023},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.977557Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:b4e0d7ef32517bfd6d3d628df9eba47b8a1b2c57b325a7bc4c94a807b4cfe453","observation_id":"bda099e9-383e-4fd2-a134-6083c2c839c6","resolution":{"observed_at":"2026-08-08T17:47:03.336432Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:47:02.981775Z","title":"Fully-dynamic coresets","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.981775Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:e9a158915b5ea072b18399baa6b66ebc9dc8e19ec257acb24d3511bfc5f2e25b","observation_id":"35398bde-2ece-4b01-b6fd-4402c79bfa32","resolution":{"observed_at":"2026-08-08T17:47:02.981775Z","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-08T17:47:03.306556Z","title":"On coresets for k-means and k-median clustering","venue":null,"work_id":"85063aff-79e8-4e0d-98cc-1301661af262","year":2004},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.985979Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:27391833a37f14974149a317a0a0726b0bc1ee4f5aeca606122c3aa8e7cf5f57","observation_id":"bacb1de1-53c8-4f0d-ad46-36e827e26903","resolution":{"observed_at":"2026-08-08T17:47:03.311861Z","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-08T17:47:03.290718Z","title":"Hochbaum and David B","venue":null,"work_id":"f2c7cbfa-68c4-4054-92d0-a092c90a4c1d","year":1985},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.990188Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:2468990e0fdebd0cb8fb266fe57fe6b9eff76e3791703c05e80020f673a74cbc","observation_id":"2852d5f7-e0db-4d6f-a1c2-446caf8089d8","resolution":{"observed_at":"2026-08-08T17:47:03.295691Z","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-08T17:47:03.275729Z","title":"Hochbaum and David B","venue":null,"work_id":"b9d2b75e-6221-483a-bd9e-007515259f8e","year":1986},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.994563Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:0d480abf33250fe6b72628dd35c03fb943cf8ce25dce07c9711a8aa6f5b146b1","observation_id":"24064cf4-e675-4c82-b38d-48b29b24a472","resolution":{"observed_at":"2026-08-08T17:47:03.280765Z","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-08T17:47:03.261598Z","title":"Data quality and record linkage techniques , volume 1","venue":null,"work_id":"d7352ffd-bf92-4ea7-93f2-158c1e08a581","year":2007},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:02.999096Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:8dc1cbe7de69b8e66101df37474adabffcf01d384b763dbb8f50e9fa23792733","observation_id":"d2a2d8af-96cc-4cb6-8ab2-b6399d3bafa4","resolution":{"observed_at":"2026-08-08T17:47:03.266120Z","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-08T17:47:03.247273Z","title":"Product quantization for nearest neighbor search","venue":null,"work_id":"11af5872-c458-4de2-93dd-c0dfce37dc42","year":2011},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.003608Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:1385f24e48a705ace1858fc30e82752286530a4d490d20b3a4fa7a1819fcd2b7","observation_id":"086f808e-20ab-418d-95c7-4a963b40f571","resolution":{"observed_at":"2026-08-08T17:47:03.251902Z","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-08T17:47:03.232314Z","title":null,"venue":null,"work_id":"85907ab0-37f7-4b95-9f3c-4514d0275e23","year":2024},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.008071Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:86cafbdc664588f91e38fb7f9722382e9e74a85d108e7cb04f72bd3dfcc7cb5b","observation_id":"8067673d-1550-4202-b312-710b89772aa4","resolution":{"observed_at":"2026-08-08T17:47:03.236886Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:47:03.012605Z","title":"Extensions of Lipschitz maps into a Hilbert space","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.012605Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:0e238a2f5eee156a0baab05df0bf82048717b18fc1e6abbb6766ba52355eeb27","observation_id":"56cb8c36-c6dd-4079-9059-6f142dcd74ca","resolution":{"observed_at":"2026-08-08T17:47:03.012605Z","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-08T17:47:03.017173Z","title":"Universal approximations for tsp, steiner tree, and set cover","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.017173Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:da3efd07165cb7117030b9d0760ba0712342c88f9adb56cff3646daafab00797","observation_id":"1d1c64d1-69df-4a87-a063-d4bf8688cd11","resolution":{"observed_at":"2026-08-08T17:47:03.017173Z","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-08T17:47:03.209044Z","title":"Record linkage: similarity measures and algorithms","venue":null,"work_id":"89c4bb98-0082-498a-9361-2ba6c0415142","year":2006},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.021599Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:7af659c16132c7611253fd1e5709dbf74c04de843807c672dd91b840fa7d1e18","observation_id":"fa6d2fca-2fb1-4379-b0bf-d825bd988fd8","resolution":{"observed_at":"2026-08-08T17:47:03.213634Z","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-08T17:47:03.026170Z","title":"Almost-linear time approximation algorithm to euclidean k-median and k-means","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.026170Z"},"links":{"cited_paper":"/paper/2407.11217","citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:0bc9748936e4bc05766ea7ae5bdfabdce3063ce0f6d84993ef526e08ade439ae","observation_id":"1572407d-75c1-46ab-8d1d-a931c388bb37","resolution":{"observed_at":"2026-08-08T17:47:03.026170Z","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-08T17:47:03.031190Z","title":"Coresets-methods and history: A theoreticians design pattern for approximation and streaming algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.031190Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:1d556fdee94baafa1753638fe732dc08c6af2132ef0b68eab82978a0a1e7bee1","observation_id":"d108bd05-74da-44d0-bb35-51427f796573","resolution":{"observed_at":"2026-08-08T17:47:03.031190Z","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-08T17:47:03.185083Z","title":"New results on the complexity of p-center problems","venue":null,"work_id":"c73233c8-1412-4db5-b8c4-6564e7d9aa79","year":1983},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.035692Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:5694a6e687bc6aecbe854bedc137065522e34ecb0c5c633f5160851b5d7adcbd","observation_id":"7c5448e9-92ce-4764-9ab0-5ce67e3d4970","resolution":{"observed_at":"2026-08-08T17:47:03.189944Z","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-08T17:47:03.040274Z","title":"US Census Data (1990)","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.040274Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:4b63ebe22cf941c65d9b0e516b2c706a6df4d77df9eff939ca5de0cc81d0e3e3","observation_id":"369d9b10-867c-4e63-a206-814291028502","resolution":{"observed_at":"2026-08-08T17:47:03.040274Z","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-08T17:47:03.044799Z","title":"KDD Cup 1999 Data","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.044799Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:ff0ec7220bee51c42052c7c02c5fd6c03d46d6e70d6351fec942057808253872","observation_id":"509f0c23-6ea5-44ed-8de4-4f8fee88a66b","resolution":{"observed_at":"2026-08-08T17:47:03.044799Z","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-08T17:47:03.167287Z","title":"High-Dimensional Probability: An Introduction with Applications in Data Science","venue":null,"work_id":"afed19d5-0df9-4801-a4cc-9afb630b5c5e","year":2018},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.049314Z"},"links":{"citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:884aa984b830da9c33c73e93ed55732f213399edfa17014b08196230f8604ea7","observation_id":"e732c46c-69f1-4afe-a1ff-a635bc3bcb58","resolution":{"observed_at":"2026-08-08T17:47:03.174782Z","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":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-08-13T15:13:33.081929Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-08-08T17:47:03.053543Z","title":"Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.053543Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:e7f5aeaababf4be50a7812678bc5b156125ebf13e81d3e87793a6acb48879804","observation_id":"fb5974c2-67d3-4b37-850f-3b4c0cad6183","resolution":{"observed_at":"2026-08-08T17:47:03.053543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":21},"total_outbound_references":41},"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 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2502.05888."}