{"as_of":"2026-08-18T03:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7aaedeae5602df4858a23429755eda4768cf015f979fff766ab6257112bb9b58","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T12:08:16.088201Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T16:18:21.697769Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1802.00459","last_updated":"2019-02-07T18:47:20Z","snapshot_observed_at":"2026-08-14T19:49:45.054193Z","submitted_at":"2018-02-01T19:07:51Z","title":"Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.00459","snapshot_observed_at":"2026-08-08T12:08:16.088201Z","title":"Yang, and Peilin Zhong","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.07669","last_updated":"2025-02-11T16:14:53Z","snapshot_observed_at":"2026-08-17T14:04:24.771759Z","submitted_at":"2025-02-11T16:14:53Z","title":"Coresets for Robust Clustering via Black-box Reductions to Vanilla Case","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T12:08:16.088201Z"},"links":{"cited_paper":"/paper/1802.00459","citing_paper":"/paper/2502.07669"},"observation_digest":"sha256:4dd9ce752238665177d33421587d06192a5ae16c52c40ab6c86436e8a2e76273","observation_id":"fa4b4756-40a1-4b32-8164-79287e850a21","resolution":{"observed_at":"2026-08-08T12:08:16.088201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.00459","last_updated":"2019-02-07T18:47:20Z","snapshot_observed_at":"2026-08-14T19:49:45.054193Z","submitted_at":"2018-02-01T19:07:51Z","title":"Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data","version":2},"cited_work":{"arxiv_id":"1802.00459","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.00459","snapshot_observed_at":"2026-08-06T16:18:21.697769Z","title":"Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data","venue":"cs.DS","work_id":"4670e3cd-9cfc-4003-9bd2-e209299b9013","year":2018},"citing_paper":{"arxiv_id":"2507.14089","last_updated":"2025-07-18T17:13:36Z","snapshot_observed_at":"2026-08-06T15:59:15.141351Z","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T16:18:21.583437Z"},"links":{"cited_paper":"/paper/1802.00459","citing_paper":"/paper/2507.14089"},"observation_digest":"sha256:f2782c155e4aa828f16c9095d7c67fd747f76a266cbcc1c61d1a985ff426b2a6","observation_id":"777c2475-a9ad-482a-b5f8-4c91aca176c1","resolution":{"observed_at":"2026-08-06T16:18:21.811376Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-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"}}],"links":{"evidence":"/evidence","html":"/paper/1802.00459/citation-record","integrity":"/paper/1802.00459/integrity","json":"/paper/1802.00459/citation-record.json","paper":"/paper/1802.00459"},"outbound":[],"paper":{"arxiv_id":"1802.00459","last_updated":"2019-02-07T18:47:20Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T19:49:45.054193Z","submitted_at":"2018-02-01T19:07:51Z","title":"Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1802.00459."}