Verification procedures in coding agents must preserve execution facts, interpret their scope and discharge checking obligations. We study these responsibilities through qualified repository checks, controlled evidence consumers and executable workflows. A prospective thirteen-task factorial study finds that correct reported facts need not yield the requested finite verdict. Conversely, all 122 delivered labels in a held-out receipt-supply study are correct, while sixteen responses misreport facts and eleven others exceed authorized scope. Production repair supplies successful controls and finite-supported preservation failures. Across 118 repair episodes on 31 tasks, source interventions separate startup reachability from repair and witness production from the claimed operation. Lifetime and resource controls delimit what passing validation establishes. Generated-note comparisons yield local repair differences but can state false explanations; strong ordinary baselines, new tasks and Skill-transfer studies supply no consistent overall advantage. These results characterize evidence interpretation, applicability and fulfilled actions while limiting claims of general diagnostic superiority, Skill deterioration or deployed folding effects.
Do language models encode the same prompted concepts in structurally compatible ways, beyond generic similarity induced by shared questions? We study contrastive-difference centered kernel alignment ($\mathrm{CKA}_Δ$), which compares per-question activation differences between opposing concept instructions. A matched same-concept versus cross-concept comparison separates the question of concept-conditioned structure from the magnitude of representational similarity. Across four checkpoints and eight personality-related traits, a fixed-final-layer analysis gives mean same- and cross-trait $\mathrm{CKA}_Δ$ of 0.7259 and 0.6828. Trait-label randomization detects correspondence conditional on this model and prompt set ($p=1/10001$, one-sided), but a model-and-trait-weighted 95% interval for the difference is $[-0.0330,0.1017]$, limiting broader generalization. Strict question-group holdouts retain high same-trait linear recoverability. More stringently, maps and preprocessing fitted on seven traits transfer a source polarity classifier for the eighth trait to handwritten test questions: mean affine and orthogonal accuracies are 88.10% and 88.57%, versus 47.70% for shuffled pairing. Performance varies substantially across traits and model directions. Synthetic controls show why moderate CKA and high affine accuracy alone do not establish functional equivalence. The results support a scoped diagnostic of concept-specific structure and held-out linear recoverability; they do not establish universal invariance or a robust advantage over raw CKA across architectures.