Pith. sign in

Paper Citation Record · LEDGER

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints

As of 24 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 3 inbound Pith citation observations for arXiv:2412.08060.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2412.08060 v2

Coverage vector

measured 20 of 20 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T18:26:46.885775Z

measured 23 of 23 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T13:35:49.517407Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-02T02:36:27.512069Z

Reference resolution

20 of 20 outbound references displayed

  • verified exact3
  • verified fuzzy7
  • unresolved10
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 8d70bba2-ca3d-4fa9-a1e9-90c076ebda2a · outbound

This paper cites Lazy Lagrangians with Predictions for Online Learning.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Lazy Lagrangians with Predictions for Online Learning

Reference 1

Resolution
verified exact
local_arxiv, observed 2026-08-11T18:26:46.969972Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-11T18:26:46.834225Z digest=sha256:73af2d8744035d9a5cd5dc9924655b4aaaec16b24bca4b3861337d6d2c23e040

Observation 252f7d4a-3d14-4ef0-9c81-3b87dc10f88e · outbound

This paper cites Online optimization with gradual variations.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Online optimization with gradual variations

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-11T18:26:46.838129Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:26:46.838129Z digest=sha256:51cdec9726ac5646dace48c9e653516da7de43069c959f1e4539ea72f4d480a5

Observation db6c482f-b92b-4c97-8177-0ac0fc75710c · outbound

This paper cites Optimistic and Adaptive Lagrangian Hedging.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Optimistic and Adaptive Lagrangian Hedging

Reference 3

Resolution
verified exact
local_arxiv, observed 2026-08-11T18:26:46.958092Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-11T18:26:46.841393Z digest=sha256:a2a1594b9dead6ed54a762d7376a095e086076826c3d9e2f03dcc097cf9be849

Observation 060daa2c-f1fc-4bf4-9991-60ea1a19ef57 · outbound

This paper cites Adaptive subgradient methods for online learning and stochastic optimization.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Adaptive subgradient methods for online learning and stochastic optimization

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-11T18:26:46.844844Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:26:46.844844Z digest=sha256:567f0aad2d572d1e32f9e4094b9fa14def7bc3cc570dab806e43fe4fad9168c8

Observation c96a2d3d-11d8-439a-ad4e-4d3228b702e5 · outbound

This paper cites Online convex optimization with hard constraints: towards the best of two worlds and beyond.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Online convex optimization with hard constraints: towards the best of two worlds and beyond

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T18:26:47.038640Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-11T18:26:46.849131Z digest=sha256:7820681fe4c46caebf052c384eac1b44f86b0e8788afbb195f95e5f0a73299fe

Observation 82218bfe-5993-4842-a2d2-0480eb49e494 · outbound

This paper cites Introduction to Online Convex Optimization.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Introduction to Online Convex Optimization

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-11T18:26:46.852334Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:26:46.852334Z digest=sha256:4e92dbe80d0d81a3f3a8cb4f719d693f9046851b023487ed0155e266effe46f5

Observation 947615cd-a886-4ba2-9a53-57f7f45642b8 · outbound

This paper cites Adaptive algorithms for online convex optimization with long-term constraints.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Adaptive algorithms for online convex optimization with long-term constraints

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T18:26:47.031403Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-11T18:26:46.855721Z digest=sha256:c1daf6e953c516df26c6d597311e486a270db7dfecc05b98ff1452acb2e93b2d

Observation 786eb1c2-90a8-47cf-9fb4-939accddf355 · outbound

This paper cites Simultaneously achieving sublinear regret and constraint violations for online convex optimization with time-varying constraints.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Simultaneously achieving sublinear regret and constraint violations for online convex optimization with time-varying constraints

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-11T18:26:46.857866Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:26:46.857866Z digest=sha256:04fa97a310651211a15bf9b3f164984cf723c39b10ca72766590ff3477545570

Observation 0b906330-70d3-491d-bb7d-0ad8dcac5919 · outbound

This paper cites Trading regret for efficiency: online convex optimization with long term constraints.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Trading regret for efficiency: online convex optimization with long term constraints

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-11T18:26:46.859941Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:26:46.859941Z digest=sha256:9abd5be3cac0df337be5ab03d455329b8247cfb7064cddf8c2f4982b896f66fb

Observation e7ae5f10-cbe0-427b-a4d6-34c4d609fd8f · outbound

This paper cites Online learning with sample path constraints.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Online learning with sample path constraints

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T18:26:47.015161Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-11T18:26:46.862145Z digest=sha256:8cb6a880ad874b79d8f8313abe55957674d9a6d45f3b332e3288834a5dbebaf1

Observation ae358a29-0e20-42a0-99f5-71494192ec75 · outbound

This paper cites Online Convex Optimization with Time-Varying Constraints.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Online Convex Optimization with Time-Varying Constraints

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-11T18:26:46.864361Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:26:46.864361Z digest=sha256:544b02af8134fcf0c3a6db1bbd0783715d94b7534ad037ccc96a328a11ee21b7

Observation 1ca986d2-01d9-43fa-a0c9-83d6fdf54972 · outbound

This paper cites Online Learning: A Modern Introduction Using Convex Optimization.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Online Learning: A Modern Introduction Using Convex Optimization

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-11T18:26:46.866978Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:26:46.866978Z digest=sha256:4cc7ac2e12553442f66778fdd3f8a223e6165c9db8045524b3f328588c64fdc0

Observation 44e1f651-a406-4260-9c04-ef1d5c508b65 · outbound

This paper cites Gradient-variation bound for online convex optimization with constraints.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Gradient-variation bound for online convex optimization with constraints

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T18:26:47.008166Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-11T18:26:46.869571Z digest=sha256:30b063b6b31d59af6d42b77d9145761133e20d13e1265a6085005b6b29e4254a

Observation 96fb774d-2fc4-42a9-964d-6cc7ea858005 · outbound

This paper cites Online learning with predictable sequences.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Online learning with predictable sequences

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T18:26:47.000477Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-11T18:26:46.871459Z digest=sha256:fbcd22ae5b7f8a805143f09b289f4c4fd4b5d5a41b498ea0e4c11b476752083e

Observation cbc17612-3670-4589-a276-591bbc6c2ff4 · outbound

This paper cites Optimization, Learning, and Games with Predictable Sequences.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Optimization, Learning, and Games with Predictable Sequences

Reference 15

Resolution
verified exact
local_arxiv, observed 2026-08-11T18:26:46.925066Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-11T18:26:46.873665Z digest=sha256:5959c0b96d02d8ad4fa260f35e8b10561d4a81d047758ceef1829a7e14acf56d

Observation 9b5381c0-50cd-4f4d-8584-de1f5fa702fa · outbound

This paper cites Optimal Algorithms for Online Convex Optimization with Adversarial Constraints.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Optimal Algorithms for Online Convex Optimization with Adversarial Constraints

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-11T18:26:46.876268Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:26:46.876268Z digest=sha256:4ce9ab1870e6a566b695720f48b277b2b0dc4cb09d7587f60812358cbcc28cdc

Observation 2576be83-6d2d-46a2-af10-4e7d8898dde9 · outbound

This paper cites Online primal-dual mirror descent under stochastic constraints.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Online primal-dual mirror descent under stochastic constraints

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T18:26:46.992248Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-11T18:26:46.878681Z digest=sha256:da088619c0ac7ae193970c104c9427481871938e59a28e3b252cd55948d1867c

Observation e5ef5b26-0281-44da-8b6e-bae107280c15 · outbound

This paper cites Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-11T18:26:46.881074Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:26:46.881074Z digest=sha256:b7950707273f0f8f7aa72f5334f67005e05fb0cef463362ada61ded0e89ce7e1

Observation dc3cdf9e-33ba-4c53-9cdc-457bf599a832 · outbound

This paper cites A low complexity algorithm with o ( T ) regret and o (1) constraint violations for online convex optimization with long term constraints.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints A low complexity algorithm with o ( T ) regret and o (1) constraint violations for online convex optimization with long term constraints

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T18:26:46.983549Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-11T18:26:46.883611Z digest=sha256:acceb56cad6cb6650b153a18d88d4e9ebfa428b6784bc1524e29a09390dfd4fb

Observation cd0059eb-30f0-4fc3-87ad-bb098d9b95dd · outbound

This paper cites Online convex programming and generalized infinitesimal gradient ascent.

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints Online convex programming and generalized infinitesimal gradient ascent

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-11T18:26:46.885775Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:26:46.885775Z digest=sha256:7ebe41fcf07e2ea69de3cf7b0342bfccbddeea447c03c596e47b70615455bbf6

Pith citing papers

Observation a8af659f-5cf7-463d-b447-43f7d5501947 · inbound

An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints cites this paper.

An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-07T13:35:49.517407Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T13:35:49.517407Z digest=sha256:241a8bf44ad700257fa293e9a438f0d6c41916531c1d623bba667e6109606a6d

Observation ad6eed46-069f-455a-819a-6341e2a3c79b · inbound

Online Learning with Gradient-Variation Interval Regret cites this paper.

Online Learning with Gradient-Variation Interval Regret An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints

Reference 19

Resolution
verified exact
arxiv_id, observed 2026-07-02T02:36:27.513599Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-06-28T10:45:03.420958Z digest=sha256:65c9289d72bbf12e2d799204c9f4646a0fc0763630579b12ca7f2ca6869f4094

Observation 2b9d032e-2a0d-47bb-8e9a-66e33e000d4a · inbound

Constrained Online Convex Optimization without Slater's Condition cites this paper.

Constrained Online Convex Optimization without Slater's Condition An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints

Reference 33

Resolution
metadata mismatch
arxiv_id, observed 2026-07-01T06:45:29.617803Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-07-01T06:40:44.712616Z digest=sha256:11b704b42f27ddd05b8211a67979738f8b812ed9cf6b0ac6e4c92129a70e0474