{"id":"W1567455550","doi":"10.4230/dagrep.4.2.38","title":"Graph Modification Problems (Dagstuhl Seminar 14071)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Division of Mathematical Sciences; Universität Ulm; Université de Montpellier; Universität Rostock; Korea Advanced Institute of Science and Technology; Technische Universität Berlin; University of Haifa; National and Kapodistrian University of Athens; Goethe-Universität Frankfurt am Main; Magyar Tudományos Akadémia; Universität Trier; Durham University; University of Oregon; Universitetet i Bergen; University of Leeds; Uniwersytet Warszawski; Indian Institute of Science; University of Toronto; University of Ioannina; Universiteit Maastricht","keywords":"Graph; Computer science; Theoretical computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232301,0.001339522,0.001064407,0.001625147,0.001637111,0.002818608,0.001487671,0.0022521,0.04356588],"category_scores_gemma":[0.00405857,0.000574113,0.001017825,0.002231752,0.001238767,0.002845882,0.002746913,0.004651709,0.01361291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003726732,"about_ca_system_score_gemma":0.00208246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001930917,"about_ca_topic_score_gemma":0.002575171,"domain_scores_codex":[0.9981434,0.0005330469,0.00007262609,0.0003560028,0.0006495696,0.0002453944],"domain_scores_gemma":[0.9988734,0.0004065855,0.00007912823,0.0001412719,0.0001806712,0.0003188329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002780871,0.0001647259,0.0002311994,0.0003486629,0.00003966352,0.0001590863,0.0001726151,0.002587808,0.001474223,0.279801,0.6052328,0.1095102],"study_design_scores_gemma":[0.0001660747,0.0001047284,0.001365341,0.000216948,0.00004017332,0.0002285789,0.0001031185,0.003815101,0.001874243,0.4976927,0.4943459,0.00004707702],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.04007286,0.07248122,0.14116,0.1708078,0.03539886,0.0005496682,0.009631948,0.003343712,0.526554],"genre_scores_gemma":[0.3553837,0.03471143,0.1117243,0.02016192,0.02037244,0.001277899,0.0215738,0.002288979,0.4325056],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.04356588,"threshold_uncertainty_score":0.1457424,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02362844855885657,"score_gpt":0.2844284748760495,"score_spread":0.260800026317193,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}