{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008292707,0.0008886873,0.0005905114,0.0007750962,0.0007410739,0.0006084591,0.001118054,0.000681436,0.001191542],"category_scores_gemma":[0.004741296,0.0003759715,0.0006089938,0.001113566,0.001140903,0.002145308,0.001435436,0.0008850136,0.0003613947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004214732,"about_ca_system_score_gemma":0.0005719584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007483193,"about_ca_topic_score_gemma":0.001035735,"domain_scores_codex":[0.9995616,0.000195798,0.00002264599,0.00006889719,0.000110436,0.00004063496],"domain_scores_gemma":[0.9978061,0.001521798,0.0001499699,0.0002666221,0.0001714766,0.00008398314],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002051779,0.000196526,0.001148441,0.0004843786,0.00008412328,0.0002035662,0.0003778466,0.632886,0.01051052,0.1056677,0.003941527,0.2442942],"study_design_scores_gemma":[0.0000524826,0.0002157441,0.0003698215,0.00003954196,0.00003842295,0.0001361474,0.0001188585,0.7447355,0.005376932,0.2442918,0.004604291,0.00002034499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02920116,0.000351875,0.967572,0.000285364,0.00003090805,0.000100828,0.00007485504,0.0002666618,0.002116304],"genre_scores_gemma":[0.2023473,0.001174793,0.7934551,0.0001268816,0.00007342032,0.0002544333,0.000487684,0.0001424421,0.001937974],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001191542,"threshold_uncertainty_score":0.00438565,"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."}}