Pith. sign in

REVIEW 1 cited by

GraphOTTER: Evolving LLM-based Graph Reasoning for Complex Table Question Answering

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 2412.01230 v1 pith:V5SM4CHJ submitted 2024-12-02 cs.CL

classification cs.CL
keywords reasoninggraphottertablecomplexgraphquestionansweringanswers
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Complex Table Question Answering involves providing accurate answers to specific questions based on intricate tables that exhibit complex layouts and flexible header locations. Despite considerable progress having been made in the LLM era, the reasoning processes of existing methods are often implicit, feeding the entire table into prompts, making it difficult to effectively filter out irrelevant information in the table. To this end, we propose GraphOTTER that explicitly establishes the reasoning process to pinpoint the correct answers. In particular, GraphOTTER leverages a graph-based representation, transforming the complex table into an undirected graph. It then conducts step-by-step reasoning on the graph, with each step guided by a set of pre-defined intermediate reasoning actions. As such, it constructs a clear reasoning path and effectively identifies the answer to a given question. Comprehensive experiments on two benchmark datasets and two LLM backbones demonstrate the effectiveness of GraphOTTER. Further analysis indicates that its success may be attributed to the ability to efficiently filter out irrelevant information, thereby focusing the reasoning process on the most pertinent data. Our code and experimental datasets are available at \url{https://github.com/JDing0521/GraphOTTER}.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Beyond Natural Language Plans: Structure-Aware Planning for Query-Focused Table Summarization

    cs.CL 2025-07 conditional novelty 4.0 of 10

    SPaGe uses structured TaSoF plans and graph-parallel SQL execution to improve query-focused table summarization, outperforming most prior models on FeTaQA, QTSumm, and QFMTS datasets.

Pith tools