Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-03T06:26:55.057225Z
Paper Citation Record · LEDGER
Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
As of 5 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 1 inbound Pith citation observation for arXiv:2601.23229.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-04T06:34:03.388597+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-05-11T02:07:49.641275Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-11T03:55:56.296671Z
Reference resolution
6 of 6 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved6
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 00381c1f-19b3-46a4-8cbd-920de6a2b090 · outbound
This paper cites an unresolved cited work.
Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs Unresolved cited work
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T06:26:54.374625Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 014d5b43-c17b-4ca5-b20c-86ea0e124d5b · outbound
This paper cites C 1-linearly independent.
Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs C 1-linearly independent
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T06:26:54.447784Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f45c8089-ba30-4b72-8bfe-694657d2f471 · outbound
This paper cites linear independence.
Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs linear independence
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T06:26:54.600213Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f470692a-b3fe-4e84-be4d-ac7804c31750 · outbound
This paper cites Given the properties of such policies, discussed in Section 3, we defineX s as follows so thatP ρ s,s′ ∈A(X s)for alls, s′ ∈ S: Xs ={ ˆPs,s′ |s ′ ∈ S} ∪ {δ(s),1}.
Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs Given the properties of such policies, discussed in Section 3, we defineX s as follows so thatP ρ s,s′ ∈A(X s)for alls, s′ ∈ S: Xs ={ ˆPs,s′ |s ′ ∈ S} ∪ {δ(s),1}
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T06:26:54.738551Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bc193b56-4bd2-4ed1-a29a-dc7746c45a7c · outbound
This paper cites Let(s t, s′ t, s′′ t ) = argmaxs,s′,s′′ fρt(s, s′, s′′)be the maximizing triple.
Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs Let(s t, s′ t, s′′ t ) = argmaxs,s′,s′′ fρt(s, s′, s′′)be the maximizing triple
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T06:26:54.890470Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c641d5f0-6ed2-40cb-a7b2-8c9f12a23310 · outbound
This paper cites For any specific triple, the mass transfer value can take at mostO(nlogn)different logarithmic scales (from Step 1) before it vanishes or the triple is no longer active.
Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs For any specific triple, the mass transfer value can take at mostO(nlogn)different logarithmic scales (from Step 1) before it vanishes or the triple is no longer active
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T06:26:55.057225Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
Observation ce453ce3-a564-41e3-abe9-4513595706ed · inbound
On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets cites this paper.
On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
Reference 8
- Resolution
- verified exact
- arxiv_id, observed 2026-06-03T02:05:45.252219Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.