Circuits

LLMs have shown strong performance in data-rich domains such as programming, but their reliability in engineering tasks remains limited. Circuit analysis is particularly challenging because it requires both multimodal understanding and precise mathematical reasoning. This paper presents an enhanced end-to-end circuit problem-solving framework using Gemini 2.5 Pro as the backbone model for scalable engineering-education applications. We systematically evaluate Gemini 2.5 Pro on undergraduate circuit-analysis problems and identify two major failure modes: circuit-recognition hallucinations, especially source-polarity errors, and reasoning-process hallucinations, such as incorrect current-direction assumptions. To reduce recognition errors, we integrate a fine-tuned YOLO detector with OpenCV-based processing to isolate voltage and current sources for polarity re-identification. To mitigate reasoning errors, we introduce an ngspice-driven verification loop that supports iterative refinement with optional human feedback. On 83 problems, the proposed pipeline achieves 97.59% accuracy, compared with 79.52% for baseline Gemini. Across four hand-drawn diagram variations, accuracy improves from 60.61%--71.21% to 89.39%--92.42%, with statistically significant gains (p<0.005). On 43 problems from a different textbook, accuracy increases from 58.14% to 83.72%, further supporting cross-textbook generalizability. Error analysis shows that circuit recognition remains the dominant source of residual failures, particularly under varying diagram representations. Overall, the framework substantially improves the robustness, scalability, and generalizability of LLM-based circuit problem solving for engineering education and practical circuit analysis.

To interpret context correctly and retrieve relevant information, large language models must bind entities to their attributes and update these bindings as state changes. We analyze how LLMs implement this binding process in a dynamic state tracking. Using causal interventions, we identify a retrieval conditioned rebinding mechanism, a compact attention head circuit that propagated binding information and when the entity is queried, uses the updated binding to retrieve the corresponding attribute. Across Gemma and Llama models, this circuit supports rebinding behavior, but the representational signature of the mechanism differs across model families. In Gemma models, the binding signature is clearly expressed in the query/key subspaces of the relevant attention heads, whereas in Llama models, the binding information is carried primarily in key vectors. Overall, our results reveal an interpretable mechanism for context dependent state tracking in LLMs.