{"as_of":"2026-08-18T23:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7b9803022763393dfb28ca4790b816d9a4ae77e63a82db532fd937b693e83fa4","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-15T23:10:43.960129Z","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-15T23:10:44.075075Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1111.6337","last_updated":"2012-06-14T01:40:01Z","snapshot_observed_at":"2026-08-18T14:21:26.995234Z","submitted_at":"2011-11-28T03:50:18Z","title":"Regret Bound by Variation for Online Convex Optimization","version":4},"cited_work":{"arxiv_id":"1111.6337","doi":null,"metadata_source":"pith","pith_arxiv_id":"1111.6337","snapshot_observed_at":"2026-08-15T23:10:44.075075Z","title":"Regret Bound by Variation for Online Convex Optimization","venue":"cs.LG","work_id":"45218913-bf79-4dff-bce9-92fc6a16485b","year":2011},"citing_paper":{"arxiv_id":"2505.05609","last_updated":"2025-05-08T19:37:35Z","snapshot_observed_at":"2026-08-17T00:36:28.034864Z","submitted_at":"2025-05-08T19:37:35Z","title":"On Corruption-Robustness in Performative Reinforcement Learning","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T23:10:43.960129Z"},"links":{"cited_paper":"/paper/1111.6337","citing_paper":"/paper/2505.05609"},"observation_digest":"sha256:1da500236a7288ce704f02a8b2f69b6d1d03cd77a52b60a78e02cf06ca06fccf","observation_id":"4bf12281-3cc7-4223-8cc5-dcf55ed6ea67","resolution":{"observed_at":"2026-08-15T23:10:44.082426Z","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/1111.6337/citation-record","integrity":"/paper/1111.6337/integrity","json":"/paper/1111.6337/citation-record.json","paper":"/paper/1111.6337"},"outbound":[],"paper":{"arxiv_id":"1111.6337","last_updated":"2012-06-14T01:40:01Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T14:21:26.995234Z","submitted_at":"2011-11-28T03:50:18Z","title":"Regret Bound by Variation for Online Convex 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-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:1111.6337."}