{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000708533,0.00007318297,0.00007702403,0.00006190948,0.0003461342,0.0001097078,0.000359761,0.00003808512,0.00004623268],"category_scores_gemma":[0.00006138444,0.00006722123,0.00003310815,0.0003946871,0.00002399441,0.0003272549,0.00008588556,0.00007786127,0.00002833862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005826016,"about_ca_system_score_gemma":0.00003475216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000503197,"about_ca_topic_score_gemma":0.0005192583,"domain_scores_codex":[0.9993131,0.00004356807,0.0001899929,0.0001925927,0.0000859561,0.0001747889],"domain_scores_gemma":[0.9992077,0.0001379687,0.00004304942,0.0002839327,0.0002749556,0.00005243687],"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.00001442929,0.00005447109,0.0001806569,0.00000444753,0.000005307747,1.325659e-7,0.000261808,0.0003902164,0.0138946,0.9206364,0.004157305,0.06040027],"study_design_scores_gemma":[0.0006232974,0.00009119442,0.002293166,0.00001189083,0.000002863364,0.000006561726,0.00001503035,0.9187886,0.04487507,0.001065984,0.0320042,0.0002221517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01138552,0.00003841272,0.9813293,0.001029796,0.0001694058,0.0002507395,3.038827e-7,0.0002310422,0.005565536],"genre_scores_gemma":[0.8266983,0.00002936474,0.1708075,0.0008507595,0.00007140778,0.00001572793,0.000007999751,0.000004894679,0.001514038],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9195704,"threshold_uncertainty_score":0.2741202,"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."}}