{"id":"W2095699525","doi":"10.1109/twc.2008.061041","title":"Diversity order analysis of the decode-and-forward cooperative networks with relay selection","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":148,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Upper and lower bounds; Selection (genetic algorithm); Cooperative diversity; Maximal-ratio combining; Overhead (engineering); Computer science; Bounded function; Diversity combining; Bit error rate; Order (exchange); Telecommunications; Mathematics; Algorithm; Mathematical optimization; Decoding methods; Power (physics); Fading; Artificial intelligence","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.001605499,0.0006880492,0.0007469353,0.001176753,0.0006526622,0.000926621,0.0006392983,0.0006180454,0.001551038],"category_scores_gemma":[0.006917756,0.0003862361,0.000363877,0.0008062995,0.001247564,0.001360905,0.000873557,0.0009919329,0.0004137699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001890397,"about_ca_system_score_gemma":0.00146501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003339712,"about_ca_topic_score_gemma":0.002092286,"domain_scores_codex":[0.9989993,0.0002538027,0.00003224963,0.00008012453,0.0004567965,0.0001777093],"domain_scores_gemma":[0.9941021,0.00371943,0.0004954702,0.0002847793,0.001206149,0.0001921104],"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.0002880647,0.00007095263,0.002600864,0.0001865307,0.00004567127,0.000405059,0.0004685288,0.686061,0.01723749,0.2729939,0.001691378,0.01795056],"study_design_scores_gemma":[0.00001904388,0.00008157258,0.0008353477,0.00002494508,0.00001568136,0.0001897055,0.00007094945,0.9391016,0.003068704,0.05576585,0.0007930144,0.00003345096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2809814,0.002249674,0.6818089,0.0009202116,0.00006740666,0.0001005153,0.0003659174,0.0001980778,0.03330789],"genre_scores_gemma":[0.9753339,0.001281916,0.01872905,0.0001267703,0.00007554029,0.0001006411,0.0001568532,0.00003864838,0.004156654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003339712,"threshold_uncertainty_score":0.0137158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03450173950108613,"score_gpt":0.2570138841348498,"score_spread":0.2225121446337636,"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."}}