{"id":"W3205584014","doi":"10.1109/lcomm.2021.3120560","title":"Reconfigurable Intelligent Surface Optimization for Uplink Sparse Code Multiple Access","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; Computational complexity theory; Reduction (mathematics); Algorithm; Signal-to-noise ratio (imaging); Wireless; Code (set theory); Computer engineering; Real-time computing; Set (abstract data type); Telecommunications; Mathematics","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.0001707742,0.0003675911,0.0003371493,0.0002063855,0.0001578477,0.0003508136,0.0002786812,0.000259377,0.0008839049],"category_scores_gemma":[0.0005702521,0.0001459605,0.0002503681,0.000269518,0.0003476437,0.0003437084,0.0004101764,0.0003432584,0.0001533986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003244021,"about_ca_system_score_gemma":0.0004179619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001093476,"about_ca_topic_score_gemma":0.001147574,"domain_scores_codex":[0.999845,0.00004205393,0.000003622561,0.00001949533,0.00006029005,0.00002950962],"domain_scores_gemma":[0.9998172,0.00007889225,0.00003207148,0.00001992438,0.00004164377,0.00001035305],"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.00007803108,0.00003283432,0.0005206169,0.00003958898,0.00002527606,0.00004954738,0.00003585795,0.9115368,0.01898152,0.01532509,0.0007152461,0.05265957],"study_design_scores_gemma":[0.000002299268,0.0000152251,0.0000333894,5.548999e-7,0.000001278779,0.000005788369,0.000002352272,0.998384,0.000666048,0.0007077846,0.0001799262,0.000001527695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.086273,0.0001968014,0.9075639,0.0001244753,0.00002536966,0.00002121006,0.00001906047,0.0002131381,0.005563121],"genre_scores_gemma":[0.8946254,0.0001173992,0.1033306,0.00005063727,0.00001600674,0.00004213909,0.00004031884,0.00003294157,0.001744593],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001093476,"threshold_uncertainty_score":0.002956986,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08006676452302545,"score_gpt":0.3082743611976618,"score_spread":0.2282075966746363,"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."}}