MétaCan
Menu
Back to cohort
Record W1971470684 · doi:10.1109/cibcb.2008.4675788

Transience in the simulation of ring species

2008· article· en· W1971470684 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
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsRing (chemistry)FertilityPopulationComputer scienceRobotTerminal (telecommunication)GridPoint (geometry)Task (project management)Artificial intelligenceEcologyBiologyEvolutionary biologyEngineeringMathematicsComputer networkDemography

Abstract

fetched live from OpenAlex

Biological ring species theoretically develop when an ancestral population expands around a geographic barrier and differentiates until terminal populations come back into contact. Adjacent populations are fertile; fertility declines with distance, and the terminal populations are not fertile. This study uses evolutionary algorithms to attempt to create artificial ring species using grid robots performing the Tartarus task with ISAc lists and string genes solving the Self Avoiding Walk (SAW) problem. Three experiments are done with the Tartarus robots. Fertility is shown to decrease with distance, but not to the extent that ring species are formed. Two experiments are done with SAW. These experiments produce sub-populations which satisfy all the criteria for biological ring species at the point in time when the ring closes. As evolution continues, the relationship between fertility and distance continues, but the terminal populations do not remain infertile. In addition, on both problems, record scores are achieved, suggesting that this model of evolution is a good optimizer for multi-optima problems like Tartarus and SAW which have many deceptive suboptima.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.885
Threshold uncertainty score0.056

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
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.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.040
GPT teacher head0.257
Teacher spread0.218 · 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

Citations11
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicEvolutionary Algorithms and ApplicationsFrench-language works237,207