{"id":"W2134027571","doi":"10.1109/glocom.2007.747","title":"Relay Selection for Low-Complexity Coded Cooperation","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Relay; Decoding methods; Selection (genetic algorithm); Relay channel; Heuristic; Computer science; Computer network; Transmission (telecommunications); Scheme (mathematics); Mutual information; Diversity gain; Channel (broadcasting); Wireless; Algorithm; Telecommunications; Mathematics; Fading; Artificial intelligence; Power (physics)","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.001155439,0.0005982655,0.0005319864,0.0003696703,0.0003975506,0.0006279665,0.0007054398,0.0006086918,0.001317297],"category_scores_gemma":[0.005653536,0.0002184425,0.000244647,0.0004682192,0.001163324,0.001027587,0.0009453339,0.0006493463,0.0003036755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006948195,"about_ca_system_score_gemma":0.0005157369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006527832,"about_ca_topic_score_gemma":0.0008746664,"domain_scores_codex":[0.9991798,0.0004351121,0.00002424198,0.00008667869,0.000200598,0.00007357778],"domain_scores_gemma":[0.9964684,0.002910047,0.0001582121,0.0002167427,0.0001995159,0.00004699501],"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.0002279936,0.00005239093,0.0005228105,0.0001609081,0.0000400911,0.000360258,0.0002888746,0.702031,0.01353199,0.2080394,0.001691562,0.07305272],"study_design_scores_gemma":[0.00002445845,0.00007168113,0.00009844253,0.00001390261,0.00001067882,0.0001251107,0.00001854902,0.9534975,0.002674036,0.04226081,0.001193223,0.00001169111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04692334,0.0007907677,0.9452053,0.0002963002,0.00003774525,0.00005277653,0.00003193856,0.0001584544,0.006503444],"genre_scores_gemma":[0.8824585,0.0005802476,0.1131442,0.0001204376,0.00006157779,0.000119016,0.00004868985,0.00002910438,0.003438142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001317297,"threshold_uncertainty_score":0.006110609,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06890904537933018,"score_gpt":0.3213797822309525,"score_spread":0.2524707368516223,"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."}}