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.
Variational causal networks: Approximate B ayesian inference over causal structures
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Entropy-based sampling of graph ensembles from simulated data quantifies causal structural ambiguity and reveals artifacts in single optimized DAGs.
citing papers explorer
-
Causal Atlases from Entropic Inference: Bayesian Networks beyond Optimal DAGs
Entropy-based sampling of graph ensembles from simulated data quantifies causal structural ambiguity and reveals artifacts in single optimized DAGs.