"What is LangGraph's defining architectural feature?"	The loop is an EXPLICIT GRAPH — nodes (functions) and edges (transitions) in code. Not an implicit while-true. Every transition visible, testable, editable. The most architecturally distinct framework studied.	harness-engineering::dd10::recall
"What are super-step checkpoints?"	State serialized at EVERY node boundary. A crash resumes from the last completed node. Module 8: 5/5. The finest-grained checkpointing in the roster.	harness-engineering::dd10::recall
"What does interrupt() do, and which two modules does it connect?"	Pauses at any graph node, serializes state, waits INDEFINITELY for human. Connects Module 6 (HITL) and Module 8 (checkpointing) — interrupt IS checkpointing, from the pause/resume view.	harness-engineering::dd10::analysis
"LangGraph scores 37/55 — highest on which two modules?"	Module 1 (Loop): 5/5 — the graph IS the loop, explicitly. Module 8 (State): 5/5 — super-step checkpoints.	harness-engineering::dd10::recall
"What's the 'graph fights the model' anti-pattern (Module 1) applied to LangGraph?"	If the model could handle a transition naturally but the rigid graph forces it through a suboptimal path, the harness CONSTRAINS capability. The future-proof test partially fails — rigid graphs don't co-evolve with model upgrades.	harness-engineering::dd10::analysis
"When is LangGraph the RIGHT choice?"	When the PROCESS is the product: regulated workflows, compliance-governed agents, multi-approval pipelines. When you want explicit, auditable, testable control flow. Wrong when you want the model to figure out the process.	harness-engineering::dd10::application
"LangGraph is used INSIDE Claude Code. What does that tell you?"	Even the thickest production harness (Claude Code) uses LangGraph for specific subsystems requiring explicit control flow. LangGraph is a tool for PARTS of a harness, not necessarily the whole thing. Hybrid: dumb loop + graph for regulated subsystems.	harness-engineering::dd10::analysis