{"id":"W2039459495","doi":"10.1016/j.tcs.2013.11.010","title":"Approximating the minimum independent dominating set in perturbed graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dominating set; Mathematics; Combinatorics; Set (abstract data type); Maximal independent set; Independent set; Discrete mathematics; Chordal graph; Computer science; Graph; 1-planar graph; Vertex (graph theory)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537614,0.001687933,0.002023474,0.001908005,0.0008087291,0.002147958,0.003134396,0.001821567,0.001692448],"category_scores_gemma":[0.0126543,0.001049504,0.0007934153,0.001972554,0.001279369,0.002769476,0.002262819,0.001852696,0.000411192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002440531,"about_ca_system_score_gemma":0.0007587199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00243039,"about_ca_topic_score_gemma":0.002406708,"domain_scores_codex":[0.9987301,0.000442016,0.00004630748,0.0002945172,0.0003268046,0.0001602634],"domain_scores_gemma":[0.9928995,0.005024028,0.0005661949,0.0006110816,0.0004875551,0.0004115638],"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.0007535669,0.0001392646,0.002231383,0.0002860386,0.00009199964,0.0001663244,0.0002050155,0.9429929,0.005548942,0.01972643,0.002535335,0.02532293],"study_design_scores_gemma":[0.00001819039,0.00004603025,0.0003069929,0.00001355086,0.00001606058,0.00006822828,0.0000571491,0.9703265,0.001171981,0.02763601,0.0003338261,0.000005390437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4930689,0.001442061,0.4960995,0.001137122,0.0001488678,0.0001568474,0.000939783,0.0007082497,0.006298733],"genre_scores_gemma":[0.8634132,0.0005674815,0.1318968,0.0001628472,0.00007996376,0.0001080493,0.001063549,0.0001741201,0.002534021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003134396,"threshold_uncertainty_score":0.01770735,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01554768930987973,"score_gpt":0.2804480771253872,"score_spread":0.2649003878155075,"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."}}