{"id":"4e057457b37927bfcd97f764cef724cd06d5fb4533ad9dd289ca754f68cbe9ee","title":"Microsoft Research reports proof of the KLS conjecture","argument":"Microsoft Research reports that researchers, including its researcher Xinzhi Zhang, have proved the Kannan–Lovász–Simonovits (KLS) conjecture, a longstanding question in high-dimensional geometry and probability. The conjecture asks whether a flat cut through a distribution can be almost as effective as the best cut of any shape, with a bound that does not grow with the number of dimensions. The reported proof establishes such a fixed bound. The source says this matters to the theory of random walks used to explore distributions and to research in geometry, probability and theoretical computer science; it does not demonstrate particular practical improvements in those fields.\n\nThe researchers used AI systems to explore mathematical approaches, while they chose directions, evaluated intermediate results and assembled and checked the proof. Microsoft Research says unguided attempts with leading AI models fell short, and that the successful process depended on both the systems and researchers’ mathematical judgment. The source also reports separate proofs and a formal computer-checked version, while noting that the authors are still simplifying their proof and extending its formal verification. How readily will the streamlined proof and expanded verification enable other researchers to examine and build on the result?","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"This reading relies on Microsoft Research’s account of the work; the article says the authors are still simplifying the proof and extending its formal verification. The source describes implications for theory but does not demonstrate concrete downstream benefits or applications.","speaker":{"name":"Alyssa Hughes","roleAtSource":"Article author"},"source":{"title":"Solving a 31-year-old grand challenge in mathematics – the KLS conjecture - Microsoft Research","publisher":"Microsoft Research","format":"Article","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","publishedAt":"2026-10-21T16:00:00+00:00","dateBasis":"Date stated by the publisher."},"evidence":[{"text":"Microsoft Research reports that researchers, including Xinzhi Zhang, proved the KLS conjecture, which proposes a dimension-independent bound relating flat cuts to the best cuts of any shape.","excerpt":"They have shown that the relationship holds with a fixed bound, regardless of how many dimensions a shape has.","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","relationship":"Source-stated"},{"text":"The source connects the conjecture to how quickly random walks can explore a probability distribution and to theoretical research in several fields.","excerpt":"Because the geometry of these cuts governs how quickly random walks can explore a distribution, KLS also plays a central role in the theory of high-dimensional sampling.","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","relationship":"Source-stated"},{"text":"The researchers directed AI-assisted exploration and used their mathematical judgment to select and develop promising approaches; unguided model attempts did not solve the problem.","excerpt":"That effort fell short of the goal. The eventual success depended on both the capabilities of the AI systems and the mathematical judgment of the researchers.","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","relationship":"Source-stated"},{"text":"Microsoft Research reports separate proofs and a formalized proof, and says the authors are simplifying their proof and extending formal verification.","excerpt":"The authors are now simplifying the proof and extending its formal verification so that the mathematics and theoretical computer science communities can more easily examine the result and build on it.","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","relationship":"Source-stated"},{"text":"The source describes theoretical implications but does not provide evidence of specific practical improvements resulting from the proof.","excerpt":"The proof therefore provides a stronger foundation for research in convex geometry, probability, and theoretical computer science.","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","relationship":"Escape Meridian interpretation"}],"sourceMedia":{"status":"found","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","checkedAt":"2026-10-21T20:00:36.513Z","items":[{"type":"image","url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2026/10/KLS-BlogHeroFeature-1400x788-1.jpg","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","attribution":"Microsoft Research","basis":"publisher-embed","availability":"verified","label":"Side-by-side diagrams compare a flat cut and a curved cut through the same convex geometric shape. The left panel, labeled “Flat cut,” shows a diamond-shaped c…","verifiedAt":"2026-10-21T20:00:36.949Z"}],"note":"Media declared by the original publisher; availability checked separately from the editorial reading."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How readily will the streamlined proof and expanded formal verification enable other researchers to examine and build on the result?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Microsoft Research reports proof of the KLS conjecture","summary":"Microsoft Research reports that researchers, including its researcher Xinzhi Zhang, have proved the Kannan–Lovász–Simonovits (KLS) conjecture, a longstanding question in high-dimensional geometry and probability. The conjecture asks whether a flat cut through a distribution can be almost as effective as the best cut of any shape, with a bound that does not grow with the number of dimensions. The reported proof establishes such a fixed bound. The source says this matters to the theory of random walks used to explore distributions and to research in geometry, probability and theoretical computer science; it does not demonstrate particular practical improvements in those fields.\n\nThe researchers used AI systems to explore mathematical approaches, while they chose directions, evaluated intermediate results and assembled and checked the proof. Microsoft Research says unguided attempts with leading AI models fell short, and that the successful process depended on both the systems and researchers’ mathematical judgment. The source also reports separate proofs and a formal computer-checked version, while noting that the authors are still simplifying their proof and extending its formal verification. How readily will the streamlined proof and expanded verification enable other researchers to examine and build on the result?","question":"How readily will the streamlined proof and expanded formal verification enable other researchers to examine and build on the result?","claims":[{"text":"Microsoft Research reports that researchers, including Xinzhi Zhang, proved the KLS conjecture, which proposes a dimension-independent bound relating flat cuts to the best cuts of any shape.","excerpt":"They have shown that the relationship holds with a fixed bound, regardless of how many dimensions a shape has.","support":"source-stated"},{"text":"The source connects the conjecture to how quickly random walks can explore a probability distribution and to theoretical research in several fields.","excerpt":"Because the geometry of these cuts governs how quickly random walks can explore a distribution, KLS also plays a central role in the theory of high-dimensional sampling.","support":"source-stated"},{"text":"The researchers directed AI-assisted exploration and used their mathematical judgment to select and develop promising approaches; unguided model attempts did not solve the problem.","excerpt":"That effort fell short of the goal. The eventual success depended on both the capabilities of the AI systems and the mathematical judgment of the researchers.","support":"source-stated"},{"text":"Microsoft Research reports separate proofs and a formalized proof, and says the authors are simplifying their proof and extending formal verification.","excerpt":"The authors are now simplifying the proof and extending its formal verification so that the mathematics and theoretical computer science communities can more easily examine the result and build on it.","support":"source-stated"},{"text":"The source describes theoretical implications but does not provide evidence of specific practical improvements resulting from the proof.","excerpt":"The proof therefore provides a stronger foundation for research in convex geometry, probability, and theoretical computer science.","support":"interpretation"}],"limitations":["This reading relies on Microsoft Research’s account of the work; the article says the authors are still simplifying the proof and extending its formal verification.","The source describes implications for theory but does not demonstrate concrete downstream benefits or applications."],"mediaId":"f5a67a23b0dd5c70b4db35e5f8f70dda8a0a53f6299ecb9f65e4ea58783a0418","correctionReason":null,"id":"4e057457b37927bfcd97f764cef724cd06d5fb4533ad9dd289ca754f68cbe9ee","publicationId":"78e907fb-1a29-4cf4-8dbb-2d0eb747bf47","version":1,"sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","sourceTitle":"Solving a 31-year-old grand challenge in mathematics – the KLS conjecture - Microsoft Research","publisher":"Microsoft Research","publishedAt":"2026-10-21T16:00:00+00:00","originalPublished":{"value":"2026-10-21T16:00:00+00:00","precision":"instant","basis":"publisher_page"},"firstObservedAt":"2026-10-21T16:06:35.341Z","createdAt":"2026-11-06T10:48:32.730Z","historical":true,"entityIds":["microsoft-research"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"f5a67a23b0dd5c70b4db35e5f8f70dda8a0a53f6299ecb9f65e4ea58783a0418","kind":"article","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-10-21T20:00:36.949Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."},{"id":"75bfd923d7f3e3b38aa237b134f805895462ea5454b8d6d162bf0438d0095de4","kind":"image","url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2026/10/KLS-BlogHeroFeature-1400x788-1.jpg","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","label":"Side-by-side diagrams compare a flat cut and a curved cut through the same convex geometric shape. T","provenance":"publisher_page","verification":{"status":"verified","checkedAt":"2026-10-21T20:00:36.949Z","method":"publisher_association_and_head","contentType":"image/jpeg","cacheUntil":1792612836949},"recommendationReason":"Observed on the acquired publisher source; availability checked."}],"sourceMedia":{"status":"found","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","checkedAt":"2026-10-21T20:00:36.513Z","items":[{"type":"image","url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2026/10/KLS-BlogHeroFeature-1400x788-1.jpg","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","attribution":"Microsoft Research","basis":"publisher-embed","availability":"verified","label":"Side-by-side diagrams compare a flat cut and a curved cut through the same convex geometric shape. The left panel, labeled “Flat cut,” shows a diamond-shaped c…","verifiedAt":"2026-10-21T20:00:36.949Z"}],"note":"Media declared by the original publisher; availability checked separately from the editorial reading."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"f5a67a23b0dd5c70b4db35e5f8f70dda8a0a53f6299ecb9f65e4ea58783a0418","confidence":0.88,"provider":"vercel","model":"typesafe-ai/jev","inputHash":"00250464359c5fb7e898406bc4fbe0af8910078a060e020747bf97cd98153d70","decidedAt":"2026-10-21T20:00:40.135Z"},"provenance":{"textHash":"ffa2e2e8b478a89ba4d31c9a82355ba3b5fde827cffa3500dd5103417c271165","observationId":"a652f2892fe3dffdeaa8a87c484c42bee4d14650e62a3a8b7d31e614ba73a7f4","retrievedAt":"2026-10-21T20:00:36.513Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"4587e443-e144-4cea-8f3e-1bfea3e17e61"},"reviewer":{"model":"gpt-6-luna","runId":"2a6bf87b-caed-4c18-8048-8f0401dd2a24"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-06T10:48:32.730Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Alyssa Hughes","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Alyssa Hughes","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Alyssa Hughes","status":"stated","provenance":{"basis":"article-jsonld","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","locator":"document/html[1]/head[0]/script[69]@3000.@graph[0].author"},"assertionId":"207f0a57e6cc0715a182ee73bba5ebf1ee687d6cab411e76843b600d81b57ec0:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-10-21T20:00:36.513Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"207f0a57e6cc0715a182ee73bba5ebf1ee687d6cab411e76843b600d81b57ec0","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","contentSha256":"0fa50e845c85a8aefc1a885999d437c8040f496eb08522f1022c3712ed52f297","textHash":"ffa2e2e8b478a89ba4d31c9a82355ba3b5fde827cffa3500dd5103417c271165","observedAt":"2026-10-21T20:00:36.513Z"}}],"participationCoverage":{"total":2,"returned":1,"complete":false,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","snapshotId":"207f0a57e6cc0715a182ee73bba5ebf1ee687d6cab411e76843b600d81b57ec0","contentSha256":"0fa50e845c85a8aefc1a885999d437c8040f496eb08522f1022c3712ed52f297","textHash":"ffa2e2e8b478a89ba4d31c9a82355ba3b5fde827cffa3500dd5103417c271165","observedAt":"2026-10-21T20:00:36.513Z","basis":"publisher-page-metadata","sourceLinks":15,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/4e057457b37927bfcd97f764cef724cd06d5fb4533ad9dd289ca754f68cbe9ee/source"}},"canonicalUrl":"https://escapemeridian.com/readings/microsoft-research-reports-proof-of-the-kls-conjecture-4e057457","formats":{"html":"/readings/microsoft-research-reports-proof-of-the-kls-conjecture-4e057457","markdown":"/readings/microsoft-research-reports-proof-of-the-kls-conjecture-4e057457.md","json":"/readings/microsoft-research-reports-proof-of-the-kls-conjecture-4e057457.json"},"attribution":"Headline and summary by Escape Meridian, prepared by Luna from the attributed source. A source check is not independent confirmation of the source’s claims.","maintainedGuideLinks":[],"readerContext":{"version":"reader-context-v1","attribution":"Reference context selected by Escape Meridian; separate from source evidence. Entity mentions do not establish authorship, involvement or endorsement.","terms":[{"id":"term-formal-verification","name":"Formal verification","explanation":"Using software to check every step of a proof or a program against precise rules.","referenceUrl":"https://en.wikipedia.org/wiki/Formal_verification"}],"entities":[{"id":"microsoft-research","name":"Microsoft Research","kind":"organization","context":"Primary technical research with named authors, papers and implementation details.","referenceUrls":["https://www.dwarkesh.com/p/satya-nadella","https://www.dwarkesh.com/p/grant-sanderson","https://www.microsoft.com/en-us/research/blog/proof-based-general-purpose-computing-with-magnetar/","https://www.microsoft.com/en-us/research/"],"path":"/entities/microsoft-research","json":"/entities/microsoft-research.json","markdown":"/entities/microsoft-research.md"}]},"researchQuestions":[],"withdrawn":false,"references":{"schemaVersion":1,"target":{"type":"reading","id":"4e057457b37927bfcd97f764cef724cd06d5fb4533ad9dd289ca754f68cbe9ee","revision":"78e907fb-1a29-4cf4-8dbb-2d0eb747bf47","revisionKind":"publication-id","title":"Microsoft Research reports proof of the KLS conjecture","url":"https://escapemeridian.com/readings/microsoft-research-reports-proof-of-the-kls-conjecture-4e057457"},"source":{"type":"source","id":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","revision":"ffa2e2e8b478a89ba4d31c9a82355ba3b5fde827cffa3500dd5103417c271165","revisionKind":"sha256-source-text","title":"Solving a 31-year-old grand challenge in mathematics – the KLS conjecture - Microsoft Research","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/"},"status":"available","items":[],"next":null,"scope":"Explicit citations in public readings and public file attachments to this reading. Shared topics are not citations. Other artifact types need an explicit reference adapter."},"revisions":[{"id":"4e057457b37927bfcd97f764cef724cd06d5fb4533ad9dd289ca754f68cbe9ee","title":"Microsoft Research reports proof of the KLS conjecture","argument":"Microsoft Research reports that researchers, including its researcher Xinzhi Zhang, have proved the Kannan–Lovász–Simonovits (KLS) conjecture, a longstanding question in high-dimensional geometry and probability. The conjecture asks whether a flat cut through a distribution can be almost as effective as the best cut of any shape, with a bound that does not grow with the number of dimensions. The reported proof establishes such a fixed bound. The source says this matters to the theory of random walks used to explore distributions and to research in geometry, probability and theoretical computer science; it does not demonstrate particular practical improvements in those fields.\n\nThe researchers used AI systems to explore mathematical approaches, while they chose directions, evaluated intermediate results and assembled and checked the proof. Microsoft Research says unguided attempts with leading AI models fell short, and that the successful process depended on both the systems and researchers’ mathematical judgment. The source also reports separate proofs and a formal computer-checked version, while noting that the authors are still simplifying their proof and extending its formal verification. How readily will the streamlined proof and expanded verification enable other researchers to examine and build on the result?","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"This reading relies on Microsoft Research’s account of the work; the article says the authors are still simplifying the proof and extending its formal verification. The source describes implications for theory but does not demonstrate concrete downstream benefits or applications.","speaker":{"name":"Alyssa Hughes","roleAtSource":"Article author"},"source":{"title":"Solving a 31-year-old grand challenge in mathematics – the KLS conjecture - Microsoft Research","publisher":"Microsoft Research","format":"Article","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","publishedAt":"2026-10-21T16:00:00+00:00","dateBasis":"Date stated by the publisher."},"evidence":[{"text":"Microsoft Research reports that researchers, including Xinzhi Zhang, proved the KLS conjecture, which proposes a dimension-independent bound relating flat cuts to the best cuts of any shape.","excerpt":"They have shown that the relationship holds with a fixed bound, regardless of how many dimensions a shape has.","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","relationship":"Source-stated"},{"text":"The source connects the conjecture to how quickly random walks can explore a probability distribution and to theoretical research in several fields.","excerpt":"Because the geometry of these cuts governs how quickly random walks can explore a distribution, KLS also plays a central role in the theory of high-dimensional sampling.","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","relationship":"Source-stated"},{"text":"The researchers directed AI-assisted exploration and used their mathematical judgment to select and develop promising approaches; unguided model attempts did not solve the problem.","excerpt":"That effort fell short of the goal. The eventual success depended on both the capabilities of the AI systems and the mathematical judgment of the researchers.","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","relationship":"Source-stated"},{"text":"Microsoft Research reports separate proofs and a formalized proof, and says the authors are simplifying their proof and extending formal verification.","excerpt":"The authors are now simplifying the proof and extending its formal verification so that the mathematics and theoretical computer science communities can more easily examine the result and build on it.","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","relationship":"Source-stated"},{"text":"The source describes theoretical implications but does not provide evidence of specific practical improvements resulting from the proof.","excerpt":"The proof therefore provides a stronger foundation for research in convex geometry, probability, and theoretical computer science.","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","relationship":"Escape Meridian interpretation"}],"sourceMedia":{"status":"found","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","checkedAt":"2026-10-21T20:00:36.513Z","items":[{"type":"image","url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2026/10/KLS-BlogHeroFeature-1400x788-1.jpg","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","attribution":"Microsoft Research","basis":"publisher-embed","availability":"verified","label":"Side-by-side diagrams compare a flat cut and a curved cut through the same convex geometric shape. The left panel, labeled “Flat cut,” shows a diamond-shaped c…","verifiedAt":"2026-10-21T20:00:36.949Z"}],"note":"Media declared by the original publisher; availability checked separately from the editorial reading."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How readily will the streamlined proof and expanded formal verification enable other researchers to examine and build on the result?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Microsoft Research reports proof of the KLS conjecture","summary":"Microsoft Research reports that researchers, including its researcher Xinzhi Zhang, have proved the Kannan–Lovász–Simonovits (KLS) conjecture, a longstanding question in high-dimensional geometry and probability. The conjecture asks whether a flat cut through a distribution can be almost as effective as the best cut of any shape, with a bound that does not grow with the number of dimensions. The reported proof establishes such a fixed bound. The source says this matters to the theory of random walks used to explore distributions and to research in geometry, probability and theoretical computer science; it does not demonstrate particular practical improvements in those fields.\n\nThe researchers used AI systems to explore mathematical approaches, while they chose directions, evaluated intermediate results and assembled and checked the proof. Microsoft Research says unguided attempts with leading AI models fell short, and that the successful process depended on both the systems and researchers’ mathematical judgment. The source also reports separate proofs and a formal computer-checked version, while noting that the authors are still simplifying their proof and extending its formal verification. How readily will the streamlined proof and expanded verification enable other researchers to examine and build on the result?","question":"How readily will the streamlined proof and expanded formal verification enable other researchers to examine and build on the result?","claims":[{"text":"Microsoft Research reports that researchers, including Xinzhi Zhang, proved the KLS conjecture, which proposes a dimension-independent bound relating flat cuts to the best cuts of any shape.","excerpt":"They have shown that the relationship holds with a fixed bound, regardless of how many dimensions a shape has.","support":"source-stated"},{"text":"The source connects the conjecture to how quickly random walks can explore a probability distribution and to theoretical research in several fields.","excerpt":"Because the geometry of these cuts governs how quickly random walks can explore a distribution, KLS also plays a central role in the theory of high-dimensional sampling.","support":"source-stated"},{"text":"The researchers directed AI-assisted exploration and used their mathematical judgment to select and develop promising approaches; unguided model attempts did not solve the problem.","excerpt":"That effort fell short of the goal. The eventual success depended on both the capabilities of the AI systems and the mathematical judgment of the researchers.","support":"source-stated"},{"text":"Microsoft Research reports separate proofs and a formalized proof, and says the authors are simplifying their proof and extending formal verification.","excerpt":"The authors are now simplifying the proof and extending its formal verification so that the mathematics and theoretical computer science communities can more easily examine the result and build on it.","support":"source-stated"},{"text":"The source describes theoretical implications but does not provide evidence of specific practical improvements resulting from the proof.","excerpt":"The proof therefore provides a stronger foundation for research in convex geometry, probability, and theoretical computer science.","support":"interpretation"}],"limitations":["This reading relies on Microsoft Research’s account of the work; the article says the authors are still simplifying the proof and extending its formal verification.","The source describes implications for theory but does not demonstrate concrete downstream benefits or applications."],"mediaId":"f5a67a23b0dd5c70b4db35e5f8f70dda8a0a53f6299ecb9f65e4ea58783a0418","correctionReason":null,"id":"4e057457b37927bfcd97f764cef724cd06d5fb4533ad9dd289ca754f68cbe9ee","publicationId":"78e907fb-1a29-4cf4-8dbb-2d0eb747bf47","version":1,"sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","sourceTitle":"Solving a 31-year-old grand challenge in mathematics – the KLS conjecture - Microsoft Research","publisher":"Microsoft Research","publishedAt":"2026-10-21T16:00:00+00:00","originalPublished":{"value":"2026-10-21T16:00:00+00:00","precision":"instant","basis":"publisher_page"},"firstObservedAt":"2026-10-21T16:06:35.341Z","createdAt":"2026-11-06T10:48:32.730Z","historical":true,"entityIds":["microsoft-research"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"f5a67a23b0dd5c70b4db35e5f8f70dda8a0a53f6299ecb9f65e4ea58783a0418","kind":"article","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-10-21T20:00:36.949Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."},{"id":"75bfd923d7f3e3b38aa237b134f805895462ea5454b8d6d162bf0438d0095de4","kind":"image","url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2026/10/KLS-BlogHeroFeature-1400x788-1.jpg","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","label":"Side-by-side diagrams compare a flat cut and a curved cut through the same convex geometric shape. T","provenance":"publisher_page","verification":{"status":"verified","checkedAt":"2026-10-21T20:00:36.949Z","method":"publisher_association_and_head","contentType":"image/jpeg","cacheUntil":1792612836949},"recommendationReason":"Observed on the acquired publisher source; availability checked."}],"sourceMedia":{"status":"found","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","checkedAt":"2026-10-21T20:00:36.513Z","items":[{"type":"image","url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2026/10/KLS-BlogHeroFeature-1400x788-1.jpg","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","attribution":"Microsoft Research","basis":"publisher-embed","availability":"verified","label":"Side-by-side diagrams compare a flat cut and a curved cut through the same convex geometric shape. The left panel, labeled “Flat cut,” shows a diamond-shaped c…","verifiedAt":"2026-10-21T20:00:36.949Z"}],"note":"Media declared by the original publisher; availability checked separately from the editorial reading."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"f5a67a23b0dd5c70b4db35e5f8f70dda8a0a53f6299ecb9f65e4ea58783a0418","confidence":0.88,"provider":"vercel","model":"typesafe-ai/jev","inputHash":"00250464359c5fb7e898406bc4fbe0af8910078a060e020747bf97cd98153d70","decidedAt":"2026-10-21T20:00:40.135Z"},"provenance":{"textHash":"ffa2e2e8b478a89ba4d31c9a82355ba3b5fde827cffa3500dd5103417c271165","observationId":"a652f2892fe3dffdeaa8a87c484c42bee4d14650e62a3a8b7d31e614ba73a7f4","retrievedAt":"2026-10-21T20:00:36.513Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"4587e443-e144-4cea-8f3e-1bfea3e17e61"},"reviewer":{"model":"gpt-6-luna","runId":"2a6bf87b-caed-4c18-8048-8f0401dd2a24"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-06T10:48:32.730Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Alyssa Hughes","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Alyssa Hughes","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Alyssa Hughes","status":"stated","provenance":{"basis":"article-jsonld","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","locator":"document/html[1]/head[0]/script[69]@3000.@graph[0].author"},"assertionId":"207f0a57e6cc0715a182ee73bba5ebf1ee687d6cab411e76843b600d81b57ec0:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-10-21T20:00:36.513Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"207f0a57e6cc0715a182ee73bba5ebf1ee687d6cab411e76843b600d81b57ec0","sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","contentSha256":"0fa50e845c85a8aefc1a885999d437c8040f496eb08522f1022c3712ed52f297","textHash":"ffa2e2e8b478a89ba4d31c9a82355ba3b5fde827cffa3500dd5103417c271165","observedAt":"2026-10-21T20:00:36.513Z"}}],"participationCoverage":{"total":2,"returned":1,"complete":false,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","snapshotId":"207f0a57e6cc0715a182ee73bba5ebf1ee687d6cab411e76843b600d81b57ec0","contentSha256":"0fa50e845c85a8aefc1a885999d437c8040f496eb08522f1022c3712ed52f297","textHash":"ffa2e2e8b478a89ba4d31c9a82355ba3b5fde827cffa3500dd5103417c271165","observedAt":"2026-10-21T20:00:36.513Z","basis":"publisher-page-metadata","sourceLinks":15,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/4e057457b37927bfcd97f764cef724cd06d5fb4533ad9dd289ca754f68cbe9ee/source"}}}],"audits":[{"publicationId":"78e907fb-1a29-4cf4-8dbb-2d0eb747bf47","verdict":"uncertain","findings":[{"dimension":"attribution","status":"pass","explanation":"The reading consistently attributes the proof claim, the AI-process account and the confirmation claims to Microsoft Research's report. It names Xinzhi Zhang as one of the researchers without implying he was the sole author, which is consistent with the source's mention of two researchers and co-author Zhao Song.","excerpt":"Now, two researchers, including Xinzhi Zhang from the Machine Learning and Optimization group at Microsoft Research, have proved the KLS conjecture"},{"dimension":"summary","status":"uncertain","explanation":"The draft says the conjecture concerns whether a flat cut through a distribution, implying any distribution, is nearly as effective as the best cut. The source limits it to a broad class of high-dimensional distributions, which the At a glance section calls log-concave. A lay reader is also not told what makes a cut effective; the source says cuts capture a distribution's narrowest bottlenecks. Smallest repair: say a flat cut through distributions in a broad (log-concave) class can capture their narrowest bottleneck nearly as well as a cut of any shape. Otherwise the title, the human-AI account and the question are faithful.","excerpt":"It asks whether, for a broad class of high-dimensional probability distributions, the best flat or hyperplane cut is always nearly as effective as the best cut of any shape."},{"dimension":"date","status":"pass","explanation":"originalPublished is 2026-10-21, based on the publisher page, and matches the feed entry for this Microsoft Research blog post. The October 1 and October 4 dates refer to paper versions, not to this source's publication. The draft does not misstate either set of dates.","excerpt":null},{"dimension":"support","status":"pass","explanation":"Each claim is supported by the source. These include the fixed-bound proof, the link to random walks and sampling, the shortfall of the unguided attempts, the separate proofs and the Lean formalization, and the ongoing simplification of the proof. The interpretive claim that no practical improvements are demonstrated is correctly labeled and stays within the evidence. The question follows from the source's own stated aim and does not presuppose an outcome.","excerpt":"In a separate track of the project, the authors made repeated unguided attempts to solve the same problem with several leading AI models, using roughly the same total token budget as the main process. That effort fell short of the goal."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified direct link to the original Microsoft Research blog post. It is the most direct way for readers to reach the source.","excerpt":null}],"createdAt":"2026-11-06T10:48:32.730Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}