{"id":"W2993252065","doi":"10.1109/tcomm.2019.2957767","title":"Throughput-Oriented Non-Orthogonal Random Access Scheme for Massive MTC Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Science Basic Research Program of Shaanxi Province; Key Research and Development Projects of Shaanxi Province; National Science and Technology Major Project; National Mobile Communications Research Laboratory, Southeast University; Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Throughput; Telecommunications link; Random access; Multiplexing; Optimization problem; Computer network; Particle swarm optimization; Noma; Distributed computing; Algorithm; Wireless; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"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.0001726516,0.000219099,0.0002651071,0.0001011198,0.0003905576,0.00009042013,0.000841358,0.0001679193,0.0002043809],"category_scores_gemma":[0.000002572216,0.0002278138,0.0002108753,0.0003930853,0.00006762486,0.0003167492,0.00000793854,0.0005325877,0.00008688113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000752878,"about_ca_system_score_gemma":0.00003734257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001112257,"about_ca_topic_score_gemma":0.0000739949,"domain_scores_codex":[0.9989439,0.00005375687,0.0003425298,0.000204084,0.0001265965,0.0003291627],"domain_scores_gemma":[0.9977388,0.0005330826,0.0000586946,0.001461824,0.0001215811,0.00008595311],"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.0001421342,0.000157665,0.00005580362,0.00005181106,0.0001989192,2.550873e-7,0.0001407262,0.9850707,0.0003226216,0.0008007993,0.002777673,0.01028087],"study_design_scores_gemma":[0.002422499,0.00007507744,0.000123235,0.0001095869,0.000047101,0.00000213696,0.00003622904,0.9511042,0.001043411,0.0002134234,0.04451869,0.0003043751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001488627,0.0001380424,0.9857755,0.0003470147,0.0008920609,0.006073002,0.00008032745,0.0003000589,0.004905356],"genre_scores_gemma":[0.9793149,0.0004197895,0.009425622,0.0001593591,0.0001094765,0.009873286,0.00007784917,0.00007508001,0.0005446955],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9778262,"threshold_uncertainty_score":0.9289978,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02660428065825239,"score_gpt":0.3002897360120764,"score_spread":0.273685455353824,"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."}}