{"id":"W2134225174","doi":"10.1109/icc.2005.1494964","title":"On constructing minimum-energy path-preserving graphs for ad-hoc wireless networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless ad hoc network; Computer science; Mobile ad hoc network; Computer network; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Path (computing); Vehicular ad hoc network; Wireless; Distributed computing; Telecommunications","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003600382,0.0002736814,0.0002926132,0.0001049218,0.0002438726,0.0002589929,0.001442155,0.0001685101,0.00006603825],"category_scores_gemma":[0.00003385489,0.0002538368,0.0001648946,0.0004548937,0.00006289503,0.0005365398,0.0004417461,0.0002099777,0.0000116056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005656481,"about_ca_system_score_gemma":0.00004533748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001318202,"about_ca_topic_score_gemma":0.0001327672,"domain_scores_codex":[0.9977436,0.00007633513,0.0004278425,0.0007259914,0.0002900837,0.0007361611],"domain_scores_gemma":[0.9976963,0.0008330287,0.0001709045,0.0009928086,0.0001148766,0.000192052],"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.00001853161,0.00004083565,0.00005570583,0.000007046677,0.00002239554,0.00000525763,0.00009172391,0.01959422,0.00006301791,0.5111243,0.01142631,0.4575507],"study_design_scores_gemma":[0.0006043445,0.0001393504,0.00002010927,0.00006180706,0.000006109832,0.00001620841,0.00005090329,0.9769195,0.0004208509,0.00947223,0.01194985,0.0003387148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01550344,0.0004966588,0.9739144,0.0005402533,0.0007956704,0.0002702453,0.000001375377,0.0004449359,0.008033063],"genre_scores_gemma":[0.8682886,0.00008891217,0.1284131,0.00202833,0.0003855855,0.00007525879,0.000005024542,0.00003493463,0.000680199],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9573253,"threshold_uncertainty_score":0.9999914,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0111405937797522,"score_gpt":0.2275152665689545,"score_spread":0.2163746727892023,"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."}}