{"id":"W3160406857","doi":"10.5121/ijasuc.2021.12201","title":"Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"article","venue":"International Journal of Ad hoc Sensor & Ubiquitous Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Wireless ad hoc network; Network packet; Optimized Link State Routing Protocol; Node (physics); Routing protocol; Throughput; Distributed computing; Bandwidth (computing); Wireless; Telecommunications; Engineering","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.001096054,0.0003993088,0.0006385427,0.0003054423,0.0002498915,0.0007147032,0.002369121,0.0002160738,0.00005162262],"category_scores_gemma":[0.0003103019,0.0004055009,0.0006075243,0.000477663,0.0001147788,0.0005355111,0.0006956501,0.0007717563,0.00001062418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003176752,"about_ca_system_score_gemma":0.0003553657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001122267,"about_ca_topic_score_gemma":0.000006749413,"domain_scores_codex":[0.9957986,0.0002437668,0.001466851,0.000653912,0.001090035,0.0007468021],"domain_scores_gemma":[0.9941328,0.001505158,0.001295537,0.0005737144,0.00216471,0.000328136],"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.000207061,0.0002302695,0.0001121847,0.00001765945,0.0005031482,0.001313012,0.001024132,0.3941471,0.001310824,0.001888906,0.004453362,0.5947923],"study_design_scores_gemma":[0.002950424,0.0007302438,0.0003792876,0.0005110481,0.00006396939,0.004307998,0.000553212,0.8622962,0.001729009,0.0008796316,0.1249714,0.0006276151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1050928,0.00984819,0.8758854,0.001794334,0.006120353,0.0003811345,0.00001371758,0.0001590244,0.0007050764],"genre_scores_gemma":[0.736705,0.000855642,0.2561986,0.001805674,0.003951704,0.00001236784,0.00002566766,0.00007866549,0.0003666365],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6316122,"threshold_uncertainty_score":0.9998397,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0125104412385799,"score_gpt":0.2680211108180769,"score_spread":0.255510669579497,"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."}}