{"id":"W1994721667","doi":"10.1002/ett.1411","title":"Performance analysis of best‐path selection scheme for multi‐hop amplify‐and‐forward relaying","year":2010,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Memorial University of Newfoundland","keywords":"Cumulative distribution function; Rayleigh fading; Probability density function; Outage probability; Path loss; Fading; Channel (broadcasting); Moment-generating function; Expression (computer science); Channel capacity; Probability of error; Mathematics; Computer science; Selection (genetic algorithm); Statistics; Topology (electrical circuits); Hop (telecommunications); Closed-form expression; Algorithm; Telecommunications; Wireless; Combinatorics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0007042841,0.0001574382,0.0002206904,0.0005133235,0.001036858,0.00009277853,0.001185852,0.0000533009,0.00003952074],"category_scores_gemma":[0.00006094248,0.0001652982,0.0001514827,0.001612434,0.000106162,0.0003644062,0.00005551495,0.0005905334,0.0000210578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002889235,"about_ca_system_score_gemma":0.00004312705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008573575,"about_ca_topic_score_gemma":0.0002303894,"domain_scores_codex":[0.9987067,0.0002627511,0.0004197252,0.0002961501,0.0001189818,0.0001956704],"domain_scores_gemma":[0.9976003,0.0003397089,0.0001810414,0.001491543,0.0002962058,0.00009115534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000480981,0.001962468,0.0044942,0.00006110786,0.001550097,3.49317e-7,0.005543421,0.0167282,0.05957833,0.04115146,0.000194442,0.8686878],"study_design_scores_gemma":[0.0004904707,0.0001450955,0.01623002,0.00003156329,0.0002277929,0.000004751151,0.00007406481,0.9689314,0.001756068,0.00001111761,0.0118372,0.000260448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05559861,0.00009863461,0.9406665,0.0005672979,0.0000892455,0.0002811917,0.00001617635,0.0001655643,0.002516767],"genre_scores_gemma":[0.7204547,0.001332054,0.2777386,0.00008648036,0.000009357004,0.00005070478,0.0000196448,0.00001629215,0.0002921727],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9522032,"threshold_uncertainty_score":0.7974777,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05175647231645616,"score_gpt":0.3003629027905945,"score_spread":0.2486064304741384,"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."}}