Pith. sign in

Paper Citation Record · LEDGER

Refined Sample Complexity for Markov Games with Independent Linear Function Approximation

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

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

pith.paper-citation-record.v1
2402.07082 v2

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-19T06:32:44.657259+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-07T20:38:32.131670Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-09T06:00:35.933208Z

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 d2e1ea29-1775-4c7b-88ff-933e142d29be · inbound

Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games cites this paper.

Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games Refined Sample Complexity for Markov Games with Independent Linear Function Approximation

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-07T20:38:32.131670Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T20:38:32.131670Z digest=sha256:14f16cda2ed05f5ae1309607d44052ec4fe1de9995c94968349ea790e542fb84

Observation 830378a1-9d87-4f4c-83d2-e68bdaf6646b · inbound

Taming the Curses of Multiagency in Robust Markov Games with Large State Space through Linear Function Approximation cites this paper.

Taming the Curses of Multiagency in Robust Markov Games with Large State Space through Linear Function Approximation Refined Sample Complexity for Markov Games with Independent Linear Function Approximation

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-05-09T06:00:35.934590Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-08T19:13:15.234351Z digest=sha256:b11902be87f398a2921cbae8a9a26dea623f4a25be39751228118c38d6e0923e