MétaCan
Menu
Back to cohort
Record W2921118646 · doi:10.14738/assrj.62.6200

The complexity coefficient for acyclic networks measuring network density: Application to project management

2019· article· en· W2921118646 on OpenAlexfundno aff
Luis F. Copertari

Bibliographic record

VenueAdvances in Social Sciences Research Journal · 2019
Typearticle
Languageen
FieldMathematics
TopicGraph theory and applications
Canadian institutionsnot available
FundersMcMaster University
KeywordsNode (physics)Arc (geometry)Computer scienceDirected acyclic graphMathematicsTheoretical computer scienceAlgorithmPhysics

Abstract

fetched live from OpenAlex

A complexity coefficient applied to acyclic networks for project management measuring network density, not its structure, is presented, analyzed and discussed. Both the Activity on Arc (AOA) and the Activity on Node (AON) paradigms are considered. Based on the restriction that the project network needs to be acyclic, it is possible to define strict bounds to the complexity coefficient. In this case, the complexity coefficient, named eta, varies between zero and one, and measures only network density.

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.027
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.027
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.003
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.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.211
GPT teacher head0.487
Teacher spread0.276 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations0
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueAdvances in Social Sciences Research JournalSame topicGraph theory and applicationsFrench-language works237,207