{"id":"W2113464786","doi":"10.1109/glocom.2008.ecp.886","title":"Novel Rateless Coded Selection Cooperation in Dual-Hop Relaying Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Decoding methods; Node (physics); Fading; Computer network; Single antenna interference cancellation; Selection (genetic algorithm); Interference (communication); Exploit; Telecommunications; Power (physics); Engineering; Computer security","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":[],"consensus_categories":[],"category_scores_codex":[0.0003681788,0.0001009831,0.0001368178,0.0001345673,0.0003329162,0.0001299932,0.0002473341,0.00005301247,0.00001378085],"category_scores_gemma":[0.00003928078,0.00009525443,0.00002014096,0.0009436546,0.00002241404,0.0005850081,0.0001385868,0.0001687413,0.00003990221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001048067,"about_ca_system_score_gemma":0.00008554512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006418044,"about_ca_topic_score_gemma":0.0002553483,"domain_scores_codex":[0.9990024,0.0001517466,0.000282004,0.0002476451,0.0001414365,0.0001747476],"domain_scores_gemma":[0.9992988,0.00008286302,0.00005844795,0.0003213949,0.0001937493,0.00004474075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002702861,0.0004609606,0.005883931,0.00002531828,0.00003166565,0.00002598122,0.006681663,0.09519488,0.2315536,0.6411492,0.005581205,0.01338465],"study_design_scores_gemma":[0.0005581813,0.00003092299,0.002380002,0.00003227936,8.799147e-7,0.00012541,0.00004813085,0.9907265,0.003455146,0.000008433954,0.002457255,0.0001768082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1193434,0.0002033416,0.8745831,0.000425862,0.0002630193,0.0002212425,2.128131e-7,0.000204612,0.004755135],"genre_scores_gemma":[0.9896186,0.000417026,0.008279656,0.0002091894,0.0000421065,0.00003363016,0.000003971002,0.000006600028,0.001389202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8955317,"threshold_uncertainty_score":0.3884363,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06613986875106533,"score_gpt":0.2759087786885166,"score_spread":0.2097689099374513,"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."}}