MétaCan
Menu
Back to cohort
Record W2559713566 · doi:10.1109/cec.2016.7743979

Adding local edge mobility to graph evolution

2016· article· en· W2559713566 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

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicScheduling and Timetabling Solutions
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsComputer scienceEnhanced Data Rates for GSM EvolutionGraphTheoretical computer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

This study extends an earlier generative representation for the evolution of graphs to include a local reconfiguration operator, the hop operator, and a null operator. The hop operator is shown to be more effective in evolving graphs with a particular geometric character (eccentricity sequence). The null operator permits evolution to select the number of active commands used, avoiding a problem with needing to tune a “gene length” parameter. The representation is parametrized by the probability of each command appearing in initial populations and during mutation. A parameter study leads to a number of rules of thumb for using the new representation and it is found that the number of failures to find a solution, in 3000 attempts, varies from 17 in 3000 as the parameters are changed. The representation is tested on 100 instances of the eccentricity sequence matching problem. Use of the null operator has the beneficial side effect of reducing observed variation in problem difficulty.

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.003
metaresearch head score (Gemma)0.005
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.845
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

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

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.104
GPT teacher head0.382
Teacher spread0.278 · 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

Quick stats

Citations12
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicScheduling and Timetabling SolutionsFrench-language works237,207