{"as_of":"2026-08-18T18:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13e934d6ead14e71c45316b1f67277bfb2ab34a1b5e75669eb7472f7dbcfe5c3","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:18:21.583437Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2507.14089/citation-record","integrity":"/paper/2507.14089/integrity","json":"/paper/2507.14089/citation-record.json","paper":"/paper/2507.14089"},"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-06T16:18:31.190930Z","title":null,"venue":null,"work_id":"21b63e24-45fb-44b7-a903-7cdf71eac6f9","year":1986},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:17.621617Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:aa70d1aab6c97c1d68d7b6c231f881f15e27992733d3ffb4780ace9bcd04bffd","observation_id":"844de8c1-31b8-48d9-8c1b-9b1ddf96b1d5","resolution":{"observed_at":"2026-08-06T16:18:31.257471Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:30.988934Z","title":"Awerbuch, A","venue":null,"work_id":"62e9b9d6-00ac-42a8-9a81-018adc654c8e","year":1989},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:17.675859Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:74fda2a3944734ee2ba46c381c6e08e9440584c06dcdd50e75d053a7c70af4aa","observation_id":"83c2ca94-c5b7-4100-99c8-3321f5656ecb","resolution":{"observed_at":"2026-08-06T16:18:31.113513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:30.693650Z","title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions","venue":null,"work_id":"858c6fa9-d261-410e-bd9e-e41232781302","year":2006},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:17.763774Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:f64ce693b492b78486c1b3e2be942598d4f923622074750a69905fc9cc94cebb","observation_id":"f7fcb878-bcf2-4b6b-9c6b-73118643fdde","resolution":{"observed_at":"2026-08-06T16:18:30.828788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:30.373087Z","title":"Streaming k-means approximation","venue":null,"work_id":"dd4e77a9-ab0b-476d-8940-a3a7933abe21","year":2009},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:17.839430Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:9b13c4319a3f84ac48045bbc363d7250d1f8ba19bce3746fd87a3422d59168ec","observation_id":"c81ceef7-998f-4f2d-a947-27ba4f45dbb3","resolution":{"observed_at":"2026-08-06T16:18:30.504204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:30.157431Z","title":"Better guarantees for \\ k\\ -means and euclidean \\ k\\ -median by primal-dual algorithms","venue":null,"work_id":"830587c8-a651-45ee-b400-08a89f657eee","year":2020},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:17.906501Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:1ddb6bc4c62d7e15cb85661a595c06329146798b57f91e91e133ad89589c7c09","observation_id":"be496cda-aa28-4c14-8e99-ad84935093fe","resolution":{"observed_at":"2026-08-06T16:18:30.239467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:29.906379Z","title":"Oblivious dimension reduction for k-means: beyond subspaces and the johnson-lindenstrauss lemma","venue":null,"work_id":"93c0b8c0-9ec0-4383-9636-f06af2ce0274","year":2019},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.039026Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:772c0fdc0fcfdf5a1cefc8d76f18d3803a3c99f427442650e6a7ecdfb3423762","observation_id":"cb03af5e-e6da-4b01-abf7-6c11ddceb353","resolution":{"observed_at":"2026-08-06T16:18:30.014350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:29.712319Z","title":"Distributed k-means and k-median clustering on general topologies","venue":null,"work_id":"3f5a2086-8084-4409-91c8-5e88734b0874","year":2013},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.085491Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:c4092016be1c49275a75964e9f407161d9736668b8508a893caa0e9b7ab00f3b","observation_id":"ae061f2b-2f6e-4318-8f9e-25c8b6c72a00","resolution":{"observed_at":"2026-08-06T16:18:29.808384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:29.478972Z","title":"Node and edge averaged complexities of local graph problems","venue":null,"work_id":"988ac76b-9963-4ab1-921c-e0029bfaee33","year":2023},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.192057Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:a7d0a388c0c30144e774d4c0dede440fb0e081df0182d11710a623674ff76ce1","observation_id":"e7f26bb7-032b-4ac7-978e-28280c1d5279","resolution":{"observed_at":"2026-08-06T16:18:29.561222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:29.278657Z","title":"Blelloch, Anupam Gupta, and Kanat Tangwongsan","venue":null,"work_id":"b1667813-f656-4a2d-a62e-d75213adfa0e","year":2012},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.301259Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:41a161f62ba3a069039c0cc9497b0798c01765174f913ed015c2bcf01f97b1f2","observation_id":"a23a0c64-0969-487d-ab1c-a16e6191bfcb","resolution":{"observed_at":"2026-08-06T16:18:29.372181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:29.036222Z","title":"Efficient k-anonymization using clustering techniques","venue":null,"work_id":"e100d199-5144-4909-b8c3-7609ffebce4c","year":2007},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.383458Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:8fa49f17b7ff2181ee42ef3a04ea722ac87a831e29eeeef3837c7bd81e6b6642","observation_id":"9ea24b59-b1b7-4ef9-a462-c77dff2ab4c3","resolution":{"observed_at":"2026-08-06T16:18:29.158833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:28.807839Z","title":"Scalable k-means clustering via lightweight coresets","venue":null,"work_id":"f675a393-8315-450a-b9f6-0fcd5db8ceb0","year":2018},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.469564Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:e4bc4cf5b92d623230924735dc0379d8976a04488661c276a7c767ff7887b316","observation_id":"2e7b30a6-f757-4e55-a54a-d9f3332b062c","resolution":{"observed_at":"2026-08-06T16:18:28.933691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:28.513884Z","title":"Blelloch and Kanat Tangwongsan","venue":null,"work_id":"b2c43fae-5f63-4ef8-a87c-62cf340adb11","year":2010},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.535947Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:6790e9ff2204bbac907006fc0d98fbd86743e378bfa7364b142095f54f0cec6b","observation_id":"c1544c45-35f2-4236-b4ac-06ddf7eee528","resolution":{"observed_at":"2026-08-06T16:18:28.676813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:28.256233Z","title":"Distributed clustering via LSH based data partitioning","venue":null,"work_id":"c4eaa975-c6a4-4e81-a176-2fea06be2684","year":2018},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.637139Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:6e9bcbc5861a50ad85dbc0d6b949b89db4b085dba07973d6dcf2089660fc77e1","observation_id":"bf6e2507-1f32-4a99-9fd5-977a97885787","resolution":{"observed_at":"2026-08-06T16:18:28.384214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:28.013336Z","title":"Breaching the 2 LMP approximation barrier for facility location with applications to k -median","venue":null,"work_id":"9a57b6dc-4b9a-44c2-bdb6-81a694a76c88","year":2023},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.719804Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:6af608452a681c31aa852b18071f4333d3ad510c5394cb39fc5607aa20f81967","observation_id":"a004bda0-aa5e-43de-9f7e-010b4f7f7402","resolution":{"observed_at":"2026-08-06T16:18:28.099815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:27.772944Z","title":"Near-optimal private and scalable k -clustering","venue":null,"work_id":"2fa7bc9a-fa34-4787-bad8-e8e2895735bc","year":2022},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.803080Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:ac04bdc39219c54953c8de98ea1c8d490a1561ae64d87eec9d7504d6ccfbe6ea","observation_id":"dd1f96c4-1802-433c-84f3-afc93a8de9cc","resolution":{"observed_at":"2026-08-06T16:18:27.909140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:27.412731Z","title":null,"venue":null,"work_id":"9694e8f6-ea8e-4dcd-9965-241d7cb107ee","year":2025},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.885277Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:2c5519bc18f35758cab43c79529c2c2cad1f578a41a3471a0cdd5dbd7778b1de","observation_id":"0c932541-db52-43fe-9add-8a404eeef097","resolution":{"observed_at":"2026-08-06T16:18:27.559927Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:27.155891Z","title":null,"venue":null,"work_id":"af814a7c-f0d9-4295-887e-72b06f6f5cbc","year":2024},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:18.959361Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:9120a8006aa0b422e5dcf4c61ba1593f145af9262ea6fee83f06e355994e5ff3","observation_id":"d1392b1b-c59f-4f2b-96c7-6df21f227b06","resolution":{"observed_at":"2026-08-06T16:18:27.251559Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:26.873972Z","title":"Online k-means clustering","venue":null,"work_id":"9e6ea9ac-085d-40d1-9939-c55c840ed505","year":2021},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.047303Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:692c84f08fc2437e3869355b9b1d07dfcdad8c151d5f1d1c06be327b9f78de10","observation_id":"c308941a-4d5b-404d-835b-91b468755403","resolution":{"observed_at":"2026-08-06T16:18:27.048830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:26.573255Z","title":"Jiang, Robert Krauthgamer, Pavel Veselý, and Mingwei Yang","venue":null,"work_id":"c908c862-2ea2-47f5-88ad-27b92e7c6072","year":2022},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.130848Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:4d28188d03cbe70030caf8d7fd5dcac264a58fbaed0f5e96f8c1922186986bdd","observation_id":"8c2e9797-e065-4bd4-b4d3-8f0bafa6b66d","resolution":{"observed_at":"2026-08-06T16:18:26.718155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:26.334783Z","title":"Time and space optimal massively parallel algorithm for the 2-ruling set problem","venue":null,"work_id":"755ee525-9387-4e21-aeae-f199661b81b0","year":2023},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.232611Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:3043bb282c13352bb0297c091fdc803596e2e31b385f3f0e3174f60a5fbc9d9a","observation_id":"92727a96-99fe-47ce-9ffe-9957ee9a1526","resolution":{"observed_at":"2026-08-06T16:18:26.421764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:26.093461Z","title":"Parallel and efficient hierarchical k-median clustering","venue":null,"work_id":"9a249660-0246-440d-9315-b6446834c82f","year":2021},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.314572Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:e9c4c94b089c8183837524701f0c78452a3a8ae1db85a5f1be30bac5f78c4c98","observation_id":"8c8273d1-ff76-4d23-9dde-490b9e12d3bf","resolution":{"observed_at":"2026-08-06T16:18:26.208620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:25.829998Z","title":"Mirrokni, and Peilin Zhong","venue":null,"work_id":"c868b2c6-f09e-4150-8c14-7c1f049d9b3d","year":2022},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.387151Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:cc5b90bb0c2ccde2ec23ba04e9d52cd25b4e56f8f39a8f51da7ff053946476c8","observation_id":"b21031b3-c331-4788-9886-4f275a407a42","resolution":{"observed_at":"2026-08-06T16:18:25.973278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:25.564657Z","title":"Better streaming algorithms for clustering problems","venue":null,"work_id":"9614df43-9f4e-4ce8-bbbb-f9e1e4952d0b","year":2003},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.477044Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:e6894e1e44f559297e013c412e67ed7e59cb0e404d456aff153f26a777a955c6","observation_id":"47e65763-eb42-480d-b01b-36a70066771c","resolution":{"observed_at":"2026-08-06T16:18:25.681179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:25.310495Z","title":"Mirrokni","venue":null,"work_id":"13c69efd-fe94-4ecf-8486-2565f47e8ecb","year":2004},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.527961Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:627a6e85a006f937f014b30b20b845b4f360039d17ff6497665a7a8cecd97f1e","observation_id":"1ae61768-b6b1-4d31-85c0-b1aadeca199d","resolution":{"observed_at":"2026-08-06T16:18:25.473399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:24.966965Z","title":"Fast clustering using mapreduce","venue":null,"work_id":"c63fd7b7-fe55-47de-aefe-131a4dbbe57b","year":2011},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.615035Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:3acd336e63b6020c4264186d067cf4f45edd016a4f5dce311757b9b7db2a5e56","observation_id":"134a389e-d927-4598-b769-4cc3f9b30125","resolution":{"observed_at":"2026-08-06T16:18:25.129721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:24.809988Z","title":"Ghaffari","venue":null,"work_id":"f50c6a76-a7f2-4252-a337-90d1f0b149dd","year":2016},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.704093Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:4ff3d0a44b51a2a42190fe6c4a0f3d589eca26022135d6d7cf016a1ed55b2307","observation_id":"498765fd-9705-4501-874e-78b004b3adbd","resolution":{"observed_at":"2026-08-06T16:18:24.898172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:24.679485Z","title":"Massively parallel ruling set made deterministic","venue":null,"work_id":"b664ed73-6345-45ef-8a78-b948e5cf92ad","year":2024},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.784741Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:adc7a33dd0c2d3578887b6f65036f500a23c237cd4b34f4ad43391819f7be3cb","observation_id":"74414436-4d8c-459b-8748-93d72797c47e","resolution":{"observed_at":"2026-08-06T16:18:24.733551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:24.521368Z","title":"Goodrich, Nodari Sitchinava, and Qin Zhang","venue":null,"work_id":"900455c7-79da-468c-b418-13f2a4658c63","year":2011},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.915468Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:16da365acf4741e22a81dcd5d1d3b2a5c119557ae29a85fdb833c8697e1c725c","observation_id":"eb4c6a23-1ed6-46fa-a946-370cb15e4524","resolution":{"observed_at":"2026-08-06T16:18:24.612513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:24.238484Z","title":"Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation","venue":null,"work_id":"6c279820-b643-4b91-aff2-55958a219a67","year":2019},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:19.999550Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:152469187614a043ac5b7c7321f5794622f970e2c1d9a1059e46d464a4a9b6ce","observation_id":"1ad405ce-7d2a-40c8-a6a0-bf00bb9460f7","resolution":{"observed_at":"2026-08-06T16:18:24.360416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:24.022036Z","title":"Massively parallel computation: A lgorithms and applications","venue":null,"work_id":"deaabb56-81ef-42c4-8a69-f3db25b92376","year":2023},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:20.097286Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:f449a09c89f719dc304038eb99374754cb419cc2d88e7f5a52b3e351965b201d","observation_id":"e3e36943-7ca1-48cd-993f-ed443f1335b8","resolution":{"observed_at":"2026-08-06T16:18:24.111534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:23.833008Z","title":"Nearest neighbors in high-dimensional spaces","venue":null,"work_id":"36e3ed02-57eb-427f-96ca-7b04142003b3","year":2004},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:20.104967Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:1cc80e751fefc3cf8e662ddb45b03a33f6e0fd5af0b3e228b6a582c7f155f760","observation_id":"77e0c870-f990-4285-b5f2-0ed57c05cc8a","resolution":{"observed_at":"2026-08-06T16:18:23.911873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:23.698253Z","title":"Vazirani","venue":null,"work_id":"da39397f-e734-4dc8-9fe2-aeb870e2760f","year":2001},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:20.170510Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:10ba2e0e39d464db083013f7a6c3746ddfdeeced93d15b70af16e65f8fdac03c","observation_id":"04c0e060-3f29-471c-afd7-f758fee9719e","resolution":{"observed_at":"2026-08-06T16:18:23.751014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:23.537133Z","title":"Deterministic distributed ruling sets of line graphs","venue":null,"work_id":"e79488d5-1ddd-4b8c-b65a-86718293d41a","year":2018},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:20.308865Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:30e27a0feaec3ae956b557213ecc0bc62296a6ef1eb7556c7e2b93ae3f58e9a7","observation_id":"a231c319-f22a-44a2-9088-a1b462cb1b4d","resolution":{"observed_at":"2026-08-06T16:18:23.636942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:23.366516Z","title":"Kothapalli and S","venue":null,"work_id":"fe151a38-0e29-45f5-9dba-daab86eaa6e4","year":2012},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:20.431758Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:27a7aaa54ecb3ecb3e171cff738346f1bc9fcbe870dd824c13e03fe91e714802","observation_id":"da7ab2ca-780c-497e-b1fd-2240b20972ce","resolution":{"observed_at":"2026-08-06T16:18:23.455437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:23.192860Z","title":"Pemmaraju","venue":null,"work_id":"8da0497d-d713-410d-bb53-0b2312c9094c","year":2020},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:20.569568Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:69b5c8a6e77d60b6024996ab8e8978fb074f5371e04f96acb80f44a342a981fc","observation_id":"7c300c5f-048d-4e53-9392-09721af6d368","resolution":{"observed_at":"2026-08-06T16:18:23.287821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:23.046541Z","title":"Karloff, Siddharth Suri, and Sergei Vassilvitskii","venue":null,"work_id":"773c9fd3-40eb-43fe-ba89-092153556aa1","year":2010},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:20.690241Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:352a36c4b8aa7bbc5c42521746395c03d32f579988c4088c3b97af0abf30d8f3","observation_id":"1d2a64d8-747e-4b53-9c2a-4174ea5714fd","resolution":{"observed_at":"2026-08-06T16:18:23.104185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:22.897168Z","title":"Least squares quantization in pcm","venue":null,"work_id":"3bf7583e-c996-40b6-bb23-0e281060a223","year":1982},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:20.780869Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:80d69e02e63ec8a94641cff873ccb6329c7294a0e5beb61f0bbe48a9b6dccfdd","observation_id":"c4128765-1eb8-481f-81e5-08a2c965a6df","resolution":{"observed_at":"2026-08-06T16:18:22.981223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:22.706855Z","title":null,"venue":null,"work_id":"032c40df-1ea0-4cc1-9fce-2d858df7429b","year":1986},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:20.894867Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:6456b157545631d9f75931cb664d96743e2418cb2e6cdaa29cbbcf39d132361a","observation_id":"ea31001a-a72c-46e2-8112-00d5cd625313","resolution":{"observed_at":"2026-08-06T16:18:22.809520Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:22.512211Z","title":"Quantizing for minimum distortion","venue":null,"work_id":"9ddd36d1-6db2-4430-9afd-2bcf0fc4d7ce","year":1960},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:21.061713Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:7c43eba34093089c5881ef48f9b89c1d23e0d1982d8c3c490124d19cd30b44a4","observation_id":"737eaa32-99bf-42c6-9a69-754c3880bd03","resolution":{"observed_at":"2026-08-06T16:18:22.618170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:22.317321Z","title":"Online facility location","venue":null,"work_id":"e233a35f-7bfa-4c5a-a30f-a3b841a17cfb","year":2001},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:21.177140Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:16fe4416377234a340697ed88a7e72e06186b023904e3879e488ca910b326e07","observation_id":"d57f4445-9248-4d2d-874a-d15e7f817a3c","resolution":{"observed_at":"2026-08-06T16:18:22.397189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:22.143232Z","title":"Fast distributed algorithms for computing separable functions","venue":null,"work_id":"c9fb4b47-093f-4b8f-b353-d966bf698167","year":2008},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:21.385198Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:13a86df13e262762a72986f890bfb8778cb2e5948aa237a6a6fbbfc24574c076","observation_id":"6e57d935-d388-4c43-8a2a-13864b0ee303","resolution":{"observed_at":"2026-08-06T16:18:22.210738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T16:18:21.950908Z","title":null,"venue":null,"work_id":"c40822f2-3b40-4034-9736-4bd3d58967e5","year":2017},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:21.519208Z"},"links":{"citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:88efb4ab96a927de27176ad0bb2274fa80faa3e6337ffcd23c5b2d1acf5371e3","observation_id":"21c00e1c-0507-4726-92fc-c7ceb147ac8f","resolution":{"observed_at":"2026-08-06T16:18:22.028895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.00459","last_updated":"2019-02-07T18:47:20Z","snapshot_observed_at":"2026-08-14T19:49:45.054193Z","submitted_at":"2018-02-01T19:07:51Z","title":"Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data","version":2},"cited_work":{"arxiv_id":"1802.00459","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.00459","snapshot_observed_at":"2026-08-06T16:18:21.697769Z","title":"Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data","venue":"cs.DS","work_id":"4670e3cd-9cfc-4003-9bd2-e209299b9013","year":2018},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:21.583437Z"},"links":{"cited_paper":"/paper/1802.00459","citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:029b62bc16ff7c39237c16aedc8e22171190f67433f46902ec98c3071470fbd4","observation_id":"777c2475-a9ad-482a-b5f8-4c91aca176c1","resolution":{"observed_at":"2026-08-06T16:18:21.811376Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":37},"total_outbound_references":43},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2507.14089."}