Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization
As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1912.01698.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T16:23:35.045711Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-07-09T20:46:33.692340Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 9c9eb0e8-c011-471c-bbcb-e9ff7e7f7168 · inbound
Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps cites this paper.
Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-05T21:19:39.044671Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7f887d52-b9a7-4077-8634-efadbd719be3 · inbound
A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization cites this paper.
A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T16:23:35.045711Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f46aeb6f-5868-4a84-9993-2b69eb34babb · inbound
Forgetting-Factor Regret for Online Zero-Sum Games cites this paper.
Forgetting-Factor Regret for Online Zero-Sum Games Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization
Reference 39
- Resolution
- verified exact
- local_arxiv, observed 2026-07-09T20:46:33.693661Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.