{"id":"W2052478271","doi":"10.1016/j.jpdc.2010.05.007","title":"Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University; Acadia University","funders":"","keywords":"Computer science; Spanning tree; Wireless sensor network; Minimum spanning tree; Routing (electronic design automation); Kruskal's algorithm; Energy consumption; Heuristic; Distributed minimum spanning tree; Cluster analysis; Tree (set theory); Hierarchical routing; Distributed computing; Connected dominating set; Degree (music); Routing protocol; Static routing; Algorithm; Computer network; Mathematics","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.00117771,0.0002903419,0.0005892122,0.0002162755,0.0003242494,0.0003138214,0.0006647501,0.000243786,0.000002138462],"category_scores_gemma":[0.0001255979,0.0002660362,0.000168428,0.0005283541,0.0001387862,0.0002894571,0.000280759,0.0009774974,3.545095e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007248791,"about_ca_system_score_gemma":0.00008482998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002689361,"about_ca_topic_score_gemma":0.00003439676,"domain_scores_codex":[0.9971849,0.000206324,0.0009888432,0.0004394595,0.0003926045,0.000787879],"domain_scores_gemma":[0.9974071,0.001124217,0.0005813589,0.0002791848,0.0003124923,0.0002956634],"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.0001288416,0.000124153,0.03023746,0.00001584326,0.00004124077,0.00009158075,0.0001451221,0.9281407,0.002145812,0.02019316,0.00008303046,0.01865304],"study_design_scores_gemma":[0.001969815,0.000121178,0.03472446,0.0001814002,0.00001370686,0.0002537684,0.00006158851,0.961892,0.0002386467,0.0001394506,0.0001225478,0.0002814373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4218197,0.00009855963,0.5773066,0.0002766692,0.0003734201,0.00006619041,0.00000956228,0.00004002701,0.000009233968],"genre_scores_gemma":[0.9526663,0.00005192133,0.04664674,0.00007053216,0.0004745673,0.000002575079,0.00006518118,0.00001795945,0.000004234817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5308466,"threshold_uncertainty_score":0.9999792,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01541678113930638,"score_gpt":0.2589145652732349,"score_spread":0.2434977841339285,"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."}}