{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002319149,0.0008963738,0.000826003,0.000700694,0.0005859302,0.001187933,0.0006364122,0.0008276677,0.001032648],"category_scores_gemma":[0.006337588,0.0002909179,0.0003896088,0.0005835112,0.001057131,0.0009017289,0.000895666,0.0004895299,0.0002049072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00148002,"about_ca_system_score_gemma":0.0009871564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002962409,"about_ca_topic_score_gemma":0.002622721,"domain_scores_codex":[0.9982868,0.0007303513,0.00005052339,0.0001458677,0.0005754612,0.0002108782],"domain_scores_gemma":[0.994552,0.003827932,0.0004515958,0.0002931553,0.0007987863,0.00007663549],"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.000398045,0.00005913533,0.002424099,0.0001781207,0.0001183313,0.0005145225,0.0003019101,0.9091227,0.02667869,0.0312233,0.0006967175,0.02828447],"study_design_scores_gemma":[0.00001026198,0.00009757236,0.0005112236,0.00001311547,0.00002780446,0.0001742701,0.00003747459,0.991683,0.004570797,0.002658153,0.0001993307,0.00001696864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4348683,0.002746151,0.5518178,0.0005297294,0.00006939726,0.0000714176,0.000141524,0.0004798756,0.009275719],"genre_scores_gemma":[0.9906241,0.0003735942,0.008204557,0.00002328561,0.0000166302,0.00001525475,0.00002907897,0.00001468336,0.0006988316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002962409,"threshold_uncertainty_score":0.01226497,"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."}}