{"id":"W2798046670","doi":"10.1016/j.jnca.2018.04.005","title":"A Pareto optimization-based approach to clustering and routing in Wireless Sensor Networks","year":2018,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cluster analysis; Routing protocol; Scalability; Wireless sensor network; Routing (electronic design automation); Multi-objective optimization; Node (physics); Throughput; Protocol (science); Energy consumption; Mathematical optimization; Tree (set theory); Distributed computing; Wireless; Computer network; Mathematics; Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.0004699382,0.0001711057,0.0002885754,0.0001666594,0.0002301579,0.0002396847,0.0004600647,0.00008678564,5.736414e-7],"category_scores_gemma":[0.000003635949,0.0001622721,0.00004316885,0.0008894246,0.00007335885,0.0001621546,0.0002489753,0.0002298378,6.080703e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003909495,"about_ca_system_score_gemma":0.00003756572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000547192,"about_ca_topic_score_gemma":0.0000106998,"domain_scores_codex":[0.9985015,0.00009558765,0.0005208749,0.0003458048,0.0001866832,0.0003495511],"domain_scores_gemma":[0.9988081,0.0002028994,0.0002717824,0.0003048057,0.0002035716,0.0002088754],"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.00001066841,0.00005620954,0.00154389,0.000006003924,0.00001117758,0.000002589874,0.0001690568,0.9756053,0.000002447539,0.00408729,0.0001737511,0.01833162],"study_design_scores_gemma":[0.0003666799,0.000101954,0.00144714,0.00009982178,0.000008132384,0.00007444758,0.00001440424,0.9971843,0.000002620868,0.00004356643,0.0004877435,0.0001691647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005219842,0.0001283034,0.9936464,0.0002949495,0.0001758155,0.0002344257,2.837075e-7,0.0000400891,0.000259848],"genre_scores_gemma":[0.5691046,0.00002929952,0.4294546,0.0004944099,0.0008862308,0.00001527559,0.000001080072,0.00001062421,0.00000395262],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5641919,"threshold_uncertainty_score":0.6617264,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01021365977976214,"score_gpt":0.2218821629897865,"score_spread":0.2116685032100244,"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."}}