The precise statements and locators cited in this P versus NP research record.
The authors report acceptance at COLT 2026; this citation pins arXiv:2601.23229v2, dated 2 June 2026. Independent OpenMath assessment is pending.
The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.
Aletheia supplies an effective strengthening of a combinatorial bound used in robust-MDP context; the authors’ preceding theorem already suffices.
Passage ID: pnp-entry-activity-aletheia:v1
Source item: activity-aletheia
Source record: pnp-aletheia@arXiv-2601.23229v2
Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.
Problem publication v14
Research activity
Robust MDP policy iteration and Aletheia contribution
Aletheia supplies an effective strengthening of a combinatorial bound used in robust-MDP context; the authors’ preceding theorem already suffices.
The algorithmic scope fixes L∞ uncertainty and a constant discount factor; the AI contribution is an intermediate theorem, not P versus NP.
Recorded authorship
Ali Asadi · Krishnendu Chatterjee · Ehsan Goharshady · Mehrdad Karrabi · Alipasha Montaseri · Carlo Pagano
Ali Asadi; Krishnendu Chatterjee; Ehsan Goharshady; Mehrdad Karrabi; Alipasha Montaseri; Carlo Pagano
The source credits Aletheia/Gemini Deep Think with an effective strengthening, Theorem 21, of an intermediate combinatorial result; the authors’ Theorem 20 already suffices for their complexity analysis.
OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.
Robust MDP policy iteration and Aletheia contribution
Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.
Source terms ↗