{"as_of":"2026-08-18T05:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3596da961caaa28a053e2310440b801fd7903f226b25cef95ac88e5ce68190db","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-09T05:29:22.411952Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.07615/citation-record","integrity":"/paper/2607.07615/integrity","json":"/paper/2607.07615/citation-record.json","paper":"/paper/2607.07615"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.914727Z","title":"On the fine- grained complexity of approximating k-center in sparse graphs","venue":null,"work_id":"47aabd50-96d6-4e82-80c7-35d2c702fb0c","year":2023},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:d7d6b67f64aea1eae7b853a41efb0c3116c53490faf4b8f6ad0ff8ef0eb40a3d","observation_id":"d8c6b6c2-9e16-43a1-a388-c27fe752e322","resolution":{"observed_at":"2026-07-09T05:36:01.916181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.908876Z","title":"Aggarwal and Chandan K","venue":null,"work_id":"2ee59028-2a87-4f28-80b0-6cdfae745dde","year":2014},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:30eb904031698171163f3944923e7fce0c4814630ae695fbde718b4b0b591c20","observation_id":"cb503389-5dc8-4a12-852d-1615436303b1","resolution":{"observed_at":"2026-07-09T05:36:01.910068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/18m1171321","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Better Guarantees for k-Means and","venue":"SIAM Journal on Computing","work_id":"ce779079-f4fb-46f8-a778-f7db510b4fbc","year":2020},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:bd76879f01232fdecdcde8412e287c89d80e97eb267405c478617c645d034474","observation_id":"35c831bf-66d7-44e5-bc48-fab8786aebfa","resolution":{"observed_at":"2026-07-09T05:36:01.010886Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:49.65679+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:49.65679+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.910663Z","title":"Euclidean spanners: short, thin, and lanky","venue":null,"work_id":"ab0ef855-bb9d-43b4-8423-8d6b72babebc","year":1995},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:14adb6fc8ac7667fd9eb5ddb79d9c3f17fcc1f49779e4be19f6ea5188b350ad2","observation_id":"beb78ff7-b7e6-475e-aa5c-7e3328d79d61","resolution":{"observed_at":"2026-07-09T05:36:01.912012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9907.509947","doi":"10.1145/509907.509947","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing , pages =","venue":null,"work_id":"183032c5-122e-41c9-89c1-8b448e19d79c","year":2002},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:c9c11749fae98182d7e9c5ea8932442434a7c20e34ea350c762a6b344f7c0287","observation_id":"77784e43-d4c6-4e1f-9531-d378013a1916","resolution":{"observed_at":"2026-07-09T05:36:00.998139Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:50.176093+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:50.176093+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1996.548477","doi":"10.1109/sfcs.1996.548477","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"37th Annual Symposium on Foundations of Computer Science","venue":null,"work_id":"4a4231a0-ac36-4a4d-8cfa-cc6ebb6b840e","year":1996},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:5158318212c20dadf7b0fc9f29fdee2b90ceae4d5c8d3b8c5042c0cd9365754c","observation_id":"51c52dc7-ee47-4c7a-9818-ad49ab37b3cc","resolution":{"observed_at":"2026-07-09T05:36:01.002548Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:50.713276+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:50.713276+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977554.ch101","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimal fully dynamick-center clustering for adaptive and oblivious adversaries","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"b1f93065-25a0-45d8-b000-3c7d9cffa352","year":2023},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:c0ddf4ae728f22cab9f01bd2ad0096accebd4d7687350bb01f28a381d8a1f8d4","observation_id":"359ece73-11ea-4b8b-972f-60953cb9c8f4","resolution":{"observed_at":"2026-07-09T05:36:01.064022Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:51.20346+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:51.20346+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-28349-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A survey of clustering data mining techniques","venue":null,"work_id":"de3c3357-c69a-47ea-8092-6a4a1dbb75e6","year":2006},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:a6e72eb2108cca77520fd904d8a4de32d64dd0535197d5b7ff9c125bfcbd17e9","observation_id":"d5a52e09-d634-4dd4-8b6e-3e3e75795df4","resolution":{"observed_at":"2026-07-09T05:36:01.068961Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:51.633403+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:51.633403+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.912606Z","title":"An improved approximation fork-median and positive correlation in budgeted optimization","venue":null,"work_id":"df1c3bae-5f56-42c4-81a9-cc660f6ce0f6","year":2017},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:b6d821ee14db3b5b9b7c4aebbaebe44c725f180df5c6a9ca4225ac5d80c5f9a7","observation_id":"07db4793-b844-4c70-946e-7ed25c5af91d","resolution":{"observed_at":"2026-07-09T05:36:01.914064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/276698","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rounding via trees: Deterministic approximation algorithms for group steiner trees andk-median","venue":null,"work_id":"0d3f4b41-a6aa-40f6-9a02-d37f85cf4144","year":1998},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:40fb1ae4cafdaf2b2c1686009ddf4a07361eeab624ee2738e176728688bd03fe","observation_id":"3be6ce3f-a3c6-459a-9de9-515c545d2763","resolution":{"observed_at":"2026-07-09T05:36:01.039324Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:52.075493+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:52.075493+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3196.2025","doi":"10.1109/focs63196.2025","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tight pair query lower bounds for matching and earth mover’s distance","venue":null,"work_id":"5fd4b01f-47c3-4faa-a1ac-715b003b010a","year":2025},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:2cdfe9b42157a49e592046de6cdc0b1fdf48fccb708fa445a2325d1d85a7588c","observation_id":"b3a4ae5a-1a78-445f-aaf0-cc2c028c4f71","resolution":{"observed_at":"2026-07-09T05:36:01.094162Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539701398594","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Improved combinatorial algorithms for facility location problems.SIAM J","venue":"SIAM Journal on Computing","work_id":"6aca14bb-5fa7-44d9-9994-0689d1908717","year":2005},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:84b754bcf4a72741b0764b23edd51902f4af304e466b0ff9fa83c1ce7a097588","observation_id":"b712cac9-fadf-444e-a21f-7515d64efa59","resolution":{"observed_at":"2026-07-09T05:36:01.036726Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:53.024475+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:53.024475+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2002.1882","doi":"10.1006/jcss.2002.1882","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Constant-Factor Approximation Algorithm for the k -Median Problem , journal =","venue":"Journal of Computer and System Sciences","work_id":"2fabaa5f-4da1-4ff4-8018-7db00fc2dfe2","year":2002},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:ba035ec02eae9b88b0f65b054d0b5680438cf5710575ba4d8f15ffc30028fbdf","observation_id":"89157c27-a273-4547-b457-bd0c4cfbd826","resolution":{"observed_at":"2026-07-09T05:36:01.083937Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:53.541304+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:53.541304+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.906941Z","title":"Mount, and Giri Narasimhan","venue":null,"work_id":"9c8ee6f4-000e-4730-9274-913c3e31c3da","year":2001},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:0b4e0c4ac70e6429ef418b70358053f3e5569761290feebb6f2f98b70dfe23c9","observation_id":"bc6b5c3c-20f7-4905-99a4-e29d397a33d5","resolution":{"observed_at":"2026-07-09T05:36:01.908176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-31594-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A dependent lp-rounding approach for the k-median problem","venue":"Lecture notes in computer science","work_id":"6038cda6-8aa5-4ea9-b960-76e39e42a585","year":2012},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:20cf42111af2ca6afd0d33d7996653eed7d7f84149717181116aa4d646fc228a","observation_id":"36d707ea-b6bc-406c-86c9-af86b873f9ea","resolution":{"observed_at":"2026-07-09T05:36:01.034075Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:54.001166+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:54.001166+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/070699007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications.SIAM J","venue":"SIAM Journal on Computing","work_id":"a9a1cff9-a306-4da0-98ad-9d05d73085a3","year":2009},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:b6abc811f39da07f456ad12992733171a8c0b4ba15c090b06c24791e959ed8b4","observation_id":"7adab7e8-5e9f-4572-8d44-a3a1c8af8f16","resolution":{"observed_at":"2026-07-09T05:36:01.077310Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:54.524512+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:54.524512+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.904965Z","title":"Size-estimation framework with applications to transitive closure and reachability","venue":null,"work_id":"3fc3ae70-3ab3-47ed-8941-1007cdab9b42","year":1997},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:9d1d4d8c71f430443b40e03b8bb1204cff1bae645de435ffec1ca849188d5e72","observation_id":"04413630-ee44-42c4-91b9-4a4d3fd69f0c","resolution":{"observed_at":"2026-07-09T05:36:01.906310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2000.1117","doi":"10.1006/jagm.2000.1117","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"All-pairs small-stretch paths.J","venue":"Journal of Algorithms","work_id":"06a782fb-d593-4a0f-a9bc-068928029358","year":2001},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:7311abfd4e9ed04c9c7509c62d5589dfda19c155cd9f70c0240a3c29d7bc5259","observation_id":"ac529a2c-e6f2-4408-98df-d29a9e2f0b10","resolution":{"observed_at":"2026-07-09T05:36:01.042902Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:54.969296+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:54.969296+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977554.ch37","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Breach- ing the 2 LMP approximation barrier for facility location with applications tok-median","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"91401d1c-9383-4dde-a4c4-b5001fb119b9","year":2023},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:2a673992229651f12d9235257f3ee980fe5727cc17648550d3c3f7b82ff6e085","observation_id":"a97cc758-b20c-4995-82b2-84f42ba5b4ee","resolution":{"observed_at":"2026-07-09T05:36:01.013387Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:55.481946+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:55.481946+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7823.37182","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.262520Z","title":"A (2 +ε)-approximation algorithm for metric k-median","venue":null,"work_id":"c43d0c73-4fb4-401f-9753-929c9b62d28f","year":2025},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:9f9cc2b0533fd61c51335c4155e301b50b1737389b1b9e61e47fa4e2517d492f","observation_id":"70721d2a-683b-4098-9c81-49450a4b2378","resolution":{"observed_at":"2026-07-09T05:36:01.264342Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977073.65","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An improved local search algorithm for k-median","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"d3110fef-7627-4b6a-805c-372339d0d307","year":2022},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:ca5ac034647f5f59764c2aa712f1e4f99b84513d3f8f7cef603a92ec8c81dd12","observation_id":"79f7d428-38b1-4f43-9158-e5bfad0dbebf","resolution":{"observed_at":"2026-07-09T05:36:01.016076Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:55.986113+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:55.986113+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2025.62","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Deterministic k-median clustering in near-optimal time","venue":"arXiv (Cornell University)","work_id":"02fb8006-5191-4982-9b1b-fae4210f055d","year":2025},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:4c067d1bae691b4a9bb4de04ef5fb6b0a5f8775d4433a5003bcde79c1bc1d193","observation_id":"3d5480c0-e399-4a3c-b4da-6b952d9900af","resolution":{"observed_at":"2026-07-09T05:36:01.059075Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:56.538372+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:56.538372+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2019.40","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction","venue":"arXiv (Cornell University)","work_id":"73161046-faa4-457d-8ecc-1c067779a685","year":2019},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:67ad2809689c0fc8b7ced465419d5fecb79d63e4a1c3c17a40c1e2fe16e4e9bb","observation_id":"c0bf7b85-247f-4eb1-be2d-b46eb25713f5","resolution":{"observed_at":"2026-07-09T05:36:01.066712Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:57.035586+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:57.035586+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2819008","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimal euclidean spanners: Really short, thin, and lanky.J","venue":"Journal of the ACM","work_id":"c005c157-40b5-489b-be24-b4ccbf3a74d3","year":2015},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:e6cf18a0fa43b3dc43da550a63ad8729230dbe06e0d85c2fc65f7e5ed997b1c2","observation_id":"821095e3-1007-4bf6-bac8-81a75678ed38","resolution":{"observed_at":"2026-07-09T05:36:01.071343Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:57.590337+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:57.590337+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2212.62255","doi":"10.1145/62212.62255","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"341bf3a7-8dd0-4d2a-af14-dcbd8e144e69","year":1988},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:ea6a835de214a321778991444b4812fcdcf85c2d937f6be4e4463095be480289","observation_id":"9ef59305-3a21-4edb-9916-6212db59279a","resolution":{"observed_at":"2026-07-09T05:36:01.022379Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:58.067855+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:58.067855+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.903131Z","title":"On strong diameter padded decompositions","venue":null,"work_id":"c182f872-3b44-4bf1-9c9f-f2c82b896792","year":2019},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:84b3721cbfa240cfd720bbf99b65e6f35d0b1aaf0eb403a9f3250324863dccd6","observation_id":"b6f3fab7-d71b-4f9d-8bfa-bf02c1b535a0","resolution":{"observed_at":"2026-07-09T05:36:01.904407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.899469Z","title":"González","venue":null,"work_id":"133dde45-4b14-4597-9651-518f254df4c1","year":1985},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:d44da4940443aebf9625c273d072e9d68df509f605092be11707065808b437bf","observation_id":"14a7722a-3261-476c-8bcb-dc691f3edd52","resolution":{"observed_at":"2026-07-09T05:36:01.900591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.901130Z","title":"On incremental approximate shortest paths in directed graphs","venue":null,"work_id":"08f696e6-378e-4044-85dc-32cc9ba15215","year":2025},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:d7eb80a4145e17244c99948d59fdd341bced2ee85bfbdcda19b790097b4808d8","observation_id":"5f2888e4-f016-4fd5-8842-dd84dffce9a7","resolution":{"observed_at":"2026-07-09T05:36:01.902463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977554.ch38","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gowda, Thomas W","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"e9a2144f-bfea-4813-ac9a-ff6d0927df4a","year":2023},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:9eb056fb1ea1cd4e236cc051a2398deff74eb2b41272578eea79416ac406a5ac","observation_id":"4e921e85-232f-4daa-a432-306321812186","resolution":{"observed_at":"2026-07-09T05:36:01.054930Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:58.503421+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:58.503421+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2000.892124","doi":"10.1109/sfcs.2000.892124","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Clustering data streams","venue":null,"work_id":"a07bcef7-bd51-4220-859a-cdcce3490e09","year":2000},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:a88307525c1856a5ff2d0552e46755aed0d6e65ba4341314e42e216308977d1d","observation_id":"ac40d49a-a2be-4b23-84bf-d86a361e2e95","resolution":{"observed_at":"2026-07-09T05:36:01.047850Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:58.99407+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:58.99407+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0809.2554","last_updated":"2008-09-15T15:42:47Z","snapshot_observed_at":"2026-08-16T19:21:44.451593Z","submitted_at":"2008-09-15T15:42:47Z","title":"Simpler Analyses of Local Search Algorithms for Facility Location","version":1},"cited_work":{"arxiv_id":"0809.2554","doi":"10.1145/375827.375845","metadata_source":"pith","pith_arxiv_id":"0809.2554","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simpler Analyses of Local Search Algorithms for Facility Location","venue":"cs.DS","work_id":"ccf67ae4-2c5d-4f8e-8604-910844819020","year":2008},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"cited_paper":"/paper/0809.2554","citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:373521e9348ff02f59bec57ff34ce484b1e3d9bca7772288a27947a107061bee","observation_id":"b72b8484-0594-4216-8ece-546e183b44d6","resolution":{"observed_at":"2026-07-09T05:36:01.260849Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-05-20T09:56:24.208337+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T09:56:24.208337+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02614317","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Cluster analysis and mathematical programming.Math","venue":"Mathematical Programming","work_id":"a2573925-9659-42ab-9a45-497ff06da165","year":1997},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:370d4b77d3b4eed33ae1ec282a70738d3c5be861f8b6126a6be4dd377dcbfcec","observation_id":"fabe1fae-f332-48c3-a2ce-957f1094332b","resolution":{"observed_at":"2026-07-09T05:36:01.090463Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:59.614831+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:59.614831+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00454-004-2822-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Clustering motion.Discret","venue":"Discrete & Computational Geometry","work_id":"ed3b81b3-6b05-489a-8522-eca4e3c311da","year":2004},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:caadaefd182b7ef993aad997ef71d2dd5d64a5866a0c32a528fe42ad2d2988b7","observation_id":"b432c5d0-9e30-4fd0-baec-6a8ed0eae2bc","resolution":{"observed_at":"2026-07-09T05:36:01.031085Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:00.151484+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:00.151484+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973105.57","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Euclidean spanners in high di- mensions","venue":null,"work_id":"2e25c8fd-14e7-4247-bdf5-b4050978d11b","year":2013},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:d0a1bb74b96ab56a07d31948c9e86aa0c36be740f55aece235597c8fbbb37c43","observation_id":"568319e5-c9a1-4953-8eb2-682c446c5f28","resolution":{"observed_at":"2026-07-09T05:36:01.061626Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:00.665538+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:00.665538+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.943518Z","title":"Hochbaum and David B","venue":null,"work_id":"73f24f66-ff19-44ad-9a4c-a7eb2f5ee1b0","year":1985},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:c992f1ede2baf2772acb29390defdd2e8d443227ecbab36ad1ffa8c5bb9d2269","observation_id":"a804d6bb-beb2-48a2-9551-b538606a0d0e","resolution":{"observed_at":"2026-07-09T05:36:01.944678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1250.301366","doi":"10.1145/301250.301366","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sublinear time algorithms for metric space problems","venue":null,"work_id":"8d479b4f-ac94-46dd-ac7b-4788ceae10d3","year":1999},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:7ae69ddc308f900388b352d426a30d577893b3aff8504f969709bf0f7619a79d","observation_id":"831c4af8-6f57-4b72-a724-e3afd3fd1a2a","resolution":{"observed_at":"2026-07-09T05:36:01.088263Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:01.256923+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:01.256923+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1499.331504","doi":"10.1145/331499.331504","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ACM Computing Surveys31(3), 264–323 (1999) https://doi.org/10.1145/331499.331504","venue":"ACM Computing Surveys","work_id":"14fe62be-03d5-4818-8ce9-49d8fd237574","year":1999},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:67c6b2c0b88af3fd510f5250335880e79a493649c5577e5a076b3b706134eb71","observation_id":"7a6d8fae-2504-4e29-b3c0-3b6c34c41df9","resolution":{"observed_at":"2026-07-09T05:36:01.051623Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:01.911004+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:01.911004+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0620.950621","doi":"10.1145/950620.950621","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Vazirani","venue":"Journal of the ACM","work_id":"6dd4ea3c-7274-4f40-852b-7292625c7c50","year":2003},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:2117d889477d9a370f49e61beb347104b369468483249d5c794a0df313beba85","observation_id":"c5708c47-3f8d-4251-a905-035e4b383b67","resolution":{"observed_at":"2026-07-09T05:36:01.074761Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:02.500609+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:02.500609+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9907.510012","doi":"10.1145/509907.510012","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A new greedy approach for facility location problems","venue":null,"work_id":"8f6cf7cc-758f-441a-b07f-7cc963b926fc","year":2002},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:d7dca32cd5b6ffcb9de3adea1245622dbb980e4af01da983c8a04f2a83432af7","observation_id":"4d6a7b35-c4db-45e3-8de3-a81cb646b8d2","resolution":{"observed_at":"2026-07-09T05:36:01.008007Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:03.083639+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:03.083639+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.941583Z","title":"Vazirani","venue":null,"work_id":"fc55110e-9699-4318-9f48-12c5e7e09fbc","year":2001},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:2826d502c10a278c491fc9efe23b976f2a022136c7503d8f0da4b14995a11c24","observation_id":"58241db2-acbf-4a98-add9-51aaf18cd762","resolution":{"observed_at":"2026-07-09T05:36:01.942865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.935201Z","title":"Local search for clustering in almost-linear time","venue":null,"work_id":"8266d92b-d9bb-43f4-aaaa-17a4fdddd354","year":2026},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:1577d9343eeaf8d21823bc585f74bcfb8c5572febfa42922d14a179b2ba5135e","observation_id":"63648e53-a07e-4e80-bdda-216c61a08538","resolution":{"observed_at":"2026-07-09T05:36:01.936518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.08713","last_updated":"2026-06-07T16:09:04Z","snapshot_observed_at":"2026-08-02T22:19:02.442419Z","submitted_at":"2026-06-07T16:09:04Z","title":"The price of incrementality in k-center clustering","version":1},"cited_work":{"arxiv_id":"2606.08713","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.08713","snapshot_observed_at":"2026-07-09T05:36:01.265864Z","title":"The price of incrementality in k-center clustering","venue":"cs.DS","work_id":"5e510a28-a1cb-4047-97a0-a432da4f1844","year":2026},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"cited_paper":"/paper/2606.08713","citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:6c9f8afcf8c37dc872e21c799bb600fbe94b2703a4cbded4d1692a1525a4e733","observation_id":"7d0cf9a8-17fe-425a-87ba-c55668eb586f","resolution":{"observed_at":"2026-07-09T05:36:01.271669Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11217","last_updated":"2026-07-08T14:27:00Z","snapshot_observed_at":"2026-08-17T06:24:43.030973Z","submitted_at":"2024-07-15T20:04:06Z","title":"Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means","version":4},"cited_work":{"arxiv_id":"2407.11217","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.11217","snapshot_observed_at":"2026-07-09T05:36:01.273201Z","title":"Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means","venue":"cs.DS","work_id":"64be51ee-d4c5-4c3f-8e12-89d02e6f6638","year":2024},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"cited_paper":"/paper/2407.11217","citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:fa0382f79746531c48e84088bf574fe90be83140db51b457f0cfcb523a5a6692","observation_id":"afff5cf9-091d-4cd4-b3bf-267ba394e50c","resolution":{"observed_at":"2026-07-09T05:36:01.276322Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.937196Z","title":"Truly optimal euclidean spanners.SIAM Journal on Computing, 54(4):FOCS19–135, 2025","venue":null,"work_id":"eef871b2-2ee5-4840-8103-7b44b92792e7","year":2025},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:253bbc5b79085aa3b3c327f3b7db4e846298517b03083a923adc4dac6d62f574","observation_id":"9b29963c-ee4e-4a00-a12c-c918f78932c2","resolution":{"observed_at":"2026-07-09T05:36:01.938735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/130938645","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2016 , url =","venue":"SIAM Journal on Computing","work_id":"41d7ab60-830f-45d9-8d8c-98a17c2fa8a8","year":2016},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:b74e45a3732684ec05e146f66c375f92561c8ca98972186d4154dcf4afe93a4b","observation_id":"5a024fd0-470e-4d66-827b-af72f59dc14f","resolution":{"observed_at":"2026-07-09T05:36:00.981990Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:03.5883+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:03.5883+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/070698257","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Williamson","venue":"SIAM Journal on Computing","work_id":"db0b778e-900d-4117-9d72-4e6059acac29","year":2010},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:62ce52221570b0b009064b33c9d92ea5c766f7508ba0de38ac8ed67898bdc180","observation_id":"397834d0-380a-4c62-a19a-f65ca2136cab","resolution":{"observed_at":"2026-07-09T05:36:01.025579Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:04.150986+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:04.150986+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6689.180670","doi":"10.1145/1806689.1806701","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms","venue":null,"work_id":"8ddf0909-65d7-4c92-91a2-b7ecbf19e0ac","year":2010},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:39a199bbc24f162ce88ecb23b81dd62561ac435632bb76679a5b2c4f1e557b65","observation_id":"17ff2797-b7d9-4bc2-8677-00eb8092916c","resolution":{"observed_at":"2026-07-09T05:36:00.990815Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.939405Z","title":"The online median problem.SIAM Journal on Computing, 32(3):816–832, 2003","venue":null,"work_id":"5eabb969-1c27-4fd5-83c3-e0dfb74967ba","year":2003},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:61cb1e02e61011c218a4a9d495b8582359a0fd2453e266593e5e78fb64dc3bf4","observation_id":"74c8c37e-5538-4f49-b535-80d8cd52c668","resolution":{"observed_at":"2026-07-09T05:36:01.940951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1023/b:mach.0000033114","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.026577Z","title":"Mettu and C","venue":null,"work_id":"485aaa7a-2e63-44fe-9c66-89d165a0b067","year":2004},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:8836e074119239215803af2867f4cf54997166c70e0de0b5b4faaac7d89bdd31","observation_id":"cca6e92a-885c-47e6-a710-5b7af630fc97","resolution":{"observed_at":"2026-07-09T05:36:01.028261Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:05.063348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:05.063348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.945326Z","title":"Deterministic constructions of approximate distance oracles and spanners","venue":null,"work_id":"7f0cd6b7-4a07-4f30-b050-3bcfa8041308","year":2005},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:3b1b69027242e160d5180aa95c5ca2696687e6f68249d3819c0d1d3903a404b4","observation_id":"1761d4e3-3da5-4f81-a7a4-e99ca634ef64","resolution":{"observed_at":"2026-07-09T05:36:01.946747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-010-9401-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On dynamic shortest paths problems.Algorithmica, 61(2):389–401, 2011","venue":"Algorithmica","work_id":"db0d291f-33bd-44f6-9a2b-637d84f4100d","year":2011},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:7edbaf8cd86a43b107571ad133000f5cc7678b06724057fc4b5242322a824ae5","observation_id":"47db78f5-9f8b-4723-be43-6e8da9aba6f2","resolution":{"observed_at":"2026-07-09T05:36:01.079952Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:05.475452+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:05.475452+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.929216Z","title":"Quick k-median, k-center, and facility location for sparse graphs","venue":null,"work_id":"e09f2f86-40b0-4253-9d30-d107aec82cac","year":2001},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:b27d7946bec4fe7ddee7d6cf53605033bce8585200ff892886ff55f7347c0a7f","observation_id":"0969efc1-9670-4ab8-889a-360b926e1401","resolution":{"observed_at":"2026-07-09T05:36:01.930615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.931243Z","title":"Quick k-median, k-center, and facility location for sparse graphs.SIAM Journal on Computing, 34(2):405–432, 2005","venue":null,"work_id":"127ecb47-9218-4776-8eb2-5eda52d31290","year":2005},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:13008ccdcc906a93c9c2017d1f9217564a883975038555e5f44d40ecfedb075c","observation_id":"02844eda-af23-40cb-be3d-62b5a17e4313","resolution":{"observed_at":"2026-07-09T05:36:01.932755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.933401Z","title":"Compact routing schemes","venue":null,"work_id":"c8769445-2315-4568-88c0-c540f27e7ca2","year":2001},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:90b3661454314aeaf851c2f821e956efaa59730e4cae7be85b56e420c224e194","observation_id":"73044e5a-0c5d-4e49-8aa1-09cbcb61bc7a","resolution":{"observed_at":"2026-07-09T05:36:01.934585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.927297Z","title":"Approximate distance oracles.Journal of the ACM (JACM), 52(1):1–24, 2005","venue":null,"work_id":"1802f765-cfa7-467b-8e20-5236b1fa3b65","year":2005},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:27fc1ee5b2d449bd8d482c9fdf82f3493b3aacecf76d3f26d8dfe12499d1da0a","observation_id":"7c86ea44-6b76-48b3-9d53-349e6fcef8d4","resolution":{"observed_at":"2026-07-09T05:36:01.928632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11222-007-9033-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Statistics and Computing 17: 395--416","venue":"Statistics and Computing","work_id":"0375804a-40b6-4b8f-ac46-a9c0e880131b","year":2007},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:fd2c7c657340882312bc7bc44655d19da9c4f0e6b54ccce6680c43817f564e73","observation_id":"bdfd7d59-705f-4d07-b045-a21b255ab4ac","resolution":{"observed_at":"2026-07-09T05:36:01.018861Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:49:06.303333+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:49:06.303333+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.925264Z","title":"Shmoys.The Design of Approximation Algorithms","venue":null,"work_id":"825fc0ea-eff1-49ae-8b60-81006d470032","year":2011},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:64664c399265b907874784b4cafe86ef3c9eb8b89a12f3c0f844b0889dbe140b","observation_id":"0454d9db-970e-4cd9-9bf5-eb84a047bbe2","resolution":{"observed_at":"2026-07-09T05:36:01.926669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.919093Z","title":"In turn, the constraint onc becomes c≥ ρ2 2 instead ofc≥5","venue":null,"work_id":"e4c7e9ed-4395-4216-a9d8-85b826bdbe07","year":null},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:60e963d8130bf67b3720e172428a53b04841f0d2ff7446d130e5c19ce4bf4e69","observation_id":"f564ea21-e647-4c38-a4e7-cbb0ef02d4d3","resolution":{"observed_at":"2026-07-09T05:36:01.920515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.916781Z","title":"When cost(In(Pγ), Ck)is analyzed in the proof of Lemma A.5, the constant3can be trivially replaced by ρ, since (rγ)z · |B(γ, r γ)| ≤ρ·Value(B(γ, r γ))","venue":null,"work_id":"e0a3c259-26bd-420f-a14b-c77284513af3","year":null},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:25f4cabc0eb4aba42bf57aff80b6a864a26132202aaff2273719f75578b30237","observation_id":"71869e2b-0587-4a70-8fd5-ff3a4aa54479","resolution":{"observed_at":"2026-07-09T05:36:01.918440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.921157Z","title":"When cost(B(x, c·r ), Γ) is analyzed in the proof of Lemma A.6, the constant3can be trivially replaced byρ, since rz · |B(x, c·r)| ≥ Value(B(x,r)) ρ","venue":null,"work_id":"25b93f1f-23d8-48ad-95ea-3afc8bb82498","year":null},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:971764ab8f93e7cfec093736484c29bf127f0757b947635174f76a6a724c275a","observation_id":"978b7d72-8cd2-4c87-a0dd-8d4823636b63","resolution":{"observed_at":"2026-07-09T05:36:01.922621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T05:36:01.923255Z","title":"Bk-Center with Outliers We now extend the incremental framework developed in Section 3 to thek-center problem with outliers, where up tot points may be discarded","venue":null,"work_id":"fbd39fb3-0372-43a8-81ad-3059f7853e49","year":null},"citing_paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-09T05:29:22.411952Z"},"links":{"citing_paper":"/paper/2607.07615"},"observation_digest":"sha256:3ad0dac90779c0305ec295544e1f75ffeb9284d2eff26658a89276276c7a8aae","observation_id":"555753fb-d05f-49b1-b051-8da58ef50426","resolution":{"observed_at":"2026-07-09T05:36:01.924666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.07615","last_updated":"2026-07-08T16:30:33Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T00:58:29.528457Z","submitted_at":"2026-07-08T16:30:33Z","title":"Faster Randomized and Deterministic k-Clustering on Graphs"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":1,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":0,"verified_exact":31,"verified_fuzzy":24},"total_outbound_references":61},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 0 inbound Pith citation observations for arXiv:2607.07615."}