MétaCan
Menu
Back to cohort
Record W1991118948 · doi:10.1088/0305-4470/39/46/l01

A simple method for reverse engineering causal networks

2006· article· en· W1991118948 on OpenAlexaff
M. Andrecut, Stuart Kauffman

Bibliographic record

VenueJournal of Physics A Mathematical and General · 2006
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGene Regulatory Network Analysis
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsSimple (philosophy)Reverse engineeringComputer scienceEpistemologyProgramming languagePhilosophy

Abstract

fetched live from OpenAlex

We present a simple method for 'reverse engineering' causal networks, based on mutual information, as a correlation measure. The goal of our method is not to recover all the causal interactions in a network but rather to recover some causal interactions with a very high confidence. For this purpose, we derive an 'exact' theoretical result for the statistical significance of mutual information. Also, we give some numerical simulation results, obtained for random Boolean networks, as an idealized model of genetic regulatory networks.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.008
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0080.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.007
GPT teacher head0.249
Teacher spread0.242 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations10
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Physics A Mathematical and GeneralSame topicGene Regulatory Network AnalysisFrench-language works237,207