Skip to content
OpenTrain AIFor AI Companies

HFEPX · Eval paper review

More Capable, Less Faithful: A Multilingual Analysis of Mathematical (Un)Solvability Detection in LLMs

Maria-Eleni Zoumpoulidi, Nikolaos Xiros, Georgios Paraskevopoulos

Published

Aug 31, 2026

Citations

0

Trust level

Low

Usefulness score

0/100 (Low)

Extraction confidence

35% (Low)

Derived from extracted protocol signals and abstract evidence.

Rater population

Not reported

Signals refreshed

Aug 31, 2026

Should you rely on this paper?

This paper is adjacent to HFEPX scope and is best used for background context, not as a primary protocol reference.

Use this as background context only. Do not make protocol decisions from this page alone.

Best use

Background context only

Use if you need

A secondary eval reference to pair with stronger protocol papers.

What to verify

Validate the evaluation procedure and quality controls in the full paper before operational use.

Main weakness

This paper looks adjacent to evaluation work, but not like a strong protocol reference.

Human feedback signal
Not explicit
Not explicit in abstract metadata
Evaluation signal
Detected
Eval setup described
Usefulness for eval research
0/100
Adjacent candidate

Treat as adjacent context, not a core eval-method reference.

Abstract

Solvability detection is one of the most challenging aspects of mathematical reasoning for Large Language Models (LLMs). While prior work has studied this capability extensively, these analyses have been limited to English. Consequently, it remains unclear whether multilingual failures arise from differences in internal Solvability Belief or from language-dependent failures to express it. To address this gap, we introduce the first multilingual benchmark of paired solvable and unsolvable mathematical problems, extending ReliableMath to French and Greek. Using this, we train multilingual probes predicting Solvability Belief and analyze the solvability detection capabilities of state-of-the-art LLMs behaviorally, representationally, and in terms of faithfulness. We find that Solvability Belief is encoded as a largely universal, language-agnostic feature, and that higher-resource languages such as English, despite achieving stronger mathematical reasoning performance, exhibit lower solvability-detection faithfulness.

What we could verify

These are the protocol signals we could actually recover from the available paper metadata. Use them to decide whether this paper is worth deeper reading.

Human Feedback Types

missing

None explicit

No explicit feedback protocol extracted.

"Solvability detection is one of the most challenging aspects of mathematical reasoning for Large Language Models (LLMs)."

Evaluation Modes

partial

Automatic Metrics

Includes extracted eval setup.

"Solvability detection is one of the most challenging aspects of mathematical reasoning for Large Language Models (LLMs)."

Quality Controls

missing

Not reported

No explicit QC controls found.

"Solvability detection is one of the most challenging aspects of mathematical reasoning for Large Language Models (LLMs)."

Benchmarks / Datasets

missing

Not extracted

No benchmark anchors detected.

"Solvability detection is one of the most challenging aspects of mathematical reasoning for Large Language Models (LLMs)."

Reported Metrics

partial

Faithfulness

Useful for evaluation criteria comparison.

"Using this, we train multilingual probes predicting Solvability Belief and analyze the solvability detection capabilities of state-of-the-art LLMs behaviorally, representationally, and in terms of faithfulness."

Benchmarks and datasets

No benchmark or dataset names were extracted from the available abstract.

Reported metrics

faithfulness
Human feedback details
Uses human feedback
No
Feedback types
None
Rater population
Not reported
Expertise required
Math, Multilingual
Evaluation details
Evaluation modes
Automatic Metrics
Agentic eval
None
Quality controls
Not reported
Evidence quality
Low
Use this page as
Background context only

Research brief

Metadata summary

Solvability detection is one of the most challenging aspects of mathematical reasoning for Large Language Models (LLMs).

Based on abstract + metadata only. Check the source paper before making high-confidence protocol decisions.

Key takeaways

  • Solvability detection is one of the most challenging aspects of mathematical reasoning for Large Language Models (LLMs).
  • While prior work has studied this capability extensively, these analyses have been limited to English.
  • Consequently, it remains unclear whether multilingual failures arise from differences in internal Solvability Belief or from language-dependent failures to express it.

Researcher actions

  • Compare this paper against nearby papers in the same arXiv category before using it for protocol decisions.
  • Check the full text for explicit evaluation design choices (raters, protocol, and metrics).
  • Use related-paper links to find stronger protocol-specific references.

Caveats

  • Generated from abstract + metadata only; no PDF parsing.
  • Signals below are heuristic and may miss details reported outside the abstract.

Recommended queries

Contribution summary

  • To address this gap, we introduce the first multilingual benchmark of paired solvable and unsolvable mathematical problems, extending ReliableMath to French and Greek.

Why it matters for eval

  • To address this gap, we introduce the first multilingual benchmark of paired solvable and unsolvable mathematical problems, extending ReliableMath to French and Greek.

Researcher checklist

  • Human feedback protocol is explicit

    No explicit human feedback protocol detected.

  • Evaluation mode is explicit

    Detected: Automatic Metrics

  • Quality control reporting appears

    No calibration/adjudication/IAA control explicitly detected.

  • Benchmark or dataset anchors are present

    No benchmark/dataset anchor extracted from abstract.

  • Metric reporting is present

    Detected: faithfulness