{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003942091,0.002591893,0.002328216,0.002201551,0.001640064,0.002838849,0.004261451,0.00228226,0.004055031],"category_scores_gemma":[0.01481121,0.001272539,0.001240684,0.003678151,0.001684106,0.003690761,0.00378783,0.002486155,0.001541322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002432873,"about_ca_system_score_gemma":0.002002031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001785508,"about_ca_topic_score_gemma":0.002959698,"domain_scores_codex":[0.9961516,0.001638981,0.0002880745,0.0006172043,0.001055674,0.0002484201],"domain_scores_gemma":[0.9945804,0.003785714,0.0003260301,0.0005722033,0.0005940125,0.0001415039],"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.0001215558,0.000127463,0.0002829884,0.0004880871,0.0001067833,0.0001017358,0.0002772049,0.7075536,0.001298696,0.1027402,0.008414482,0.1784873],"study_design_scores_gemma":[0.0001164359,0.00008191819,0.00006976462,0.00004713637,0.00003039602,0.0001079004,0.00007566958,0.8521891,0.0007881726,0.1387696,0.007701941,0.00002198623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002075638,0.000813427,0.9935395,0.0002241043,0.0001006309,0.0002741422,0.0001065794,0.0004094937,0.002456526],"genre_scores_gemma":[0.08509999,0.001160676,0.9083154,0.0002068224,0.0001776476,0.001270402,0.0005298813,0.0002069374,0.003032201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004261451,"threshold_uncertainty_score":0.02084798,"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."}}