{"id":"W2155950678","doi":"10.1109/glocom.2009.5425456","title":"Optimum/Sub-Optimum Detection for Multi-Branch Cooperative Diversity Networks with Limited CSI","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Channel state information; Relay; Computer science; Cooperative diversity; Independent and identically distributed random variables; Overhead (engineering); Signal-to-noise ratio (imaging); Algorithm; Maximal-ratio combining; Path (computing); Mathematical optimization; Mathematics; Telecommunications; Wireless; Statistics; Random variable; Decoding methods; Fading; Computer network; Power (physics)","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.002434992,0.0005258677,0.0008362214,0.0005169104,0.0003189165,0.0009780718,0.0007115211,0.0009384258,0.0006547453],"category_scores_gemma":[0.01165572,0.0005251244,0.0003690847,0.0006321776,0.00119808,0.001757274,0.0009110725,0.0008872839,0.0002676502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006017046,"about_ca_system_score_gemma":0.000572258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004878136,"about_ca_topic_score_gemma":0.0005316961,"domain_scores_codex":[0.9983359,0.000720712,0.00005935161,0.0001665624,0.0005480826,0.0001694544],"domain_scores_gemma":[0.9916934,0.006680572,0.0006268295,0.0003591547,0.0005533178,0.0000867336],"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.0002184153,0.00006237863,0.001185644,0.0001578437,0.00004995866,0.0002738941,0.0002273975,0.8782062,0.01151663,0.06089756,0.0006178265,0.04658628],"study_design_scores_gemma":[0.00001073507,0.00003876837,0.0001578962,0.000007722952,0.000006727309,0.0001042165,0.00001497515,0.9833956,0.00232835,0.01373457,0.0001919535,0.000008562187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06649122,0.000774555,0.9300656,0.0002268027,0.00001605127,0.00001992607,0.00002422896,0.00008556495,0.002296012],"genre_scores_gemma":[0.8375726,0.0007493133,0.1604125,0.0000920311,0.00005041792,0.00005240435,0.00004661446,0.0000347304,0.0009894082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002434992,"threshold_uncertainty_score":0.01287764,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04916008592958765,"score_gpt":0.2697308120402354,"score_spread":0.2205707261106478,"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."}}