{"id":"W3103796002","doi":"10.1109/lcomm.2021.3058142","title":"Reconfigurable Intelligent Surface-Assisted Uplink Sparse Code Multiple Access","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; Decoding methods; Transmission (telecommunications); Code (set theory); Spectral efficiency; Message passing; Wireless; Scheme (mathematics); Bit error rate; Computer engineering; Algorithm; Parallel computing; Computer network; Channel (broadcasting); 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.00007875981,0.0002211039,0.0002088391,0.0002014666,0.0001380906,0.0003591224,0.0004085038,0.0002681055,0.0008242308],"category_scores_gemma":[0.0002973583,0.00009196547,0.0001544181,0.0001939557,0.0002587593,0.0002860703,0.0002954578,0.0002244117,0.0003356561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002626787,"about_ca_system_score_gemma":0.0001997122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003296074,"about_ca_topic_score_gemma":0.0006296959,"domain_scores_codex":[0.9998842,0.00001866419,0.000004086081,0.00001846283,0.0000541956,0.00002029879],"domain_scores_gemma":[0.9998087,0.00004014498,0.0000524823,0.00003406852,0.00005114574,0.00001349321],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002134157,0.0001263126,0.001511652,0.0001407181,0.00005525528,0.0003637359,0.000135727,0.1257484,0.6964051,0.03085375,0.001989233,0.1424567],"study_design_scores_gemma":[0.00002055346,0.0003303275,0.0005701919,0.000006847687,0.00001709996,0.0002286126,0.00002107081,0.8696791,0.1200243,0.002583497,0.006494818,0.00002362967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3502015,0.0004367168,0.6261333,0.0002747579,0.00009253109,0.00006055699,0.00006994612,0.001214579,0.02151615],"genre_scores_gemma":[0.9477306,0.00009219041,0.04949616,0.00006411478,0.00001620275,0.00002070791,0.00004175093,0.00001898708,0.002519264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008242308,"threshold_uncertainty_score":0.00275737,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1088059909603701,"score_gpt":0.3174725588141571,"score_spread":0.208666567853787,"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."}}