The paper presents an empirical taxonomy of eleven hallucination sub‑types in large language models (LLMs) that generate UML class diagrams from natural language requirements, organized into Prompt Faithfulness, Code Faithfulness, and Reasoning Quality. The taxonomy was derived from 60 manually annotated DeepSeek‑R1 traces and applied to additional traces, revealing model‑dependent failure patterns and a negative association between requirement complexity and Prompt Faithfulness errors. A mitigation experiment with Qwen3‑based models showed that adding Prompt Faithfulness and Reasoning Quality constraints to the prompt improved the F1 score by 4.0 percentage points, while post‑hoc Code Faithfulness review offered no consistent benefit.
arXiv:2606. 05402v1 Announce Type: cross Abstract: Large reasoning models (LRMs) produce reasoning traces with non-linear structures, such as backtracking and self-correction, that complicate the evaluation and monitoring of the reasoning process.
arXiv:2606. 07410v1 Announce Type: cross Abstract: The emergence of "Aha moments" in large language models, particularly DeepSeek-R1-0120, has raised the question of whether these systems genuinely reason or merely imitate the appearance of reasoning.
The paper "Fluent but Fallible: Benchmarking Hallucination and Factual Reliability in Large Language Models" evaluates ten advanced LLMs on a benchmark of 70 academic prompts across four complexity levels. Using five metrics—Accuracy, Precision, Recall, Response Deviation Index, and Hallucination Index—reviewers found that Perplexity and DeepSeek V3 achieved the highest overall accuracy, Gemini balanced recall and performance, LLaMA 3 resisted hallucinations, and Falcon had perfect precision but low recall and high deviation. The study highlights a trade‑off between response completeness and factual reliability, especially as prompt complexity increases.
arXiv:2608. 08514v1 Announce Type: new Abstract: We independently reproduce two recent methods for making large language model (LLM) reasoning more reliable, and stress-test them across domains and models (RPC across four new task domains with Qwen3-8B, LCF across four 7-8B models).
arXiv:2607. 23019v1 Announce Type: new Abstract: Chain-of-thought (CoT) prompting enables large language models (LLMs) to tackle multi-step reasoning tasks, yet the generated intermediate steps are not guaranteed to be logically sound.
arXiv:2608. 03291v1 Announce Type: cross Abstract: Chain-of-thought (CoT) reasoning improves large language model (LLM) performance while also providing an observable interface to the model's reasoning process.
arXiv:2606. 05792v1 Announce Type: cross Abstract: TLA+ has supported industrial verification at companies such as Amazon and Microsoft, yet writing correct TLA+ specifications from natural language still requires time and expertise, which limits adoption.
arXiv:2510. 00492v3 Announce Type: replace Abstract: The reliability of large language models (LLMs) during test-time scaling is often assessed with \emph{external verifiers} or \emph{reward models} that distinguish correct reasoning from flawed logic.
The article examines how Large Language Models can aid in creating Entity-Relationship diagrams from natural language requirements. It tests three LLMs with three prompting strategies—Zero-Shot, Chain of Thought, and Chain of Thought + Verifier—on scenarios of increasing complexity. Findings show that while LLMs perform adequately on simpler tasks, their reliability drops with more complex requirements, leading to inconsistencies, ambiguities, and constraint representation failures.
PHRBench is a new benchmark that evaluates how large language models handle hallucinated information during multi-stage reasoning. It tests 18 models across four domains using 4,820 controlled instances, measuring Hallucination Compliance, Hallucination Avoidance, and Heuristic Correction to determine if a model can correct hallucinated premises and still reach the correct answer. The study finds that successful recovery is rare, often requires frequent belief updates, and that features of the hallucinated prompt can predict recovery with an AUROC of 0.847.
arXiv:2603. 29025v3 Announce Type: replace-cross Abstract: Large language models fail when a salient surface cue conflicts with an unstated feasibility constraint.
The paper investigates whether large language models (LLMs) follow Occam's Razor when performing inductive and abductive reasoning. It introduces a synthetic framework for generating questions that require both types of reasoning and a new automated metric to evaluate the simplicity and correctness of generated hypotheses. Experiments show that while LLMs can handle simple scenarios, they struggle with complex world models and producing high‑quality, simplest hypotheses, even when using advanced reasoning techniques.