<scp>GAMaterial</scp>—A genetic‐algorithm software for material design and discovery
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.
Bibliographic record
Abstract
Abstract Genetic algorithms (GAs) are stochastic global search methods inspired by biological evolution. They have been used extensively in chemistry and materials science coupled with theoretical methods, ranging from force‐fields to high‐throughput first‐principles methods. The methodology allows an accurate and automated structural determination for molecules, atomic clusters, nanoparticles, and solid surfaces, fundamental to understanding chemical processes in catalysis and environmental sciences, for instance. In this work, we propose a new genetic algorithm software, GAMaterial, implemented in Python3.x, that performs global searches to elucidate the structures of atomic clusters, doped clusters or materials and atomic clusters on surfaces. For all these applications, it is possible to accelerate the GA search by using machine learning (ML), the ML@GA method, to build subsequent populations. Results for ML@GA applied for the dopant distributions in atomic clusters are presented. The GAMaterial software was applied for the automatic structural search for the Ti 6 O 12 cluster, doping Al in Si 11 (4Al@Si 11 ) and Na 10 supported on graphene (Na 10 @graphene), where DFTB calculations were used to sample the complex search surfaces with reasonably low computational cost. Finally, the global search by GA of the Mo 8 C 4 cluster was considered, where DFT calculations were made with the deMon2k code, which is interfaced with GAMaterial.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it