{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001995489,0.0005665847,0.0005725568,0.0006958571,0.0006769291,0.0006599437,0.003053098,0.0002934646,0.00001921843],"category_scores_gemma":[0.0002915306,0.0005196917,0.0003546042,0.001110352,0.0002985508,0.003304133,0.0007662395,0.0006706336,0.0004095117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001529863,"about_ca_system_score_gemma":0.00007424093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001165458,"about_ca_topic_score_gemma":0.000006826866,"domain_scores_codex":[0.9954875,0.0001508937,0.001326935,0.000622484,0.001037828,0.001374396],"domain_scores_gemma":[0.9958346,0.0003902823,0.0005918434,0.002141035,0.0006075091,0.0004346735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002069996,0.001365724,0.005195152,0.001357868,0.0003387492,0.000006690239,0.01892335,0.004529221,0.001925761,0.8036625,0.01068839,0.1517995],"study_design_scores_gemma":[0.006240336,0.001642259,0.001843423,0.0004381683,0.00005647388,0.000155301,0.0009427131,0.5412002,0.007932916,0.1627052,0.2746164,0.002226658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04646928,0.00008340979,0.9429661,0.0005054849,0.0006204408,0.001855269,0.0001143864,0.0006151048,0.006770526],"genre_scores_gemma":[0.9089149,0.00009663068,0.08782146,0.0009787603,0.0002129955,0.0006113822,0.0003376976,0.00009570569,0.0009305007],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8624456,"threshold_uncertainty_score":0.9997255,"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."}}