{"id":"W2221570658","doi":"10.1049/iet-net.2013.0045","title":"Finite‐state Markov modelling for wireless cooperative networks","year":2013,"lang":"en","type":"article","venue":"IET Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Fading; Markov chain; Wireless network; Wireless; Cooperative diversity; Path (computing); Markov model; Maximal-ratio combining; Signal-to-noise ratio (imaging); Scalability; Diversity combining; Computer network; Channel (broadcasting); Machine learning; Telecommunications","routes":{"ca_aff":true,"ca_fund":true,"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.000491159,0.000310411,0.0003403623,0.00007890892,0.0005873508,0.0006351935,0.00142577,0.0001401407,0.00007355873],"category_scores_gemma":[0.0000267294,0.0002895529,0.0001350809,0.0006651211,0.00008490237,0.0007722811,0.0004913648,0.0004444428,0.00004677592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006009246,"about_ca_system_score_gemma":0.00005454464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001402163,"about_ca_topic_score_gemma":0.00002977469,"domain_scores_codex":[0.9978913,0.0002266307,0.0004625285,0.0005609408,0.0001739534,0.0006846549],"domain_scores_gemma":[0.9972192,0.0008927714,0.0001603638,0.0009963223,0.0005292202,0.0002021469],"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.00000913865,0.00003294133,0.00003042411,0.00000347178,0.00002944458,0.000001765559,0.0002455392,0.8612742,0.000005807047,0.01120526,0.01176341,0.1153986],"study_design_scores_gemma":[0.0004598424,0.00007252035,0.00004150124,0.00006208964,0.000006091951,0.000004211231,0.00001619554,0.9920521,0.00001956242,0.0008852198,0.006008768,0.0003718441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001069232,0.001219064,0.9934749,0.001028087,0.0006449716,0.0008895271,0.000001953747,0.0002745322,0.001397714],"genre_scores_gemma":[0.9623187,0.002774988,0.03061866,0.001864698,0.0003845166,0.0004837656,0.00003346864,0.000040506,0.001480708],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9628562,"threshold_uncertainty_score":0.9999557,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03256792284504671,"score_gpt":0.254399413969905,"score_spread":0.2218314911248582,"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."}}