{"as_of":"2026-08-08T10:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ac6bfe338bbb0392aaf01133c3f402431fdee4e47151f6e91d756611a32ecb3c","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-08T06:32:00.761636+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-07T10:39:41.076073Z","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-07T18:16:16.850658Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.05753","last_updated":"2023-07-06T17:21:27Z","snapshot_observed_at":"2026-08-06T19:41:24.401159Z","submitted_at":"2022-11-10T18:41:42Z","title":"The Randomized $k$-Server Conjecture is False!","version":2},"cited_work":{"arxiv_id":"2211.05753","doi":"10.48550/arxiv.2211.05753","metadata_source":"pith","pith_arxiv_id":"2211.05753","snapshot_observed_at":"2026-08-07T18:16:16.850658Z","title":"The Randomized $k$-Server Conjecture is False!","venue":"cs.DS","work_id":"2bb2fb6a-b692-4363-aa9c-481833855ef5","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.076073Z"},"links":{"cited_paper":"/paper/2211.05753","citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:a2c046f1fc2f2a92e254a0228790cd7aab8c1f0cb49c4df91ca7684764cd6119","observation_id":"db0d7e90-f1b2-421b-b89f-1af18e8e1a93","resolution":{"observed_at":"2026-08-07T10:39:41.254700Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2211.05753/citation-record","integrity":"/paper/2211.05753/integrity","json":"/paper/2211.05753/citation-record.json","paper":"/paper/2211.05753"},"outbound":[],"paper":{"arxiv_id":"2211.05753","last_updated":"2023-07-06T17:21:27Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T19:41:24.401159Z","submitted_at":"2022-11-10T18:41:42Z","title":"The Randomized $k$-Server Conjecture is False!"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2211.05753."}