<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Competitive Programming with Large Reasoning Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2502.06807/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2502.06807/feed.xml" rel="self" type="application/rss+xml" /><item><title>Competitive Programming with Large Reasoning Models — mentioned by troupo</title><link>https://news.ycombinator.com/item?id=45063209</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.06807:45063209</guid><pubDate>Fri, 29 Aug 2025 12:29:59 GMT</pubDate><description>&lt;p&gt;&amp;gt; the extrapolation should have been straightforward, Indeed.&amp;quot;By late next month you&amp;#x27;ll have over four dozen husbands&amp;quot; https://xkcd.com/605/ &amp;gt; So, here&amp;#x27;s some support for my second claim: I don&amp;#x27;t think any of these links support the claim that &amp;quot;No SOTA model was trained without verified reward training for math and programming&amp;quot; https://arxiv.org/abs/2507.06920: &amp;quot;We hope this work contributes to building a scalable foundation for reliable LLM code evaluation&amp;quot; https://arxiv.org/abs/2506.11425: A custom agent with a custom environment and a custom training dataset on ~800 predetermined problems.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.06807/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Competitive Programming with Large Reasoning Models — mentioned by khafra</title><link>https://news.ycombinator.com/item?id=45061306</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.06807:45061306</guid><pubDate>Fri, 29 Aug 2025 07:42:31 GMT</pubDate><description>&lt;p&gt;My two claims: 1. OpenAI has been doing verifier-guided training since last year. 2. No SOTA model was trained without verified reward training for math and programming. I supported the first claim with a document describing what OpenAI was doing last year; the extrapolation should have been straightforward, but it&amp;#x27;s easy for people who aren&amp;#x27;t tracking AI progress to underestimate the rate at which it occurs. So, here&amp;#x27;s some support for my second claim: https://arxiv.org/abs/2507.06920 https://arxiv.org/abs/2506.11425 https://arxiv.org/abs/2502.06807&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.06807/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Competitive Programming with Large Reasoning Models — HN submission</title><link>https://news.ycombinator.com/item?id=43072941</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.06807:43072941</guid><pubDate>Sun, 16 Feb 2025 23:32:10 GMT</pubDate><description>&lt;p&gt;OpenAI: Competitive Programming with Large Reasoning Models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.06807/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Competitive Programming with Large Reasoning Models — HN submission</title><link>https://news.ycombinator.com/item?id=43055820</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.06807:43055820</guid><pubDate>Sat, 15 Feb 2025 04:05:09 GMT</pubDate><description>&lt;p&gt;Competitive Programming with Large Reasoning Models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.06807/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Competitive Programming with Large Reasoning Models — mentioned by marojejian</title><link>https://news.ycombinator.com/item?id=43051209</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.06807:43051209</guid><pubDate>Fri, 14 Feb 2025 18:08:22 GMT</pubDate><description>&lt;p&gt;Paper: https://arxiv.org/html/2502.06807v1 &amp;quot;although specialized pipelines such as o1-ioi yield solid improvements, the scaled-up, general-purpose o3 model surpasses those results without relying on hand-crafted inference heuristics.&amp;quot; &amp;quot;Overall, these results indicate that scaling general-purpose reinforcement learning, rather than relying on domain-specific techniques, offers a robust path toward state-of-the-art AI in reasoning domains, such as competitive programming.&amp;quot;&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.06807/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Competitive Programming with Large Reasoning Models — HN submission</title><link>https://news.ycombinator.com/item?id=43030525</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.06807:43030525</guid><pubDate>Wed, 12 Feb 2025 22:37:05 GMT</pubDate><description>&lt;p&gt;Competitive programming with large language models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.06807/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Competitive Programming with Large Reasoning Models — HN submission</title><link>https://news.ycombinator.com/item?id=43025479</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.06807:43025479</guid><pubDate>Wed, 12 Feb 2025 13:59:52 GMT</pubDate><description>&lt;p&gt;Competitive Programming with Large Reasoning Models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;6 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.06807/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Competitive Programming with Large Reasoning Models — HN submission</title><link>https://news.ycombinator.com/item?id=43022224</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.06807:43022224</guid><pubDate>Wed, 12 Feb 2025 05:35:29 GMT</pubDate><description>&lt;p&gt;OpenAI o3 just scored 99.8% on CodeForces using brute-force&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.06807/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Competitive Programming with Large Reasoning Models — HN submission</title><link>https://news.ycombinator.com/item?id=43021849</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.06807:43021849</guid><pubDate>Wed, 12 Feb 2025 04:22:01 GMT</pubDate><description>&lt;p&gt;Competitive Programming with Large Reasoning Models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;16 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.06807/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
