{"as_of":"2026-08-16T20:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dec58357d2d3856ae1b3717725008f79cd0cf49053347921a4b235aede6e6839","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:21:03.198666Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.16382/citation-record","integrity":"/paper/2504.16382/integrity","json":"/paper/2504.16382/citation-record.json","paper":"/paper/2504.16382"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.396219Z","title":"Massively parallel minimum spanning tree in general metric spaces","venue":null,"work_id":"c23d4fdf-14e7-4d25-ac2b-84e68caeae74","year":2025},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.025147Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:4f5ef5009605d2d5e4901b4dc5c7f4899ff346375658d08098d6962f3980dac1","observation_id":"db8e5c67-0f04-41a6-8871-c250eae485f2","resolution":{"observed_at":"2026-08-16T11:21:03.399565Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.04327","last_updated":"2023-09-08T13:46:01Z","snapshot_observed_at":"2026-08-16T15:02:15.516448Z","submitted_at":"2023-09-08T13:46:01Z","title":"A 2-Approximation Algorithm for Data-Distributed Metric k-Center","version":1},"cited_work":{"arxiv_id":"2309.04327","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.04327","snapshot_observed_at":"2026-08-16T11:21:04.268970Z","title":"A 2-Approximation Algorithm for Data-Distributed Metric k-Center","venue":"cs.CG","work_id":"4a8e5a9e-a5c3-49e7-85ea-8563166aa5ae","year":2023},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.028869Z"},"links":{"cited_paper":"/paper/2309.04327","citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:9b99e0a2805a53783659406a133b2a2a372fafaec01cfacd567693ea3dac80bd","observation_id":"2ed272d5-7d2a-4462-baa7-fcbc92d66faf","resolution":{"observed_at":"2026-08-16T11:21:04.274004Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.033019Z","title":"Network decomposition and locality in distributed computation","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.033019Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:979a33dd0dc78b93f94558dce9d96ac74ff61490a02d6ef074a7031d248b8151","observation_id":"5d78c367-681a-45ae-a0f0-a8dde58e9b52","resolution":{"observed_at":"2026-08-16T11:21:03.033019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12811","last_updated":"2023-02-24T18:46:27Z","snapshot_observed_at":"2026-08-16T15:52:53.060083Z","submitted_at":"2023-02-24T18:46:27Z","title":"$k$-Center Clustering with Outliers in the MPC and Streaming Model","version":1},"cited_work":{"arxiv_id":"2302.12811","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.12811","snapshot_observed_at":"2026-08-16T11:21:04.201927Z","title":"$k$-Center Clustering with Outliers in the MPC and Streaming Model","venue":"cs.DS","work_id":"6dadc843-61c3-4435-bc4f-a0c08f7e798c","year":2023},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.037174Z"},"links":{"cited_paper":"/paper/2302.12811","citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:e1e1fea41af4e30524c61080347ee5b050754647c3838916b12f4ca6953585e1","observation_id":"6c561657-399d-4ba9-a5d7-ccadc9de6659","resolution":{"observed_at":"2026-08-16T11:21:04.206514Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v35i5.16513","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.387083Z","title":"Mirrokni","venue":null,"work_id":"4f00add5-cb5f-425c-bd73-99c7bccbf1aa","year":2021},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.041670Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:a019082182b18c39fc9b207d8c8bfd425086dbc6b6ad58db3e2112beec19fce8","observation_id":"aee54f2d-0d0c-4c3b-ae04-d43188c748a6","resolution":{"observed_at":"2026-08-16T11:21:03.390050Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.045538Z","title":"Communication steps for parallel query processing","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.045538Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:a20efd5acbfda49e704bc1a959d8d2ce668f0133b91e8e31008ad2620517726d","observation_id":"2e3c6fc1-4897-4ddd-b35e-b79c13da74f8","resolution":{"observed_at":"2026-08-16T11:21:03.045538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.049079Z","title":"k -center clustering in distributed models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.049079Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:e8515ba4354893fb2ee0bcdd985b4d97efaf1cbd0e7c0eaf4b20e42e0ca03ec7","observation_id":"2a913dbb-84c1-46e8-abf8-0e02a39bc715","resolution":{"observed_at":"2026-08-16T11:21:03.049079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:04.411492Z","title":"Distributed clustering via LSH based data partitioning","venue":null,"work_id":"ea0d61a6-6e1a-45d2-8ba3-3af977b1ee08","year":2018},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.052668Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:07b28535d59e76cb98d1e65972a659e9809755d815ebc31c40355d36bfe4babb","observation_id":"652562f7-103b-4a64-a042-4817089ba8e3","resolution":{"observed_at":"2026-08-16T11:21:04.415797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T17:09:13.238240Z","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-16T11:21:03.060689Z","title":"Jiang, Robert Krauthgamer, Pavel Veselý, and Mingwei Yang","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.060689Z"},"links":{"cited_paper":"/paper/2204.02095","citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:287931530ef0511ce13ea0e16d05a14a4b70496c7d683899e72b0ad27edbce7a","observation_id":"a6eba71b-2ca5-4785-beaa-c80664a28c8e","resolution":{"observed_at":"2026-08-16T11:21:03.060689Z","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":"10.4230/lipics.icalp.2024.50","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.364828Z","title":null,"venue":null,"work_id":"eddbbbaa-42ac-4925-83ce-1a589b2ab1af","year":2024},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.064405Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:9eb20542a736ade47076229af08d015e1bc6ae853a31d5531d07424150de02cb","observation_id":"b238b38b-ecdc-4d46-b02e-cf11cb9993d9","resolution":{"observed_at":"2026-08-16T11:21:03.368332Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.067863Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.067863Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:cd56c0da1dbe9906d5ebdd6368e9863884bf8390c0fed45ab04c6d6c804c6088","observation_id":"40ec70b7-4b5e-4886-b931-20d529fe7f40","resolution":{"observed_at":"2026-08-16T11:21:03.067863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.071190Z","title":"Time and space optimal massively parallel algorithm for the 2-ruling set problem","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.071190Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:661791237dcdb696c12819f57aeceb4d995284e09542658edb9e057b4019acde","observation_id":"82d2a9e9-1709-4bbf-bed4-8e0fe72cf5f0","resolution":{"observed_at":"2026-08-16T11:21:03.071190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:04.401317Z","title":"Parallel and efficient hierarchical k -median clustering","venue":null,"work_id":"aa3a7272-5750-452c-bef7-bb69c716227e","year":2021},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.074658Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:8564de5090ae48c76eec71429d98ad224da1c250cd1676da79a3e9c5154657d5","observation_id":"ce8d9929-7e1d-40ec-856b-cb6e994c1841","resolution":{"observed_at":"2026-08-16T11:21:04.404975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:04.390473Z","title":"Mirrokni, and Peilin Zhong","venue":null,"work_id":"32118e28-1df6-4c2f-ba20-17c223144b71","year":2022},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.077981Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:32f88260c964bf863dc50933ec29c2a7749283862b526dfc3fcee0fc5c7ca4c6","observation_id":"c7a11bf3-da70-4887-9477-bb11505de9cf","resolution":{"observed_at":"2026-08-16T11:21:04.394046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:04.378366Z","title":"Solving k-center clustering (with outliers) in mapreduce and streaming, almost as accurately as sequentially","venue":null,"work_id":"d4623d1f-8b99-4908-a5f7-c88ffb36cf4c","year":2019},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.081432Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:7186cb72051314e19597fdbad3230843bfe78b3b5547be75216757895a5db5e0","observation_id":"996a71f7-6570-4559-8644-6e59c6108a46","resolution":{"observed_at":"2026-08-16T11:21:04.382334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.084736Z","title":"MapReduce : Simplified data processing on large clusters","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.084736Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:b94f10fd8f505908481915f20d8894122fab16453dd6e9f9f04f8bef7a1d3098","observation_id":"37d940ef-3688-422a-8aaf-2d6aa5f60ac8","resolution":{"observed_at":"2026-08-16T11:21:03.084736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.088432Z","title":"Fast clustering using MapReduce","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.088432Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:a609fba0b1cfd5fd53fc2611af0db2b776ecb74a00a036e490f56b80c643f273","observation_id":"e48e9448-1525-418c-b903-d909e76ee0ec","resolution":{"observed_at":"2026-08-16T11:21:03.088432Z","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":"10.1137/1.9781611977073.66","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.348847Z","title":"Mirrokni, and Peilin Zhong","venue":null,"work_id":"7b83f5a5-c5bc-4383-aa62-8fc0b9f5a2fd","year":2022},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.091516Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:4a42663a2050b410464603f8a229653a83b9fa9071cd628e0d943222fa73d711","observation_id":"32eb5bc9-6baf-449d-a4aa-d691ee9278b4","resolution":{"observed_at":"2026-08-16T11:21:03.352225Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3672562","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.339006Z","title":"Scattering and sparse partitions, and their applications","venue":null,"work_id":"4575d860-d38c-4a6e-bab9-373d0504fcdd","year":2024},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.094629Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:cae55c47b4c5fa099ef66f9ebff72d1e2a8438710143184f32fb75dcf58c80c9","observation_id":"622645d5-98aa-4348-8e22-91b83f025604","resolution":{"observed_at":"2026-08-16T11:21:03.342561Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.097485Z","title":"Improved MPC algorithms for MIS , matching, and coloring on trees and beyond","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.097485Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:dc3938581b4b50c211b36196f6d22d32d20719c3222f46e16aa37b8cc9259415","observation_id":"32cda7a3-53be-4ade-9101-f59dea44c25d","resolution":{"observed_at":"2026-08-16T11:21:03.097485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:04.367172Z","title":"Massively parallel algorithms, 2019","venue":null,"work_id":"25ddd0a2-9964-45e9-a1dd-b236cc6b4117","year":2019},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.100289Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:665ca0dd14ce52b4376dea041254434895a65c8f513a274c5df8bfd510ae9ad9","observation_id":"7a0ef780-1a83-44cc-947e-94ced717beca","resolution":{"observed_at":"2026-08-16T11:21:04.371037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:04.357480Z","title":"Distributed graph algorithms, 2022","venue":null,"work_id":"608375cc-0741-40e0-abb3-93f4a8718936","year":2022},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.103484Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:cd32788f562a872e34d5cf374ad766d1b2e3ca8382c97b66ccc442adbc6890b2","observation_id":"9bf4b429-0b4a-4213-a992-64e4aac5c4ed","resolution":{"observed_at":"2026-08-16T11:21:04.360531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.109742Z","title":"Gonzalez","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.109742Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:e9d64d52cddbf524eae2bfb38ef181bb79adbee41fb7db68e3234e5e6b4629bd","observation_id":"01e1790c-dd6c-4aca-b92a-2f7c62070573","resolution":{"observed_at":"2026-08-16T11:21:03.109742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.113146Z","title":"Massively parallel ruling set made deterministic","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.113146Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:021f76f4db82d4ea8d379f4cbd9772b0743109105cea3917df4b135378997a0e","observation_id":"a7885fbf-8669-4fd8-bcd7-2a011b339b97","resolution":{"observed_at":"2026-08-16T11:21:03.113146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1101.1902","last_updated":"2011-01-10T17:46:40Z","snapshot_observed_at":"2026-08-15T04:57:56.658948Z","submitted_at":"2011-01-10T17:46:40Z","title":"Sorting, Searching, and Simulation in the MapReduce Framework","version":1},"cited_work":{"arxiv_id":"1101.1902","doi":null,"metadata_source":"pith","pith_arxiv_id":"1101.1902","snapshot_observed_at":"2026-08-16T11:21:03.993098Z","title":"Sorting, Searching, and Simulation in the MapReduce Framework","venue":"cs.DC","work_id":"e3118a10-e9df-4309-9ac6-87eb205175bf","year":2011},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.116858Z"},"links":{"cited_paper":"/paper/1101.1902","citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:97745e25b9922442a5aed1d8d1c017cce8e5bc1bf7509663c3bcefdc566f439e","observation_id":"9fbd0668-3c01-48c2-9b47-94af9f70253c","resolution":{"observed_at":"2026-08-16T11:21:03.997487Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.120679Z","title":"Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.120679Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:cad72e45128177a21bd06572d15428d4c769e9ec2c97e8f9db9041063cccef22","observation_id":"f89687f0-e06d-4203-8078-d68091b99217","resolution":{"observed_at":"2026-08-16T11:21:03.120679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.123993Z","title":"No, coreset, no cry","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.123993Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:8630769484343996d5fe50e3450a9978b813ea8f286990f107eb34d8d72d014e","observation_id":"6825045f-7b98-4ff8-a037-73deaabdc6a9","resolution":{"observed_at":"2026-08-16T11:21:03.123993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.127484Z","title":"On coresets for k -means and k -median clustering","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.127484Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:66a59ce6f59f822dba35874d13ca9d9aa5d8cd63aebe28abf12695e5f9eab94b","observation_id":"e2068265-2bf9-4fd5-9067-3c0504e2a82c","resolution":{"observed_at":"2026-08-16T11:21:03.127484Z","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":"10.1287/moor.10.2.180","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.296491Z","title":"Hochbaum and David B","venue":null,"work_id":"099638c2-e0e2-4cf4-bed2-d439bd923efa","year":1985},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.130723Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:2a527167b3f9a5fc6e9cb4e3dcc4977d57a2c2acf39117ba432afea4c806389f","observation_id":"5dbc9973-b52f-43d4-8573-6b8c3aee7964","resolution":{"observed_at":"2026-08-16T11:21:03.300039Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5925.5933","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.919177Z","title":"Hochbaum and David B","venue":null,"work_id":"b7b550da-a527-4319-9038-aa5f97f25fc5","year":1986},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.134160Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:076a7a5738138f47cc3a7e57c1fd42c674e05490f8fa39fa3720eb149b284543","observation_id":"4e0f6776-42aa-47cf-bbfd-f514e4baa675","resolution":{"observed_at":"2026-08-16T11:21:03.924737Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.137664Z","title":"Almost optimal massively parallel algorithms for k -center clustering and diversity maximization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.137664Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:d0a4a5e6025e28d722a865b0ffa38ed38041d22d69439e8f645cbb3d8d6b50ce","observation_id":"75ee9de1-9d5d-4275-b247-eeb872139141","resolution":{"observed_at":"2026-08-16T11:21:03.137664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.141023Z","title":"Dryad: Distributed data-parallel programs from sequential building blocks","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.141023Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:3570e746427992491131905a945a4cc1bb9887567dcb083ffc23c3af5ed66c6b","observation_id":"dd1978eb-0580-4034-956b-c995ed031a6d","resolution":{"observed_at":"2026-08-16T11:21:03.141023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.145260Z","title":"Massively parallel computation: Algorithms and applications","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.145260Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:d597d1e6115d1730c4a7bc56085f3a7a0c04df14fa9618670a586006d10f064c","observation_id":"5d06695f-1d5d-4629-af5c-2f1a209cc014","resolution":{"observed_at":"2026-08-16T11:21:03.145260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.148813Z","title":"Brief announcement: Fast and better distributed mapreduce algorithms for k -center clustering","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.148813Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:3f54f336a12f6f8684e8cfed8f7540b32ef9d131646bd67f60f0c1dc1e263a6b","observation_id":"9d3eb907-3769-4246-b6a3-80da3a568994","resolution":{"observed_at":"2026-08-16T11:21:03.148813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.151799Z","title":"Pemmaraju, and Ajitanshu Singh","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.151799Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:0b1834936153c7b605a10320de92908ea2b2a9d26096e93288018a369457fad3","observation_id":"7bcb3011-f095-4edd-a43c-cefd21f6cb0b","resolution":{"observed_at":"2026-08-16T11:21:03.151799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.155253Z","title":"Extensions of Lipschitz maps into a Hilbert space","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.155253Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:fa284e7243e149c5d886b6b5c82f1181de6413b318ef712d2baf051bea773a13","observation_id":"6b37f948-f2b8-456a-90a8-5b3dcbfa7da3","resolution":{"observed_at":"2026-08-16T11:21:03.155253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.158903Z","title":"Universal approximations for TSP , Steiner tree, and set cover","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.158903Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:af18418a122d036cfe24bbee53800dbf702be53cc0a5b66b19d97f461d6c1444","observation_id":"4b685ccd-8c6f-43f7-a637-3a7c94f6695c","resolution":{"observed_at":"2026-08-16T11:21:03.158903Z","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":"10.1137/1.9781611977912.139","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.271996Z","title":"Massively parallel algorithms for high-dimensional Euclidean minimum spanning tree","venue":null,"work_id":"9c6f08bf-ecae-4799-ab50-fd67b76625c7","year":2024},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.162639Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:4257b4d59feb46f9e487850fbe21007b352175bc3cb8bdf885195ddea6601b6e","observation_id":"7302e847-19de-435a-9dde-cd1d3a106a5f","resolution":{"observed_at":"2026-08-16T11:21:03.277010Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.166203Z","title":"Karloff, Siddharth Suri, and Sergei Vassilvitskii","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.166203Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:18adc66587ad83242da654ac181e827f6dad8ca3a5a1d13f8e42c38b120720d8","observation_id":"2ac3b33d-0cf0-4684-84ec-e0d0ca7fefe0","resolution":{"observed_at":"2026-08-16T11:21:03.166203Z","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":"10.1007/978-981-97-2340-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.251832Z","title":"Improved approximation algorithm for the distributed lower-bounded k -center problem","venue":null,"work_id":"781ad150-4f29-46b7-9a78-6fdb39945225","year":2024},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.169932Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:46613d5099011ad1ed082fe185ea8f57c6b56b4da3c7d6ce2be07dcb7d9dbd10","observation_id":"cefa361b-506e-42d8-88f6-76024a41f427","resolution":{"observed_at":"2026-08-16T11:21:03.255992Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.173461Z","title":"A simple parallel algorithm for the maximal independent set problem","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.173461Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:7a634b6527aa8a02bfd408ae770846ef6142e1feb251fe24d659e06ce19cbc56","observation_id":"ce6381cf-cd58-4991-ae8b-b1a89aafe3df","resolution":{"observed_at":"2026-08-16T11:21:03.173461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:04.347683Z","title":"Kusner, Wenlin Chen, Kilian Q","venue":null,"work_id":"36547ad8-81f6-4a21-a771-7ae60d539df1","year":2015},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.176430Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:ddf46e959b70ad53964b3189da17fe8e5c8d9df43e2140c8a71ae38ad02c93bd","observation_id":"fcd20380-4d12-41ee-bfb7-96f0883054fa","resolution":{"observed_at":"2026-08-16T11:21:04.350827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.08745","last_updated":"2018-07-23T17:49:03Z","snapshot_observed_at":"2026-08-16T12:13:37.496268Z","submitted_at":"2018-07-23T17:49:03Z","title":"Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.08745","snapshot_observed_at":"2026-08-16T11:21:03.179204Z","title":"Round compression for parallel graph algorithms in strongly sublinear space","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.179204Z"},"links":{"cited_paper":"/paper/1807.08745","citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:d2164d17ac35e8b638258b812380b8107ce0ecd640676cd286a1af1752e90e04","observation_id":"efd21560-bf1a-4b9a-8c11-6fc3dcf02242","resolution":{"observed_at":"2026-08-16T11:21:03.179204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.182185Z","title":"Empirical Processes: Theory and Applications , chapter 4: Packing and Covering in Euclidean Spaces, pages 14--20","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.182185Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:9bb09e3ee204f109a094f41499adf5764e4d25f8be0ca9f5319f66877dfa6f51","observation_id":"5fafd1d0-d54c-4b39-ae42-f6a87e42cfe4","resolution":{"observed_at":"2026-08-16T11:21:03.182185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.184881Z","title":"Polylogarithmic-time deterministic network decomposition and distributed derandomization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.184881Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:aefca1dbdb0157a994d25aeab14d82b706bb10caf7c29518a2034d48ad81d466","observation_id":"3caedcea-ec67-4860-823f-1ed9824f3265","resolution":{"observed_at":"2026-08-16T11:21:03.184881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.187659Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.187659Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:989608a43c0dd247174e0c99c4800162d0bf5e36ea878f1fd7de6b89f1f01eb3","observation_id":"caa29fa8-7b29-4856-9bc7-3b12264fba36","resolution":{"observed_at":"2026-08-16T11:21:03.187659Z","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":"10.1007/s00446-010-0097-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.227773Z","title":"An optimal maximal independent set algorithm for bounded-independence graphs","venue":null,"work_id":"7975dee0-eeac-49b1-adc8-d72c64597d05","year":2010},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.190474Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:11b946f555e680b7b3b9c80a7ea66fe00d7c9bed2dd01987e33137c3d9bd322e","observation_id":"f5d213d5-8d64-4054-8d8f-af7c63bbd469","resolution":{"observed_at":"2026-08-16T11:21:03.234201Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"hadoop-the-definitive/9781491","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:03.456803Z","title":"Hadoop: The Definitive Guide","venue":null,"work_id":"e7939d52-a057-4ef1-a3c9-54611be0ed96","year":2015},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.195145Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:197d4acd6128a18c9f26beb243353cd4a25ec6d069f49692248801a5a1816c3c","observation_id":"b697263c-4d95-4a05-ba3d-814843135d95","resolution":{"observed_at":"2026-08-16T11:21:03.460954Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:21:04.335937Z","title":"Franklin, Scott Shenker, and Ion Stoica","venue":null,"work_id":"b92802d0-a2ad-433b-ab41-46362e443ef5","year":2010},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.198666Z"},"links":{"citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:9c8483b31a52a90117ee67478cb8c6d26778cbac3b4ca897d37744592a325809","observation_id":"7324d0b8-e719-4054-9164-f0edbe7ddd98","resolution":{"observed_at":"2026-08-16T11:21:04.339113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":14,"verified_fuzzy":8},"total_outbound_references":49},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2504.16382."}