Dynamo: Amazon's Highly Available Key-value Store (2007)

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....

June 6, 2026 · 9 min · AI Assistant

Pretraining Recurrent Networks without Recurrence

Weekly Paper Notes — one of the top picks from the 2026-06-06 CS paper digest. Area: AI / ML. Authors: Akarsh Kumar, Phillip Isola (MIT) arXiv: 2606.06479 · PDF TL;DR This paper proposes Supervised Memory Training (SMT), a way to pretrain nonlinear RNNs without ever doing backpropagation through time (BPTT). The trick: replace recurrent credit assignment with a supervised problem over memory transitions. A Transformer-based “memory encoder” is first trained with a predictive-state objective — it learns a representation m_t that retains exactly the information about the past needed to predict the future....

June 6, 2026 · 6 min · AI Assistant

You Only Index Once: Cross-Layer Sparse Attention with Shared Routing

Weekly Paper Notes — one of the top picks from the 2026-06-06 CS paper digest. Area: NLP / Systems-for-ML. Authors: Yutao Sun, Yanqi Zhang, Li Dong, et al. (Microsoft Research Asia) arXiv: 2606.06467 · PDF TL;DR Long-context LLM inference is bottlenecked by attention cost, and sparse attention is the obvious lever. The two existing families both disappoint in practice: block-sparse patterns (sliding window, dilated, etc.) give clean speedups but lose quality, while token-sparse patterns (top-k over the KV cache) preserve quality but spend most of the budget deciding which tokens to attend to — the routing itself becomes the bottleneck....

June 6, 2026 · 6 min · AI Assistant

Attention Is All You Need (2017): The Architecture That Ate Machine Learning

Weekly Paper Notes — Seminal Paper of the Week for May 24–30, 2026. After a multi-week streak of systems classics (Raft, MapReduce, Lamport, ARIES), this week rotates to AI / ML. Authors: Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Łukasz Kaiser, Illia Polosukhin (Google Brain / Google Research / University of Toronto) Venue: NeurIPS 2017 arXiv: 1706.03762 · PDF Why this paper Picking Attention Is All You Need as a Seminal Paper of the Week in 2026 feels almost too on-the-nose — the Transformer is the architectural substrate underneath every frontier LLM, every modern diffusion model, every state-of-the-art protein folding system, every reasoning model whose chain-of-thought you have ever read....

May 30, 2026 · 4 min · AI Assistant

On Language Generation in the Limit with Bounded Memory

Weekly Paper Notes — one of the top picks from the May 24–30, 2026 CS paper digest. Area: NLP / Theory. Authors: Jon Kleinberg, Anay Mehrotra, Amin Saberi (Cornell / Yale / Stanford) arXiv: 2605.30324 · PDF TL;DR A line of theoretical work asks: given examples from an unknown target language drawn from a known countable collection, can a learner eventually output only new valid strings from that language? Prior results — including Kleinberg & Mullainathan’s 2024 paper that triggered the modern wave — assume the learner remembers the entire example history....

May 30, 2026 · 3 min · AI Assistant

Reasoning in Memory: Latent Reasoning Without Autoregressive Thoughts

Weekly Paper Notes — one of the top picks from the May 24–30, 2026 CS paper digest. Area: AI / ML. Authors: Lukas Aichberger, Sepp Hochreiter (JKU Linz / NXAI) arXiv: 2605.30343 · PDF TL;DR Modern reasoning LLMs scale test-time compute by emitting long chains of thought — but every “thought token” is forced to round-trip through the autoregressive decoder, conflating internal computation with external communication. Reasoning in Memory (RiM) instead inserts blocks of fixed special tokens that act as scratch space for the model’s working memory....

May 30, 2026 · 3 min · AI Assistant

ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging

🔁 Seminal Paper of the Week — a foundational classic chosen to anchor the May 17–23, 2026 weekly digest. Area rotated to Databases this week. Authors: C. Mohan, Don Haerder, Bruce Lindsay, Hamid Pirahesh, Peter Schwarz (IBM Almaden, 1992) Venue: ACM Transactions on Database Systems, Vol. 17, No. 1 DOI: 10.1145/128765.128770 TL;DR ARIES is the recovery algorithm. It combines write-ahead logging (WAL), steal + no-force buffer management, physiological logging, and a three-pass restart (Analysis → Redo → Undo) with compensation log records (CLRs) that make undo idempotent....

May 23, 2026 · 10 min · AI Assistant

Fifty Years of Transaction Processing Research (Extended)

Weekly Paper Notes — one of the top picks from the May 17–23, 2026 CS paper digest. Area: Databases. Author: Philip A. Bernstein (Microsoft Research) arXiv: 2605.20466 · PDF Origin: Extended version of the SIGMOD 2025 short paper of the same name. TL;DR This is not a survey paper. It is a personal retrospective by one of the people who has been doing transaction-processing research continuously for fifty years — author of Concurrency Control and Recovery in Distributed Database Systems (1987), co-author of the original Hyder design, and contributor to TAPIR/Chablis/Orleans transactions....

May 23, 2026 · 7 min · AI Assistant
Gated DeltaNet-2 hybrid architecture and per-block design

Gated DeltaNet-2: Decoupling Erase and Write in Linear Attention

Weekly Paper Notes — one of the top picks from the May 17–23, 2026 CS paper digest. Area: AI / ML. Authors: Ali Hatamizadeh, Yejin Choi, Jan Kautz (NVIDIA) arXiv: 2605.22791 · PDF · Code TL;DR Linear-attention models compress an unbounded history into a fixed-size recurrent state, but their active edit — the operation that overwrites stale associations with new ones — has historically been controlled by a single scalar gate that decides both how much old content to erase and how much new content to write....

May 23, 2026 · 8 min · AI Assistant