Unified Sharp Bounds on Probabilities of Causation

Xin Shu, Ang Li
10/19/2026
cs.AI

No confident code implementation found for this paper.

Abstract

Probabilities of causation (PoCs) have developed steadily, from the binary measures first introduced by Pearl to the non-binary setting recently studied by Shu et al. As the theory has matured, PoCs have found applications in a growing range of areas, including personalized medicine, marketing and legal attribution. Shu et al. proposed closed-form bounds for multi-valued treatments and outcomes and proved them valid, but left their sharpness in high dimensions open. We close this gap with a mathematical proof. We further show that $\PNS$, $\PSub$, $\PRep$ and $\PN$ are all special cases of a single, more general formula. Combined with their equivalence classes, this settles the question of sharp bounds for discrete PoCs from experimental and observational data: in every dimension, they are given in closed form by a single theorem.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{shu2026unified,
  title  = {Unified Sharp Bounds on Probabilities of Causation},
  author = {Xin Shu and Ang Li},
  year   = {2026},
  eprint = {2610.27398},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.27398v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2610.27398.svg)](https://codeofpaper.com/paper/2610.27398)

Discussion