{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001204173,0.0001043163,0.0001544021,0.00003113658,0.0002180268,0.0001278128,0.0006187682,0.00003590184,0.000008071974],"category_scores_gemma":[0.00002210415,0.0001134108,0.00004564147,0.0001274496,0.00008324566,0.0001563341,0.00009540567,0.0001656038,0.000005266121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002163807,"about_ca_system_score_gemma":0.000003854035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006629656,"about_ca_topic_score_gemma":0.000007494847,"domain_scores_codex":[0.9994662,0.00004221281,0.0001736924,0.0001052721,0.00004732067,0.0001652656],"domain_scores_gemma":[0.9990988,0.0003158188,0.00003124965,0.0004649988,0.00001723849,0.00007185942],"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.0004710168,0.0001010924,0.003050032,0.002349088,0.0005200478,0.000005309438,0.00994567,0.243591,0.4396265,0.007511528,0.2424024,0.05042638],"study_design_scores_gemma":[0.003343154,0.00002793492,0.0006400682,0.0001948307,0.00005388499,0.000003751488,0.00005940397,0.9018235,0.01298766,0.0004175402,0.07991074,0.0005375213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1237433,0.0003752112,0.8303664,0.03365703,0.0002903798,0.008509156,0.00004972832,0.0008427809,0.002165969],"genre_scores_gemma":[0.9889757,0.00007821746,0.006522218,0.002799307,0.000157714,0.001409483,0.00002201942,0.00003118291,0.00000413775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8652323,"threshold_uncertainty_score":0.4624757,"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."}}