{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626215,0.002126586,0.002435576,0.001762277,0.0007666255,0.002111147,0.004102122,0.001867602,0.002126543],"category_scores_gemma":[0.01158819,0.001205544,0.001062798,0.002478161,0.001336628,0.003219208,0.002697443,0.002248399,0.0006044153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002646794,"about_ca_system_score_gemma":0.0007541897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002115627,"about_ca_topic_score_gemma":0.002021068,"domain_scores_codex":[0.9985064,0.000529386,0.00005548489,0.0003511636,0.0003948231,0.0001627067],"domain_scores_gemma":[0.9940302,0.004115382,0.0004379826,0.0006737388,0.000411992,0.0003307375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005004933,0.00010168,0.001045769,0.000292809,0.00008224772,0.0001057451,0.0001371616,0.9325082,0.004065094,0.02260663,0.003610676,0.03494346],"study_design_scores_gemma":[0.00001371307,0.00003752804,0.0001657951,0.000013271,0.0000146017,0.00005645474,0.00002836569,0.9671502,0.0008587735,0.03121811,0.0004378379,0.000005364967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2165587,0.002112488,0.7703322,0.0009638453,0.0002252235,0.0001816211,0.0009350636,0.0009880419,0.00770288],"genre_scores_gemma":[0.7134823,0.001251123,0.2775137,0.000241915,0.0002025181,0.0002062716,0.001627204,0.0004080608,0.005067011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004102122,"threshold_uncertainty_score":0.0192039,"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."}}