Understanding long-time vacancy aggregation in iron: A kinetic activation-relaxation technique study
Bibliographic record
Abstract
Vacancy diffusion and clustering processes in body-centered-cubic (bcc) Fe are studied using the kinetic activation-relaxation technique (k-ART), an off-lattice kinetic Monte Carlo method with on-the-fly catalog building capabilities. For monovacancies and divacancies, k-ART recovers previously published results while clustering in a 50-vacancy simulation box agrees with experimental estimates. Applying k-ART to the study of clustering pathways for systems containing from one to six vacancies, we find a rich set of diffusion mechanisms. In particular, we show that the path followed to reach a hexavacancy cluster influences greatly the associated mean-square displacement. Aggregation in a 50-vacancy box also shows a notable dispersion in relaxation time associated with effective barriers varying from 0.84 to 1.1 eV depending on the exact pathway selected. We isolate the effects of long-range elastic interactions between defects by comparing to simulations where those effects are deliberately suppressed. This allows us to demonstrate that in bcc Fe, suppressing long-range interactions mainly influences kinetics in the first 0.3 ms, slowing down quick energy release cascades seen more frequently in full simulations, whereas long-term behavior and final state are not significantly affected.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".