{"id":"W2132388203","doi":"10.1109/tvt.2008.928898","title":"Lexicographically Optimal Routing for Wireless Sensor Networks With Multiple Sinks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Lexicographical order; Wireless sensor network; Computer science; Routing (electronic design automation); Node (physics); Wireless; Mathematical optimization; Commodity; Sink (geography); Computer network; Algorithm; Mathematics; Engineering; Telecommunications; Combinatorics","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.001527175,0.0007657328,0.0009516935,0.0007945422,0.0007718759,0.0009978632,0.001176878,0.0007327484,0.001871045],"category_scores_gemma":[0.003579789,0.0005747111,0.0005208384,0.001335767,0.0009960899,0.00188435,0.001207319,0.0008548826,0.0004748525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001621452,"about_ca_system_score_gemma":0.001901086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0020067,"about_ca_topic_score_gemma":0.003436598,"domain_scores_codex":[0.9990125,0.0004519195,0.00007136732,0.000182205,0.0001804221,0.0001015988],"domain_scores_gemma":[0.9989175,0.000634895,0.0001340483,0.0001326632,0.000123707,0.00005715058],"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.0002689869,0.0000833843,0.0007259154,0.0003160699,0.00004607646,0.0001439551,0.0003105886,0.7520677,0.006188298,0.1370213,0.004028988,0.09879878],"study_design_scores_gemma":[0.00004368626,0.00009365799,0.0001443071,0.00002403857,0.00001308113,0.00007209244,0.0000689284,0.8973488,0.001909327,0.09582673,0.004431964,0.00002334373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01674134,0.0004746331,0.9793068,0.0002904159,0.00004837657,0.00009972855,0.0001063706,0.000295846,0.002636404],"genre_scores_gemma":[0.2222957,0.0007140584,0.7730602,0.000201632,0.00004950472,0.0001955457,0.0003404677,0.0001311556,0.003011789],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0020067,"threshold_uncertainty_score":0.01176453,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007047224449727065,"score_gpt":0.2108578616335326,"score_spread":0.2038106371838055,"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."}}