MétaCan
Menu
Back to cohort
Record W1567455550 · doi:10.4230/dagrep.4.2.38

Graph Modification Problems (Dagstuhl Seminar 14071)

2014· article· en· W1567455550 on OpenAlexfundno aff
Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov

Bibliographic record

VenueDROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2014
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsnot available
FundersDivision of Mathematical SciencesUniversität UlmUniversité de MontpellierUniversität RostockKorea Advanced Institute of Science and TechnologyTechnische Universität BerlinUniversity of HaifaNational and Kapodistrian University of AthensGoethe-Universität Frankfurt am MainMagyar Tudományos AkadémiaUniversität TrierDurham UniversityUniversity of OregonUniversitetet i BergenUniversity of LeedsUniwersytet WarszawskiIndian Institute of ScienceUniversity of TorontoUniversity of IoanninaUniversiteit Maastricht
KeywordsGraphComputer scienceTheoretical computer science

Abstract

fetched live from OpenAlex

This report documents the program and the outcomes of Dagstuhl Seminar 14071 "Graph Modification Problems". The seminar was held from February 9 to February 14, 2014. This report contains abstracts for presentations about the recent developments on algorithms and structural results for graph modification problems, as well as related areas. Furthermore, the report contains a summary of open problems in this area of research.

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.004
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: Other · Consensus signal: Other
Teacher disagreement score0.044
Threshold uncertainty score0.146

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0020.001
Scholarly communication0.0030.003
Open science0.0010.003
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0440.014

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.024
GPT teacher head0.284
Teacher spread0.261 · 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
GenreOther

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

Citations19
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueDROPS (Schloss Dagstuhl – Leibniz Center for Informatics)Same topicAdvanced Graph Theory ResearchFrench-language works237,207