<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Weekly CS Paper Digest — 2026-07-26 → 2026-08-01 on Sparse Notes</title>
    <link>https://sparsenotes.com/posts/2026/08/papers/</link>
    <description>Recent content in Weekly CS Paper Digest — 2026-07-26 → 2026-08-01 on Sparse Notes</description>
    <image>
      <url>https://sparsenotes.com/images/og-default.png</url>
      <link>https://sparsenotes.com/images/og-default.png</link>
    </image>
    <generator>Hugo -- gohugo.io</generator>
    <lastBuildDate>Sat, 01 Aug 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sparsenotes.com/posts/2026/08/papers/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Incast-Free MoE Rate-Based Scheduling</title>
      <link>https://sparsenotes.com/posts/2026/08/papers/incast-free-moe-rate-scheduling/</link>
      <pubDate>Sat, 01 Aug 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/08/papers/incast-free-moe-rate-scheduling/</guid>
      <description>Round-robin scheduling of Mixture-of-Experts all-to-all traffic causes an exponentially growing incast; normalizing the demand matrix by its worst-case row/column sum eliminates it by construction.</description>
    </item>
    
    <item>
      <title>Specula: Scaling Formal Specifications for Autonomous Model Checking of System Code</title>
      <link>https://sparsenotes.com/posts/2026/08/papers/specula-agentic-tla-model-checking/</link>
      <pubDate>Sat, 01 Aug 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/08/papers/specula-agentic-tla-model-checking/</guid>
      <description>A push-button agentic system that writes its own TLA&#43; specs, checks them against real code traces, and found 249 bugs across 48 open-source systems.</description>
    </item>
    
    <item>
      <title>The Design and Implementation of a Log-Structured File System (1991)</title>
      <link>https://sparsenotes.com/posts/2026/08/papers/log-structured-file-system/</link>
      <pubDate>Sat, 01 Aug 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/08/papers/log-structured-file-system/</guid>
      <description>Seminal paper of the week: Rosenblum and Ousterhout&amp;#39;s bet that memory would keep growing, reads would stop hitting disk, and the only thing left worth optimizing was the write path.</description>
    </item>
    
  </channel>
</rss>
