GoT-CD: Graph-of-Thoughts Causal Discovery and the Fragility of Post-hoc Path-Specific Fairness Audits

• URL: http://arxiv.org/abs/2608.02877v1
• Date: Mon, 03 Aug 2026 20:59:26 GMT
• Title: GoT-CD: Graph-of-Thoughts Causal Discovery and the Fragility of Post-hoc Path-Specific Fairness Audits
• Abstract summary: We show that Graph-of-Thoughts reasoning yields acyclic discovered graphs that are structurally competitive with large language model (LLM) baselines.<n>We introduce GoT-CD, in which the reasoning unit is a complete candidate edge set.<n>GoT-CD returns a valid DAG on all five reported benchmarks and achieves the best DAG-valid F1 score among LLM methods on Asia, Alzheimer's, and COVID-Respiratory datasets.
• Score: 2.1092701269163436
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Causal discovery recovers directed structure from observational data and is increasingly used in clinical settings to support mechanism reasoning and fairness audits of predictive models. Path-specific counterfactual fairness asks whether a protected attribute influences an outcome through illegitimate pathways, but these estimands are defined relative to a supplied causal graph and therefore inherit whatever errors the discovery step introduces. Discovery methods are routinely scored on aggregate structural metrics that weight all edges equally, and no established evaluation asks whether the specific pathway an audit depends on survives discovery---or what the audit reports when that pathway is missing. Here we show that full-graph Graph-of-Thoughts reasoning yields acyclic discovered graphs that are structurally competitive with large language model (LLM) baselines, yet that structural fidelity alone does not guarantee fairness-faithful audits. We introduce GoT-CD, in which the reasoning unit is a complete candidate edge set: multiple graphs are generated in parallel, scored by a deterministic validity function, and merged under a hard union constraint that forbids invented edges, with greedy projection enforcing a DAG before commitment. GoT-CD returns a valid DAG on all five reported benchmarks and achieves the best DAG-valid F1 score among LLM methods on Asia, Alzheimer's, and COVID-Respiratory datasets. On an Alzheimer's benchmark with known unfair path, a post-hoc path-specific audit shows that five of eight discovered graphs recover no path from the sensitive attribute to the outcome and therefore report a null overall effect while mediated effects persist, necessitating downstream path-specific fairness analysis along with structural discovery.

Related papers

• GENESIS: Towards Explainable Causal Discovery [2.352430391785511]
  Causal Discovery from observational data faces two fundamental challenges.<n>We propose GENESIS, an explainable hybrid CD framework that decomposes graph construction into interpretable decision points.<n>We show that GENESIS achieves 100% decision traceability across all settings, establishing explainability as a first-class objective in causal discovery.
  arXiv  Detail & Related papers  (2026-08-04T16:09:01Z)
• 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)
• Unsupervised Skill Discovery for Agentic Data Analysis [55.42853694128929]
  DataCOPE is an unsupervised verifier-guided skill discovery framework for data-analytic agents.<n>It iteratively coordinates a Data-Analytic Agent for trajectory generation, an Unsupervised Verifier for signal extraction, and a Skill Manager for contrastive skill distillation.<n>We evaluate DataCOPE on report-style analysis from Deep Data Research and reasoning-style analysis from DABStep.
  arXiv  Detail & Related papers  (2026-06-04T17:20:47Z)
• Iterative Causal Discovery: Per-Edge Impossibility Certificates, Tier-Aware Oracle Queries, and the $1+K$ Lower Bound [0.0]
  Causal-discovery algorithms return a directed graph, but provide no principled means of distinguishing edge directions identified by the data from those assigned without an identifying assumption.<n>We introduce a protocol for observational causal discovery on continuous data that attaches to each candidate edge a discrete impossibility certificate.<n>Two oracle primitives, the meta-hub query and the node-children query, jointly establish an upper bound of $1+K$ expert interactions sufficient to recover any DAG.
  arXiv  Detail & Related papers  (2026-05-26T12:01:32Z)
• Rethinking Feature Alignment in Generalist Graph Anomaly Detection: A Relational Fingerprint-based Approach [60.199985286210904]
  Generalist graph anomaly detection (GAD) aims to detect anomalies on unseen graphs without graph-specific retraining.<n>Existing approaches primarily focus on aligning heterogeneous data across domains, which ignores different feature semantics.<n>We propose Fingerprint-based generalist GAD approach (ReFi-GAD)<n>We show that ReFi-GAD significantly outperforms state-of-the-art methods in experiments on 14 datasets.
  arXiv  Detail & Related papers  (2026-05-25T05:12:26Z)
• TRACE: Temporal Rule-Anchored Chain-of-Evidence on Knowledge Graphs for Interpretable Stock Movement Prediction [23.985633276560844]
  We present a Temporal Rule-Anchored Chain-of-Evidence (TRACE) on knowledge graphs for interpretable stock movement prediction.<n>On an S&P500 benchmark, the method achieves 55.1% accuracy, 55.7% precision, 71.5% recall, and 60.8% F1.<n>The gains stem from (i) rule-guided exploration that focuses search on economically meaningful motifs rather than arbitrary walks, and (ii) text-grounded consolidation that aggregates high-confidence, fully grounded hypotheses.
  arXiv  Detail & Related papers  (2026-03-12T22:41:53Z)
• HELP: HyperNode Expansion and Logical Path-Guided Evidence Localization for Accurate and Efficient GraphRAG [53.30561659838455]
  Large Language Models (LLMs) often struggle with inherent knowledge boundaries and hallucinations.<n>Retrieval-Augmented Generation (RAG) frequently overlooks structural interdependencies essential for multi-hop reasoning.<n>Help achieves competitive performance across multiple simple and multi-hop QA benchmarks and up to a 28.8$times$ speedup over leading Graph-based RAG baselines.
  arXiv  Detail & Related papers  (2026-02-24T14:05:29Z)
• Breaking the Static Graph: Context-Aware Traversal for Robust Retrieval-Augmented Generation [12.71443292660797]
  We propose CatRAG, Context-Aware Traversal for robust RAG.<n>CatRAG builds on the HippoRAG 2 architecture and transforms the static KG into a query-adaptive navigation structure.<n> Experiments across four multi-hop benchmarks demonstrate that CatRAG consistently outperforms state of the art baselines.
  arXiv  Detail & Related papers  (2026-02-02T11:13:38Z)
• Relink: Constructing Query-Driven Evidence Graph On-the-Fly for GraphRAG [10.60635000782353]
  We argue for a textitreason-and-construct paradigm and propose Relink, a framework that dynamically builds a query-specific evidence graph.<n>Relink achieves significant average improvements of 5.4% in EM and 5.2% in F1 over leading GraphRAG baselines.
  arXiv  Detail & Related papers  (2026-01-12T04:35:23Z)
• A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection [60.09453163562244]
  We propose a Heterophily-guided Unsupervised Graph fraud dEtection approach (HUGE) for unsupervised GFD.<n>In the estimation module, we design a novel label-free heterophily metric called HALO, which captures the critical graph properties for GFD.<n>In the alignment-based fraud detection module, we develop a joint-GNN architecture with ranking loss and asymmetric alignment loss.
  arXiv  Detail & Related papers  (2025-02-18T22:07:36Z)
• Enhancing Fairness in Unsupervised Graph Anomaly Detection through Disentanglement [33.565252991113766]
  Graph anomaly detection (GAD) is increasingly crucial in various applications, ranging from financial fraud detection to fake news detection.<n>Current GAD methods largely overlook the fairness problem, which might result in discriminatory decisions skewed toward certain demographic groups.<n>We devise a novel DisEntangle-based FairnEss-aware aNomaly Detection framework on the attributed graph, named DEFEND.<n>Our empirical evaluations on real-world datasets reveal that DEFEND performs effectively in GAD and significantly enhances fairness compared to state-of-the-art baselines.
  arXiv  Detail & Related papers  (2024-06-03T04:48:45Z)
• BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery [97.79015388276483]
  A structural equation model (SEM) is an effective framework to reason over causal relationships represented via a directed acyclic graph (DAG) Recent advances enabled effective maximum-likelihood point estimation of DAGs from observational data. We propose BCD Nets, a variational framework for estimating a distribution over DAGs characterizing a linear-Gaussian SEM.
  arXiv  Detail & Related papers  (2021-12-06T03:35:21Z)

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.