Weekly CS Paper Digest — Jun 20 – Jun 27, 2026

Weekly Paper Notes — Seminal Paper of the Week for the 2026-06-27 CS paper digest. Area: Distributed Computing. Author: Satoshi Nakamoto Published: October 31, 2008 (cryptography mailing list) Canonical URL: bitcoin.org/bitcoin.pdf This week’s digest had a fresh paper on transaction-fair ordering on DAGs without weak edges (Tilikum, 2606.27250) — a piece of work whose entire problem statement (DeFi, BEV, reordering attacks) only exists because of one nine-page document published seventeen-and-a-half years ago to a small cryptography mailing list....

Weekly Paper Notes — one of the top picks from the 2026-06-27 CS paper digest. Area: AI / ML. Authors: Nicklas Hansen, Xiaolong Wang (UC San Diego) arXiv: 2606.27326 · PDF · Interactive TL;DR Generative action-conditional world models produce visually fluent rollouts that drift from the true dynamics — the “fluent but wrong” failure mode familiar from LLMs, now in video. Hansen and Wang argue this is fundamentally a data coverage problem: hallucinations concentrate in regions of state-action space the training set under-samples, and cheap data-centric signals computed at inference time can both detect and prevent them....

Weekly Paper Notes — one of the top picks from the 2026-06-27 CS paper digest. Area: AI / ML. Authors: Josef Chen arXiv: 2606.27288 · PDF TL;DR The paper formalizes a hard accuracy ceiling for any multi-model LLM system whose final output is one member’s answer — routing, voting, cascades, fusion, mixture-of-agents. That ceiling is 1 − β, where β is the co-failure rate: the fraction of queries on which every model in the pool is wrong simultaneously....

Weekly Paper Notes — one of the top picks from the 2026-06-20 CS paper digest. Area: Distributed Computing. Authors: Jiasheng Zhou, Longbin Zeng, Clavis Chen, Ruiming Lu et al. arXiv: 2606.20374 · PDF TL;DR ARGUS is a tracing and performance-diagnosis system designed for always-on operation on production LLM training clusters with more than 10,000 GPUs. The central insight is that no single profiler can be cheap, deep, and continuous all at once — so ARGUS decomposes observation along the training call hierarchy into three independent collection channels: CPU call stacks, framework semantics, and GPU kernel execution....

Weekly Paper Notes — one of the top picks from the 2026-06-20 CS paper digest. Area: Databases / Systems. Authors: Georg Kreuzmayr (TigerBeetle), Muhammad El-Hindi (TUM), Benjamin Wagner (Firebolt), Tobias Ziegler (TigerBeetle), Viktor Leis (TUM) arXiv: 2606.19969 · PDF TL;DR For two decades distributed database systems treated the network as an opaque, kernel-managed pipe and the kernel TCP stack was fast enough that this abstraction was free. It isn’t anymore....

Seminal Paper of the Week — the paper that quietly defined what “cloud storage” looks like from the inside. Authors: Sanjay Ghemawat, Howard Gobioff, Shun-Tak Leung (Google) Published: SOSP ‘03 — 19th ACM Symposium on Operating Systems Principles, October 2003. Canonical link: The Google File System (Google research mirror) · ACM DOI 10.1145/945445.945450 TL;DR In 2003, Ghemawat, Gobioff and Leung described how Google was running a multi-thousand-node, petabyte-scale distributed file system on commodity hardware — and how the design assumptions diverged so sharply from the established POSIX-file-system lineage that almost every architectural decision in the paper looks like a heresy until you read the workload section....

Weekly Paper Notes — one of the top picks from the 2026-06-13 CS paper digest. Area: Operating Systems / Systems. Authors: Zhuoping Yang, Yiyu Shi, Alex Jones arXiv: 2606.06697 · PDF TL;DR The GPU has quietly become a multi-tenant device — applications no longer just dispatch compute kernels, they call into vendor libraries (cuFFT, cuBLAS, NCCL), interact with GPU-resident services, and touch storage and network adapters through GPUDirect paths. But the CUDA programming model still hands each process the full keys to the device: its own context, raw device pointers, runtime handles, module loader, and direct kernel launch....

Weekly Paper Notes — one of the top picks from the 2026-06-13 CS paper digest. Area: Distributed Computing. Authors: Samuel Erickson, Mikael Johansson (KTH) arXiv: 2606.13287 · PDF TL;DR In asynchronous SGD (ASGD), workers compute gradients on possibly stale parameters and push updates without waiting for slow peers. That’s how you keep all the GPUs busy, but it’s also how slow workers (“stragglers”) inject large delays into the update stream, which classical analyses say should slow convergence in proportion to the maximum delay across the workers....

Seminal Paper of the Week — a foundational systems paper that quietly shapes how every distributed system you use is layered. Authors: Jerome H. Saltzer, David P. Reed, David D. Clark (MIT) Published: ACM Transactions on Computer Systems 2(4), November 1984. Canonical link: End-to-End Arguments in System Design (MIT) · ACM DOI 10.1145/357401.357402 TL;DR The end-to-end argument is a layering principle: a function should be implemented in a lower layer of a system only when it can be completely and correctly implemented at that layer, and when implementing it there provides a clear performance benefit over implementing it at the endpoints....

Weekly Paper Notes — Seminal Paper of the Week for the 2026-06-06 CS paper digest. Area: Distributed Systems / Databases. Citation: Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, Werner Vogels — Dynamo: Amazon’s Highly Available Key-value Store. SOSP ‘07. DOI: 10.1145/1294261.1294281 Canonical PDF: Amazon Dynamo paper (Werner Vogels’ archive) Why the paper still matters Almost every popular “NoSQL” key-value store of the last fifteen years — Cassandra, Riak, Voldemort, DynamoDB (the service), early versions of Redis Cluster, parts of MongoDB’s replica routing — pulls its core design vocabulary directly from Dynamo: consistent hashing for partitioning, vector clocks for divergence tracking, sloppy quorums with hinted handoff for availability under failure, and read repair / Merkle-tree anti-entropy for eventual convergence....