← All posts
Novel Method

Convergent Core Analysis: Extracting What Your Data Truly Says

By Moonlit Social Labs · April 3, 2026 · 8 min read

You've collected your data. You've cleaned it. Now it's time to analyze. But which analysis do you run? Do you winsorize outliers or exclude them? Mean-impute missing values or use listwise deletion? Run a parametric test or its non-parametric equivalent?

Each choice is defensible. Each gives you a slightly different result. And therein lies one of the most under-discussed problems in social science: the garden of forking paths.

The Problem: One Dataset, 200 Results

In 2016, Steegen and colleagues formalized what many researchers had long suspected: for any given dataset and research question, there are dozens or hundreds of defensible analytical choices, and those choices meaningfully change the results. They called this multiverse analysis — the practice of running every reasonable specification and showing the full distribution of outcomes.

Multiverse analysis was a breakthrough for transparency. Instead of reporting one cherry-picked result, you show all of them. But it left researchers with a new problem: you now have 200 results, and no principled way to summarize them.

You can plot a specification curve and eyeball it. You can report the percentage of specifications that are significant. But neither approach extracts the actual finding — the core claim that is genuinely robust across analytical choices.

The Solution: Convergent Core Analysis

Convergent Core Analysis (CCA) is designed to solve exactly this problem. Given a multiverse of specification results, CCA algorithmically extracts the convergent core — the strongest claim that survives across virtually all specifications.

CCA doesn't just count how many analyses agree. It finds the specific, defensible claim that nearly all analyses support, and identifies the exact conditions under which it might break down.

How it works (plain language)

Imagine you ask 200 experts the same research question. Each analyzes the data their own way. CCA listens to all 200, then reports:

  1. Direction consensus. Do the vast majority (say, 95%+) agree on the direction of the effect — positive or negative?
  2. Magnitude convergence. What's the typical size of the effect, and how tightly do the estimates cluster?
  3. Boundary conditions. Which analytical choices actually matter? If you change how you handle outliers, does the finding flip? If you switch from listwise to pairwise deletion, does the effect size double?
  4. Robustness cascade. Does the core claim hold at 90% agreement? 95%? 99%? This tells you how strict you can be before the consensus breaks down.

How it works (technical details)

CCA operates on specification-curve output — a matrix where each row is one specification, and columns include the effect size, p-value, and a vector of analytical decisions (e.g., outlier method, missing data strategy, covariate set).

The algorithm computes:

Honest Assessment

CCA is a genuine extension of multiverse analysis (Steegen et al., 2016). The individual components — direction counting, IQR, boundary detection — are standard techniques. The novelty is in combining them into a structured "convergent core" extraction, giving researchers a principled summary rather than a wall of specification curves.

When Should You Use CCA?

CCA is most useful when:

Example

Suppose you're studying whether a mindfulness intervention reduces anxiety. Your multiverse includes 180 specifications varying by: outlier handling (3 methods), missing data strategy (3 methods), anxiety measure (2 scales), covariate set (5 choices), and analysis type (2: parametric/non-parametric).

CCA might report:

That's a much more useful finding than "p = .03 with our preferred specification."

Try It in PsyStat Nexus

CCA is available in the Novel Methods module of PsyStat Nexus. Paste your specification-curve effect sizes and the tool computes the full convergent core with direction consensus, magnitude clustering, boundary conditions, and robustness cascade.

Get started free →

Related Posts

Novel Method
The Complexity Navigator
When your model gets complicated, how do you know if the complexity is earning its keep? The Complexity Navigator finds the optimal tradeoff.
Novel Method
Dialectical Inference
What if frequentist and Bayesian analyses disagree? Dialectical Inference synthesizes both into a unified conclusion.