{"schema_version":"source-reader-v1","record":{"source_id":"pnp-aletheia","versions":[{"work":{"authors":["Ali Asadi","Krishnendu Chatterjee","Ehsan Goharshady","Mehrdad Karrabi","Alipasha Montaseri","Carlo Pagano"],"kind":"research_paper","publication":"accepted","publication_note":"The authors report acceptance at COLT 2026; this citation pins arXiv:2601.23229v2, dated 2 June 2026. Independent OpenMath assessment is pending.","ai_role":"self_reported","ai_note":"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.","artifacts":[],"published":{"value":"2026"}},"id":"pnp-aletheia@arXiv-2601.23229v2","source_id":"pnp-aletheia","title":"Robust MDP policy iteration and Aletheia contribution","owner":"Ali Asadi; Krishnendu Chatterjee; Ehsan Goharshady; Mehrdad Karrabi; Alipasha Montaseri; Carlo Pagano","url":"https://arxiv.org/html/2601.23229v2","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"arXiv-2601.23229v2","content_sha256":null,"update_method":"Manual primary-source check; changes require a new source version and staff publication.","identifier_policy":"Source URL and exact theorem/section locator; no inferred identity merge.","observed_on":"2026-10-10","source_updated_on":null,"rights":"metadata-link","license":"Full-text redistribution rights not asserted","terms_url":"https://arxiv.org/html/2601.23229v2","attribution":"Ali Asadi; Krishnendu Chatterjee; Ehsan Goharshady; Mehrdad Karrabi; Alipasha Montaseri; Carlo Pagano","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-activity-aletheia:v1","source_version_id":"pnp-aletheia@arXiv-2601.23229v2","item_id":"activity-aletheia","url":"https://arxiv.org/html/2601.23229v2","wording":"Aletheia supplies an effective strengthening of a combinatorial bound used in robust-MDP context; the authors’ preceding theorem already suffices.","wording_kind":"paraphrase","locator":"Theorems 20–21, Appendix H; technical contributions §1","supersedes":null}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-aletheia@arXiv-2601.23229v2","available_versions":[{"id":"pnp-aletheia@arXiv-2601.23229v2","revision":"arXiv-2601.23229v2","observed_on":"2026-10-10","title":"Robust MDP policy iteration and Aletheia contribution","publication":"accepted","content_sha256":null,"used_in_current_publications":true}],"usages":[{"id":"source-use-f31a145aba2e419e8547","entry_id":"pnp-entry-activity-aletheia:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"activity","title":"Robust MDP policy iteration and Aletheia contribution","claim":null,"fragment":"activity","assessment":null,"superseded":false,"formalization":null,"update":{"id":"pnp-activity-aletheia","title":"Robust MDP policy iteration and Aletheia contribution","kind":"research_direction","source_entry_ids":["pnp-entry-activity-aletheia:v1"],"summary":"Aletheia supplies an effective strengthening of a combinatorial bound used in robust-MDP context; the authors’ preceding theorem already suffices.","limitation":"The algorithmic scope fixes L∞ uncertainty and a constant discount factor; the AI contribution is an intermediate theorem, not P versus NP.","related_claim_ids":[]}},{"id":"source-use-6423c25b7df2902e7f5f","entry_id":"pnp-entry-activity-aletheia:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}