MétaCan
Menu
Back to cohort
Record W2282111065 · doi:10.4230/dagrep.4.10.51

Optimal algorithms and proofs (Dagstuhl Seminar 14421)

2015· article· en· W2282111065 on OpenAlexfundno aff
Olaf Beyersdorff, Edward Hirsch, Jan Krajı́ček, Rahul Santhanam

Bibliographic record

VenueDROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2015
Typearticle
Languageen
FieldComputer Science
TopicDigital Image Processing Techniques
Canadian institutionsnot available
FundersCouncil for Research in the Social Sciences, Columbia UniversityUniversität WienJulius-Maximilians-Universität WürzburgUniversité de FribourgKungliga Tekniska HögskolanUniversity of TorontoUniversität UlmUniversity of LeedsMiddlesex UniversityState University of New YorkNational Institute of InformaticsUniverzita Karlova v PrazeTechnische Universität Chemnitz
KeywordsMathematical proofComputer scienceTheoretical computer scienceAlgorithmMathematics

Abstract

fetched live from OpenAlex

This report documents the programme and the outcomes of the Dagstuhl Seminar 14421 "Optimal algorithms and proofs". The seminar brought together researchers working in computational and proof complexity, logic, and the theory of approximations. Each of these areas has its own, but connected notion of optimality; and the main aim of the seminar was to bring together researchers from these different areas, for an exchange of ideas, techniques, and open questions, thereby triggering new research collaborations across established research boundaries.

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.009
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.061
Threshold uncertainty score0.205

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0090.012
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0030.003
Science and technology studies0.0020.002
Scholarly communication0.0080.004
Open science0.0020.005
Research integrity0.0040.007
Insufficient payload (model declined to judge)0.0610.028

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.028
GPT teacher head0.281
Teacher spread0.253 · 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 designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Citations1
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueDROPS (Schloss Dagstuhl – Leibniz Center for Informatics)Same topicDigital Image Processing TechniquesFrench-language works237,207