--- title: 'Shortcut-Consistency Training: Methods & Applications' url: https://www.emergentmind.com/topics/shortcut-consistency-training type: topic --- # Shortcut-Consistency Training: Methods & Applications Searching arXiv for the cited shortcut-consistency papers to ground the article in current records. Shortcut-consistency training denotes a class of training procedures in which a consistency objective is retained only after shortcut routes to satisfying that objective have been identified and neutralized. Across the literature, the term appears in several distinct technical settings: cross-domain photo–sketch translation, dense video correspondence, one-step and few-step generative modeling, reward modeling, deployment-time debiasing, reasoning under distribution shift, and deep-search task synthesis. The unifying concern is that a naïve consistency loss can often be minimized by superficial or structurally trivial signals—such as absolute pixel position, within-domain reconstruction biases, formatting and verbosity cues, answer-token concentration, or prematurely identifying clues—rather than by the intended semantic correspondence, flow, preference signal, or search process [1805.00247] [2105.05838] [2510.21250] [2606.12087]. ## 1. Scope of the term across the literature The phrase has no single canonical meaning across all subfields represented here. Instead, it names a recurring design pattern: a model is trained with a consistency condition, but the training pipeline is altered so that shortcut features cannot satisfy that condition on their own. In some works, the shortcut is literal, as in the “absolute position shortcut” in fully convolutional cycle-consistency for video correspondence. In others, “shortcut” refers to a one-step or few-step generative map, a weak within-domain bottleneck reconstruction used in place of a long cycle, or a diagnostic notion of shortcut sensitivity under counterfactual or masked perturbations [2105.05838] [2510.21250] [2604.12277] [2606.09043]. | Setting | Shortcut carrier | Consistency mechanism | |---|---|---| | Photo-to-sketch translation | Large photo–sketch domain gap | Within-domain shortcut consistency at encoder bottleneck | | Video correspondence | Absolute spatial position | Double-crop plus feature warping in cycle-consistency | | Generative shortcut models | Step-size inconsistency, compounding guidance, EMA lag | Self-consistency, intrinsic guidance, Twin EMA | | Continuous-time consistency models | Pure shortcut loss without local flow anchor | Flow Matching anchor added to consistency loss | | Reward modeling | Surface formatting, length, tone cues | Online reweighting from counterfactual sensitivity | | Deployment-time debiasing | Shortcut tokens highlighted by attribution | Representation consistency under token masking | | Reasoning and search | Answer memorization, shortcut clues, cheap identifying routes | Gradient-aware surgery or shortcut-resistant task synthesis | A central misconception corrected by multiple papers is that consistency alone guarantees meaningful structure. In the surveyed work, simple cycle-consistency can collapse to identity matching in correspondence learning, standard cross-domain cycles can be less stable than bottleneck shortcuts in sketch generation, shortcut models can become self-inconsistent across step sizes, and search tasks that appear structurally complex can still admit a cheap identifying route [2105.05838] [1805.00247] [2510.21250] [2606.12087]. ## 2. Bottleneck shortcut consistency in photo–sketch translation The earliest formulation in this set appears in "Learning to Sketch with Shortcut Cycle Consistency" [1805.00247]. The problem is photo-to-sketch translation with weakly informative paired supervision, where the photo and sketch domains differ substantially and human sketches vary in sophistication and abstraction even for the same reference photo. The method therefore replaces the standard long cross-domain cycle with a shortcut consistency enforced at the encoder bottleneck. The architecture is explicitly multi-modal. \(E_{\text{photo}}\) is a CNN encoder for photos with five strided convolutions, instance normalization, ReLU, two fully connected layers, and two heads \(\mu_p,\sigma_p\in\mathbb{R}^d\), producing $$ z_p=\mu_p+\sigma_p\odot\epsilon,\qquad \epsilon\sim\mathcal{N}(0,I). $$ \(E_{\text{sketch}}\) is a bidirectional LSTM encoder for vector sketches, again producing \(\mu_s,\sigma_s\in\mathbb{R}^d\) and a reparameterized latent \(z_s\). \(D_{\text{sketch}}\) is a conditional RNN with an LSTM and Mixture-Density-Network outputs, while \(D_{\text{photo}}\) is a CNN decoder with five fractionally-strided convolutions. Two supervised translation tasks are optimized jointly: $$ \hat s=D_s(E_p(x)),\qquad \hat x=D_p(E_s(s)). $$ The photo-to-sketch loss \(\mathcal{L}_{\rightarrow s}\) is the standard SketchRNN negative log-likelihood of the ground-truth stroke sequence under the MDN outputs, and the sketch-to-photo loss is $$ \mathcal{L}_{\rightarrow p}(x,\hat x)=\mathbb{E}_{x,\hat x}\big[\|x-\hat x\|_2^2\big]. $$ The shortcut-consistency term is within-domain reconstruction rather than \(X\to Y\to X\) cycle consistency: $$ L_{sc} = \mathbb{E}_x\big[\|D_p(E_p(x))-x\|_1\big] + \mathbb{E}_s\big[\|D_s(E_s(s))-s\|_1\big]. $$ The full objective is $$ L_{\text{full}} = L_{\text{sup}} + \lambda_{sc}L_{sc} + \lambda_{KL}L_{KL}, $$ with \(\lambda_{sc}=1.0\) and \(\lambda_{KL}=0.01\). The paper explicitly does not use standard cross-domain cycle consistency, so \(\lambda_{cyc}=0\), and within-domain reconstruction is merged into the shortcut term. The reported significance is empirical as well as conceptual. Adding shortcut consistency “greatly speeds up convergence” relative to standard cycle-consistency. On ShoeV2, the full model achieves \(53.5\%@1\) recognition accuracy versus \(51.5\%@1\) for a one-way Pix2seq baseline and \(36.5\%\) for human sketches; for fine-grained SBIR it achieves \(6.0\%@1\) versus \(4.5\%@1\) for Pix2seq, with chance at \(0.5\%\). Removing \(L_{sc}\) and reverting to full cycle consistency leads to mode collapse or much lower retrieval and recognition scores. Synthetic sketches sampled from the latent space further yield a \(+2.1\%@1\) gain on SBIR pretraining, improving \(32.43\%\) over \(30.33\%\). ## 3. Breaking positional shortcuts in fully convolutional cycle-consistency "Breaking Shortcut: Exploring Fully Convolutional Cycle-Consistency for Video Correspondence Learning" [2105.05838] studies a different failure mode. Previous cycle-consistency correspondence learning methods commonly relied on image patches. The paper moves to a fully convolutional formulation, denoted FC\(^3\), and shows that direct fully convolutional training collapses because CNN features encode absolute position through mechanisms such as zero-padding and fixed receptive fields. In consequence, the feature at spatial index \(i\) can match purely by index, so that $$ A_t^{t+1}(i,j)\approx\delta_{i=j}, $$ and cycle-consistency is satisfied without learning meaningful visual correspondence. The core training object is a palindrome sequence of feature maps $$ S_w=\bigl[F_1^{fb},\,F_2^f,\dots,F_T^f,F_T^b,\dots,F_1^b\bigr], $$ with frame-to-frame transition matrices $$ A_t^{t+1}(i,j) = \frac{\exp\bigl(\langle S_t^i,S_{t+1}^j\rangle/\tau\bigr)} {\sum_l\exp\bigl(\langle S_t^i,S_{t+1}^l\rangle/\tau\bigr)}. $$ The full cycle transition is $$ A_{\rm cyc}=\prod_{t=1}^{2T-1}A_t^{t+1}, $$ and the cycle-consistency loss supervises only returns to the same spatial location, masked for valid regions: $$ \mathcal{L}_{\rm cyc} = -\frac{1}{H'W'}\sum_{i=1}^{H'W'}M_b(i)\log\bigl(A_{\rm cyc}(i,i)\bigr). $$ The total loss sums this over starting timesteps \(k=1,\dots,T-1\): $$ \mathcal{L}_{\rm total}=\sum_{k=1}^{T-1}\mathcal{L}_{\rm cyc}^{(k)}. $$ The shortcut-breaking mechanism has two parts. First, each frame is independently cropped twice, $$ X_t^f=\Omega_{\theta^f}(I_t),\qquad X_t^b=\Omega_{\theta^b}(I_t), $$ with random-resized-crop and horizontal flip. Because \(\theta^f\neq\theta^b\), the same pixel appears at different absolute positions in the forward and backward tracks. Second, feature warping aligns the forward crop of the first frame to the backward crop. If \(B_f=B_{\theta^f}\) and \(B_b=B_{\theta^b}\), then $$ B_{fb}=B_bB_f^{-1}, $$ and a differentiable bilinear resampling operator \(\mathcal{T}\) yields \(F_1^{fb}\). A warped all-ones map produces a mask \(M\in[0,1]^{H'\times W'}\), then $$ M_b(i)=\bigl[M(i)>0.5\bigr]. $$ No extra loss term is introduced; warping only enters through the construction of \(S_w\) and \(M_b\). The implementation is tightly specified. The encoder \(\psi\) is ResNet-18, with “layer3” and “layer4” stride set to \(1\), giving a \(32\times 32\times C\) feature map, followed by a \(1\times1\) convolution to \(C=512\). Training uses Adam with learning rate \(10^{-4}\), batch size \(64\) clips, \(\tau=0.05\), crop scale \(s\sim U(0.08,1.0)\), aspect ratio in \([3/4,4/3]\), random horizontal flip \(50\%\), BYOL-style color augmentation on \(X_t^f\) and \(X_t^b\), clip length \(T=4\), and one epoch of Kinetics training, approximately \(4.5\) hours on \(8\times\)V100. The gains over naïve fully convolutional cycle-consistency are large. On J-HMDB pose tracking, PCK@0.1 rises from \(32.4\%\) for vanilla FC\(^3\) with zero-padding, \(49.7\%\) with replicate-padding, and \(35.1\%\) with no-padding, to \(62.0\%\) for STFC\(^3\). On 300VW face landmark tracking, RMSE falls from \(56.7\) for FC\(^3\) with zero-padding and \(28.2\) with replicate-padding to \(18.8\). On DAVIS-17 video object segmentation, \(\mathcal{J}\&\mathcal{F}_m\) rises from \(18.0\) for FC\(^3\) with zero-padding to \(60.5\). The crop-area lower bound \(\gamma\) also matters: \([0.08,1.0]\) gives \(60.5\), while \([0.01,1.0]\) gives \(60.1\). Removing color augmentation costs \(1.3\) points. ## 4. Self-consistency in generative shortcut models and flow-anchored consistency In generative modeling, “shortcut” often refers to a model that supports one-step, few-step, and multi-step sampling with a single network. "Improved Training Technique for Shortcut Models" introduces iSM as a training framework that formalizes self-consistency across different step sizes and then resolves several associated failure modes [2510.21250]. The basic object is a network \(s_\theta(x,t,c,d)\) predicting the normalized displacement from time \(t\) to \(t+d\), conditioned on side-information \(c\). Self-consistency requires one step of size \(2d\) to match two consecutive steps of size \(d\). If $$ x'_{t+d}=x_t+s_\theta(x_t,t,c,d)\cdot d, $$ then the consistency target is $$ s_{\text{consistency}} = \frac12\,g^w(x_t,t,c,d) + \frac12\,g^w(x'_{t+d},t+d,c,d), $$ and the self-consistency loss is $$ L_{\text{consistency}}(\theta) = \mathbb{E}_{x_0\sim\mathcal{N},\,x_1\sim p_{\text{data}},\,t,w,d} \Big[ \|s_\theta(x_t,t,c,2d,w)-s_{\text{consistency}}\|^2 \Big]. $$ The paper argues that a standard slow EMA conflicts with self-consistency because the target becomes out-of-date. Its Twin EMA strategy therefore maintains \(\theta^-_{\text{target}}\) for training targets with fast decay \(\tau_{\text{fast}}\) and \(\theta^-_{\text{infer}}\) for inference with slow decay \(\tau_{\text{slow}}\): $$ \theta^-_{\text{target}}\leftarrow\tau_{\text{fast}}\theta^-_{\text{target}}+(1-\tau_{\text{fast}})\theta, \qquad \theta^-_{\text{infer}}\leftarrow\tau_{\text{slow}}\theta^-_{\text{infer}}+(1-\tau_{\text{slow}})\theta. $$ The same work identifies “compounding guidance”: when fixed-scale CFG is applied once during training but a large inference step implicitly aggregates \(N\) CFG-guided microsteps, the effective guidance behaves as $$ w' \approx w^{\log_2 N}. $$ For \(N=128\) and \(w=1.5\), the intermediate scale is approximately \(17\times\). iSM resolves this by making \(w\) an explicit input and training one network with three losses: \(L_{\text{velocity}}\) at \(d=0,w=0\), \(L_{\text{guidance}}\) at \(d=0,w>0\), and guided \(L_{\text{consistency}}\) for \(d>0\). To mitigate low-frequency bias, every \(\ell_2\) comparison is replaced by a multi-level discrete wavelet transform loss, $$ L_{\text{wavelet}}(s_{\text{pred}},s_{\text{tgt}}) = \frac{1}{L+1}\sum_{l=0}^{L}\|W^{(l)}(s_{\text{pred}})-W^{(l)}(s_{\text{tgt}})\|^2, $$ with \(L=5\) levels in practice. The unified objective is $$ L_{\text{total}}(\theta)=\alpha L_{\text{velocity}}+\beta L_{\text{guidance}}+\gamma L_{\text{consistency}}, $$ with \(\alpha=\beta=\gamma=1\). Scaling Optimal Transport over \(K\) batches is used to reduce variance and learn straighter trajectories. The reported result is “substantial FID improvements over baseline shortcut models across one-step, few-step, and multi-step generation” on ImageNet \(256\times256\). A closely related but distinct development is "Flow-Anchored Consistency Models" [2507.03738], which studies continuous-time consistency models. The paper argues that training instability arises because the model is asked to learn only a shortcut across a probability flow, losing its grip on the instantaneous velocity field. For a probability-flow ODE $$ \frac{dx(t)}{dt}=v(x(t),t), $$ a consistency model is written as $$ f_\theta(x_t,t)=x_t+(1-t)\,F_\theta(x_t,t), $$ with a fixed-point relation $$ F_\theta(x,t)=v(x,t)+(1-t)\,\partial_tF_\theta(x,t). $$ A direct shortcut loss regresses \(F_\theta\) to the average velocity $$ \bar v(x_t,t)=\frac{x_1-x_t}{1-t}, $$ but the paper attributes instability to missing explicit supervision on the instantaneous field \(v(x,t)\). FACM therefore adds a Flow Matching anchor: $$ \mathcal{L}_{FM}(\theta) = \mathbb{E}_{t,x_0,x_1} \big\|v_\theta(x_t,t)-(x_1-x_0)\big\|_2^2, $$ and optimizes $$ \mathcal{L}_{FACM}(\theta) = \mathcal{L}_{\text{consistency}}(\theta) + \lambda\,\mathcal{L}_{FM}(\theta), $$ with \(\lambda=1.0\). In the reported ImageNet \(256\times256\) distillation setting from a LightningDiT teacher, FACM achieves FID \(1.76\) at \(NFE=1\) and FID \(1.32\) at \(NFE=2\). The ablations show \(\lambda=0\) leads to training collapse or FID \(\gg 10\), \(\lambda\in[0.5,1.5]\) is stable with the best result at \(\lambda=1.0\), and from-scratch FACM converges stably but needs approximately \(11\times\) training relative to distillation. Taken together, these generative works show that self-consistency is not sufficient by itself. In iSM, self-consistency must be reconciled with guidance control, frequency content, trajectory straightness, and EMA dynamics. In FACM, the shortcut objective must be anchored by local flow supervision. This suggests that generative shortcut-consistency training is increasingly formulated as a joint objective rather than a single consistency penalty. ## 5. Counterfactual and masked consistency in reward modeling and deployment-time debiasing Shortcut-consistency ideas also appear in language-model preference optimization and deployment-time mitigation. "DynaCF: Mitigating Shortcut Learning in Reward Models via Dynamic Counterfactual Sensitivity" defines shortcut sensitivity online during reward-model training and uses it to reweight the Bradley–Terry loss [2606.09043]. For a preference dataset \(D=\{(x_i,y_i^+,y_i^-)\}\) and reward model \(R_\theta\), the original and counterfactual margins are $$ m_i(\theta)=R_\theta(x_i,y_i^+)-R_\theta(x_i,y_i^-), $$ $$ m^{cf}_{i,k}(\theta)=R_\theta(x_i,y^{cf}_{i,k})-R_\theta(x_i,y_i^-). $$ The two diagnostics are $$ \Delta_{i,k}(\theta)=|m_i(\theta)-m^{cf}_{i,k}(\theta)|, \qquad F_{i,k}(\theta)=\mathbf{1}[m^{cf}_{i,k}(\theta)<0]. $$ Aggregating over \(K_i\) valid semantics-preserving counterfactuals gives $$ s_{cf,i}(\theta) = \frac{1}{K_i}\sum_{k=1}^{K_i}\Delta_{i,k}(\theta) + \mu_{\text{flip}}\cdot\frac{1}{K_i}\sum_{k=1}^{K_i}F_{i,k}(\theta). $$ Samples are dynamically downweighted by $$ w_i(t)=\max(w_{\min},\,1-\gamma\,s_{cf,i}(\theta_t)), $$ and the per-step objective becomes $$ L_{\text{DynaCF}}(t) = \frac{1}{|B_t|}\sum_{i\in B_t}w_i(t)\cdot[-\log\sigma(m_i(\theta_t))]. $$ The counterfactuals are produced by rule-based edits under three profiles: default, math, and code. Validity checks include non-degeneracy, token overlap thresholds, number preservation in math/code, and a length-edit restriction requiring the chosen response to be substantially longer than the rejected one. The empirical pattern is that dynamic online reweighting helps while static pre-train reweighting can hurt. On RM-Bench Hard for Qwen3-4B, static reweighting drops from \(41.3\) to \(38.5\), whereas DynaCF improves the BT baseline from \(41.3\) to \(50.0\). On overall RM-Bench, Qwen3-4B improves from \(69.0\%\) to \(73.1\%\), and Qwen3-8B from \(72.2\%\) to \(74.2\%\). On RewardBench Safety, Qwen3-4B improves from \(83.2\%\) to \(85.5\%\), and Qwen3-8B from \(86.9\%\) to \(87.5\%\). The authors also report reduced average \(\Delta\) and flip-rates, most strongly in high-sensitivity groups, and an optimal warmup of \(5\%\), \(\gamma=1.0\), and \(w_{\min}=0.1\). "Models Know Their Shortcuts: Deployment-Time Shortcut Mitigation" moves the same general idea to inference-time adaptation without access to the original training data [2604.12277]. The paper’s Shortcut Guardrail framework begins with a frozen classifier \(f_\theta(x)\), predicts a pseudo-label \(\hat y\), and computes token saliency by gradient\(\times\)input: $$ s_i = \left\| \left( \frac{\partial \mathcal{L}_{\mathrm{cls}}}{\partial \mathbf e_i} \right) \odot \mathbf e_i \right\|_2. $$ The top-\(k\) tokens define \(\mathcal{H}(x)\), with default \(k=10\). A LoRA adapter is inserted into each linear layer, $$ W_{\text{new}}=W_T+\Delta W,\qquad \Delta W=BA, $$ with only \(\phi=\{A,B\}\) trainable and final deployment weights $$ W_{\text{final}}=W_T+\alpha\,\Delta W. $$ Training uses Masked Contrastive Learning. For each high-saliency token, a masked variant \(x^{\text{mask}_j}\) is formed. With normalized anchor and positive embeddings \(\mathbf a_i\) and \(\mathbf p_{ij}\), two InfoNCE terms are averaged: $$ \mathcal{L}_{\mathrm{MaskCL}} = \frac{1}{2Bk} \Bigl( \mathcal{L}_{\mathrm{nce}}^{x\to\mathrm{mask}} + \mathcal{L}_{\mathrm{nce}}^{\mathrm{mask}\to x} \Bigr). $$ The paper interprets this as enforcing representation consistency with or without individual shortcut tokens. Evaluation includes overall accuracy, worst-group accuracy (WGA), and Maximum Single-Token Prediction Sensitivity (MSTPS): $$ \mathrm{MSTPS} = \frac1N\sum_{i=1}^N \max_{j\in\mathcal{H}(x_i)} \bigl|P(\hat y_i\mid x_i)-P(\hat y_i\mid x_i^{\text{mask}_j})\bigr|. $$ Results are mixed but informative across settings. On real-world benchmarks, Shortcut Guardrail improves overall accuracy on SST-2 from \(0.911\) to \(0.919\) and on CivilComments from \(0.880\) to \(0.882\); on MultiNLI it reports \(0.790\) accuracy with WGA \(0.571\), matching the best WGA in the table. Under controlled shortcut shifts, it achieves the best overall accuracy and WGA on Yelp-ST (\(0.488/0.353\)), the best accuracy on Yelp-Syn (\(0.530\)) with WGA \(0.220\), the best accuracy and WGA on GoEmo-ST (\(0.627/0.339\)), and \(0.607/0.222\) on GoEmo-Syn. MSTPS is reduced from \(0.134\) to \(0.113\) on SST-2, \(0.530\) to \(0.438\) on CivilComments, \(0.331\) to \(0.203\) on Yelp-ST, and \(0.647\) to \(0.501\) on GoEmo-ST. These two papers instantiate shortcut-consistency differently. DynaCF treats consistency as margin stability under semantics-preserving counterfactuals and modulates sample weights online. Shortcut Guardrail treats consistency as representation invariance under masking of attributed shortcut tokens and learns a lightweight corrective adapter at deployment time. ## 6. Gradient-aware shortcut consistency in reasoning and search "Mitigating Shortcut Reasoning in Language Models: A Gradient-Aware Training Approach" studies shortcut reasoning in controlled benchmarks and proposes Shortcut-Aware Reasoning Training (SART) [2603.20899]. The method uses gradient signals rather than explicit counterfactual edits. For each sample \(s\), with per-sample gradient \(g_s=\nabla_\theta \ell(\theta;s)\) and validation gradient $$ g_V=\nabla_\theta \frac{1}{|V|}\sum_{v\in V}\ell(\theta;v), $$ the alignment score is $$ A(s)=\cos(g_s,g_V)=\frac{g_s^\top g_V}{\|g_s\|\,\|g_V\|}, $$ and the answer-gradient concentration is $$ R(s)= \frac{\sum_{t\in T_{\text{ans}}}\|\nabla_\theta \ell_t(\theta;s)\|} {\sum_{t\in T_{\text{ans}}\cup T_{\text{reason}}}\|\nabla_\theta \ell_t(\theta;s)\|}. $$ These form a ShortcutScore $$ S(s)=\alpha\max(0,\tau_A-A(s))+\beta\max(0,R(s)-\tau_R), $$ which is converted to a soft sample weight $$ w(s)=\exp(-\lambda S(s)). $$ SART then applies gradient surgery. If \(A(s)<\tau_A\), the non-transferable direction aligned with the validation gradient is removed: $$ g_s' = g_s-\gamma\cdot\frac{g_s^\top g_V}{\|g_V\|^2}\,g_V. $$ If \(R(s)>\tau_R\), answer-dominant gradients are suppressed by decomposing \(g_s=g_s^{ans}+g_s^{reason}\) and using $$ g_s''=(1-\rho)g_s^{ans}+g_s^{reason}. $$ The final update is $$ \theta\leftarrow\theta-\eta\sum_{s\in \text{batch}}w(s)\,g_s^{adj}. $$ The experimental setting is tightly controlled: a \(3.2\)M-parameter GPT-style transformer with \(4\) layers, \(d_{\text{model}}=256\), \(8\) heads, trained for \(40\) epochs with AdamW, learning rate \(10^{-3}\), weight decay \(10^{-4}\), batch size \(64\), and cosine annealing. The datasets are synthetic benchmarks with \(70\%\) of training data following a spurious rule and \(30\%\) the true rule. On the averaged results, SART reaches \(92.5\) accuracy, \(87.9\) robustness, and \(85.5\) reasoning consistency, compared with \(76.0\), \(47.7\), and \(68.4\) for the strongest listed baseline, Influence Filtering. The paper reports gains of \(+16.5\) percentage points in clean accuracy and \(+40.2\) in robustness over the best baseline. The ablation shows SFT at \(68.8/19.4\), reweight only at \(75.2/40.1\), surgery only at \(73.5/40.5\), and full SART at \(92.5/87.9\). A noted limitation is approximately \(2.5\times\) computational overhead. A structurally related but task-level formulation appears in "FORT-Searcher: Synthesizing Shortcut-Resistant Search Tasks for Training Deep Search Agents" [2606.12087]. Rather than modifying per-sample gradients or weights, FORT formalizes when a search task admits cheap identifying routes. A question is defined as $$ q=(\mathcal{X},\mathcal{C}_q,\Sigma), $$ with answer space \(\mathcal{X}\), clue set \(\mathcal{C}_q\), and retrieval interface \(\Sigma\). For any clue subset \(P\subseteq \mathcal{C}_q\), $$ \mathrm{Ans}(P)=\{x\in\mathcal{X}:\forall c\in P,\ c(x)=1\}, $$ and the identifying subsets are $$ \mathcal{I}_q=\{P\subseteq \mathcal{C}_q:\mathrm{Ans}(P)=\{y^*\}\}. $$ The valid evidence-acquisition route cost for an identifying subset is \(Q_\Sigma(P)\), and the cheapest identifying route is $$ Q_\Sigma^*=\min_{P\in\mathcal{I}_q}Q_\Sigma(P). $$ The paper also defines the pure-posterior cost $$ D_{\text{post}}(q)=\inf_{\pi\in\Pi_{\text{post}}}\mathbb{E}_{\tau\sim\pi}[|\tau|], $$ and solver-side prior utility $$ U_\pi(q)=D_{\text{post}}(q)-\Omega(q,\pi). $$ Four shortcut risks are identified: evidence co-coverage, single-clue selectivity, exposed constants, and prior-knowledge binding. Realized search difficulty is diagnosed by trajectory signatures including empirical solving cost \(\widehat\Omega\), answer-hit time \(\bar T_{\text{hit}}\), and prior-shortcut rate $$ \widehat p_{\text{prior}} = \frac1N\sum_{i=1}^N\mathbf{1}[T_{\text{model}}(\tau_i)