Pith. sign in

Paper Citation Record · LEDGER

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints

As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2310.18955.

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

pith.paper-citation-record.v1
2310.18955 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+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-11T18:26:46.876268Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T13:35:52.098114Z

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 9b5381c0-50cd-4f4d-8584-de1f5fa702fa · inbound

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints cites this paper.

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:546d4e64d6d6715409d9649d2c5a07fce47ef5053e5cd3816d34cbf6f2ed6705

Observation c9478aca-4de9-44ea-a123-6fa7c9863918 · inbound

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint cites this paper.

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint Optimal Algorithms for Online Convex Optimization with Adversarial Constraints

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-08T18:51:12.703340Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-08T18:51:12.703340Z digest=sha256:7bbf3977f9d97a4fafcb7f60cb30d58c4ef39dd1ce9354f5762cbc2e58c0ce5c

Observation 69f3302e-3541-4a29-b121-6ab7b2a4be2f · inbound

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

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

Reference 32

Resolution
verified exact
local_arxiv, observed 2026-08-07T13:35:52.145545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-07T13:35:50.768281Z digest=sha256:cb18706efdd6d264cec6f18ca307153f65013a2a75846ca6f0c5c2b29fff3fe4