<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/wp-content/plugins/xml-sitemap-feed/assets/sitemap-news.xsl?ver=5.7.4"?>
<!-- generated-on="2026-05-09T09:56:30+00:00" -->
<!-- generator="XML Sitemap & Google News for WordPress" -->
<!-- generator-url="https://status301.net/wordpress-plugins/xml-sitemap-feed/" -->
<!-- generator-version="5.7.4" -->
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:news="http://www.google.com/schemas/sitemap-news/0.9" >
<url><loc>https://mahdi.cheraghchi.info/technology/the-post-doctoral-pipeline-that-connects-epfl-mit-cmu-and-the-university-of-michigan-and-why-it-matters/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T07:36:22+00:00</news:publication_date><news:title>The Post-Doctoral Pipeline That Connects EPFL, MIT, CMU, and the University of Michigan — and Why It Matters</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/ai/why-ai-models-that-can-explain-themselves-are-harder-to-build-than-anyone-in-silicon-valley-admits/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T07:31:17+00:00</news:publication_date><news:title>Why AI Models That Can Explain Themselves Are Harder to Build Than Anyone in Silicon Valley Admits</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/research/inside-the-world-of-approximation-hardness-where-researchers-prove-that-problems-cannot-even-be-approximately-solved/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T07:27:07+00:00</news:publication_date><news:title>Inside the World of Approximation Hardness: Where Researchers Prove That Problems Cannot Even Be Approximately Solved</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/research/the-mathematics-of-machine-translation-how-algorithms-learned-to-understand-context/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T07:21:51+00:00</news:publication_date><news:title>The Mathematics of Machine Translation: How Algorithms Learned to Understand Context</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/research/how-a-graduate-students-dissertation-on-coding-theory-became-a-foundational-reference-for-5g-network-designers/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T07:17:19+00:00</news:publication_date><news:title>How a Graduate Student&#8217;s Dissertation on Coding Theory Became a Foundational Reference for 5G Network Designers</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/research/the-obscure-siam-journal-paper-that-quietly-changed-how-we-think-about-signal-recovery/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T07:12:03+00:00</news:publication_date><news:title>The Obscure SIAM Journal Paper That Quietly Changed How We Think About Signal Recovery</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/ai/the-ai-therapist-can-a-machine-cure-the-american-mental-health-crisis/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T07:07:16+00:00</news:publication_date><news:title>The AI Therapist: Can a Machine Cure the American Mental Health Crisis?</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/research/why-the-research-agenda-of-americas-top-theoretical-cs-labs-looks-nothing-like-what-silicon-valley-is-building-and-that-is-exactly-the-point/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T07:03:00+00:00</news:publication_date><news:title>Why the Research Agenda of America&#8217;s Top Theoretical CS Labs Looks Nothing Like What Silicon Valley Is Building — and That Is Exactly the Point</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/research/the-mathematics-of-climate-change-will-algorithms-save-us-before-its-too-late/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T06:57:41+00:00</news:publication_date><news:title>The Mathematics of Climate Change: Will Algorithms Save Us Before It’s Too Late?</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/research/the-augmented-reality-enterprise-how-warehouses-became-the-ultimate-tech-laboratory/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T06:53:26+00:00</news:publication_date><news:title>The Augmented Reality Enterprise: How Warehouses Became the Ultimate Tech Laboratory</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/technology/one-tape-turing-machine-and-branching-program-lower-bounds-for-mcsp/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T06:46:24+00:00</news:publication_date><news:title>One-Tape Turing Machine and Branching Program Lower Bounds for MCSP</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/technology/capacity-upper-bounds-for-deletion-type-channels/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-08T06:40:14+00:00</news:publication_date><news:title>Capacity upper bounds for deletion-type channels</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/research/inside-csdm-ias-where-the-quietest-room-in-princeton-solves-the-loudest-problems-in-computing/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T12:45:03+00:00</news:publication_date><news:title>Inside CSDM IAS &#8211; Where the Quietest Room in Princeton Solves the Loudest Problems in Computing</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/news/inside-the-focs-steering-committee-the-quiet-power-behind-theoretical-computer-science/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T12:43:37+00:00</news:publication_date><news:title>Inside the FOCS Steering Committee &#8211; The Quiet Power Behind Theoretical Computer Science</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/news/inside-the-quiet-revolution-how-derandomization-theory-in-coding-is-rewriting-the-rules-of-communication/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T12:31:12+00:00</news:publication_date><news:title>Inside the Quiet Revolution &#8211; How Derandomization Theory in Coding Is Rewriting the Rules of Communication</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/technology/circuit-lower-bounds-for-mcsp-from-local-pseudorandom-generator/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T12:25:27+00:00</news:publication_date><news:title>Circuit Lower Bounds for MCSP from Local Pseudorandom Generator</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/research/how-mit-computer-science-and-artificial-intelligence-lab-keeps-outrunning-silicon-valley/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T12:21:34+00:00</news:publication_date><news:title>How MIT Computer Science and Artificial Intelligence Lab Keeps Outrunning Silicon Valley</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/news/nearly-optimal-robust-secret-sharing-the-quiet-breakthrough-reshaping-cryptography/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T12:16:04+00:00</news:publication_date><news:title>Nearly Optimal Robust Secret Sharing &#8211; The Quiet Breakthrough Reshaping Cryptography</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/news/submodular-functions-are-noise-stable-the-quiet-math-result-that-changed-machine-learning/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T12:11:10+00:00</news:publication_date><news:title>Submodular Functions Are Noise Stable &#8211; The Quiet Math Result That Changed Machine Learning</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/technology/nearly-optimal-deterministic-algorithm-for-sparse-walsh-hadamard-transform/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T12:06:47+00:00</news:publication_date><news:title>Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/news/non-malleable-codes-against-active-physical-layer-adversary-the-quiet-breakthrough-cryptographers-have-been-waiting-for/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T12:02:38+00:00</news:publication_date><news:title>Non-Malleable Codes against Active Physical Layer Adversary &#8211; The Quiet Breakthrough Cryptographers Have Been Waiting For</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/news/approximating-linear-threshold-predicates-the-quiet-math-problem-that-refuses-to-be-solved/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T11:57:48+00:00</news:publication_date><news:title>Approximating Linear Threshold Predicates &#8211; The Quiet Math Problem That Refuses to Be Solved</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/news/focs-2022-inside-the-denver-gathering-that-quietly-shaped-a-decade-of-computer-science/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T11:01:52+00:00</news:publication_date><news:title>FOCS 2022 &#8211; Inside the Denver Gathering That Quietly Shaped a Decade of Computer Science</news:title></news:news></url>
<url><loc>https://mahdi.cheraghchi.info/research/coding-and-information-theory-the-quiet-math-powering-everything-you-touch/</loc><news:news><news:publication><news:name>Mahdi Cheraghchi</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-05-07T10:56:49+00:00</news:publication_date><news:title>Coding and Information Theory &#8211; The Quiet Math Powering Everything You Touch</news:title></news:news></url>
</urlset>
