{"id":"W2014492395","doi":"10.1109/wcnc.2010.5506390","title":"Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Wireless ad hoc network; Connected dominating set; Locality; Distributed algorithm; Algorithm; Routing (electronic design automation); Flexibility (engineering); Set (abstract data type); Distributed computing; Computer network; Minimum spanning tree; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0007396938,0.0001657931,0.0002071317,0.00009302665,0.0001029554,0.0001398905,0.0008025531,0.0001525203,0.00003896487],"category_scores_gemma":[0.0001087398,0.0001491571,0.00006673868,0.0005260927,0.00003997838,0.0001018338,0.0002664484,0.000367388,0.00001362781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003238725,"about_ca_system_score_gemma":0.00004388972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001024481,"about_ca_topic_score_gemma":0.0002877559,"domain_scores_codex":[0.9983857,0.00004365669,0.000321683,0.0005168007,0.0001814366,0.0005507007],"domain_scores_gemma":[0.9984627,0.0006231767,0.00009491013,0.0005945082,0.0001075121,0.0001172435],"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.00001543969,0.0001547638,0.0002035068,0.00001114448,0.00001104999,0.00001969636,0.0004566702,0.1043653,0.0006348707,0.03334369,0.001586654,0.8591972],"study_design_scores_gemma":[0.0008647544,0.00006471843,0.001033168,0.00001591905,0.000002078503,0.00001090268,0.00001688626,0.9951025,0.0002432087,0.0005066383,0.001934919,0.0002042614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08944661,0.0001539358,0.9067672,0.0003182471,0.001391258,0.0006596309,0.000001114201,0.0002234031,0.001038624],"genre_scores_gemma":[0.716382,0.000004912305,0.2828841,0.0002947023,0.0001237742,0.0001482352,0.00000406875,0.00001496608,0.0001432401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8907372,"threshold_uncertainty_score":0.608245,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01173975342600944,"score_gpt":0.2585781266881421,"score_spread":0.2468383732621326,"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."}}