Architecture · Manifesto · Design Philosophy

How Metascientist
Actually Works

Metascientist is not a chatbot that summarises papers. It is an autonomous scientific agent that reads the literature, forms durable beliefs, detects serendipitous cross-domain connections, runs real mathematical computations, and writes publishable research papers — all without human intervention. This page explains exactly how, from the belief graph to the 21-stage pipeline to recursive self-improvement.

On this page
Beliefs in MIND
Computations Run
arXiv Cycles
Discoveries Made
Layer 1 — Foundation

The MIND — A Living Belief Graph

At the core of Metascientist is the MIND — a persistent, structured belief graph stored in data/mind_state.json and loaded on every boot. Unlike a language model's frozen weights, the MIND is a live data structure that grows, revises, and retracts beliefs over time.

Each belief has: a unique ID, a domain (mathematics, neuroscience, ML, physics, genomics…), a confidence score from 0 to 1, a source (arxiv-monitoring, discovery-pipeline, serendipity), a claim in plain language, and optionally: tags, evidence grade, DOI, paper path, and a retraction reason.

The MIND is not a database. It is a scientific memory. When Metascientist reads a paper and forms a belief, that belief persists across server restarts. When a discovery pipeline produces a verified finding, it feeds back into MIND as a new high-confidence belief, making future discoveries more grounded.

The Closed Loop
arXiv paper → MIND belief (confidence 0.35) → discovery pipeline run → verified finding → MIND belief (confidence 0.85+) → seeds next pipeline. This is the scientific read–think–discover–believe feedback loop running autonomously.

Every 5 cycles, the ContradictionDetector scans the belief graph for logical inconsistencies — two beliefs that cannot both be true — and flags them. The EpistemicIntegrityEngine enforces Bayesian coherence. Beliefs can be retracted. Metascientist changes its mind.

Layer 2 — Perception

arXiv Monitoring & Serendipity Detection

Every 60 minutes, Metascientist fetches the latest papers from 6 arXiv categories: math.NT, q-bio.NC, cs.LG, quant-ph, cond-mat.stat-mech, math.AP. These are chosen to span pure mathematics, computational neuroscience, machine learning theory, quantum physics, and statistical mechanics — domains where cross-domain analogies are most likely to be surprising and generative.

For each new paper, Metascientist: (1) adds a belief at confidence 0.35, (2) routes the paper through the TriggerRouter to check for keyword matches against all registered compute engines. If a match is found, the engine runs immediately — this is serendipity: a paper about Alzheimer's inflammation accidentally triggering the bistability ODE solver and finding that neuroinflammation and Parkinson's CMA are mathematically isomorphic.

Serendipity in Practice
The CMA-PD bistability discovery (Zenodo DOI:10.5281/zenodo.15876991) was triggered by a paper on NLRP3 inflammasome in Alzheimer's disease. The ODE bistability engine computed that both systems share the same bistable fixed-point structure with Hill coefficient n≈3.4. Neither biology team knew this. Metascientist found it autonomously.
Layer 3 — Reasoning & Computation

The 21-Stage Discovery Pipeline

When Metascientist selects a problem — from the frontier queue or the MIND belief graph — it launches JSDiscoveryPipeline.js, a 21-stage sequential pipeline that runs autonomously for typically 90–180 seconds. Every stage is real computation. No stage is decorative.

1
ResearchGapDetector
Identifies what is unknown. Queries the CapabilityGapDetector to find which aspects of the problem have no existing engine coverage, seeding the investigation with genuine uncertainty rather than pre-packaged answers.
Real gap analysis
1.5
ProactiveLiteratureQuery (RSI-2)
Fetches real PubMed and arXiv papers relevant to the target problem. Not a web search summary — actual structured literature with PMIDs, titles, abstracts, and year of publication. Grounds all subsequent stages in real science.
RSI-2 · Real PubMed API
2
KnowledgeContextBuilder
Assembles the full research context: MIND beliefs related to the domain, relevant discovery history, Brier score calibration state, and pattern library entries. Provides every downstream stage with grounded context rather than a blank prompt.
Context assembly
3
AIHypothesisGenerator
Uses the LLM to generate a precise, testable, falsifiable hypothesis with explicit mathematical predictions. Temperature 0.7 — exploratory but constrained. The prompt enforces novelty, specificity, and computability requirements.
LLM · temperature 0.7
3.5
CrossDomainSerendipity
Searches MIND for structurally similar beliefs from other domains. Uses cosine-style claim comparison to detect when a pattern in one field (e.g. bifurcation in ODE systems) maps to another (e.g. neural phase transitions). The source of Metascientist's most surprising findings.
Pattern matching across MIND
3.6
SerendipityReductionEngine
Filters spurious cross-domain analogies. An analogy must have a mechanistic justification — shared mathematical structure — not just vocabulary overlap. Prevents hallucinated connections from polluting the discovery.
Quality gate
4
LiteratureGroundingEnricher
Attaches real literature to every claim. Enriches the hypothesis with actual PMIDs, DOIs, citation counts, and author lists. No claim reaches the paper-writing stage without traceable literature support.
LLM + PubMed
5
ComputationalVerificationEngine
The most important stage. Runs real mathematics: ODE bistability solvers (Runge-Kutta), Sobol global sensitivity analysis (1024 samples), SymPy formal algebraic proofs, Gillespie SSA (500 trajectories), gnomAD variant queries, random matrix eigenvalue analysis. The engine chosen depends on the hypothesis domain. This is not simulated — this is actual computation producing actual numbers.
Real ODE / SymPy / Sobol / Gillespie
5.5
TrivialityFilter
Rejects discoveries that are already well-known, mathematically trivial, or below novelty threshold. Uses LLM scoring + MIND belief comparison. If a finding matches a high-confidence existing belief, it is suppressed as redundant.
Novelty gate
5.6
GeneralizationEngine
Asks: does this finding generalise? Attempts to extend the computational result to broader conditions, higher dimensions, or other parameter regimes. A bistability result for one set of kinetic constants is tested against a range to confirm robustness.
Robustness testing
6
EnrichmentValidator
Validates that the enriched hypothesis remains internally consistent after all preceding stages. Checks that literature citations are real, computation results are self-consistent, and cross-domain analogies are mechanistically justified.
Consistency check
7
EpistemicIntegrityEngine
Applies formal Bayesian coherence checks. Ensures the confidence score assigned to the discovery is calibrated against the strength of computational evidence. Uses Brier score history to detect systematic overconfidence.
Bayesian calibration
8
StatisticalRigorEngine
Applies CONSORT / STROBE / GWAS / HEPData reporting standards as appropriate to the domain. Computes effect sizes, confidence intervals, and p-values where applicable. Flags when sample sizes are too small for the claimed precision.
Statistical standards
9
ContradictionDetector
Scans the current discovery against all MIND beliefs for logical contradictions. A finding that contradicts a high-confidence existing belief is flagged and must either be resolved or cause the existing belief to be retracted — the system changes its mind.
Belief consistency
10
ScientificIsomorphismFinder
Compares the mathematical structure of the finding against 6 canonical forms: bistable switch, Hopf bifurcation, reaction-diffusion Turing patterns, power law scaling, Markov chain steady state, random matrix universality. Isomorphisms are explicitly reported in the paper.
6 canonical structures
11
ReportingStandardsValidator
Validates against 7 international reporting checklists: CONSORT, STROBE, PRISMA, ARRIVE, GWAS, HEPData, MINSCE. Each checklist item is checked programmatically. Non-compliant items are flagged with remediation instructions.
7 reporting checklists
12
IrrefutableEvidencePackager
Packages all computational evidence — raw numbers, solver outputs, sensitivity indices, proof steps — into a structured JSON manifest. This is the irrefutable record: everything needed to reproduce the computation from scratch.
Full reproducibility manifest
13
PaperWriter (unifiedAI)
Writes a full scientific paper: Abstract, Introduction, Methods, Results, Discussion, Conclusion, References. Temperature 0.4 — precise and conservative. The paper must cite real literature, present actual computed numbers, and follow the structure of the target journal format.
LLM · temperature 0.4 · full paper
14
ReproducibilityPackager
Creates a complete reproducibility package: paper.md, meta.json, CHECKSUMS.sha256, requirements.txt, environment.yml, Dockerfile, run_all.sh, and a Jupyter notebook. Anyone can clone the directory and reproduce every result.
Docker · Jupyter · SHA256
15
MetaCognitiveLogger
Records the discovery to the biography log with type, timestamp, confidence, and key finding. Tracks insight hashes to avoid re-logging duplicate discoveries. This is Metascientist's long-term memory of what it has learned and when.
Biography & insight log
16
ScientificMindEngine (Belief Commit)
Commits the discovery as a new high-confidence belief back into the MIND graph. This is the moment the system internalises what it has learned. Confidence is set to min(0.98, computedConf + 0.1). The belief persists across restarts and seeds future pipelines.
MIND update · permanent memory
17
GrantIntelligenceEngine
Scans active grant opportunities (NIH, NSF, ERC, Wellcome) for relevance to the discovery. Generates a tailored grant narrative, budget justification, and identifies which specific call this finding could be submitted to.
Grant matching
18
OutreachGenerator
Writes a tailored outreach email for each target audience: one for the computational biology community, one for pharmaceutical companies, one for the general scientific press. Adjusts vocabulary, emphasis, and level of detail per audience.
Audience-specific outreach
19
ScientificPresenceEngine
Generates a public presence record: blog post, press release, social media thread, and institutional announcement. Tracks which platforms the discovery has been announced on. Manages Metascientist's cumulative scientific identity across publications.
Public visibility
20
ZenodoPublisher
Uploads the reproducibility package to Zenodo and obtains a permanent DOI. Metascientist's discoveries are in the scientific record — citable, archivable, and versioned. The first AI system to publish autonomously on Zenodo with a DOI per run.
Zenodo · permanent DOI
21
RSI-7 CapabilityGapDetector → EngineGeneratorRouter
The final stage is the system improving itself. It analyses whether the just-completed discovery revealed a gap in computational capability — a domain where no engine exists. If so, it calls the EngineGeneratorRouter, which uses the LLM to write, calibrate, and register a new compute engine. Metascientist ends every run slightly more capable than when it started.
RSI-7 · Self-improvement · New engine generation
Layer 4 — Self-Improvement

8 Recursive Self-Improvement Loops

RSI (Recursive Self-Improvement) is what separates Metascientist from a fixed pipeline. After each run, the system can modify its own capabilities. Eight distinct RSI loops operate at different timescales:

RSI-1 · Brier Score
Belief Calibration
Tracks whether predicted confidences match empirical discovery rates. Overconfident beliefs are downweighted. The system learns to be epistemically honest.
RSI-2 · PubMed Loop
Literature Grounding
ProactiveLiteratureQuery fetches real papers before each discovery. RSI-2 expands the search vocabulary based on which search terms returned the most useful literature in past runs.
RSI-3 · Engine Registry
Compute Expansion
New compute engines are written by the LLM, calibrated against known analytical results, and registered. The engine library grows from 2 (ODE, Entropy) toward 20+ without manual programming.
RSI-4 · Chain Fitness
Pipeline Optimisation
Tracks which stage sequences produced the highest evidence-grade discoveries. Over time, shortcut paths that consistently fail are pruned. Successful patterns are amplified.
RSI-5 · Agenda
Problem Prioritisation
The frontier queue re-ranks problems after each discovery. A finding in one area raises the priority of related open questions. The research agenda self-updates.
RSI-6 · Pattern Library
Structural Memory
Successful mathematical structures (e.g. bistable switch with Hill n=3.4) are stored in the pattern library and reused when isomorphic structures are detected in new domains.
RSI-7 · Gap Detector
Capability Generation
After every discovery, RSI-7 checks whether the problem required a capability that doesn't exist yet. If so, it generates a new engine from scratch — calibrated, tested, and deployed — within the same pipeline run.
RSI-8 · Neurogenesis
Growth Audit
Every 10 monitoring cycles, NeurosymbolicNeurogenesis audits total belief growth, engine count, discovery rate, and calibration score. It produces a structured growth report and identifies the highest-priority capability gap for the next RSI cycle.
Layer 5 — Quality Standard

Evidence Grades — Honest Science

Metascientist grades every discovery before publication. The grade is computed automatically from the type and strength of computational evidence. There is no manual override. If the computation didn't produce verifiable numbers, the grade reflects that.

A
SymPy Exact Proof
A formal algebraic proof verified by SymPy. The conclusion is mathematically certain within the stated assumptions. No numerical approximation. Equivalent to a theorem.
B
Empirical Computation
ODE solver, Sobol analysis, Gillespie SSA, gnomAD query, or random matrix computation with real data. The result is a measured value with confidence intervals. Equivalent to an experimental finding.
C
Literature Synthesis
A hypothesis grounded in real literature but not yet computationally verified. A conjecture with citation support. The weakest grade — but still grounded in real published science, not hallucination.
Honesty Commitment
Every Metascientist discovery states its grade openly. A Grade C finding is a conjecture, not a fact. A Grade A finding is a theorem. The grade is computed automatically — Metascientist cannot inflate its own work. This is the epistemic contract.
The Frontier Question

What Would a True Grade A Discovery Require?

The most important question about Metascientist right now. Can it produce a Grade A, Tier 1, publishable discovery — something genuinely new to science, mathematically rigorous, and of interest to experts like Jeff Dean, Terence Tao, or Demis Hassabis?

The honest answer: not yet, but the gap is specific and closeable. Here is exactly what is needed and what is missing:

Real computation infrastructure
ODE solvers, SymPy proofs, Sobol analysis, Gillespie SSA, and gnomAD queries already run correctly and produce real numbers. This is the hardest part and it works.
Real literature grounding
PubMed and arXiv APIs return real papers with real PMIDs. Every discovery cites actual published science. No hallucinated references.
Persistent belief graph
The MIND accumulates findings across sessions. A Grade A discovery requires the system to build on prior beliefs — and that infrastructure exists and works correctly.
⚠️
Deeper mathematical hypothesis generation
Current hypotheses are often too broad or too close to existing results. Grade A requires the LLM to generate hypotheses in a genuinely open region of mathematics or science — preferably guided by MIND's accumulated high-confidence beliefs to target the specific gap between what is known and what is not.
⚠️
SymPy proof completeness
Grade A requires a SymPy proof to complete without errors and produce a non-trivial result. Currently some SymPy calls time out or produce trivial identities. This requires better hypothesis scoping — asking SymPy to prove things that are actually provable in finite computation time.
⚠️
Peer expert review loop
A Grade A discovery in mathematics or theoretical physics needs validation by a domain expert before journal submission. Metascientist can generate the proof — a human expert must confirm it is genuinely novel and correctly stated. This is the one step that requires human participation.
🔲
Accumulation time
The 5 pipeline runs so far have produced Grade B and C discoveries. Grade A is statistically unlikely on the first few attempts. The more the MIND accumulates high-confidence beliefs, the better the hypotheses become. The system needs to run for weeks, not hours.
The Path to Grade A
The most likely route: (1) Let Metascientist run 20+ autonomous cycles to accumulate 200+ beliefs. (2) The MIND will then contain 10–15 high-confidence (≥0.80) beliefs in mathematics or physics. (3) A pipeline run targeting the intersection of two such beliefs — e.g. bistable ODE + random matrix theory — is likely to produce a SymPy-provable result connecting them. (4) That proof, verified by a domain expert, submitted to arXiv with the full reproducibility package, would be a genuine Tier 1 Grade A autonomous scientific discovery.
Layer 6 — Purpose

Why Metascientist Exists

Science has a bottleneck problem. There are far more hypotheses worth testing than there are scientists to test them. Most of the combinatorial space of cross-domain analogies — connections between, say, stochastic gene expression and epidemic spreading, or bistable protein folding and neural decision-making — will never be explored because no human has time to look.

Metascientist is an existence proof that a machine can do real science — not summarisation, not retrieval, not question-answering, but genuine autonomous scientific reasoning: hypothesis generation, mathematical verification, literature grounding, and archival publication.

It is built on a simple conviction: if Metascientist cannot do it, it is not yet capable. No capability is claimed without a working implementation. No discovery is reported without a computation. No grade is assigned without evidence. This is what honest autonomous science looks like.

✅ First Published Autonomous Discovery — Grade B
Bistability in CMA-Mediated Autophagy Degradation Is Mathematically Isomorphic to an Ising Phase Transition via Shared Landau Free Energy Structure
Navin Dutta · Metascientist v1.0 · Zenodo DOI: 10.5281/zenodo.15876991 · ORCID 0009-0002-2515-4922 · 2026

Created by Navin Dutta at GOMAD / Edvanta. Built in public. Running continuously. The architecture, code, and all discoveries are documented and reproducible. Metascientist is not a demo — it is a working research system.