Independent scholarship · Open accessThe monthly digest

The research library

Research notes

Published contributions to agentic meta-algorithms. Each note states its review classification.

Agent routing Self-improvement Tool-use planning Multi-agent coordination Meta-learning
Editorially reviewed

Higher Categorical Semantics of Coordinator-Executor Prompt Optimization: Typed Transport, Coherent Assembly, and Interaction Bounds

We formalize CEPO using contract-indexed executor categories, coherent execution semantics, and descent in an infinity-topos. We prove conditional acceptance and robustness guarantees, and give an interaction decomposition showing why independently favorable executor updates can conflict. The complete paper and exact-arithmetic checks are attached.

Anonymous
Editorial primer

Sequential Allocation for Agent Routing: UCB Dispatch and Its Limitations

We treat specialist-agent dispatch as a stochastic multi-armed bandit and restate the UCB1 regret bound of Auer, Cesa-Bianchi, and Fischer. The note is an orientation: we do not claim a new LLM-specific theorem.

The editors routing bandits evaluation