Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''
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
Held at the Institute of Mathematics of the University of Liège, Liège, September 8―11, 2004 This special issue of Discrete Mathematics & Theoretical Computer Science is dedicated to the tenth "Journées montoises d'informatique théorique" conference (Mons theoretical computer science days) which was held, for the first time, at the Institute of Mathematics of the University of Liège, Belgium, From 8th to 11th September 2004. Previous editions of this conference took place in Mons 1990, 1992, 1994, 1998, in Rouen 1991, in Bordeaux 1993, Marseille 1995, Marne-La-Vallée 2000 and Montpellier 2002.<p> This tenth edition can be considered as a widely international one. We were lucky to have almost 85 participants from fourteen different countries: Austria, Belgium, Burkina Faso, Canada, Czech republic, Finland, France, Germany, Israel, Italy, Japan, Norway, Poland and Portugal. The main proportion of researchers participating to this event was coming from France and Italy where a long tradition of combinatorics on words is well established. During four days, 42 contributed talks and 7 invited talks were given, the main topics being combinatorics on words, numeration systems, automata and formal languages theory, coding theory, verification, bio-informatics, number theory, grammars, text algorithms, symbolic dynamics and tilings. The invited speakers were: J. Cassaigne (CNRS, Luminy-Marseille), D. Caucal (IRISIA-CNRS, Rennes), C. Frougny (LIAFA, Université Paris 8), T. Helleseth (University of Bergen), S. Langerman (FNRS, Université Libre de Bruxelles), F. Neven (Limburgs Universitair Centrum, Diepenbeek), M.-F. Sagot (Inria Rhône-Alpes, Université Lyon I).<p> We would like to thanks all the participants, the invited speakers and the anonymous referees who made possible this event and special issue. Each paper has been refereed using high scientific standard by two independent referees. Readers of this special issue may wonder why it took so long to obtain it. We have encountered some problems with the formerly chosen journal and for the benefit of the contributors to this issue, we have chosen Discrete Mathematics & Theoretical Computer Science to publish their work.
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.006 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.003 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.008 | 0.002 |
| 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