Engram recruitment spends spatial information
The paper starts from an experimental observation rather than a new dataset: engram cells in hippocampal CA1 are recruited from a subset of place cells, and when a place cell becomes an engram cell its place field expands in the corresponding context. A place field is the spatial region in which a neuron preferentially fires, so expanding it blurs where the animal is. That single fact turns engram allocation into a budget problem, because the same finite population of CA1 neurons must carry both the animal's position and the identity of the context.
The authors formalize the budget with mutual information, a measure of how much one variable tells you about another. Spatial information is the mutual information between which neuron fired and the animal's position, conditioned on context; contextual information is the mutual information between the firing neuron and the context, conditioned on position. Because position is continuous and context is discrete, the two quantities are not directly comparable, so the model combines them as a weighted sum with W setting how much spatial information counts relative to contextual information. The analysis maximizes a lower bound on the increase in this total information relative to a reference network with no engram cells at all.
A Gaussian place-field model with disjoint engrams
Each context is a two-dimensional environment of the same area, explored uniformly, and the animal is placed in context s with probability p_s. Each place field is an isotropic two-dimensional Gaussian whose width is the baseline sigma for ordinary place cells and sigma times the square root of (1 + alpha) for cells recruited as engram cells in that context. The parameter alpha therefore measures how much a cell's field expands on recruitment, which the authors treat as the strength of contextual input. Engram sets for different contexts are assumed mutually disjoint, no engram cells are assigned to the home cage, and the fractions f_s must sum to at most one.
The optimal fractions are obtained by numerically solving this constrained maximization for many draws of context probabilities, with alpha = 0.5, W = 0.1 and M = 10 contexts in the main figure. Because the constraint couples all contexts, the optimal f_s generally depends on the whole set of probabilities rather than on p_s alone. That coupling is the formal source of the competition the paper is about, and it is why the results are not a per-context calculation.
Allocation peaks at intermediate context probability
The numerical solutions show three features. For sufficiently large p_s, the optimal engram fraction falls as the context becomes more frequent: allocating many engram cells to a repeatedly visited environment would erode spatial information that the animal keeps using, so preserving accurate spatial coding wins. For sufficiently small p_s, the fraction also falls, but for a different reason. Recruiting cells for a rarely experienced context barely dents spatial information, yet it consumes cells that other contexts could use, so the shared budget pushes allocation down.
Together these two effects produce a non-monotonic curve that reaches its maximum at an intermediate probability. The authors test the competition explanation directly by re-running the analysis with competition among contexts removed; as expected, the optimal fraction then becomes a monotonically decreasing function of occurrence probability. This control matters because it separates the low-probability decline, which is a competition effect, from the high-probability decline, which follows from the spatial-contextual trade-off alone.
Rare contexts receive no engram cells at all
The third feature is a discontinuity rather than a gradual taper. At a critical context probability the optimal fraction jumps from a finite value to zero, so contexts below that probability receive no engram cells in the optimum. The authors report that this transition also disappears when inter-context competition is removed, tying it to the same shared-resource mechanism. Their interpretation is that maintaining memories of environments extremely unlikely to recur is an inefficient use of limited neurons, which are better spent on frequent contexts and on accurate spatial representation.
This is a model prediction about an optimal allocation, not an observation of what animals do. The paper presents it as experimentally testable: the predicted curve and its discontinuity are stated in terms of measured engram fractions across contexts whose frequencies are known, which is the comparison the framework is built to invite.
A phase boundary separates allocation from none
Varying alpha and W produces a qualitative split. For relatively small W, the optimal fraction stays finite and keeps the non-monotonic shape. As W grows, the solution moves into a phase where no engram cells are allocated for any value of p_s, because accurate spatial representation has become important enough that suppressing recruitment is information-theoretically optimal. The critical W rises with alpha, so stronger contextual input, indexed by greater place-field expansion, allows finite allocation even when spatial information carries a relatively large weight.
Applying the Karush-Kuhn-Tucker conditions to the constrained problem yields a sufficient condition for the no-allocation phase, W at least 1 minus alpha divided by (1 + alpha) times the natural log of (1 + alpha). The authors compare this analytic boundary with a numerically computed phase diagram in the alpha-W plane, colored by the log of the maximum engram fraction across contexts, and report good agreement between the predicted curve and the numerical boundary.
Stationary probabilities limit the interpretation
The theory is built for a stationary setting with fixed occurrence probabilities, so the optimal fractions describe what CA1 would settle on after the animal has experienced the contexts at given frequencies. Real animals do not experience contexts under stationary conditions, and effective probabilities can shift with experience; the authors note that extending the framework to a dynamic setting might speak to forgetting. The model also assumes uniform exploration, equal-area environments, Gaussian place fields, and mutually disjoint engram sets, and it maximizes a lower bound on contextual information rather than the exact conditional mutual information, which the authors could not evaluate analytically.
The authors further suggest, as an interpretation rather than a result, that the decline at high context probability is consistent with systems consolidation: frequently encountered contexts may accumulate repeated experiences and become less dependent on hippocampal representations as they consolidate in the neocortex. That link is offered as a possible reading of the curve, not as something the optimization demonstrates.
Intermediate contexts are the sharpest test
The paper's most decision-relevant claim is a comparison, not a single number. If engram allocation followed frequency, the largest engram fractions would sit at the most frequently experienced contexts; the model instead puts the maximum at intermediate probabilities, sends rare contexts below the critical threshold to zero, and reduces allocation for the most frequent contexts. The parameters that move this picture are alpha, the place-field expansion that indexes contextual input strength, and W, the weight on spatial information, with the analytic boundary marking where allocation disappears entirely.
For readers evaluating the framework, the informative test is therefore the shape of the curve across contexts spanning rare, intermediate and frequent, together with the predicted jump at the critical probability. A monotonic increase in measured engram fraction with context frequency would contradict the competition account, whereas a peak at intermediate frequency and a drop for the most frequent contexts would be the pattern this model was built to explain.
Sources used in this answer
Space versus Context: Competition for limited neural resources determines engram cell allocation in the hippocampus
An information-theoretic optimization over finite CA1 place cells predicts that the optimal engram fraction for a context is non-monotonic in its occurrence probability, jumps from zero at a critical probability, peaks at intermediate probabilities, and vanishes entirely above a derivable boundary in place-field expansion and spatial-information weight.
