MétaCan
Menu
Back to cohort
Record W2070018731 · doi:10.1207/s15328007sem1002_3

Testing Recursive Path Models With Correlated Errors Using D-Separation

2003· article· en· W2070018731 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueStructural Equation Modeling A Multidisciplinary Journal · 2003
Typearticle
Languageen
FieldComputer Science
TopicBayesian Modeling and Causal Inference
Canadian institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsConditional independenceMathematicsDirected acyclic graphPath (computing)Independence (probability theory)Markov chainPath analysis (statistics)StatisticGraphStatisticsTest statisticAlgorithmCombinatoricsStatistical hypothesis testingDiscrete mathematicsApplied mathematicsComputer science

Abstract

fetched live from OpenAlex

Abstract This article shows how to extend the inferential test of Shipley (2000b), which is applicable to recursive path models without correlated errors (a directed acyclic graph [DAG] model), to a class of recursive path models that include correlated errors (a semi-Markov model). The path model is first converted to a partial ancestral graph (PAG) and then, for PAGs that do not require latent variables, an inducing path DAG is obtained that is equivalent in its conditional independence relations to the original path model. The null probabilities of the k tests of independence that are implied by this DAG are combined using Fisher's test statistic C = -2ΣLn(pi), which is distributed as a chi-square variate with 2k degrees of freedom.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.178
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.003
Open science0.0000.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

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.108
GPT teacher head0.321
Teacher spread0.214 · 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