Pith. sign in

REVIEW 6 cited by

Causal models in string diagrams

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 2304.07638 v1 pith:O4HNPJVV submitted 2023-04-15 cs.LO cs.LGmath.CT

classification cs.LOcs.LGmath.CT
keywords causalmodelmodelsdiagramsreasoningcategoryframeworkstring
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The framework of causal models provides a principled approach to causal reasoning, applied today across many scientific domains. Here we present this framework in the language of string diagrams, interpreted formally using category theory. A class of string diagrams, called network diagrams, are in 1-to-1 correspondence with directed acyclic graphs. A causal model is given by such a diagram with its components interpreted as stochastic maps, functions, or general channels in a symmetric monoidal category with a 'copy-discard' structure (cd-category), turning a model into a single mathematical object that can be reasoned with intuitively and yet rigorously. Building on prior works by Fong and Jacobs, Kissinger and Zanasi, as well as Fritz and Klingler, we present diagrammatic definitions of causal models and functional causal models in a cd-category, generalising causal Bayesian networks and structural causal models, respectively. We formalise general interventions on a model, including but beyond do-interventions, and present the natural notion of an open causal model with inputs. We also give an approach to conditioning based on a normalisation box, allowing for causal inference calculations to be done fully diagrammatically. We define counterfactuals in this setup, and treat the problems of the identifiability of causal effects and counterfactuals fully diagrammatically. The benefits of such a presentation of causal models lie in foundational questions in causal reasoning and in their clarificatory role and pedagogical value. This work aims to be accessible to different communities, from causal model practitioners to researchers in applied category theory, and discusses many examples from the literature for illustration. Overall, we argue and demonstrate that causal reasoning according to the causal model framework is most naturally and intuitively done as diagrammatic reasoning.

Discussion (0). Sign in to comment.

Forward citations

Cited by 6 Pith papers

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

  1. From Mechanistic to Compositional Interpretability

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    Compositional interpretability defines explanations as commuting syntactic-semantic mapping pairs grounded in compositionality and minimum description length, with compressive refinement and a parsimony theorem guaran...

  2. From Mechanistic to Compositional Interpretability

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    The paper introduces compositional interpretability as a category-theoretic framework that casts mechanistic explanations as commuting syntactic-semantic mappings optimized under faithfulness and complexity constraint...

  3. Quantum-like Cognition in Process Theories: An Analysis

    q-bio.NC 2026-04 unverdicted novelty 7.0 of 10

    Any sequential cognitive decision data admits a classical instrument model, but joint decisions violating Bell inequalities are required to strictly rule out classical models in favor of quantum-like ones.

  4. Partializations of Markov categories

    math.CT 2025-09 accept novelty 7.0 of 10

    Given a partializable Markov category C, the span-based category Partial(C) is a positive quasi-Markov CD category that inherits representability, conditionals, Kolmogorov products, and idempotent splittings.

  5. String Diagrams for Quantum Foundations, Computing and Natural Language Processing

    quant-ph 2026-05 unverdicted novelty 6.0 of 10

    String diagrams formalize constructor theory with locality-composition conflicts, enable wave-based Boolean logic design and optimization, and map Urdu text circuits equivalently to English ones up to gate translation...

  6. Layered Monoidal Theories I: Diagrammatic Algebra and Applications

    cs.LO 2026-02 conditional novelty 6.0 of 10

    Layered monoidal theories let different abstraction levels of a system live in one string diagram with formal translations between layers.

Pith tools