{"as_of":"2026-08-18T11:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5cb3aff9d414aceef72d5a5908ac94baa6f6d8c7865443f3b131ebab814079dc","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-18T06:34:40.430872+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-16T11:19:40.947493Z","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-14T04:19:03.543299Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.03121","last_updated":"2024-11-05T14:08:43Z","snapshot_observed_at":"2026-08-18T08:48:52.490017Z","submitted_at":"2024-11-05T14:08:43Z","title":"Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03121","snapshot_observed_at":"2026-08-16T11:19:40.947493Z","title":"Fully dynamic k-median with near-optimal update time and recourse","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":3,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:40.947493Z"},"links":{"cited_paper":"/paper/2411.03121","citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:1fba974721cec90235f731b1e16eb39bcb23162e08fcc9104d50e7dd07aa1c90","observation_id":"4eba1ade-4c88-47e1-bb11-b8dfc1a5f6d8","resolution":{"observed_at":"2026-08-16T11:19:40.947493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03121","last_updated":"2024-11-05T14:08:43Z","snapshot_observed_at":"2026-08-18T08:48:52.490017Z","submitted_at":"2024-11-05T14:08:43Z","title":"Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse","version":1},"cited_work":{"arxiv_id":"2411.03121","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.03121","snapshot_observed_at":"2026-08-14T04:19:03.543299Z","title":"Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse","venue":"cs.DS","work_id":"d3784a74-8722-4d7c-a247-5c7d38c0cd29","year":2024},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-18T08:27:13.088055Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":232,"source":"pdf_text","source_observed_at":"2026-08-14T04:19:02.936152Z"},"links":{"cited_paper":"/paper/2411.03121","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:655b94c28f4240c6deca62f11a7f89993bd5deba06363977664736d6605e0503","observation_id":"8c5f82d2-1a31-4d07-bd09-3262e43b36d3","resolution":{"observed_at":"2026-08-14T04:19:03.554597Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/2411.03121/citation-record","integrity":"/paper/2411.03121/integrity","json":"/paper/2411.03121/citation-record.json","paper":"/paper/2411.03121"},"outbound":[],"paper":{"arxiv_id":"2411.03121","last_updated":"2024-11-05T14:08:43Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T08:48:52.490017Z","submitted_at":"2024-11-05T14:08:43Z","title":"Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse"},"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 2 inbound Pith citation observations for arXiv:2411.03121."}