PEARL: Auditable Repair for Scientific Reasoning Graph Extraction

• URL: http://arxiv.org/abs/2607.17917v1
• Date: Mon, 20 Jul 2026 13:14:13 GMT
• Title: PEARL: Auditable Repair for Scientific Reasoning Graph Extraction
• Abstract summary: We propose PEARL, a training-free framework that turns noisy graph responses into auditable reasoning graphs.<n>PEARL first materializes explicit graph content under a closed Peircean schema, then uses matched evidence-grounded judge feedback to repair rejected edge types, local inference steps, and terminal roots.<n>The graphs provide a reliability layer for research-agent and AI scientist that need inspectable reasoning traces rather than unconstrained graph regeneration.
• Score: 4.931179793958283
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Scientific Reasoning Graph Extraction (SRGE) aims to recover explicit links among observations, evidence, intermediate claims, and paper-level conclusions. LLMs can produce graph-like scientific explanations, but their outputs often mix malformed syntax, drifting edge labels, incorrectly oriented roots, and weak source anchors. We propose PEARL (Peircean Extraction via Abstraction and Repair Layer), a training-free framework that turns noisy LLM graph responses into auditable reasoning graphs and repairs them toward strict semantic validity. PEARL first materializes explicit graph content under a closed Peircean schema, then uses matched evidence-grounded judge feedback to repair rejected edge types, local inference steps, and terminal roots while preserving an audit trail. On five 70-paper model archives from ARCHE, a benchmark for latent reasoning-chain extraction, PEARL raises strict gate passes from 0/350 for the LLM baseline to 300/350, with average REA improving from 0.339 to 0.906. The graphs provide a reliability layer for research-agent and AI scientist workflows that need inspectable reasoning traces rather than unconstrained graph regeneration. Code and audit artifacts are available at https://github.com/BohanSu/auditable-repair-reasoning-graphs/tree/300-350_workshop .

Related papers

• LogSemFuse: Semantic Evidence Fusion for Explainable Log Anomaly Detection [6.950497660953971]
  LogSemFuse is an evidence-guided plug-in framework that enhances existing backbone detectors without replacing their original pipelines.<n>We evaluate LogSemFuse on HDFS, BGL, and Liberty using DeepLog, LogAnomaly, LogBERT, and NeuralLog as backbones.
  arXiv  Detail & Related papers  (2026-07-03T20:50:07Z)
• VeriGraph: Towards Verifiable Data-Analytic Agents [71.17693022916896]
  LLM-based agents have demonstrated strong capabilities in data-intensive analytical tasks, yet their outputs are rarely verifiable.<n>We propose VeriGraph, a traceable neuro-symbolic reasoning framework that enables agents to construct an explicit heterogeneous evidence directed acyclic graph.<n>Our results suggest that explicit evidence-graph construction is a promising path toward verifiable data-analytic agents.
  arXiv  Detail & Related papers  (2026-06-15T11:50:56Z)
• ReasoningFlow: Discourse Structures for Understanding LLM Reasoning Traces [13.927941324541356]
  ReasoningFlow is a framework that captures the discourse structures of LRM reasoning traces into fine-grained directed acyclic graphs.<n>By analyzing ReasoningFlow graphs, we find that LRMs exhibit structurally similar traces, despite being trained from different base models.<n> ReasoningFlow reveals diverse fine-grained reasoning behaviors that can be used for better reasoning trace monitorability.
  arXiv  Detail & Related papers  (2026-06-03T20:12:26Z)
• AGRAG: Advanced Graph-based Retrieval-Augmented Generation for LLMs [15.570965946461255]
  Graph-based retrieval-augmented generation (RAG) has demonstrated significant potential in enhancing Large Language Models (LLMs) with structured knowledge.<n>Existing methods face three critical challenges: Inaccurate Graph Construction; Poor Reasoning Ability; and Inadequate Answering.<n>We propose AGRAG, an advanced graph-based retrieval-augmented generation framework.
  arXiv  Detail & Related papers  (2025-11-02T06:13:06Z)
• G-reasoner: Foundation Models for Unified Reasoning over Graph-structured Knowledge [88.82814893945077]
  Large language models (LLMs) excel at complex reasoning but remain limited by static and incomplete parametric knowledge.<n>Recent graph-enhanced RAG (GraphRAG) attempts to bridge this gap by constructing tailored graphs and enabling LLMs to reason on them.<n>G-reasoner is a unified framework that integrates graph and language foundation models for reasoning over diverse graph-structured knowledge.
  arXiv  Detail & Related papers  (2025-09-29T04:38:12Z)
• GRIL: Knowledge Graph Retrieval-Integrated Learning with Large Language Models [59.72897499248909]
  We propose a novel graph retriever trained end-to-end with Large Language Models (LLMs)<n>Within the extracted subgraph, structural knowledge and semantic features are encoded via soft tokens and the verbalized graph, respectively, which are infused into the LLM together.<n>Our approach consistently achieves state-of-the-art performance, validating the strength of joint graph-LLM optimization for complex reasoning tasks.
  arXiv  Detail & Related papers  (2025-09-20T02:38:00Z)
• Self-Exploring Language Models for Explainable Link Forecasting on Temporal Graphs via Reinforcement Learning [24.718280040158245]
  We present Reasoning-Enhanced Learning for Temporal Graphs (ReaL-TG)<n>ReaL-TG is a reinforcement learning framework that fine-tunes graph models to perform explainable link forecasting.<n>We propose a new evaluation protocol combining ranking metrics with an LLM-as-a-Judge system.
  arXiv  Detail & Related papers  (2025-08-31T19:47:01Z)
• Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering [75.12322966980003]
  Large Language Models (LLMs) have shown strong inductive reasoning ability across various domains.<n>Most existing RAG pipelines rely on unstructured text, limiting interpretability and structured reasoning.<n>Recent studies have explored integrating knowledge graphs with LLMs for knowledge graph question answering.<n>We propose RAPL, a novel framework for efficient and effective graph retrieval in KGQA.
  arXiv  Detail & Related papers  (2025-06-11T12:03:52Z)
• Align-GRAG: Reasoning-Guided Dual Alignment for Graph Retrieval-Augmented Generation [79.75818239774952]
  Large language models (LLMs) have demonstrated remarkable capabilities, but still struggle with issues like hallucinations and outdated information.<n>Retrieval-augmented generation (RAG) addresses these issues by grounding LLM outputs in external knowledge with an Information Retrieval (IR) system.<n>We propose Align-GRAG, a novel reasoning-guided dual alignment framework in post-retrieval phrase.
  arXiv  Detail & Related papers  (2025-05-22T05:15:27Z)
• Can Large Language Models Analyze Graphs like Professionals? A Benchmark, Datasets and Models [70.03602551880526]
  We introduce ProGraph, a benchmark for large language models (LLMs) to process graphs.<n>Our findings reveal that the performance of current LLMs is unsatisfactory, with the best model achieving only 36% accuracy.<n>We propose LLM4Graph datasets, which include crawled documents and auto-generated codes based on 6 widely used graph libraries.
  arXiv  Detail & Related papers  (2024-09-29T11:38:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.