A causal discovery protocol using per-edge RESOLVED/IMPOSSIBLE certificates and gated tiers (LSNM, IGCI, Stein, MDL, PEIT) plus meta-hub and node-children oracle queries to achieve a 1+K expert interaction upper bound for any DAG.
Causal inference using the algorithmic markov condition
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Iterative Causal Discovery: Per-Edge Impossibility Certificates, Tier-Aware Oracle Queries, and the $1+K$ Lower Bound
A causal discovery protocol using per-edge RESOLVED/IMPOSSIBLE certificates and gated tiers (LSNM, IGCI, Stein, MDL, PEIT) plus meta-hub and node-children oracle queries to achieve a 1+K expert interaction upper bound for any DAG.