{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0002879693,0.0005996486,0.0007119032,0.0003030453,0.0003583304,0.0004712268,0.008666276,0.0005495155,0.00007178029],"category_scores_gemma":[0.0001908969,0.0007484303,0.0002706774,0.0005914874,0.0004639125,0.0003886118,0.002897917,0.002832235,0.00008961488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006426467,"about_ca_system_score_gemma":0.00009530046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001736256,"about_ca_topic_score_gemma":0.0007017161,"domain_scores_codex":[0.9974189,0.000251518,0.001000985,0.0005744798,0.0002427323,0.000511324],"domain_scores_gemma":[0.9871251,0.0007798863,0.0003457956,0.01139109,0.000244943,0.0001132105],"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.000005023631,0.0001326413,0.0004791232,0.0002250437,0.0003129128,0.000006134897,0.0003639334,0.9137293,0.0552462,0.00009499519,0.006973524,0.0224312],"study_design_scores_gemma":[0.0007730061,0.00001580814,0.001577713,0.001704167,0.0001676553,0.00003219167,0.00100538,0.6258339,0.3039886,0.0007947938,0.06128584,0.002821014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3028437,0.01861472,0.6397858,0.02127446,0.002768876,0.002056381,0.0003261854,0.008259925,0.004069922],"genre_scores_gemma":[0.877094,0.02505467,0.09570484,0.000438704,0.00002840943,0.0005091516,0.000938122,0.0001661355,0.00006591627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5742503,"threshold_uncertainty_score":0.9994967,"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."}}