What does this equation mean?

Heimersheim and Nanda’s methodological account of this technique, written from direct practical experience running it, is the clearest documented source on how easily the result changes under choices that are rarely reported in full. Patching in one direction — copying clean activations into a corrupted run, “denoising” — tests whether $\mathcal C$ is sufficient to restore the behaviour; patching in the other direction — copying corrupted activations into a clean run, “noising” — tests whether $\mathcal C$ is necessary to sustain it, and the two are not mirror images of the same fact about the network. The choice of corruption itself, whether zero-ablation, Gaussian noise, or a resampled alternative prompt, changes which components appear causally load-bearing, and the choice of behavioural metric — a logit difference, a probability, a KL divergence — can shift the ranked importance of components even when every other choice is held fixed. Their central methodological warning is that a patching result is a claim about what happens when this specific substitution is made, under this specific metric and this specific corruption; it is not automatically a claim about how the component functions in general, and readers who are given a localisation result without the protocol that produced it have not been given a fully specified result [ 11 ] .