{"id":"W2109825376","doi":"10.1109/twc.2011.030311.100589","title":"Low Complexity Selection Cooperation Techniques Using Information Accumulation in Dual-Hop Relaying Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Relay; Hop (telecommunications); Computer science; Fading; Transmission (telecommunications); Signal-to-noise ratio (imaging); Algorithm; Outage probability; Decoding methods; Mathematics; Topology (electrical circuits); Computer network; Telecommunications; Physics; Combinatorics","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.001732078,0.0005898797,0.0006142254,0.0006738055,0.0004644875,0.000868173,0.0009121821,0.0005222482,0.0003864513],"category_scores_gemma":[0.003237932,0.0003124531,0.0003456776,0.0005773558,0.001138825,0.001010115,0.001400446,0.0005554781,0.0001179219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007183686,"about_ca_system_score_gemma":0.0006629425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005751788,"about_ca_topic_score_gemma":0.0006059019,"domain_scores_codex":[0.9991741,0.000378675,0.00004135712,0.0000805895,0.0002449437,0.00008039238],"domain_scores_gemma":[0.9977921,0.001419052,0.0002991782,0.0002409811,0.000186669,0.00006203259],"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.0004374842,0.0001370768,0.001394241,0.0001977661,0.00007494729,0.0004231381,0.0005332147,0.7107036,0.0440685,0.1124502,0.0009513366,0.1286285],"study_design_scores_gemma":[0.00004039683,0.0002247883,0.0001894074,0.00001508479,0.00002518257,0.0001973014,0.00003752765,0.9765371,0.007678594,0.01403141,0.0009955988,0.000027689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.106175,0.0007137269,0.8884382,0.0001952601,0.00002911197,0.00007034667,0.00001622182,0.0001951717,0.004167009],"genre_scores_gemma":[0.8972541,0.0002860769,0.1013689,0.000039841,0.0000166531,0.00007164141,0.00001734041,0.00001281518,0.0009324574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001732078,"threshold_uncertainty_score":0.009160221,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1447510464307607,"score_gpt":0.3279241871680669,"score_spread":0.1831731407373062,"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."}}