Paper Citation Record · LEDGER

Provably Efficient Reinforcement Learning with Linear Function Approximation

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

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

pith.paper-citation-record.v1
1907.05388 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 6 of 6 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 6 of 6 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-14T04:54:13.863800Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-03T23:49:01.921708Z

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 70db911d-5bc8-49d7-9b49-3b148c7fdae3 · inbound

$\sqrt{n}$-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank cites this paper.

$\sqrt{n}$-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank Provably Efficient Reinforcement Learning with Linear Function Approximation

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-14T04:54:13.863800Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe812a04-aa3f-427b-9898-609bb95c18b5 · 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 Provably Efficient Reinforcement Learning with Linear Function Approximation

Reference 8

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

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.

Observation 5d06263b-74ef-4fa1-bc0e-49d7fcb93c07 · inbound

Bellman-sufficient Information Complexity cites this paper.

Bellman-sufficient Information Complexity Provably Efficient Reinforcement Learning with Linear Function Approximation

Reference 22

Resolution: verified exact; arxiv_id, observed 2026-07-03T04:47:38.226185Z

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.

Observation 414fb887-a556-408b-90bd-423f5d645709 · inbound

Bellman-sufficient Information Complexity cites this paper.

Bellman-sufficient Information Complexity Provably Efficient Reinforcement Learning with Linear Function Approximation

Reference 23

Resolution: verified exact; arxiv_id, observed 2026-07-03T23:49:01.923307Z

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.

Observation c5ecd9fa-2d4b-421b-86e8-fca5a2d520f3 · inbound

Bellman-sufficient Information Complexity cites this paper.

Bellman-sufficient Information Complexity Provably Efficient Reinforcement Learning with Linear Function Approximation

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-12T14:23:15.089919Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c496e685-b1f3-4c74-8553-bdac69a70c1f · inbound

Bellman-sufficient Information Complexity cites this paper.

Bellman-sufficient Information Complexity Provably Efficient Reinforcement Learning with Linear Function Approximation

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-02T11:53:51.087284Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.