{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567632,0.001011889,0.001662383,0.0009508826,0.001116024,0.001778541,0.003230549,0.001112502,0.004810166],"category_scores_gemma":[0.006697503,0.000641868,0.0009973919,0.00175684,0.001105249,0.003770151,0.004089763,0.002134984,0.001730951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001705097,"about_ca_system_score_gemma":0.001770876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001757272,"about_ca_topic_score_gemma":0.00242932,"domain_scores_codex":[0.9981205,0.0004800525,0.00009841473,0.000602011,0.0004249974,0.0002740699],"domain_scores_gemma":[0.9967813,0.001600299,0.0002972653,0.0008301786,0.0002487056,0.0002421196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00122552,0.0005583706,0.002040268,0.001139605,0.0001800173,0.0002448485,0.001045917,0.493806,0.02685676,0.1084135,0.02132935,0.3431599],"study_design_scores_gemma":[0.0003192948,0.0003636746,0.0007080403,0.00007353322,0.0000796575,0.0002615558,0.0001843342,0.858926,0.01006015,0.1145729,0.01440563,0.0000452088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03308708,0.000540604,0.9578513,0.0006655183,0.00005794986,0.0002036597,0.0002727197,0.001903857,0.005417283],"genre_scores_gemma":[0.3587496,0.0005180796,0.6310019,0.0003645759,0.000103281,0.0006617763,0.001450881,0.0005302213,0.006619663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004810166,"threshold_uncertainty_score":0.01609159,"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."}}