{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0001838493,0.0001349855,0.000212844,0.0002141143,0.00412206,0.00002996748,0.001547232,0.00006649474,0.00001875303],"category_scores_gemma":[0.000006545133,0.000105754,0.0001105458,0.003667724,0.0004149906,0.0002780345,0.0001450396,0.0004312589,0.000001772589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005521597,"about_ca_system_score_gemma":0.00008178234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007423179,"about_ca_topic_score_gemma":0.002667518,"domain_scores_codex":[0.9987836,0.0004030849,0.0002372964,0.0002259501,0.000203727,0.0001463048],"domain_scores_gemma":[0.9972368,0.0003849398,0.0001422372,0.001767084,0.0004065087,0.00006243023],"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.00003281776,0.0004106915,0.007574828,0.000003322244,0.001099831,4.709599e-7,0.005767684,0.9530663,0.0002019826,0.02020696,0.00007860723,0.01155644],"study_design_scores_gemma":[0.0002857874,0.00006878916,0.017179,0.00002615337,0.0002506353,0.0000109849,0.00006239648,0.9810417,0.0007633076,0.00000791072,0.0001467041,0.000156618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1323246,0.0001079343,0.8660533,0.0009650261,0.00004836166,0.0001536949,0.000004664744,0.00006951606,0.0002728393],"genre_scores_gemma":[0.9895931,0.002975165,0.006986451,0.0002148975,0.000003436234,0.00004400679,0.000002920622,0.000007918123,0.0001720804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8590668,"threshold_uncertainty_score":0.9971744,"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."}}