{"id":"W2167040808","doi":"10.1109/tcomm.2009.09.070595","title":"Relay ordering in a multi-hop cooperative diversity network","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Hop (telecommunications); Expression (computer science); Algorithm; Computer science; Computational complexity theory; Signal-to-noise ratio (imaging); Bit error rate; Diversity combining; Outage probability; Cooperative diversity; Probability of error; Selection (genetic algorithm); Mathematics; Mathematical optimization; Telecommunications; Decoding methods; 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.001068904,0.0004290029,0.0006363622,0.0004353931,0.000469639,0.0006109311,0.0006662396,0.0005654419,0.0005407584],"category_scores_gemma":[0.002351634,0.0003164375,0.0001992496,0.0005791202,0.0005929922,0.001227552,0.0007079796,0.0004937005,0.0002055614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006304234,"about_ca_system_score_gemma":0.000577938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009446655,"about_ca_topic_score_gemma":0.001191875,"domain_scores_codex":[0.9989977,0.0004696243,0.0000424943,0.0001307773,0.0002492206,0.0001101174],"domain_scores_gemma":[0.9989686,0.000525886,0.000140333,0.0001649995,0.0001524576,0.00004781953],"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.0002846346,0.00004623688,0.0007858031,0.00006652258,0.00002114377,0.0002380569,0.0002272025,0.8640791,0.01561608,0.0328923,0.0006922428,0.08505061],"study_design_scores_gemma":[0.00002003114,0.00008885148,0.0001222835,0.00000528398,0.000008405052,0.00008991255,0.00002401278,0.9835958,0.004412121,0.0108302,0.0007926348,0.00001037309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07443146,0.0004648018,0.9228842,0.0001205621,0.00001930585,0.00003271832,0.00002282319,0.0001887894,0.001835327],"genre_scores_gemma":[0.7962779,0.0002646373,0.2017163,0.0000549358,0.00002005871,0.00004934431,0.00003762993,0.00002483442,0.001554353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001068904,"threshold_uncertainty_score":0.005652964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0871327742830498,"score_gpt":0.3105994923613186,"score_spread":0.2234667180782688,"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."}}