Pith. sign in

Paper Citation Record · LEDGER

Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming

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

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

pith.paper-citation-record.v1
2501.02761 v1

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-18T06:34:40.430872+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-07-12T08:21:32.803474Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-03T16:58:42.505341Z

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 4a6f4820-0c07-42c6-8b35-c16df151343a · inbound

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates cites this paper.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming

Reference 18

Resolution
metadata mismatch
arxiv_id, observed 2026-07-03T04:07:36.538541Z

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.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:cccc3d400fbde50f5e6c8a8e4741ac3d9917c6c703d2979d243b6b7741a2873b

Observation d71cad5e-37fa-44c8-a7ba-376d30c219b4 · inbound

Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy cites this paper.

Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming

Reference 20

Resolution
verified exact
arxiv_id, observed 2026-07-03T16:58:42.506775Z

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.

source=arxiv_source observed=2026-07-03T16:51:03.016123Z digest=sha256:74b877c203aba004f51a87c8a551df64fa64da7465f73cd5011b763ea52a204e

Observation 91b3cfdc-4b7d-4ca4-bd3a-d3d244fe751d · inbound

Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy cites this paper.

Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming

Reference 20

Resolution
unresolved
no resolver link, observed 2026-07-12T08:21:32.803474Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-12T08:21:32.803474Z digest=sha256:4673970c4ddcf06e9ee3e069059b0a4e4ce50aff6ae5a7f7a66ef1dd140d5a67