Bibliographic record
Abstract
This special issue contains papers written by participants to the conference "Noncommutative rings and their Applications" that was held in Lens (France) at the Science faculty of the Universit\'e d'Artois. The meeting gave the experts from different domains the opportunity to exchange their views, share their research, and learn from one another new results and problems in a friendly atmosphere. They were 55 researchers, graduate and postdoctoral students from USA, Canada, Poland, Czech Republic, Italy, Spain, Germany, Portugal, Egypt, Senegal, New Zeland, South Africa, Algeria, Turkey, Mexico, Brazil, Uruguay, Indonesia...and France! The interplay between ring and coding theory was emphasized by the very nice and interesting course "Linear codes from the axiomatic point of view" given by Jay Wood. The four invited speakers: Fr\'ed\'erique Oggier, Christophe Reutenauer, Angel del Rio and Irfan Siap contributed greatly to the success of this conference. The topics of the Jay Wood's course and the 39 talks presented at the conference are well represented by this special issue of Jacodesmath. They cover pure ring theory such as nil *-clean rings, radical classes or algebras such as Grassman algebras and Steenrod algebras and many papers relating these subjects with coding theory such as MacWilliams extension theorem, dual codes, Lee and Hamming weight. So this volume will be particularly useful for mathematicians at the confluent of these two branches. This meeting was supported by the Laboratoire de Math\'ematiques de Lens (LML), by different bodies from the Universit\'e d'Artois (RI, BQR), as well as by a regional organization (the Fédération des Laboratoires de Math´ematiques du Nord pas de Calais). We would like to thank all the participants for their efforts and enthusiasm. A very warm thanks to the colleagues who kindly agreed to referee the papers. Their expertise, promptitude, and professionalism improved the quality of the articles in this volume. Many thanks are due to the editorial staff of the Jacodesmath journal for the very efficient way they managed the process of preparing and publishing these proceedings.
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.004 | 0.024 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.007 | 0.005 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.007 | 0.007 |
| Insufficient payload (model declined to judge) | 0.216 | 0.144 |
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".