Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints
As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1604.02218.
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-17T06:30:58.91139+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-08T20:49:17.044261Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-08T18:51:12.964602Z
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 3dedcc25-bf48-4116-b809-a5f6413bd678 · inbound
$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization cites this paper.
$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T20:49:17.044261Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9ca3397a-b886-4b7b-913f-fd9e7052a6b2 · inbound
Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint cites this paper.
Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints
Reference 19
- Resolution
- verified exact
- local_arxiv, observed 2026-08-08T18:51:12.968483Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.