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 View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 12 code samples harvested from 1 repository linked to this paper: 8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified. Where Syntology's instrument failed: 5 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 12 samples from 1 repository, 8 ran (3 with no instrument failure; 5 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

zawedcvg/are-large-language-models-attentive-readers officialmentioned in papermentioned on GitHubMITSyntology: 12 samples, 8 ran (5 instrument-failed) · 4 unverified 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 (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · violated contract
5ran · our draft was wrong
2ran
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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

zawedcvg/are-large-language-models-attentive-readers official repository 12 samples, 8 ran (5 instrument-failed) · 4 unverified
backoff_delay create_fake_para.py ran fingerprinted MIT (permissive) · dcb601348781165b · report fixture: signature backoff_factor:float/0/float, attempts:int/0/int · returned float · level recorded 2026-09-24
chain_of_thought_prompt chain_of_thought_prompts.py ran · our draft was wrong MIT (permissive) · 52795004151377fd · report fixture: signature dataset:list/1/dict · returned list · level recorded 2026-09-24
chain_of_thought_prompt_control chain_of_thought_prompts.py ran · our draft was wrong MIT (permissive) · f340c851521bcbc1 · report fixture: signature dataset:list/1/dict · returned list · level recorded 2026-09-24
chain_of_thought_prompt_subqa chain_of_thought_prompts.py ran · our draft was wrong MIT (permissive) · 7e921f20bf4f544e · report fixture: signature dataset:list/1/dict · returned list · level recorded 2026-09-24
create_context create_prompts.py ran · our draft was wrong MIT (permissive) · 108b8b142bf27098 · report fixture: signature dataset:list/1/dict · returned list · level recorded 2026-09-24
create_fake_para create_prompts.py ran · our draft was wrong MIT (permissive) · b7e16417bab14929 · report fixture: signature dataset:list/1/tuple · returned list · level recorded 2026-09-24
is_enough_paragraphs create_prompts_with_fake_para.py ran · violated contract fingerprinted MIT (permissive) · 725fa390ba83e35b · report fixture: signature len_fake_idx:int/0/int, is_related:bool/0/bool, count:int/0/int · returned bool · level recorded 2026-09-22
is_in create_fake_question_tuples.py ran MIT (permissive) · 23d10d95d360854a · report fixture: signature num:int/0/int, ranges:int/0/int, thing:set/0/? · returned bool · level recorded 2026-09-24
create_dictionary_same_index create_prompts_with_fake_para.py unverified MIT (permissive) · 187e2e2e5060ca39 · report
create_fake_para_openai create_prompts.py unverified MIT (permissive) · 2c9129c02bfe4c46 · report
get_required_paragraphs create_prompts_with_fake_para.py unverified MIT (permissive) · 8a8a10f341e59184 · report
the_mixer create_fake_question_tuples.py 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