{"id":"W2116958737","doi":"10.1109/icc.2011.5962490","title":"Range of Achievable Diversity Order in Multiple Relay Networks with Multiple Users","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Upper and lower bounds; Cooperative diversity; Diversity (politics); Signal-to-noise ratio (imaging); Order (exchange); Computer science; Selection (genetic algorithm); Diversity gain; Range (aeronautics); Relay channel; Computer network; Outage probability; Telecommunications; Topology (electrical circuits); Mathematics; Fading; Wireless; Physics; Combinatorics; Engineering; Power (physics); Wireless network; Business; Decoding methods","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.003549327,0.001054687,0.001351543,0.001094259,0.0008273398,0.002042325,0.0008984957,0.001049635,0.0009359791],"category_scores_gemma":[0.0218596,0.0007765738,0.000559183,0.0009473888,0.00182282,0.002737262,0.002010209,0.001257422,0.0003201276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244211,"about_ca_system_score_gemma":0.0007702704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006669002,"about_ca_topic_score_gemma":0.000403525,"domain_scores_codex":[0.9965306,0.001383865,0.0001280212,0.0002795537,0.001158892,0.000519049],"domain_scores_gemma":[0.9739458,0.022681,0.001025374,0.0009459247,0.001056952,0.0003447889],"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.0007243216,0.00009371528,0.003388514,0.0003135259,0.0001358557,0.0009793591,0.0006529055,0.8063785,0.02259381,0.1403612,0.0006249464,0.02375328],"study_design_scores_gemma":[0.00006582908,0.0003878919,0.001370757,0.0001174945,0.00005356462,0.001238666,0.0002256665,0.8593991,0.01518839,0.1200233,0.001836437,0.00009298098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3836238,0.006493163,0.5768306,0.00091757,0.00004900303,0.00007853255,0.0002283579,0.000513457,0.03126548],"genre_scores_gemma":[0.9841659,0.001178191,0.01374523,0.00005321768,0.0000417955,0.00006441544,0.00006332184,0.00003016089,0.0006578143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003549327,"threshold_uncertainty_score":0.01877081,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06417028442210491,"score_gpt":0.2299703879976839,"score_spread":0.1658001035755789,"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."}}