Meta and Michigan State paper finds LLM-built reasoning graphs unreliable
The non-obvious point is that most reasoning-graph pipelines assume the LLM's decomposition is correct without ever verifying it, so confidence scores inherit hidden graph errors. Builders of agent workflows and RAG-style decomposition systems should add graph-level validation before trusting computed confidence. The Qwen3-32B versus Qwen3-8B result is a concrete warning that scaling a model does not guarantee better sub-question answering.
