<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
  <title>MATRIX · KLS AI-assisted proof</title>
  <link>https://derekwang2002.github.io/ai-intelligence/en/projects/kls-ai-proof/</link>
  <description>Material changes in AI models, agents, engineering and infrastructure, with primary sources and recommendations.</description>
  <language>en</language>
  <lastBuildDate>Mon, 02 Nov 2026 16:56:00 GMT</lastBuildDate>
  <atom:link href="https://derekwang2002.github.io/ai-intelligence/en/feeds/projects/kls-ai-proof.xml" rel="self" type="application/rss+xml"/>
  <item>
    <title>Researchers prove the KLS conjecture with human-directed AI search</title>
    <link>https://derekwang2002.github.io/ai-intelligence/en/events/ev-20261004-03/</link>
    <guid isPermaLink="false">ev-20261004-03-published</guid>
    <pubDate>Thu, 22 Oct 2026 16:37:30 GMT</pubDate>
    <category>New</category>
    <category>WATCH</category>
    <description>&lt;p&gt;Researchers proved the 31-year-old Kannan–Lovász–Simonovits conjecture, removing a dimension-dependent bound in high-dimensional sampling theory. The Microsoft-affiliated proof used a human-directed search across roughly 100 agent trajectories; two parallel proofs and a later Lean 4 formalization provide separate checks on the mathematics. The workflow result is retrospective evidence, not proof that an unguided model can solve comparable problems.&lt;/p&gt;&lt;p&gt;Recommendation: WATCH&lt;/p&gt;&lt;p&gt;Sources: &lt;a href=&quot;https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/&quot;&gt;Microsoft Research KLS article&lt;/a&gt; · &lt;a href=&quot;https://arxiv.org/abs/2610.01447&quot;&gt;A proof of the KLS conjecture&lt;/a&gt; · &lt;a href=&quot;https://arxiv.org/abs/2610.05474&quot;&gt;Independent proof of the KLS conjecture&lt;/a&gt;&lt;/p&gt;</description>
  </item>
</channel>
</rss>
