40:I[185,["/_next/static/chunks/3xnt26d00_zk-.js","/_next/static/chunks/1s-yni1uf2lwd.js","/_next/static/chunks/42spz6paskvb6.js","/_next/static/chunks/06x30xgfe6iur.js","/_next/static/chunks/3b4qrzgkt_l12.js","/_next/static/chunks/15lgs8s22dk5l.js"],"SendEmailButton"] 42:I[63625,["/_next/static/chunks/3xnt26d00_zk-.js","/_next/static/chunks/1s-yni1uf2lwd.js","/_next/static/chunks/42spz6paskvb6.js","/_next/static/chunks/06x30xgfe6iur.js","/_next/static/chunks/3b4qrzgkt_l12.js","/_next/static/chunks/15lgs8s22dk5l.js"],"AddToLibraryButton"] 43:I[29721,["/_next/static/chunks/3xnt26d00_zk-.js","/_next/static/chunks/1s-yni1uf2lwd.js","/_next/static/chunks/42spz6paskvb6.js","/_next/static/chunks/06x30xgfe6iur.js","/_next/static/chunks/3b4qrzgkt_l12.js","/_next/static/chunks/15lgs8s22dk5l.js"],"ShareButton"] 44:I[58016,["/_next/static/chunks/3xnt26d00_zk-.js","/_next/static/chunks/1s-yni1uf2lwd.js","/_next/static/chunks/42spz6paskvb6.js","/_next/static/chunks/06x30xgfe6iur.js","/_next/static/chunks/3b4qrzgkt_l12.js","/_next/static/chunks/15lgs8s22dk5l.js"],"ProcessEpisodeButton"] 45:I[45269,["/_next/static/chunks/3xnt26d00_zk-.js","/_next/static/chunks/1s-yni1uf2lwd.js","/_next/static/chunks/42spz6paskvb6.js","/_next/static/chunks/06x30xgfe6iur.js","/_next/static/chunks/3b4qrzgkt_l12.js","/_next/static/chunks/15lgs8s22dk5l.js"],"SignupCTA"] 39:["$","h1",null,{"className":"max-w-[22ch] font-display text-[clamp(32px,4.5vw,48px)] font-medium leading-[1.05] tracking-[-0.02em] text-[color:var(--fg-1)] text-balance","children":"From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning"}] 3a:["$","div",null,{"className":"flex flex-wrap items-center gap-x-4 gap-y-1 font-mono text-[12px] uppercase tracking-[0.1em] text-[color:var(--fg-3)]","children":[["$","time",null,{"dateTime":"2026-07-18T16:23:16.000Z","children":"July 18, 2026"}],["$","span",null,{"aria-hidden":true,"children":"·"}],["$","span",null,{"children":"00:18:38"}],false]}] 41:T401,

This paper studies how post-training pipelines transform large language models into effective reasoners through compositional generalization. The authors propose a hierarchical latent selection model that separates reasoning into atomic skills, such as local operations, and routing mechanisms that dictate how information is composed. Their theory suggests that supervised fine-tuning (SFT) provides the necessary raw materials, while reinforcement learning (RL) identifies and decomposes these elements into reusable modules. Controlled experiments validate that RL enables models to solve novel tasks by recombining learned atoms in ways not seen during training. Ultimately, the study concludes that SFT should focus on broad module coverage while RL should target genuinely new compositions to maximize out-of-distribution performance.