{"as_of":"2026-08-12T06:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1975963c9c8546b87c754d294c85c292e2b2f46545da7523de72e36e6f40cd35","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-12T06:34:41.77262+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-11T20:02:09.617520Z","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-08T16:39:14.688156Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.15118","last_updated":"2024-02-13T19:39:48Z","snapshot_observed_at":"2026-07-06T14:23:43.235725Z","submitted_at":"2022-11-28T08:17:12Z","title":"A Faster $k$-means++ Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.15118","snapshot_observed_at":"2026-08-11T20:02:09.617520Z","title":"A faster k -means++ algorithm","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.06148","last_updated":"2025-02-20T18:38:08Z","snapshot_observed_at":"2026-08-11T19:55:48.254163Z","submitted_at":"2024-12-09T02:01:18Z","title":"The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-11T20:02:09.617520Z"},"links":{"cited_paper":"/paper/2211.15118","citing_paper":"/paper/2412.06148"},"observation_digest":"sha256:5a837739269836bf7464b9cebefc860d2decb688dbf12bfa113e3f03fad98fc5","observation_id":"58b94d7b-391d-425f-b6f3-411d2a11393a","resolution":{"observed_at":"2026-08-11T20:02:09.617520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.15118","last_updated":"2024-02-13T19:39:48Z","snapshot_observed_at":"2026-07-06T14:23:43.235725Z","submitted_at":"2022-11-28T08:17:12Z","title":"A Faster $k$-means++ Algorithm","version":2},"cited_work":{"arxiv_id":"2211.15118","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.15118","snapshot_observed_at":"2026-08-08T16:39:14.688156Z","title":"A Faster $k$-means++ Algorithm","venue":"cs.DS","work_id":"d84d272d-0e23-43f7-bd3d-e94bd88878e5","year":2022},"citing_paper":{"arxiv_id":"2502.06167","last_updated":"2025-02-10T05:36:30Z","snapshot_observed_at":"2026-08-09T01:42:08.911908Z","submitted_at":"2025-02-10T05:36:30Z","title":"Universal Approximation of Visual Autoregressive Transformers","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T16:39:14.228597Z"},"links":{"cited_paper":"/paper/2211.15118","citing_paper":"/paper/2502.06167"},"observation_digest":"sha256:34b7c0e4dae56da8e176799f49b7af1828971ec011ec422ee6f79a118c780011","observation_id":"f6fc0e1a-8f9e-4c25-a3ac-c4b8aec322a1","resolution":{"observed_at":"2026-08-08T16:39:14.691586Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2211.15118/citation-record","integrity":"/paper/2211.15118/integrity","json":"/paper/2211.15118/citation-record.json","paper":"/paper/2211.15118"},"outbound":[],"paper":{"arxiv_id":"2211.15118","last_updated":"2024-02-13T19:39:48Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T14:23:43.235725Z","submitted_at":"2022-11-28T08:17:12Z","title":"A Faster $k$-means++ Algorithm"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2211.15118."}