{"id":"W4206830864","doi":"10.1016/j.dam.2021.07.005","title":"Parameterized algorithms for the Happy Set problem","year":2021,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Parameterized complexity; Mathematics; Undirected graph; Vertex (graph theory); Graph; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0006704067,0.0002020478,0.0002806483,0.00004508817,0.0002944947,0.0002950219,0.001229545,0.00006402904,0.0000219832],"category_scores_gemma":[0.0001494776,0.0001356452,0.0001408488,0.0005020332,0.0001318901,0.0001481494,0.0005055388,0.0001844112,0.00005081348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000241489,"about_ca_system_score_gemma":0.00008323777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.792477e-7,"about_ca_topic_score_gemma":0.000001288028,"domain_scores_codex":[0.9983016,0.00003015658,0.0003405641,0.0004346732,0.0004101564,0.0004828232],"domain_scores_gemma":[0.9968223,0.00155067,0.0001305172,0.001268733,0.0001325357,0.00009526697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009540919,0.00004854636,5.537194e-7,0.0001195874,0.00006053453,0.000005646991,0.001303755,0.0001108781,0.007601416,0.9762574,0.0004482776,0.01403384],"study_design_scores_gemma":[0.0005405786,0.00003424276,0.00000363391,0.00002802376,0.0000228661,0.0000244003,0.0006898662,0.1199075,0.0200485,0.8518598,0.0065889,0.0002516559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003625311,0.0001147909,0.9936067,0.0009842819,0.00007641497,0.0009927159,0.00002565861,0.0001578444,0.003679088],"genre_scores_gemma":[0.01434683,0.00003466541,0.9838215,0.0002510854,0.00005042721,0.0008385458,0.00001551012,0.00003539247,0.0006060645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1243976,"threshold_uncertainty_score":0.5531452,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05288598446721245,"score_gpt":0.3275477432066388,"score_spread":0.2746617587394263,"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."}}