{"id":"W2550370761","doi":"10.1109/sahcn.2006.288529","title":"A Distributed Min-Max Tree Algorithm for Maximum-Lifetime Multicast in Resource-limited Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Scalability; Distributed computing; Wireless sensor network; Node (physics); Wireless network; Algorithm; Wireless ad hoc network; Distributed algorithm; Overhead (engineering); Bandwidth (computing); Wireless; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001218526,0.0007422359,0.001130028,0.0006459062,0.0008740187,0.0006916476,0.001858867,0.001005711,0.001778802],"category_scores_gemma":[0.002193435,0.0003745301,0.0004847867,0.0009650816,0.0004372588,0.002160545,0.001204106,0.0008996196,0.0004978304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007296146,"about_ca_system_score_gemma":0.0009921782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009495739,"about_ca_topic_score_gemma":0.001558634,"domain_scores_codex":[0.9995024,0.0001736789,0.00002506233,0.00009300299,0.0001544402,0.00005145153],"domain_scores_gemma":[0.9994118,0.0003104366,0.00006645958,0.00007363888,0.00009251124,0.00004516186],"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.0005493965,0.0002332428,0.0006823241,0.0003143233,0.0001068224,0.0001547409,0.0002394411,0.5336385,0.008625788,0.04022216,0.009906888,0.4053264],"study_design_scores_gemma":[0.00009124711,0.0001173847,0.00009599474,0.00001510505,0.0000189654,0.00009151788,0.00003335083,0.9715911,0.00166451,0.02250956,0.00375627,0.00001491086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005615386,0.0003583018,0.9920793,0.0001674647,0.00003875106,0.00005694652,0.00005362932,0.0005407051,0.001089617],"genre_scores_gemma":[0.1742377,0.0004142903,0.8223515,0.0001759455,0.00008599564,0.0002816067,0.000232841,0.0001243624,0.002095718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001858867,"threshold_uncertainty_score":0.006444275,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007972831279504206,"score_gpt":0.2137334632735627,"score_spread":0.2057606319940585,"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."}}