Papers › Seemingly Plausible Distractors in Multi-Hop Reasoning: Are Large Language Models...

Seemingly Plausible Distractors in Multi-Hop Reasoning: Are Large Language Models Attentive Readers?

8 Sep 2024arXiv:2409.05197archive 2025-07-28

Neeladri Bhuiya, Viktor Schlegel, Stefan Winkler

State-of-the-art Large Language Models (LLMs) are accredited with an increasing number of different capabilities, ranging from reading comprehension, over advanced mathematical and reasoning skills to possessing scientific knowledge. In this paper we focus on their multi-hop reasoning capability: the ability to identify and integrate information from multiple textual sources. Given the concerns with the presence of simplifying cues in existing multi-hop reasoning benchmarks, which allow models to circumvent the reasoning requirement, we set out to investigate, whether LLMs are prone to exploiting such simplifying cues. We find evidence that they indeed circumvent the requirement to perform multi-hop reasoning, but they do so in more subtle ways than what was reported about their fine-tuned pre-trained language model (PLM) predecessors. Motivated by this finding, we propose a challenging multi-hop reasoning benchmark, by generating seemingly plausible multi-hop reasoning chains, which ultimately lead to incorrect answers. We evaluate multiple open and proprietary state-of-the-art LLMs, and find that their performance to perform multi-hop reasoning is affected, as indicated by up to 45% relative decrease in F1 score when presented with such seemingly plausible alternatives. We conduct a deeper analysis and find evidence that while LLMs tend to ignore misleading lexical cues, misleading reasoning paths indeed present a significant challenge.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2409.05197")

Code

Syntology Ran 8 of 12 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 1 ran · violated contract; 7 ran with no contract checked.

By repository: official repository: 12 samples from 1 repository, 8 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

zawedcvg/are-large-language-models-attentive-readers officialmentioned in papermentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 8 ran; 0 honoured the contract we drafted; 4 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · violated contract
7ran
4unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from zawedcvg/Are-Large-Language-Models-Attentive-Readers. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

backoff_delay zawedcvg/Are-Large-Language-Models-Attentive-Readers/create_fake_para.py official repository ran fingerprinted MIT (permissive) · dcb601348781165b · report
chain_of_thought_prompt zawedcvg/Are-Large-Language-Models-Attentive-Readers/chain_of_thought_prompts.py official repository ran MIT (permissive) · 52795004151377fd · report
chain_of_thought_prompt_control zawedcvg/Are-Large-Language-Models-Attentive-Readers/chain_of_thought_prompts.py official repository ran MIT (permissive) · f340c851521bcbc1 · report
chain_of_thought_prompt_subqa zawedcvg/Are-Large-Language-Models-Attentive-Readers/chain_of_thought_prompts.py official repository ran MIT (permissive) · 7e921f20bf4f544e · report
create_context zawedcvg/Are-Large-Language-Models-Attentive-Readers/create_prompts.py official repository ran MIT (permissive) · 108b8b142bf27098 · report
create_fake_para zawedcvg/Are-Large-Language-Models-Attentive-Readers/create_prompts.py official repository ran MIT (permissive) · b7e16417bab14929 · report
is_enough_paragraphs zawedcvg/are-large-language-models-attentive-readers/create_prompts_with_fake_para.py official repository ran · violated contract fingerprinted MIT (permissive) · 725fa390ba83e35b · report
is_in zawedcvg/Are-Large-Language-Models-Attentive-Readers/create_fake_question_tuples.py official repository ran MIT (permissive) · 23d10d95d360854a · report
create_dictionary_same_index zawedcvg/are-large-language-models-attentive-readers/create_prompts_with_fake_para.py official repository unverified MIT (permissive) · 187e2e2e5060ca39 · report
create_fake_para_openai zawedcvg/Are-Large-Language-Models-Attentive-Readers/create_prompts.py official repository unverified MIT (permissive) · 2c9129c02bfe4c46 · report
get_required_paragraphs zawedcvg/are-large-language-models-attentive-readers/create_prompts_with_fake_para.py official repository unverified MIT (permissive) · 8a8a10f341e59184 · report
the_mixer zawedcvg/Are-Large-Language-Models-Attentive-Readers/create_fake_question_tuples.py official repository unverified MIT (permissive) · 7d67f1e6076e1033 · report

Tasks

Language ModellingReading Comprehension

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

FocusSET

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections