Pith. sign in

REVIEW 4 cited by

Multi-hop Question Answering via Reasoning Chains

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.02610 v2 pith:IYUJ3HGA submitted 2019-10-07 cs.CL cs.AI

classification cs.CLcs.AI
keywords chainsquestionreasoningansweransweringmulti-hopperformancetext
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Multi-hop question answering requires models to gather information from different parts of a text to answer a question. Most current approaches learn to address this task in an end-to-end way with neural networks, without maintaining an explicit representation of the reasoning process. We propose a method to extract a discrete reasoning chain over the text, which consists of a series of sentences leading to the answer. We then feed the extracted chains to a BERT-based QA model to do final answer prediction. Critically, we do not rely on gold annotated chains or "supporting facts:" at training time, we derive pseudogold reasoning chains using heuristics based on named entity recognition and coreference resolution. Nor do we rely on these annotations at test time, as our model learns to extract chains from raw text alone. We test our approach on two recently proposed large multi-hop question answering datasets: WikiHop and HotpotQA, and achieve state-of-art performance on WikiHop and strong performance on HotpotQA. Our analysis shows the properties of chains that are crucial for high performance: in particular, modeling extraction sequentially is important, as is dealing with each candidate sentence in a context-aware way. Furthermore, human evaluation shows that our extracted chains allow humans to give answers with high confidence, indicating that these are a strong intermediate abstraction for this task.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Think Clearly: Improving Reasoning via Redundant Token Pruning

    cs.AI 2025-06 conditional novelty 6.0 of 10

    A training-free test-time method prunes low-attention reasoning tokens from the KV cache, guided by an injected end-of-thinking token, and reports accuracy gains on math competition benchmarks.

  2. RAG-Star: Enhancing Deliberative Reasoning with Retrieval Augmented Verification and Refinement

    cs.CL 2024-12 conditional novelty 6.0 of 10

    A Monte Carlo tree search reasoning framework where each node is a sub-question and its answer, and retrieval-augmented rewards guide the search toward verifiable answers.

  3. HyCE-RAG: Hypergraph Chain-of-Evidence Retrieval-Augmented Generation for Explainable Multi-hop Question Answering

    cs.AI 2026-06 reject novelty 5.0 of 10

    Organizing retrieved evidence into confidence-scored hypergraph chains is reported to lift multi-hop QA accuracy, context relevance, and faithfulness by 11–30 points over vector and graph RAG baselines on five benchmarks.

  4. Review-Then-Refine: A Dynamic Framework for Multi-Hop Question Answering with Temporal Adaptability

    cs.CL 2024-12 conditional novelty 4.0 of 10

    A two-phase RAG pipeline with dynamic temporal query rewriting and adaptive retrieval improves multi-hop QA accuracy over several tested baselines on four benchmarks.

Pith tools