Pith. sign in

Paper Citation Record · LEDGER

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback

As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.17625.

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

pith.paper-citation-record.v1
2502.17625 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:07:02.905677Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T11:07:06.976028Z

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 8aa4244a-7f95-4fe3-8a00-0c655f4cc1ea · inbound

Learning in Matching Games with Bandit Feedback cites this paper.

Learning in Matching Games with Bandit Feedback Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback

Reference 22

Resolution
verified exact
local_arxiv, observed 2026-08-07T11:07:06.980695Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-08-07T11:07:02.905677Z digest=sha256:8a6c7b34d9081c4960961d8517020f30a3edda264c449efa4c8ebea51673cd72

Observation a0eb3204-d47b-4932-989b-f31207c9fd14 · inbound

Probably Correct Optimal Stable Matching under Two-Sided Uncertainty cites this paper.

Probably Correct Optimal Stable Matching under Two-Sided Uncertainty Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback

Reference 27

Resolution
unresolved
no resolver link, observed 2026-07-11T12:55:57.279598Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T12:55:57.279598Z digest=sha256:287b827be435459c9f89ddbc72670ab2589e16257cfced4fa3763c155775ab00