Facthink Facthink
How it works

A claim graph, grown by four stages.

Your inputs seed a shared claim graph. Four stages (over 8 agents) read from it and commit back to it — initializing graph structure, verifying evidence, enriching concepts, and expanding new hypotheses.

System architecture
System architecture: a shared claim graph grown by four agent stages

The pipeline in plain terms

You provide a claim, your topic priorities, and your expertise and interests. Those seed a shared claim graph; every stage reads from it and commits its results back.

Your expertise also steers the two generative stages, so what's mined and proposed stays close to your interests.

Extraction

The Extractor reads your claim and seeds the graph — turning prose into structured nodes and causal edges, then committing them as the graph's first components.

Evidence verification

Three independent judges weigh each edge against the retrieved evidence — a Coherence Judge (entailment vs. contradiction), a Methods Appraiser (design and bias risk), and a Causal Evidence Verifier (open risks and qualifiers). Their separate findings combine into one deterministic verdict, committed back to the graph unless the evidence falls short of what the verdict would claim.

Enrichment

A Concept Miner surfaces outcome concepts the graph implies but doesn't yet name; a Canonicalization Adjudicator merges duplicates so the vocabulary stays clean. The mined concepts are committed back to the graph.

Hypothesis expansion

A Hypothesis Proposer suggests new causal links. Independent Novelty Judges score each for novelty and saturation, combined by median; an eligibility gate (Gate_h) and a final ranking then decide which candidates survive, and the top survivors are committed — on your confirmation — as new hypotheses.

See a real run, end to end →
Inside stage ④ · Hypothesis scoring

How a hypothesis is scored

Every proposed hypothesis runs a three-stage gauntlet before any reach you. The thresholds and weights below are the configured defaults — echoed in each run's audit, not fixed truths.

A.

The building-block judgments

Each scored 0–1. Most blend two ingredients — the proposing AI's opinion and hard semantic similarity measurements.

AI rating semantic similarity
Novelty
How new is the concept?
Math part = how far the new concept sits from everything already in the graph.
70
30
Fit to topic
Inside the scope of interest?
Math part = meaning-closeness of the new concept to the seed claim.
70
30
Overlap
Just a restatement?
Math leads — closest match of the concept to anything in the graph or to its sibling candidates.
30
70
Testability
Runnable as a benchmark?
No objective meaning-measure exists — the AI's judgment alone.
100 · AI

Plus four judgments the proposing AI gives directly, no quantified measurements blended in: plausibility, value of testingimportancemechanism specificity.

B.

Three stages to a ranking

Stage 1 strict pass / fail · fail-closed

The eligibility gate

Eligible only if all four hold at once. Missing any single bar disqualifies the hypothesis no matter how high the others are.

novelty≥ 0.4
testability≥ 0.5
fit≥ 0.5
overlap< 0.8
Stage 2 independent panel · median

The independent expert panel

A panel separate from the proposer grades two things relative to the field, not just this graph. Numbers combine by the median — resisting a single outlier reviewer.

Field novelty
How new to a practitioner, given the literature. Replaces the proposer's own novelty for ranking.
Establishedness
How strongly retrieved papers already treat the relationship as a known result.
Stage 3 score → rank

Quality score, then final rank

Quality score · equal-weight average of six
field novelty plausibility testability value of testing importance mechanism specificity
Final ranking score
quality × (1 − establishedness)

Establishedness is a 0–1 rating of how strongly the literature already treats the relationship as a known result.

This helps to re-order to demote the familiar (non-novel) ideas. Eligible hypotheses sort by this score, the higher the better.