{"id":"W1719847780","doi":"10.1007/978-3-642-38768-5_24","title":"Approximating the Minimum Independent Dominating Set in Perturbed Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Independent set; Graph; Discrete mathematics; Approximation algorithm; Running time; Time complexity; Simple (philosophy); 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","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002307583,0.0006910594,0.0006823339,0.001199942,0.0005456554,0.001202395,0.006294125,0.0003577973,0.00004507455],"category_scores_gemma":[0.0002340904,0.000517222,0.0002234752,0.001345835,0.001046508,0.0008234231,0.002918228,0.001887961,0.00004497238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002711218,"about_ca_system_score_gemma":0.0003540358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000119619,"about_ca_topic_score_gemma":0.0002095977,"domain_scores_codex":[0.9946523,0.0001164982,0.0009604194,0.001783529,0.001467908,0.00101931],"domain_scores_gemma":[0.9958135,0.001492778,0.0005038059,0.001812609,0.0002188555,0.0001583897],"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.000003760778,0.00004666339,0.0001234401,0.00006563273,0.00001583771,0.00009948976,0.005623082,0.007744831,0.00009997287,0.09008908,0.00003856115,0.8960497],"study_design_scores_gemma":[0.0002657451,0.0000661064,0.0002444168,0.0003792654,0.000003785693,0.00007756079,0.000002521271,0.6264696,0.0001783616,0.3715393,0.0002461358,0.0005272493],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001087134,0.0004867428,0.9899627,0.001389571,0.001757106,0.000834682,0.000004549479,0.0001461078,0.004331399],"genre_scores_gemma":[0.3608237,0.00004974645,0.6354279,0.002647351,0.0004904213,0.00008055242,0.00000749036,0.00006265529,0.000410206],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8955224,"threshold_uncertainty_score":0.9998345,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02306009861298433,"score_gpt":0.2452592815605292,"score_spread":0.2221991829475449,"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."}}