{"as_of":"2026-08-17T18:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bf43cadea2af0b7cbd40ef328d9cf88ce610addf1a4dc2e4bf011d048ca3b379","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:19:41.097894Z","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-07-09T05:36:01.273201Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.11217","last_updated":"2026-07-08T14:27:00Z","snapshot_observed_at":"2026-08-17T06:24:43.030973Z","submitted_at":"2024-07-15T20:04:06Z","title":"Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11217","snapshot_observed_at":"2026-08-08T17:47:03.026170Z","title":"Almost-linear time approximation algorithm to euclidean k-median and k-means","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05888","last_updated":"2025-02-09T13:01:50Z","snapshot_observed_at":"2026-08-08T17:29:29.515758Z","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T17:47:03.026170Z"},"links":{"cited_paper":"/paper/2407.11217","citing_paper":"/paper/2502.05888"},"observation_digest":"sha256:0bc9748936e4bc05766ea7ae5bdfabdce3063ce0f6d84993ef526e08ade439ae","observation_id":"1572407d-75c1-46ab-8d1d-a931c388bb37","resolution":{"observed_at":"2026-08-08T17:47:03.026170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11217","last_updated":"2026-07-08T14:27:00Z","snapshot_observed_at":"2026-08-17T06:24:43.030973Z","submitted_at":"2024-07-15T20:04:06Z","title":"Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11217","snapshot_observed_at":"2026-08-16T11:19:41.097894Z","title":"Almost-linear time approximation algorithm to euclidean k-median and k-means","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.097894Z"},"links":{"cited_paper":"/paper/2407.11217","citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:fea2a74a39ef8518ebba406823e32fc597a49c0a6b74ac9ce08e233d67a45ad4","observation_id":"e844e460-388e-43a7-a46d-268d9aa7cf11","resolution":{"observed_at":"2026-08-16T11:19:41.097894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2407.11217/citation-record","integrity":"/paper/2407.11217/integrity","json":"/paper/2407.11217/citation-record.json","paper":"/paper/2407.11217"},"outbound":[],"paper":{"arxiv_id":"2407.11217","last_updated":"2026-07-08T14:27:00Z","latest_version":4,"primary_category":"cs.DS","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"},"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 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2407.11217."}