{"as_of":"2026-08-18T10:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:be368d8d6ebd99cb344c90c142ea1b48764bbc0d7b44e332aa202ddc8774a297","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:19:41.152464Z","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-16T11:19:41.184978Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.02971","last_updated":"2025-03-15T01:58:29Z","snapshot_observed_at":"2026-08-18T06:50:49.456405Z","submitted_at":"2024-03-05T13:49:32Z","title":"Space Complexity of Euclidean Clustering","version":3},"cited_work":{"arxiv_id":"2403.02971","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.02971","snapshot_observed_at":"2026-08-16T11:19:41.184978Z","title":"Space Complexity of Euclidean Clustering","venue":"cs.CG","work_id":"a118f7d2-79b1-45f1-abf2-7df10bcaeb05","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":54,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.152464Z"},"links":{"cited_paper":"/paper/2403.02971","citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:5747fb6252277e3791911b3bb96b88e79cf93d792ea48a070076046f7936b3be","observation_id":"282d1108-b281-464b-99f3-82bcd7527f7d","resolution":{"observed_at":"2026-08-16T11:19:41.191214Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.02971/citation-record","integrity":"/paper/2403.02971/integrity","json":"/paper/2403.02971/citation-record.json","paper":"/paper/2403.02971"},"outbound":[],"paper":{"arxiv_id":"2403.02971","last_updated":"2025-03-15T01:58:29Z","latest_version":3,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-18T06:50:49.456405Z","submitted_at":"2024-03-05T13:49:32Z","title":"Space Complexity of Euclidean Clustering"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.02971."}