MétaCan
Menu
Back to cohort
Record W4379535338 · doi:10.14232/actacyb.303531

Preface

2023· article· en· W4379535338 on OpenAlexaboutno aff
Andreas Rauh, Balázs Bánhelyi

Bibliographic record

VenueActa Cybernetica · 2023
Typearticle
Languageen
FieldComputer Science
TopicGraph Theory and Algorithms
Canadian institutionsnot available
Fundersnot available
KeywordsCzechLibrary sciencePolitical sciencePhilosophyComputer science

Abstract

fetched live from OpenAlex

Preface The 19th International Symposium on Scientific Computing, Computer Arithmetic and Verified Numerical Computation (SCAN) was originally planned to be organized by the Institute of Informatics of the University of Szeged (SZTE) in Szeged, Hungary, in the year 2020. Due to the pandemic situation, the Scientific Committee of SCAN decided to postpone the meeting to September 13–15, 2021 and to have it in a fully online format.The members of the Scientific Committee were the following representatives of the topics of the conference: G. Alefeld (Karlsruhe, Germany), A. Bauer (Ljubljana, Slovenia), J. B. van den Berg (Amsterdam, the Netherlands), G.F. Corliss (Milwaukee, USA), T. Csendes (Szeged, Hungary), R.B. Kearfott (Lafayette, USA), V. Kreinovich (El Paso, USA), J.-P. Lessard (Montreal, Canada), W. Luther (Duisburg, Germany), S. Markov (Sofia, Bulgaria), G. Mayer (Rostock, Germany), J.-M. Muller (Lyon, France), M. Nakao (Tokyo, Japan), T. Ogita (Tokyo, Japan), S. Oishi (Tokyo, Japan), K. Ozaki (Tokyo, Japan), M. Plum (Karlsruhe, Germany), A. Rauh (Brest, France), N. Revol (Lyon, France), J. Rohn (Prague, Czech Republic), S. Rump (Hamburg, Germany/Tokyo, Japan), S. Shary (Novosibirsk, Russia), W. Tucker (Uppsala, Sweden), W. Walter (Dresden, Germany), J. Wolff von Gudenberg (Würzburg, Germany), and N. Yamamoto (Tokyo, Japan). The members of the Organizing Committee were: Balázs Bánhelyi, Tibor Csendes, Boglárka G.-Tóth, Viktor Homolya, Tamás Vinkó, and Dániel Zombori. During SCAN, more than 50 participants were present and 48 talks in several fields of reliable computation and its applications were given, and organized in 18 thematic sessions. The plenary speakers were Fabienne Jézéquel (Sorbonne University, France), Marko Lange (Hamburg University of Technology, Germany), J.D. Mireles James (Florida Atlantic University, USA), together with the Moore Prize winners Marko Lange and Siegfried Rump (Waseda University, Japan).The open-access scientific journal Acta Cybernetica offered to publish paper versions of selected presentations after a careful peer review process. Altogether, 7 papers were accepted for publication in the present special issue of Acta Cybernetica. The full program of the conference, the collection of all abstracts, and further information can be found at https://www.inf.u-szeged.hu/scan2020/. Andreas Rauh, Balázs Bánhelyi Guest Editors

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Editorial · Consensus signal: none
Teacher disagreement score0.558
Threshold uncertainty score0.000

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.015
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.003
Science and technology studies0.0030.001
Scholarly communication0.0050.005
Open science0.0020.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.5580.426

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.011
GPT teacher head0.226
Teacher spread0.216 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreEditorial

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".

Quick stats

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueActa CyberneticaSame topicGraph Theory and AlgorithmsFrench-language works237,207