{"id":"W2096510011","doi":"10.1109/glocom.2008.ecp.102","title":"Maximum-Lifetime Coding Subgraph for Multicast Traffic in Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear network coding; Multicast; Computer science; Computer network; Network packet; Steiner tree problem; Wireless network; Wireless sensor network; Distributed computing; Coding (social sciences); Wireless; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127715,0.0003674263,0.0003963979,0.0006451781,0.0004422073,0.0005134465,0.0006257524,0.0005757454,0.0007187678],"category_scores_gemma":[0.004634595,0.000176934,0.0003377076,0.0008450485,0.000623656,0.001269798,0.0005475414,0.0004374933,0.00009761454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001272288,"about_ca_system_score_gemma":0.0009261871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001627349,"about_ca_topic_score_gemma":0.001965199,"domain_scores_codex":[0.9995078,0.0002371481,0.00001263539,0.00004465805,0.0001500366,0.00004779002],"domain_scores_gemma":[0.9985378,0.001049364,0.0001314654,0.00009222457,0.0001466862,0.00004257117],"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.00009691677,0.00004292264,0.0007028647,0.00009979194,0.00001768328,0.00008038254,0.0001590341,0.8284279,0.007908707,0.113991,0.001355503,0.04711727],"study_design_scores_gemma":[0.000004691408,0.00002222201,0.0001490479,0.000006221333,0.00000404587,0.00003254114,0.00001956652,0.9685472,0.001296545,0.02948246,0.0004308159,0.000004514274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1095749,0.0004480604,0.8861303,0.0005213339,0.00001648821,0.00004747385,0.00008058632,0.0001705554,0.00301026],"genre_scores_gemma":[0.9198503,0.0005602438,0.07768084,0.00007181263,0.00003627883,0.0001456392,0.0001680046,0.00006630494,0.001420624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001627349,"threshold_uncertainty_score":0.00923115,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04532337336681537,"score_gpt":0.2739400625564971,"score_spread":0.2286166891896817,"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."}}