{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.004815111,0.0002451845,0.0002575748,0.0004195105,0.0006743005,0.0009824213,0.005601953,0.00006291815,0.00006044699],"category_scores_gemma":[0.0005135722,0.0001574775,0.00008325579,0.00298681,0.003765644,0.001486689,0.002682858,0.000635452,0.0001283173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009336718,"about_ca_system_score_gemma":0.0001139794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001542398,"about_ca_topic_score_gemma":0.000001863706,"domain_scores_codex":[0.9956881,0.0004426172,0.0004927978,0.0009394225,0.0013049,0.00113221],"domain_scores_gemma":[0.9966736,0.001389487,0.0001147229,0.001287471,0.0002623661,0.000272365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003605306,0.00003744003,0.0002460461,0.00000673409,0.000002242741,0.000009549073,0.001883782,0.0001918912,0.00164464,0.9481151,0.00001535244,0.04784369],"study_design_scores_gemma":[0.0001864914,0.00006206876,0.001641179,0.00002382594,6.877961e-7,0.00002805581,0.00008240455,0.5162815,0.001286245,0.4802542,0.0000053176,0.000148011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2681039,0.00002891564,0.7266497,0.00198442,0.0002499544,0.0005574345,4.683028e-7,0.000127985,0.002297278],"genre_scores_gemma":[0.8740659,0.000001981285,0.1252251,0.0005702809,0.00004214227,0.00007255121,3.033409e-7,0.00001018293,0.00001147895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6059621,"threshold_uncertainty_score":0.9997782,"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."}}