{"id":"W3002002006","doi":"10.1007/978-3-030-39881-1_27","title":"Parameterized Algorithms for the Happy Set Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parameterized complexity; Combinatorics; Undirected graph; Vertex (graph theory); Mathematics; Graph; Vertex cover; Discrete mathematics; Clique; Set (abstract data type); Integer (computer science); Computer science; Algorithm","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.001597983,0.0005991702,0.0006150063,0.0004712649,0.0005655517,0.0008541381,0.007574693,0.0002600839,0.00001397811],"category_scores_gemma":[0.0003235818,0.0004244499,0.0002657033,0.0009748553,0.001398916,0.0005771674,0.002326217,0.001139604,0.00004681693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001866205,"about_ca_system_score_gemma":0.0005795005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006437686,"about_ca_topic_score_gemma":0.00001325651,"domain_scores_codex":[0.9951864,0.00006575336,0.0005476834,0.00198843,0.001251754,0.0009599397],"domain_scores_gemma":[0.9938033,0.003393941,0.00028523,0.001928659,0.0003388422,0.0002500759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003382656,0.00001506544,0.000003274839,0.00006091263,0.00003265257,0.00004780968,0.0007383597,0.01480629,0.0002298345,0.1367467,0.00009000483,0.8471953],"study_design_scores_gemma":[0.0002567207,0.0002273326,0.000003998221,0.0001060672,0.000006368148,0.00003071479,1.830897e-7,0.4928971,0.0006270647,0.497974,0.007484173,0.0003862823],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000002354187,0.0005399878,0.9905806,0.005155785,0.001014962,0.001746505,0.00002773663,0.0002192306,0.0007127955],"genre_scores_gemma":[0.006769638,0.00006627032,0.9892376,0.002745822,0.0005278894,0.0001513216,0.00000730837,0.0000636352,0.0004305093],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.846809,"threshold_uncertainty_score":0.9998207,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05112185459821832,"score_gpt":0.3106082458598953,"score_spread":0.2594863912616769,"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."}}