{"id":"W3187834769","doi":"10.4230/lipics.disc.2021.13","title":"A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Air Force Office of Scientific Research; Institute for Basic Science; Agence Nationale de la Recherche; National Science Foundation","keywords":"Dominating set; Mathematics; Vertex (graph theory); Combinatorics; Approximation algorithm; Constant (computer programming); Graph; Independent set; Discrete mathematics; Degree (music); Algorithm; Computer science; Physics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001943289,0.0009886905,0.001194311,0.0006877553,0.0007144838,0.001888876,0.004529511,0.0007041583,0.00001634039],"category_scores_gemma":[0.0001039224,0.0008088595,0.001028136,0.0008112593,0.0003654189,0.001287868,0.003801627,0.001810799,0.00001508325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002743825,"about_ca_system_score_gemma":0.0004198116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001271312,"about_ca_topic_score_gemma":0.0002038716,"domain_scores_codex":[0.9942027,0.0001300686,0.002313567,0.000953425,0.0009266137,0.001473617],"domain_scores_gemma":[0.9949066,0.001061258,0.001069142,0.002108041,0.0006005364,0.00025444],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001137889,0.001002845,0.0006730236,0.004739804,0.001168879,0.00008461754,0.05952198,0.003566695,0.000007619141,0.03040959,0.009509184,0.889202],"study_design_scores_gemma":[0.002945212,0.0001990511,0.0001512564,0.001023883,0.00008099948,0.0001051048,0.003026175,0.9510344,0.0001762485,0.01776526,0.02241655,0.001075851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002984049,0.0003899677,0.9857943,0.001112941,0.003136704,0.004103625,0.001675947,0.0002517122,0.0005507542],"genre_scores_gemma":[0.04989778,0.0002307655,0.9417846,0.002036005,0.0004430827,0.002870374,0.002349498,0.0001288917,0.0002590094],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9474677,"threshold_uncertainty_score":0.9994362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0237182243147758,"score_gpt":0.2742524588576999,"score_spread":0.2505342345429241,"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."}}