{"id":"W1780992783","doi":"10.1007/978-0-387-35608-2_11","title":"Symmetric Connectivity with Minimum Power Consumption in Radio Networks","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Wireless ad hoc network; Unicast; Computer science; Wireless network; Approximation algorithm; Shortest path problem; Topology (electrical circuits); Graph; Wireless; Network packet; Mathematical optimization; Mathematics; Algorithm; Computer network; Theoretical computer science; Combinatorics; Telecommunications","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003868426,0.0005684349,0.0006943229,0.0005866336,0.0000693753,0.0001853943,0.0009695843,0.0006400255,0.001241589],"category_scores_gemma":[0.00001375461,0.0004959261,0.0001307028,0.0003299921,0.0001343079,0.0003889315,0.0003111065,0.000974031,0.0003302016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002711391,"about_ca_system_score_gemma":0.00005181578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002159223,"about_ca_topic_score_gemma":0.0001474186,"domain_scores_codex":[0.9972324,0.0000633243,0.000482275,0.001133623,0.000508073,0.0005803406],"domain_scores_gemma":[0.9975615,0.0005289553,0.0003131403,0.001320918,0.00008831543,0.0001871962],"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.00002693481,0.00007893422,0.0009191276,0.00002464386,0.00009321734,0.0003751998,0.00006204224,0.003688759,3.646659e-7,0.9567608,0.01273322,0.02523678],"study_design_scores_gemma":[0.003406984,0.001126465,0.005507454,0.001003793,0.00009405748,0.0005452571,0.000004124365,0.8554384,0.000007876065,0.01062838,0.1186599,0.003577398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00009472297,0.001530866,0.3708948,0.00008596302,0.0005597053,0.0006507817,0.000001881022,0.0002700211,0.6259112],"genre_scores_gemma":[0.3693198,0.00162494,0.01061073,0.0009658035,0.0004493765,0.00009887194,0.00002198813,0.0001853257,0.6167231],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9461324,"threshold_uncertainty_score":0.9997492,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01745053382231488,"score_gpt":0.2107557105450149,"score_spread":0.1933051767227,"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."}}