{"id":"W2548384668","doi":"10.1109/sahcn.2016.7733003","title":"On Jointly Constructing and Scheduling Multiple Forwarding Trees in Wireless Sensor Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scheduling (production processes); Wireless sensor network; Job shop scheduling; Distributed computing; Schedule; Computer network; Mathematical optimization; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003820152,0.0002274336,0.0002859668,0.0002059091,0.0001290414,0.0001445813,0.0003629234,0.0001286923,0.000006555081],"category_scores_gemma":[0.00014548,0.0001600275,0.00005611968,0.0003797912,0.0001057823,0.0003464014,0.0002597435,0.0001950427,0.000008128265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006820364,"about_ca_system_score_gemma":0.00001828946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003368964,"about_ca_topic_score_gemma":0.0001435969,"domain_scores_codex":[0.9980978,0.0001059402,0.0003556251,0.0006390313,0.0002252897,0.0005763311],"domain_scores_gemma":[0.9978455,0.001436561,0.0001165934,0.0004248175,0.00004724207,0.0001292351],"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.00003337501,0.00006235437,0.05313751,0.000008222753,0.00002542774,0.00006938083,0.0002016663,0.5445054,0.009881141,0.1709109,0.00003380336,0.2211309],"study_design_scores_gemma":[0.00107159,0.00004547005,0.00139765,0.0003029517,0.000002249276,0.00003232298,0.00009960497,0.9921569,0.00435373,0.0002197452,0.00002313321,0.0002946757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5007198,0.00002716773,0.4977027,0.0002596946,0.0002277519,0.00007135262,2.697751e-7,0.0001488999,0.000842306],"genre_scores_gemma":[0.9280989,0.0000358264,0.07147076,0.0001681882,0.00009140535,0.000006508807,3.624266e-7,0.00001906892,0.000108972],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4476515,"threshold_uncertainty_score":0.6525732,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01121503281168209,"score_gpt":0.2129846800809791,"score_spread":0.201769647269297,"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."}}