{"id":"W3106800228","doi":"10.1109/lcomm.2020.3039436","title":"Low-Complexity Coding and Spreading for Unsourced Random Access","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Random access; Algorithm; Coding (social sciences); Permutation (music); Payload (computing); Reduction (mathematics); Interference (communication); Transmission (telecommunications); Computational complexity theory; Theoretical computer science; Computer network; Mathematics; Telecommunications","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.0005456954,0.0005483726,0.0003198964,0.0003466523,0.0002944076,0.0006437485,0.0009616686,0.0005163225,0.001705796],"category_scores_gemma":[0.001830126,0.0002033938,0.0003255649,0.0004171418,0.0006375754,0.0007769812,0.0008059738,0.0007975165,0.0005894908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004089198,"about_ca_system_score_gemma":0.0005658781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005530693,"about_ca_topic_score_gemma":0.0008789724,"domain_scores_codex":[0.9993204,0.0002117806,0.00002433012,0.0000714167,0.0003212864,0.00005083722],"domain_scores_gemma":[0.9987509,0.0006115975,0.0001468479,0.0002372527,0.0002151674,0.00003826951],"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.0002797274,0.0001628576,0.0007434285,0.0003699321,0.00007847847,0.0003934459,0.0002536075,0.2598802,0.1610769,0.4425948,0.001605427,0.132561],"study_design_scores_gemma":[0.00001462108,0.0000874895,0.00008438477,0.00001308504,0.00001272282,0.000135531,0.000009124017,0.9674146,0.01368045,0.0167064,0.00182349,0.00001800328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0203978,0.0002445981,0.9755458,0.0001313172,0.00003699682,0.0000419709,0.00002355261,0.0001628082,0.003415199],"genre_scores_gemma":[0.7157147,0.0004430315,0.2792819,0.0001663756,0.0001005708,0.0001332375,0.00007655055,0.00004885313,0.004034783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001705796,"threshold_uncertainty_score":0.005706429,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1059593985725959,"score_gpt":0.3134487988049234,"score_spread":0.2074894002323275,"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."}}