{"as_of":"2026-08-22T09:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:adfcde9fa2a6850728dd9b5a33c26eda10bd6cf949f9580a547b213a19ed0e00","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-22T06:32:14.747728+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-12T17:58:56.123912Z","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-12T17:58:56.422758Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.03213","last_updated":"2021-05-11T02:05:14Z","snapshot_observed_at":"2026-08-20T02:05:35.347390Z","submitted_at":"2020-02-08T18:10:20Z","title":"Curvature of Feasible Sets in Offline and Online Optimization","version":2},"cited_work":{"arxiv_id":"2002.03213","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.03213","snapshot_observed_at":"2026-08-12T17:58:56.422758Z","title":"Curvature of Feasible Sets in Offline and Online Optimization","venue":"cs.DS","work_id":"ccb7f58b-e25c-4fab-8f9f-611f49b69595","year":2020},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.123912Z"},"links":{"cited_paper":"/paper/2002.03213","citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:0eaff65cb15e898eed439149281b4be4e960e257bd2ad6bfac1074b7b88b036c","observation_id":"006491f2-e894-442f-b2f8-38a8697e410c","resolution":{"observed_at":"2026-08-12T17:58:56.427419Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2002.03213/citation-record","integrity":"/paper/2002.03213/integrity","json":"/paper/2002.03213/citation-record.json","paper":"/paper/2002.03213"},"outbound":[],"paper":{"arxiv_id":"2002.03213","last_updated":"2021-05-11T02:05:14Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-20T02:05:35.347390Z","submitted_at":"2020-02-08T18:10:20Z","title":"Curvature of Feasible Sets in Offline and Online Optimization"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2002.03213."}