{"id":"W2014692197","doi":"10.1007/s11276-006-6147-8","title":"A Constraint Formulation for Minimum-Energy Multicast Routing in Wireless Multihop Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Multicast; Distributed computing; Integer programming; Heuristic; Ad hoc wireless distribution service; Energy consumption; Relay; Routing (electronic design automation); Wireless; Optimized Link State Routing Protocol; Routing protocol; Algorithm; 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.0008687206,0.0006469596,0.0007884384,0.0002311465,0.0003676465,0.0004103522,0.00126143,0.0006403704,0.00001027766],"category_scores_gemma":[0.00002729081,0.0006872066,0.0002940523,0.001134466,0.0001324231,0.0007437594,0.0004124179,0.0006123348,0.000005034071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003078956,"about_ca_system_score_gemma":0.000108172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002220476,"about_ca_topic_score_gemma":0.002030731,"domain_scores_codex":[0.9949479,0.0002197218,0.001330695,0.001320845,0.0004407839,0.001740091],"domain_scores_gemma":[0.9967908,0.001112288,0.0005449794,0.001070629,0.0002364997,0.0002448237],"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.0001037084,0.0002311423,0.001731178,0.00002127961,0.00003084157,0.00005029517,0.0001504589,0.4754481,0.0001019231,0.1671738,0.0009151485,0.3540421],"study_design_scores_gemma":[0.002774932,0.0001139996,0.002145276,0.0002518005,0.00001858184,0.00002753825,0.00004579119,0.9915033,0.0000670628,0.0009627396,0.001319862,0.0007691292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03804222,0.0009191949,0.9577292,0.0001962443,0.001148474,0.001021264,0.000005993349,0.0004545106,0.0004829555],"genre_scores_gemma":[0.9810476,0.0001639344,0.01644534,0.0003565003,0.001119456,0.0004866425,0.0001245584,0.0001003431,0.0001556121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9430054,"threshold_uncertainty_score":0.9995579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01100072351455254,"score_gpt":0.2308510834784031,"score_spread":0.2198503599638506,"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."}}