{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":879,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":879,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"db7b57e9a4f9","filters":{"venue":"IEEE Transactions on Communications"}},"results":[{"id":"W2161272050","doi":"10.1109/tcomm.2006.877962","title":"Dual methods for nonconvex spectrum optimization of multicarrier systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1634,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Optimization problem; Duality gap; Convexity; Duality (order theory); Computer science; Strong duality; Dual (grammatical number); Convex optimization; Maximization; Mathematics; Algorithm; Regular polygon","retraction":null,"screen_n_in":null,"score":{"opus":0.02031336845911654,"gpt":0.299815892806152,"spread":0.2795025243470355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001661752,0.0001562792,0.0002195798,0.0001730404,0.0002109574,0.00002313272,0.0002723193,0.0001117975,0.00001965977],"category_scores_gemma":[0.000005818642,0.000181848,0.00009734445,0.0003885147,0.00009675462,0.0001762162,0.000002050244,0.0001762397,0.00000371345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001062164,"about_ca_system_score_gemma":0.00002055229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003460976,"about_ca_topic_score_gemma":0.00003970366,"domain_scores_codex":[0.9990402,0.000100852,0.0004489156,0.0001382537,0.0000859161,0.0001857934],"domain_scores_gemma":[0.9982415,0.0005492182,0.00008619122,0.000959687,0.0001214458,0.00004192969],"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.000008887155,0.00008808684,0.000001747344,0.00003221028,0.000039883,3.996541e-8,0.00005218201,0.994113,0.00112448,0.0013024,0.00007478063,0.003162259],"study_design_scores_gemma":[0.0004013477,0.00002791545,0.000006875949,0.00003490519,0.0000610657,0.000002509287,0.00004946493,0.9869511,0.01055891,0.0001858097,0.001557707,0.0001623744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00008436061,0.0004501577,0.9965214,0.0001084287,0.0004913521,0.0006198026,0.00009510941,0.0003280438,0.001301411],"genre_scores_gemma":[0.5219265,0.0003345642,0.4771849,0.000004705344,0.00003324501,0.0002859219,0.00005418275,0.00004752609,0.0001284614],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5218421,"threshold_uncertainty_score":0.7415547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120448104","doi":"10.1109/tcomm.2004.836447","title":"Multihop Diversity in Wireless Relaying Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":673,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Channel (broadcasting); Computer science; Computer network; Wireless; Transmission (telecommunications); Signal-to-noise ratio (imaging); Electronic engineering; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09475132157149174,"gpt":0.3027697721859978,"spread":0.2080184506145061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000300702,0.0001436903,0.0001527394,0.0002829975,0.001448069,0.00009343861,0.002910397,0.00007268869,0.00001421899],"category_scores_gemma":[0.000007393217,0.0001619058,0.00008535391,0.001046325,0.0001171943,0.0005395871,0.0001244675,0.0005804018,0.00009736358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000247612,"about_ca_system_score_gemma":0.0000767346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001639588,"about_ca_topic_score_gemma":0.001443054,"domain_scores_codex":[0.998841,0.0002217142,0.0002692714,0.0002633019,0.000174952,0.0002297113],"domain_scores_gemma":[0.9968907,0.000244946,0.00006669581,0.002606285,0.0001038006,0.00008754301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003926633,0.004141386,0.0004386667,0.00002265986,0.0001299901,0.00001548053,0.02981417,0.188428,0.00459556,0.290794,0.0001646306,0.4814162],"study_design_scores_gemma":[0.01164882,0.0005378874,0.00718573,0.001265561,0.00008376512,0.0000842336,0.001924993,0.9082745,0.03286492,0.02317974,0.009871963,0.003077898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01619443,0.0001658494,0.9738241,0.007023124,0.0002905329,0.0002519455,0.000003554874,0.0002469642,0.001999451],"genre_scores_gemma":[0.9809412,0.002442277,0.01599105,0.0004145082,0.000007934882,0.00007323411,0.000002538015,0.00000980654,0.0001174723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9647468,"threshold_uncertainty_score":0.9998519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2510173137","doi":"10.1109/tcomm.2017.2650992","title":"Optimal Joint Power and Subcarrier Allocation for Full-Duplex Multicarrier Non-Orthogonal Multiple Access Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":593,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Subcarrier; Telecommunications link; Computer science; Resource allocation; Base station; Mathematical optimization; Benchmark (surveying); Computational complexity theory; Optimization problem; Maximization; Convex optimization; Throughput; Orthogonal frequency-division multiplexing; Algorithm; Computer network; Mathematics; Regular polygon; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05177138249031417,"gpt":0.2963507919404115,"spread":0.2445794094500973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003280488,0.0003664823,0.0003812625,0.0002480967,0.002591322,0.0006587305,0.002238123,0.0002330208,0.00003499012],"category_scores_gemma":[0.00007718759,0.0004126494,0.0001926038,0.0001389,0.0004884556,0.0008920326,0.00005026784,0.0006104248,0.00003539367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001613166,"about_ca_system_score_gemma":0.00007774698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001826909,"about_ca_topic_score_gemma":0.0007041564,"domain_scores_codex":[0.9982743,0.00009211264,0.0006224826,0.0003621341,0.0002326827,0.0004163063],"domain_scores_gemma":[0.993516,0.0006019556,0.0001881871,0.005108538,0.0003464264,0.000238904],"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.00004723316,0.0002469897,0.00009841363,0.00008675681,0.0002599911,4.558061e-7,0.0007615114,0.9792791,0.01495139,0.0009139621,0.0004174873,0.002936714],"study_design_scores_gemma":[0.00113184,0.00006550947,0.003545821,0.0001047411,0.0001080882,0.00001439555,0.0002620369,0.986651,0.003239064,0.000007232886,0.00441874,0.0004515151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4020973,0.0004610703,0.5921759,0.001381141,0.0007575762,0.0015698,0.0006153604,0.0004375112,0.0005043616],"genre_scores_gemma":[0.9817427,0.0008279752,0.01481746,0.000037314,0.00003955655,0.002095877,0.00009160827,0.0001141067,0.0002334429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5796454,"threshold_uncertainty_score":0.9998325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2496222037","doi":"10.1109/tcomm.2016.2594759","title":"Energy-Efficient Resource Allocation for Downlink Non-Orthogonal Multiple Access Network","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":492,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Southeast University; National Natural Science Foundation of China","keywords":"Telecommunications link; Computer science; Mathematical optimization; Efficient energy use; Resource allocation; Single antenna interference cancellation; Convex optimization; Spectral efficiency; Optimization problem; Maximization; Base station; Noma; Multiplexing; Channel (broadcasting); Algorithm; Mathematics; Regular polygon; Computer network; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03135922093522871,"gpt":0.2715286323733495,"spread":0.2401694114381208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001829297,0.0002413075,0.0002131045,0.000214514,0.0006898214,0.00005065662,0.002059828,0.0001802192,0.00002342538],"category_scores_gemma":[0.00002122323,0.0002174859,0.0001459975,0.0004652194,0.0002472593,0.0002396933,0.00002753646,0.0002898855,0.00002882201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002106213,"about_ca_system_score_gemma":0.00003581125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007997582,"about_ca_topic_score_gemma":0.0001598956,"domain_scores_codex":[0.9987088,0.00007171725,0.000448596,0.0002509651,0.0001609084,0.0003590016],"domain_scores_gemma":[0.9951084,0.00146356,0.00009938174,0.003114507,0.0001331968,0.00008096893],"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.00002263497,0.0001552259,0.000009336218,0.00001372791,0.00006322219,7.531207e-8,0.00004867054,0.8147457,0.003359587,0.003237536,0.001619448,0.1767248],"study_design_scores_gemma":[0.001213705,0.00006883011,0.0001501514,0.0002034125,0.00004777425,0.000004266707,0.0001016857,0.73489,0.05996241,0.002281045,0.2004794,0.0005973451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009977875,0.0003571519,0.9925131,0.00273729,0.0001743862,0.00045093,0.0001465211,0.001343108,0.001279789],"genre_scores_gemma":[0.9721965,0.001653197,0.02400716,0.0001124795,0.00003613314,0.00163518,0.00005798676,0.00007158572,0.0002297715],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9711987,"threshold_uncertainty_score":0.8868819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2512920678","doi":"10.1109/tcomm.2016.2602341","title":"Ambient Backscatter Communication Systems: Detection and Performance Analysis","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":445,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Backscatter (email); Electronic engineering; Computer science; Remote sensing; Telecommunications; Electrical engineering; Engineering; Wireless; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.01449382695249085,"gpt":0.2131451518220512,"spread":0.1986513248695603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001852368,0.0001552103,0.0001732685,0.0003001029,0.0004171286,0.00005648331,0.0004510329,0.0001023406,0.00002176011],"category_scores_gemma":[0.000003205198,0.0001349036,0.00007274907,0.0006358669,0.0001625434,0.0002645821,0.00000610459,0.0002502557,0.00004682707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001384119,"about_ca_system_score_gemma":0.00000707182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005329801,"about_ca_topic_score_gemma":0.0004786834,"domain_scores_codex":[0.9991063,0.0001369692,0.0002987107,0.0001576459,0.000120249,0.0001801522],"domain_scores_gemma":[0.9975512,0.0003907165,0.00005260286,0.001856511,0.00007327073,0.0000756735],"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.00001422137,0.0001155834,0.0006751445,0.0000379992,0.0007229999,1.854234e-7,0.0002684755,0.8817492,0.00668369,0.000275775,0.00009762929,0.1093591],"study_design_scores_gemma":[0.000400306,0.00005857423,0.008577131,0.0002282523,0.0004578109,0.00001120205,0.00006662315,0.977614,0.00867924,0.00002503266,0.003492835,0.0003889355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1868897,0.0005740655,0.8097198,0.0003340613,0.0002289094,0.0001744768,0.00002345207,0.0005708107,0.001484751],"genre_scores_gemma":[0.9925703,0.005376319,0.001406365,0.00002314017,0.00001345008,0.0002358911,0.000005668815,0.00003294849,0.0003358491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8083134,"threshold_uncertainty_score":0.550121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093554016","doi":"10.1109/tcomm.2012.12.110670","title":"Transmit Antenna Selection for Security Enhancement in MIMO Wiretap Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":424,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Transmitter; Channel (broadcasting); Channel state information; MIMO; Topology (electrical circuits); Computer science; Secrecy; Antenna (radio); Selection (genetic algorithm); Nakagami distribution; Signal-to-noise ratio (imaging); Algorithm; Computer network; Telecommunications; Mathematics; Wireless; Artificial intelligence; Combinatorics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03391912688999205,"gpt":0.2874597000552449,"spread":0.2535405731652529,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004245842,0.0002285182,0.0002438765,0.0003499936,0.0003090866,0.00003726936,0.0007773855,0.000166401,0.00006623786],"category_scores_gemma":[0.000005578818,0.0002783582,0.0001414109,0.0005727673,0.00009462225,0.0004648258,0.000004558336,0.0005755573,0.00003536428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002798627,"about_ca_system_score_gemma":0.00002322359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008225341,"about_ca_topic_score_gemma":0.0006833904,"domain_scores_codex":[0.9986703,0.0001399026,0.0004664647,0.00015943,0.000149636,0.0004142625],"domain_scores_gemma":[0.9980481,0.0003065248,0.00005177573,0.001386811,0.0000969516,0.0001097881],"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.0006632092,0.02784045,0.001955632,0.002119,0.002078294,0.000001099853,0.1347858,0.07167867,0.3826808,0.049869,0.01014736,0.3161807],"study_design_scores_gemma":[0.001547876,0.0002173668,0.0003712643,0.0003108112,0.0001259526,0.00001495889,0.0006148437,0.6196561,0.3242633,0.0025337,0.04921445,0.001129347],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02092398,0.001110966,0.9729557,0.0009551905,0.0003764207,0.00112955,0.00006575277,0.0008765172,0.001605902],"genre_scores_gemma":[0.9828965,0.002810279,0.01204674,0.00008385342,0.0000318271,0.001967548,0.0000312127,0.00005868154,0.00007335148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9619725,"threshold_uncertainty_score":0.9999669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3172818029","doi":"10.1109/tcomm.2021.3088898","title":"Secrecy-Energy Efficient Hybrid Beamforming for Satellite-Terrestrial Integrated Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":406,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; McGill University","funders":"Shanghai Aerospace Science and Technology Innovation Foundation; Nanjing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Beamforming; Telecommunications link; Computer science; Mathematical optimization; Optimization problem; Convex optimization; Iterative method; Base station; Communications satellite; Satellite; Algorithm; Mathematics; Telecommunications; Regular polygon; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03608583246600989,"gpt":0.257239790081947,"spread":0.2211539576159371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002692444,0.0002755664,0.0003129757,0.0002018233,0.0005684714,0.0001284672,0.00102841,0.0001429242,0.00005103992],"category_scores_gemma":[0.00001977293,0.0003140196,0.0002553324,0.0006669217,0.000106184,0.000119269,0.00001098742,0.000502851,0.00003439447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002478728,"about_ca_system_score_gemma":0.00009618344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005465017,"about_ca_topic_score_gemma":0.0003143424,"domain_scores_codex":[0.9983046,0.0002425388,0.0006613196,0.0002603829,0.0001742147,0.0003569591],"domain_scores_gemma":[0.9954334,0.001087215,0.00007992062,0.003046311,0.0002125986,0.0001405161],"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.00003522196,0.0002955455,0.000004145682,0.00002608729,0.0002209141,0.000001495591,0.0003031389,0.8681266,0.002193252,0.001558018,0.0002052773,0.1270303],"study_design_scores_gemma":[0.0006482548,0.00002771066,0.000007112993,0.0001146158,0.00006358178,0.00003164863,0.0003106676,0.7740075,0.02231534,0.0001605883,0.2019802,0.0003327996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001159131,0.005081032,0.9878729,0.0002699971,0.001371228,0.0003665976,0.0001286682,0.0006880929,0.003062367],"genre_scores_gemma":[0.9790705,0.007105357,0.01215058,0.00009305705,0.0000793669,0.0006150249,0.0003605623,0.00009451782,0.0004310742],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9779114,"threshold_uncertainty_score":0.9999312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1917463349","doi":"10.1109/tcomm.2015.2456093","title":"Millimeter Wave Cellular Networks: A MAC Layer Perspective","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":405,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"European Commission; York University; Vetenskapsrådet; Stiftelsen för Strategisk Forskning; New York University","keywords":"Computer network; Computer science; Physical layer; Radio resource management; Cellular network; Wireless; Scheduling (production processes); Base station; Handover; Synchronization (alternating current); Wireless network; Electronic engineering; Telecommunications; Engineering; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.09565613722390491,"gpt":0.2706013469799129,"spread":0.174945209756008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001871453,0.000192453,0.0001665092,0.0001886403,0.0002359909,0.00005302989,0.0003619866,0.0001080349,0.00009880379],"category_scores_gemma":[0.000005821712,0.0002047547,0.0001272015,0.0003126725,0.00007637596,0.0001610315,0.000004968052,0.0004837625,0.0001947918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002402422,"about_ca_system_score_gemma":0.00003350406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005664006,"about_ca_topic_score_gemma":0.00009917735,"domain_scores_codex":[0.9990308,0.000105406,0.0002748627,0.0001816465,0.0001671525,0.0002401127],"domain_scores_gemma":[0.9982152,0.0001036667,0.00003070691,0.001251691,0.0002153297,0.0001833882],"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.000024384,0.000280119,0.000002260856,0.00001199168,0.000259267,0.000002926309,0.003494234,0.9706798,0.01316391,0.0004155306,0.00214198,0.009523591],"study_design_scores_gemma":[0.000458921,0.00005302811,0.000002367646,0.0000280728,0.00007682554,0.000009147507,0.0009705792,0.954523,0.03807829,0.0006794501,0.004821079,0.0002992994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002414854,0.001173975,0.9822142,0.0004990226,0.0005111498,0.0002573716,0.00002829974,0.0004530267,0.01244808],"genre_scores_gemma":[0.9863934,0.0006877689,0.01193957,0.0001743914,0.00004545537,0.0001293506,0.00001493485,0.00005668761,0.0005584689],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9839785,"threshold_uncertainty_score":0.8349655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973323421","doi":"10.1109/tcomm.2014.010914.130249","title":"Free-Space Optical Communication with Nonzero Boresight Pointing Errors","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":400,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Fading; Probability density function; Free-space optical communication; Jitter; Bit error rate; Log-normal distribution; Optics; Cumulative distribution function; Optical communication; Nakagami distribution; Electronic engineering; Time diversity; Mathematics; Physics; Computer science; Statistics; Telecommunications; Engineering; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.01382308347117646,"gpt":0.2240412016320527,"spread":0.2102181181608762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003399235,0.0003198718,0.0003127678,0.0002989352,0.0007802109,0.0001129051,0.003299796,0.0002292195,0.00004888093],"category_scores_gemma":[0.00005883637,0.0003125131,0.0001086663,0.0007482969,0.0006909678,0.0003473885,0.00004430723,0.001261269,0.0001398892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001543311,"about_ca_system_score_gemma":0.00002917114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003690773,"about_ca_topic_score_gemma":0.0004951122,"domain_scores_codex":[0.9983916,0.0002131113,0.0004678539,0.0002505328,0.0002924796,0.0003844018],"domain_scores_gemma":[0.9906596,0.001240616,0.00008451349,0.007710903,0.0001667639,0.0001375988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001465598,0.002306881,0.0001350628,0.0002046406,0.0008372907,0.000002533623,0.002019645,0.2035598,0.008742679,0.3622855,0.004556335,0.4152031],"study_design_scores_gemma":[0.002802673,0.0005199678,0.000917656,0.0006226103,0.000255459,0.00005078015,0.001548072,0.8059504,0.1070256,0.009848584,0.06847091,0.001987248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006154772,0.0008297462,0.9306058,0.01096682,0.0001082362,0.0004529626,0.00004263009,0.003268085,0.04757095],"genre_scores_gemma":[0.858501,0.002006821,0.1388652,0.00008895599,0.00000846788,0.0002837228,0.00002101556,0.00008403327,0.0001407779],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8523462,"threshold_uncertainty_score":0.9999327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1423052447","doi":"10.1109/tcomm.2015.2502954","title":"Hybrid Block Diagonalization for Massive Multiuser MIMO Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":382,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; MIMO; Baseband; Electronic engineering; Telecommunications link; Rayleigh fading; Computer science; Block (permutation group theory); Antenna (radio); Fading; Channel (broadcasting); Multi-user MIMO; Telecommunications; Engineering; Mathematics; Bandwidth (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.04356902100349175,"gpt":0.2735929353615431,"spread":0.2300239143580513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001497668,0.0001883547,0.0001943877,0.0001800026,0.0002521712,0.00005541502,0.000414178,0.00008528208,0.0000049461],"category_scores_gemma":[0.000016931,0.000214593,0.00008103043,0.0002351193,0.00005469505,0.00029533,0.000002499681,0.0001810352,0.00007022433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002690355,"about_ca_system_score_gemma":0.00004496061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003053618,"about_ca_topic_score_gemma":0.00005623685,"domain_scores_codex":[0.9990247,0.00007871757,0.0003810305,0.0001723795,0.0001340204,0.0002091063],"domain_scores_gemma":[0.998051,0.0002615074,0.00007304701,0.001140392,0.0003383803,0.0001356395],"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.000009158542,0.00008016432,0.000002614912,0.0000344976,0.00005409255,2.182235e-7,0.0002782513,0.9961811,0.0003769988,0.0004799306,0.001589728,0.0009132883],"study_design_scores_gemma":[0.0008002147,0.00004684291,0.000002469272,0.00006915371,0.00006006192,0.00001033263,0.0003018126,0.9723732,0.00400062,0.0001591146,0.02191124,0.0002648778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003827726,0.0005545967,0.9948277,0.0001803123,0.0009053568,0.001016187,0.0002360151,0.0006394294,0.001257561],"genre_scores_gemma":[0.9740732,0.0002846518,0.02338474,0.00002539022,0.00005361269,0.001308484,0.0001055875,0.00008550296,0.0006788727],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9736904,"threshold_uncertainty_score":0.8750849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2520624197","doi":"10.1109/tcomm.2017.2664860","title":"Robust Resource Allocation for MIMO Wireless Powered Communication Networks Based on a Non-Linear EH Model","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":349,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Australian Research Council; Alexander von Humboldt-Stiftung","keywords":"Computer science; Robustness (evolution); Channel state information; MIMO; Resource allocation; Maximization; Wireless; Mathematical optimization; Convex optimization; Throughput; Transmitter power output; Wireless network; Computer network; Channel (broadcasting); Regular polygon; Telecommunications; Mathematics; Transmitter","retraction":null,"screen_n_in":null,"score":{"opus":0.05087931178117185,"gpt":0.2678242946319973,"spread":0.2169449828508255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000458575,0.0003533871,0.0003138435,0.000194922,0.002457478,0.0002020976,0.002522514,0.0003240139,0.000009025918],"category_scores_gemma":[0.00003029512,0.0004202149,0.0002014001,0.0001974798,0.0002940556,0.000309032,0.00001511445,0.0008636562,0.00001711399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002258317,"about_ca_system_score_gemma":0.00006494175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006130866,"about_ca_topic_score_gemma":0.0006670435,"domain_scores_codex":[0.9983873,0.0001320335,0.0005159688,0.0003324297,0.0002262541,0.0004060527],"domain_scores_gemma":[0.9918572,0.0008900349,0.0002165121,0.006684667,0.0002034453,0.0001481779],"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.00004852355,0.0002412543,0.000004307373,0.00002527838,0.00005638809,1.620688e-7,0.0001282041,0.9902512,0.0002730951,0.0006352208,0.0008172083,0.007519186],"study_design_scores_gemma":[0.0008926023,0.00006243215,0.00006375688,0.0003390906,0.00007858577,0.000001211474,0.00003089313,0.9949303,0.001226839,0.00008711674,0.001895868,0.0003912646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001710699,0.00009168594,0.9867482,0.001665861,0.0002697427,0.000678474,0.00007770507,0.0006154053,0.008142298],"genre_scores_gemma":[0.9481899,0.0005470222,0.04921585,0.0002166897,0.00005951227,0.0009720678,0.0001986311,0.0001514205,0.0004489677],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9464791,"threshold_uncertainty_score":0.9998249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076579100","doi":"10.1109/tcomm.2015.2411266","title":"Cognitive and Energy Harvesting-Based D2D Communication in Cellular Networks: Stochastic Geometry Modeling and Analysis","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":347,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Stochastic geometry; Cognitive radio; Computer science; Energy harvesting; Computer network; Interference (communication); Transmitter; Cellular network; Channel (broadcasting); Stochastic geometry models of wireless networks; Wireless; Signal-to-interference-plus-noise ratio; Electronic engineering; Energy (signal processing); Radio resource management; Telecommunications; Wireless network; Engineering; Power (physics); Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03234404328833789,"gpt":0.2432006864108595,"spread":0.2108566431225216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003854297,0.0002218179,0.0002908836,0.0006236477,0.0002742294,0.00009111997,0.00037566,0.000157479,0.000003729142],"category_scores_gemma":[0.00002644237,0.0002709278,0.00005857941,0.001385231,0.0002015602,0.0002180317,0.00001246895,0.0005641647,0.000001441773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001048606,"about_ca_system_score_gemma":0.00003323696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006075844,"about_ca_topic_score_gemma":0.003515066,"domain_scores_codex":[0.9987368,0.0002489643,0.0003917482,0.0002296202,0.0001448233,0.0002480447],"domain_scores_gemma":[0.9975955,0.001011931,0.00005972246,0.001030612,0.0001264952,0.0001757724],"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.000009996875,0.00007672377,0.0001083957,0.000007677937,0.0001376254,5.651631e-7,0.0001907895,0.9919811,0.00001817293,0.0001771185,0.000003745737,0.007288011],"study_design_scores_gemma":[0.0005205836,0.00002476756,0.0001209025,0.000164685,0.0002911952,0.000002211806,0.0002030029,0.9982212,0.00006149484,0.0001215378,0.00001975784,0.0002486602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03670669,0.003214585,0.959128,0.000114677,0.00006301594,0.00008870488,0.00001877826,0.0002613373,0.0004042038],"genre_scores_gemma":[0.9920892,0.0007908717,0.006716105,0.00005548746,0.00001176969,0.0001585604,0.00008928398,0.00004776926,0.00004095615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9553825,"threshold_uncertainty_score":0.9999743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2992716901","doi":"10.1109/tcomm.2019.2957482","title":"Towards Optimal Power Control via Ensembling Deep Neural Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":279,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Power control; Artificial neural network; Channel state information; Fading; Generalization; Channel (broadcasting); Power (physics); Additive white Gaussian noise; Computational complexity theory; Interference (communication); Artificial intelligence; Machine learning; Algorithm; Wireless; Computer network; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02397361943255083,"gpt":0.2596625151970172,"spread":0.2356888957644664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002869804,0.000219718,0.0002273953,0.0002502685,0.000512504,0.0001985042,0.002147361,0.0001431043,0.000112149],"category_scores_gemma":[0.000006453641,0.0002349366,0.0001750181,0.0007077554,0.00009575459,0.0007545399,0.00001576082,0.0005768849,0.000284066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001361794,"about_ca_system_score_gemma":0.00005332792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000349641,"about_ca_topic_score_gemma":0.00003119104,"domain_scores_codex":[0.9981827,0.0002966845,0.0004444155,0.0004193221,0.0003309598,0.0003259367],"domain_scores_gemma":[0.9957986,0.0004837723,0.0001707316,0.003162153,0.0002474905,0.0001372454],"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.00001896496,0.0002653341,0.0000314012,0.00000323023,0.00005083044,5.916656e-7,0.0004196368,0.9302217,0.001922694,0.005918563,0.00001934307,0.06112773],"study_design_scores_gemma":[0.0005777509,0.00009633477,0.0008910444,0.00001181099,0.00001942855,0.00001358449,0.00004003688,0.9969297,0.0006106301,0.0002064626,0.000361989,0.0002412188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003942252,0.0001124403,0.9886478,0.004372078,0.0007538414,0.0005008359,0.000006914067,0.0004113126,0.001252579],"genre_scores_gemma":[0.9715075,0.00003255092,0.02764205,0.0005382213,0.00002273758,0.00008740788,0.000007596814,0.00002730817,0.0001346007],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9675653,"threshold_uncertainty_score":0.9580437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127421917","doi":"10.1109/tcomm.2004.836563","title":"On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) Codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":279,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Quantization (signal processing); Mathematics; Parity-check matrix; Belief propagation; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05494814690018784,"gpt":0.3493726599252929,"spread":0.294424513025105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294792,0.0001722234,0.0002039444,0.0002871164,0.0007605004,0.00007183242,0.001058503,0.00008797483,0.000009110287],"category_scores_gemma":[0.00002327487,0.0001978756,0.0001076556,0.0003879084,0.00008604135,0.0004344729,0.00002007286,0.0002794123,0.00001094086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001267704,"about_ca_system_score_gemma":0.00008446685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001156218,"about_ca_topic_score_gemma":0.0009891078,"domain_scores_codex":[0.998668,0.0001438297,0.0004425039,0.000335751,0.0001917924,0.0002181645],"domain_scores_gemma":[0.9968697,0.0009595621,0.0002054821,0.001579818,0.0003028775,0.00008255979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002604076,0.001631306,0.00003759397,0.00007311859,0.0001504361,3.149651e-7,0.004983448,0.002422611,0.01773613,0.09673528,0.0009097271,0.875294],"study_design_scores_gemma":[0.0007299681,0.0002772292,0.0005325418,0.0001122598,0.00008149875,0.00001253572,0.0003631552,0.5989918,0.3922165,0.005367395,0.0009158134,0.0003993309],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01411093,0.00008734424,0.9809914,0.003301586,0.0001229051,0.0006898488,0.0001023964,0.0003408868,0.0002526729],"genre_scores_gemma":[0.6871147,0.0002131178,0.3122021,0.0001162054,0.00001001483,0.0002576192,0.000008887519,0.0000131625,0.00006417926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8748947,"threshold_uncertainty_score":0.8069133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116674255","doi":"10.1109/tcomm.2010.01.080080","title":"Performance analysis of adaptive decode-and-forward cooperative diversity networks with best-relay selection","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":274,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"","keywords":"Relay; Relay channel; Cooperative diversity; Node (physics); Computer science; Transmitter; Selection (genetic algorithm); Diversity gain; Computer network; Signal-to-noise ratio (imaging); Diversity combining; Outage probability; Channel (broadcasting); Telecommunications; Fading; Engineering; Power (physics); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0326593209367927,"gpt":0.2629587803049321,"spread":0.2302994593681394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003077473,0.0001747034,0.0002745148,0.0004115681,0.001745808,0.00006305485,0.001391507,0.00009266922,0.00003965954],"category_scores_gemma":[0.000006273331,0.0001605137,0.00009895748,0.002500294,0.000333552,0.000517151,0.00008392929,0.0007522197,0.00000544423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004762882,"about_ca_system_score_gemma":0.00007442374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007196743,"about_ca_topic_score_gemma":0.005544287,"domain_scores_codex":[0.9988434,0.0002249999,0.0002731069,0.0002866597,0.0001908233,0.0001810539],"domain_scores_gemma":[0.9971396,0.0004372658,0.0001523088,0.001669712,0.0004974222,0.0001037322],"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.0001138708,0.001093228,0.006095055,0.000006665489,0.00192948,4.332099e-7,0.004530989,0.841828,0.001035944,0.01744415,0.00005148968,0.1258707],"study_design_scores_gemma":[0.0002867029,0.0002751896,0.006123625,0.0000208704,0.0003986227,0.000004628182,0.00007982174,0.9914056,0.0009900904,0.000007156817,0.0002176856,0.0001899893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1018309,0.00007832136,0.8961511,0.0004804409,0.00008293245,0.0002161554,0.00000967398,0.00009183589,0.001058651],"genre_scores_gemma":[0.966216,0.002428363,0.03102205,0.00009211818,0.000006173103,0.0000567407,0.000006067127,0.000008757284,0.0001637772],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.865129,"threshold_uncertainty_score":0.9995538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147072043","doi":"10.1109/tcomm.2004.836596","title":"Distribution Functions of Selection Combiner Output in Equally Correlated Rayleigh, Rician, and Nakagami-<tex>$m$</tex>Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":273,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Nakagami distribution; Rayleigh fading; Fading; Fading distribution; Cumulative distribution function; Mathematics; Statistics; Signal-to-noise ratio (imaging); Channel capacity; Rayleigh distribution; Channel (broadcasting); Algorithm; Telecommunications; Probability density function; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03565044146017216,"gpt":0.2724362698078587,"spread":0.2367858283476865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004956311,0.0005584984,0.0006349688,0.0008435172,0.0009028986,0.00009286001,0.001028305,0.0004778002,0.00008322329],"category_scores_gemma":[0.00008328001,0.0006808354,0.0002234581,0.002208262,0.0004279969,0.0007060102,0.00004116302,0.001501921,0.0001408692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009041796,"about_ca_system_score_gemma":0.00009852133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002284356,"about_ca_topic_score_gemma":0.004653747,"domain_scores_codex":[0.9969417,0.0003439777,0.001255943,0.0004866793,0.0003934783,0.0005781819],"domain_scores_gemma":[0.9956412,0.0006378532,0.0003195234,0.002757208,0.0004384486,0.0002057599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001110217,0.00181437,0.0001693582,0.0001444392,0.000354868,6.112502e-7,0.00266927,0.9013223,0.06707095,0.004295379,0.001140006,0.02090744],"study_design_scores_gemma":[0.02321178,0.001516972,0.01669755,0.007973706,0.002887539,0.0006001721,0.001512125,0.174598,0.1196595,0.02698577,0.6124015,0.01195536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06371178,0.001426786,0.9298294,0.0007438463,0.000444858,0.0009282577,0.0003449708,0.001432527,0.001137577],"genre_scores_gemma":[0.971642,0.004358768,0.02159539,0.00005578155,0.00002777627,0.0005899059,0.0008423288,0.0001345464,0.0007535287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.908234,"threshold_uncertainty_score":0.9995643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100072869","doi":"10.1109/26.855519","title":"The generation of correlated Rayleigh random variates by inverse discrete Fourier transform","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":270,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Random variate; Convolution random number generator; Algorithm; Random number generation; Computer science; Control variates; Discrete Fourier transform (general); Fourier transform; Inverse; Mathematics; Mathematical optimization; Random variable; Statistics; Fourier analysis; Monte Carlo method; Fractional Fourier transform","retraction":null,"screen_n_in":null,"score":{"opus":0.02599972743022813,"gpt":0.2791343712317966,"spread":0.2531346438015685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002533387,0.0001048286,0.0001161721,0.00004208395,0.001117854,0.0001076153,0.0005129092,0.00003246779,0.001584201],"category_scores_gemma":[0.000002470842,0.0000766072,0.0001369803,0.0002916348,0.0003748156,0.0002424331,0.000001871938,0.0002285998,0.00007223918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001683844,"about_ca_system_score_gemma":0.00007414581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005604697,"about_ca_topic_score_gemma":0.0001996088,"domain_scores_codex":[0.9990404,0.0001608761,0.0002797527,0.0001337097,0.0002016683,0.0001835642],"domain_scores_gemma":[0.9984906,0.0003227189,0.00005233847,0.0009861225,0.00007442039,0.00007384053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001510868,0.003189055,0.0002628693,0.00002170409,0.001515118,4.813832e-7,0.00798497,0.03796869,0.03679235,0.02050145,0.0877419,0.8025106],"study_design_scores_gemma":[0.009103779,0.0003768163,0.0001187949,0.00008510362,0.0003890288,0.000002413907,0.003290047,0.4484691,0.2427196,0.01426552,0.2803038,0.0008759846],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07018334,0.0004399534,0.8426549,0.006854059,0.0005040119,0.001318364,0.001463361,0.000093609,0.07648838],"genre_scores_gemma":[0.9890817,0.0004350564,0.0004839624,0.00002231905,0.00001841576,0.0001471201,0.0001280038,0.00001090885,0.009672468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9188984,"threshold_uncertainty_score":0.9993285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120896095","doi":"10.1109/tcomm.2006.877947","title":"Distributed space-time block coding","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":257,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Node (physics); Relay; Code (set theory); Algorithm; Topology (electrical circuits); Combinatorics; Mathematics; Set (abstract data type); Physics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03229868936485061,"gpt":0.2693690723793093,"spread":0.2370703830144587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000246584,0.00018971,0.0001856273,0.000187932,0.001320879,0.0002185124,0.002672375,0.00007550392,0.00006849135],"category_scores_gemma":[0.00000806887,0.0002032771,0.0001310443,0.001021996,0.000149611,0.0003825339,0.00003962769,0.000439934,0.0004331978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001311198,"about_ca_system_score_gemma":0.00007114086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003265334,"about_ca_topic_score_gemma":0.0001516285,"domain_scores_codex":[0.9985796,0.0003042693,0.0003533817,0.0002842949,0.0002052202,0.0002732722],"domain_scores_gemma":[0.9955425,0.0004861596,0.0001043797,0.003586491,0.0001919288,0.00008852681],"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.00004137534,0.005205213,0.00009165843,0.00002884774,0.000320512,0.00001010021,0.001594489,0.1204223,0.06492312,0.6278403,0.04319955,0.1363224],"study_design_scores_gemma":[0.0009871542,0.0001082037,0.0007256556,0.0001120592,0.00004867555,0.0000387713,0.00003889816,0.8565692,0.0179007,0.00260436,0.1200903,0.0007760273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006225464,0.000301428,0.9774653,0.01044466,0.0001599998,0.000236094,0.00003509691,0.0005955305,0.01013931],"genre_scores_gemma":[0.9743118,0.0008787629,0.02269689,0.0002069958,0.0000241855,0.000097306,0.00002941281,0.0000166609,0.00173804],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9736892,"threshold_uncertainty_score":0.9999793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108165364","doi":"10.1109/26.871398","title":"Equal-gain diversity receiver performance in wireless channels","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":247,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Rician fading; Nakagami distribution; Mathematics; Fading; Probability density function; Rayleigh fading; Diversity gain; Algorithm; Telecommunications; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03043936461231794,"gpt":0.2523884447162454,"spread":0.2219490801039274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001627335,0.0001861003,0.0001890582,0.0002454085,0.0005697862,0.00002259436,0.001313097,0.000118932,0.0003113158],"category_scores_gemma":[0.000001545865,0.0002292607,0.00006928934,0.000595904,0.0001525603,0.0004139598,0.00001545814,0.0006802326,0.0002063173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002300065,"about_ca_system_score_gemma":0.00001469068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006353017,"about_ca_topic_score_gemma":0.000213808,"domain_scores_codex":[0.99901,0.0001178397,0.0003091752,0.0001638607,0.000149025,0.0002501325],"domain_scores_gemma":[0.9975783,0.0001913112,0.00002985566,0.002086841,0.00004399629,0.00006965436],"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.00003658741,0.0005055065,0.000170674,0.00004104834,0.00005211405,0.000001231259,0.002162638,0.5248007,0.001124695,0.0008582793,0.000196784,0.4700497],"study_design_scores_gemma":[0.001486513,0.0001577777,0.001942144,0.0004577059,0.00005074099,0.00001466218,0.0003884774,0.9012375,0.07030695,0.001617154,0.02096836,0.001371983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.320892,0.0004290828,0.6128652,0.0009599527,0.0003245709,0.001029831,0.00009561495,0.003195171,0.06020856],"genre_scores_gemma":[0.9816241,0.01350154,0.004010537,0.00007038211,0.000007681815,0.0002042499,0.00001358816,0.00003860934,0.0005292982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6607322,"threshold_uncertainty_score":0.9348981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3203387279","doi":"10.1109/tcomm.2021.3117599","title":"Multi-RIS-Aided Wireless Systems: Statistical Characterization and Performance Analysis","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":238,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Ministry of Science and Technology, Taiwan; National Science Foundation","keywords":"Ergodic theory; Fading; Independent and identically distributed random variables; Wireless; Channel (broadcasting); Computer science; Outage probability; Topology (electrical circuits); Algorithm; Random variable; Mathematics; Computer network; Telecommunications; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02745581189989359,"gpt":0.2605286997374888,"spread":0.2330728878375952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008868906,0.000177893,0.00027575,0.0002948866,0.0004164726,0.00007827413,0.0005024674,0.0001236685,0.00002472554],"category_scores_gemma":[0.00001043716,0.0002070479,0.00005774684,0.001072248,0.0001962216,0.0002693756,0.00001372191,0.0004498135,0.00002752564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009835879,"about_ca_system_score_gemma":0.0000277078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001165102,"about_ca_topic_score_gemma":0.00008832924,"domain_scores_codex":[0.9989872,0.0001188752,0.0003753249,0.0002021636,0.000129986,0.0001864819],"domain_scores_gemma":[0.9973555,0.0002867268,0.00005973415,0.002080642,0.000149935,0.00006745911],"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.00002554803,0.000884892,0.001294662,0.0003070652,0.001932522,0.000005372697,0.001051131,0.5912602,0.09512497,0.003654022,0.00005233439,0.3044073],"study_design_scores_gemma":[0.0002630463,0.0000190119,0.006824823,0.00004509257,0.0001875506,0.000009531082,0.0003026243,0.9774954,0.01322501,0.00001182173,0.001359572,0.000256519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06548881,0.0005110099,0.9324017,0.0002149252,0.0001352334,0.000162736,0.0001808605,0.0007841026,0.0001206677],"genre_scores_gemma":[0.9622434,0.0130671,0.02398126,0.00002115074,0.000005138868,0.0002350269,0.0002100162,0.00003342651,0.0002034933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9084204,"threshold_uncertainty_score":0.8443169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3007970939","doi":"10.1109/tcomm.2020.2974457","title":"Sparse Channel Estimation and Hybrid Precoding Using Deep Learning for Millimeter Wave Massive MIMO","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":219,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Precoding; Zero-forcing precoding; MIMO; Computer science; Algorithm; Quantization (signal processing); Artificial neural network; Electronic engineering; Channel (broadcasting); Control theory (sociology); Artificial intelligence; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.09714878866662471,"gpt":0.269265349034555,"spread":0.1721165603679302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001069388,0.0001697723,0.0001693457,0.000131424,0.0005194712,0.00006664234,0.0001602064,0.00006002134,0.00002201636],"category_scores_gemma":[0.00002017016,0.0001981837,0.00008633777,0.0001480125,0.00004679552,0.0002212227,0.000005186139,0.0003279334,0.00001181653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006253196,"about_ca_system_score_gemma":0.00001232801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005902486,"about_ca_topic_score_gemma":0.00001006077,"domain_scores_codex":[0.9991773,0.00006157636,0.0002917977,0.0001899033,0.00008854631,0.0001908522],"domain_scores_gemma":[0.9991806,0.0002120234,0.00005581879,0.0003512517,0.00007977529,0.0001205338],"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.0000120057,0.00002357071,6.447442e-7,0.00005968572,0.00006381597,2.715173e-7,0.001174922,0.9416308,0.01860737,0.00001085251,0.00001600423,0.03840005],"study_design_scores_gemma":[0.0003287221,0.0000501278,0.000002315366,0.00004658116,0.00008666782,0.000006549726,0.0002045977,0.9435917,0.05505738,0.0001304518,0.0003017041,0.0001932228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01620752,0.0003111578,0.9817978,0.0006278314,0.0001326077,0.0004406265,0.00003225962,0.0002756089,0.0001745651],"genre_scores_gemma":[0.9143005,0.0005596744,0.08475579,0.0001427278,0.00002493259,0.0001186207,0.00002934001,0.00004892772,0.0000194928],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.898093,"threshold_uncertainty_score":0.8081697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055044375","doi":"10.1109/tcomm.2013.111213.130235","title":"Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":212,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Cognitive radio; Scheduling (production processes); Computer network; Quality of service; Rayleigh fading; Artificial noise; Fading; Physical layer; Base station; Mathematical optimization; Wireless; Telecommunications; Mathematics; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.0255506041634968,"gpt":0.2738122242116717,"spread":0.2482616200481749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001198975,0.0002472423,0.0002592056,0.0002482567,0.0002548521,0.00007941435,0.0008592561,0.0001301942,0.00008733739],"category_scores_gemma":[0.000005861048,0.0002555438,0.00008215495,0.0006685426,0.0002141781,0.0004853881,0.000009929622,0.001196382,0.00009233081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000137424,"about_ca_system_score_gemma":0.0000232207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002593551,"about_ca_topic_score_gemma":0.001031327,"domain_scores_codex":[0.9988753,0.0001623439,0.0003095639,0.0002007571,0.0001586741,0.0002933478],"domain_scores_gemma":[0.9972849,0.0006072471,0.00005060668,0.001794401,0.0001619978,0.0001008087],"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.00004989071,0.002706771,0.0004561039,0.00006516497,0.0003842346,0.000002715108,0.01083405,0.9395402,0.003813557,0.00141012,0.0004570324,0.04028015],"study_design_scores_gemma":[0.0006356637,0.00005056323,0.0006631508,0.000231581,0.00003743992,0.00000550649,0.0005782882,0.9863539,0.01029788,0.0004459731,0.0003050363,0.0003950523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3157615,0.0003657218,0.6758244,0.0006139892,0.00006847944,0.001072721,0.00002708289,0.001318353,0.004947733],"genre_scores_gemma":[0.9885174,0.001061184,0.00892399,0.00008142861,0.00001632926,0.001279799,0.00001919868,0.00006786535,0.00003283098],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6727558,"threshold_uncertainty_score":0.9999897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123447220","doi":"10.1109/tcomm.2009.02.070158","title":"Decentralized dynamic spectrum access for cognitive radios: cooperative design of a non-cooperative game","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Cognitive radio; Computer science; Regret; Channel (broadcasting); Interference (communication); Computer network; Agile software development; Wireless; Telecommunications; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04219709066889608,"gpt":0.3287933253325193,"spread":0.2865962346636232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002795389,0.0002866229,0.0004308675,0.0002720086,0.0006564835,0.0002198933,0.001488183,0.00009796376,0.00001963479],"category_scores_gemma":[0.00003062327,0.0002879121,0.0001973073,0.001022749,0.0002342997,0.0007222337,0.00001170738,0.000381772,0.000009188077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001550283,"about_ca_system_score_gemma":0.0002498793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002684772,"about_ca_topic_score_gemma":0.0001752856,"domain_scores_codex":[0.9981074,0.0003665859,0.0004776769,0.0004439981,0.0002009336,0.0004033957],"domain_scores_gemma":[0.9965153,0.001552779,0.0001879391,0.001167809,0.0004495988,0.0001265889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001812741,0.007539451,0.000007709011,0.00005381193,0.001672116,0.00002219938,0.02126725,0.4623086,0.01971446,0.02143004,0.0006421734,0.4635295],"study_design_scores_gemma":[0.00205859,0.0008768091,0.0002735811,0.0002039926,0.0001079877,0.00002360083,0.000190049,0.9628689,0.03099991,0.001934304,0.00008144772,0.0003808317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001064378,0.0002829546,0.9928135,0.003499449,0.0001733641,0.001556435,0.0000813169,0.0001321027,0.0003965499],"genre_scores_gemma":[0.965182,0.001169298,0.03291365,0.0004620673,0.00001230406,0.0001349334,0.00001600404,0.0000201177,0.00008963468],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9641176,"threshold_uncertainty_score":0.9999573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2887906137","doi":"10.1109/tcomm.2018.2881117","title":"Learning-Aided Physical Layer Authentication as an Intelligent Process","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":193,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Physical layer; Computer science; Authentication (law); Robustness (evolution); Authentication protocol; Lightweight Extensible Authentication Protocol; Distributed computing; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.03787961938960948,"gpt":0.336655443153291,"spread":0.2987758237636815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001927727,0.0002185572,0.0001880261,0.0002366408,0.000635119,0.00008672215,0.001435965,0.000121877,0.0001493897],"category_scores_gemma":[0.00001506061,0.0002479476,0.00009593413,0.0005377483,0.0003497142,0.0004099291,0.00000914202,0.000763182,0.0007114732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001229294,"about_ca_system_score_gemma":0.00004290083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003995196,"about_ca_topic_score_gemma":0.0001537179,"domain_scores_codex":[0.9987655,0.0002116823,0.0003275918,0.0002249505,0.0002339826,0.0002362822],"domain_scores_gemma":[0.9966355,0.0001907694,0.00006379557,0.002678695,0.0002963274,0.0001349178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003087268,0.01239844,0.0001143878,0.0003073089,0.001039072,0.000002607997,0.1626357,0.07686958,0.190068,0.06250753,0.001646096,0.4921025],"study_design_scores_gemma":[0.0002815211,0.0005268172,0.0001537408,0.00009716392,0.00009226902,0.00001339419,0.001422589,0.551665,0.4221323,0.008951472,0.01405996,0.0006037456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4905205,0.00008993396,0.485488,0.001232878,0.0002701748,0.0007871923,0.00002689641,0.004652125,0.01693231],"genre_scores_gemma":[0.9956302,0.0004464244,0.00303982,0.00007744042,0.00005578989,0.0004189911,0.00003345039,0.00007317318,0.0002247006],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5051097,"threshold_uncertainty_score":0.9999973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153279511","doi":"10.1109/tcomm.2004.836424","title":"Accurate Evaluation of Multiple-Access Performance in TH-PPM and TH-BPSK UWB Systems","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":179,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Phase-shift keying; Pulse-position modulation; Additive white Gaussian noise; Bit error rate; Modulation (music); Algorithm; Electronic engineering; Computer science; Interference (communication); Gaussian noise; Keying; Gaussian; Time-hopping; Mathematics; White noise; Telecommunications; Decoding methods; Physics; Pulse-amplitude modulation; Engineering; Pulse (music); Detector; Acoustics","retraction":null,"screen_n_in":null,"score":{"opus":0.06166949947961563,"gpt":0.3005825281511645,"spread":0.2389130286715489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004495891,0.0001655839,0.0002196818,0.0004222802,0.0002335184,0.00004231873,0.001084429,0.0001475973,0.0000105971],"category_scores_gemma":[0.00002174386,0.000183431,0.00004460117,0.0006995726,0.0002025806,0.0004205016,0.00001354732,0.0005056965,0.00001568372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002271011,"about_ca_system_score_gemma":0.00007541947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003053629,"about_ca_topic_score_gemma":0.001629079,"domain_scores_codex":[0.9988252,0.0001434846,0.0004766296,0.0001550493,0.000209983,0.0001896821],"domain_scores_gemma":[0.9973213,0.0002806538,0.00008126612,0.002100797,0.0001738792,0.00004210541],"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.000009754441,0.0002493816,0.0004548577,0.00005567328,0.00005592989,1.030899e-7,0.0006257378,0.980036,0.002937513,0.0006719482,0.000006171224,0.01489689],"study_design_scores_gemma":[0.002644115,0.0001013317,0.01505872,0.0004281177,0.0001538837,0.00002586327,0.0007545538,0.9545368,0.02423492,0.0006412991,0.0009628348,0.0004575337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8695397,0.002779359,0.120581,0.0008541943,0.0002852842,0.001211956,0.00006581158,0.0005201009,0.004162589],"genre_scores_gemma":[0.9925255,0.005338918,0.001454599,0.00001078645,0.000003963859,0.0006082781,0.00001387288,0.00002997577,0.00001409421],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1229858,"threshold_uncertainty_score":0.7480101,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119039041","doi":"10.1109/tcomm.2009.07.070157","title":"Resource allocation in an OFDM-based cognitive radio system","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":175,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Cognitive radio; Subcarrier; Knapsack problem; Orthogonal frequency-division multiplexing; Resource allocation; Greedy algorithm; Computer science; Frequency allocation; Mathematical optimization; Resource management (computing); Simple (philosophy); Electronic engineering; Algorithm; Telecommunications; Computer network; Mathematics; Engineering; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01933829889396434,"gpt":0.2548390433945764,"spread":0.2355007445006121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001221999,0.0001622986,0.0001575292,0.0002763991,0.0002227572,0.0000323378,0.0003761972,0.0001063214,0.000008778045],"category_scores_gemma":[0.000003454747,0.0002023447,0.00004701792,0.0006511869,0.00005446598,0.0002890816,7.307393e-7,0.0003723071,0.00002445353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002936586,"about_ca_system_score_gemma":0.00002652955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000763944,"about_ca_topic_score_gemma":0.0001906836,"domain_scores_codex":[0.9990404,0.000152278,0.0003126231,0.0001724735,0.0001268498,0.000195378],"domain_scores_gemma":[0.9986104,0.0002068299,0.00004408649,0.0009851253,0.0000770286,0.00007653256],"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.00002032866,0.0001761523,0.000006322924,0.0000102,0.000008402037,6.116858e-7,0.0002332126,0.9735663,0.0004589221,0.0003470827,0.00001731711,0.02515515],"study_design_scores_gemma":[0.0005892654,0.00007597193,0.0003787722,0.0001930922,0.000026156,0.000002770434,0.0003535985,0.9947898,0.003120002,0.00003023505,0.0002317982,0.0002085779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006824803,0.000161913,0.9888587,0.0003271714,0.00008312259,0.0004051547,0.00002519323,0.0007822999,0.002531628],"genre_scores_gemma":[0.9888472,0.000119035,0.01061901,0.00008709291,0.00001753048,0.0001484731,0.00009981686,0.00003695806,0.00002486521],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9820224,"threshold_uncertainty_score":0.8251377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171250293","doi":"10.1109/tcomm.2005.849638","title":"Iterative Tree Search Detection for MIMO Wireless Systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":173,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"MIMO; Turbo; Computer science; Quadrature amplitude modulation; Turbo code; Algorithm; Computational complexity theory; Tree (set theory); Wireless; Detection theory; Bit error rate; QAM; Electronic engineering; Mathematics; Decoding methods; Channel (broadcasting); Telecommunications; Engineering; Detector","retraction":null,"screen_n_in":null,"score":{"opus":0.03672285389025646,"gpt":0.2979098798032245,"spread":0.2611870259129681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001918138,0.0002138481,0.0002146154,0.0002868073,0.0006285768,0.0000759587,0.000923536,0.0001390311,0.00001277957],"category_scores_gemma":[0.000004132562,0.0002462227,0.0001241992,0.0003896331,0.0001306932,0.0003987645,0.000005618601,0.000524254,0.00005893381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003407952,"about_ca_system_score_gemma":0.00002371864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002543739,"about_ca_topic_score_gemma":0.0005405664,"domain_scores_codex":[0.9988623,0.0001327538,0.0004061853,0.0001865119,0.0001529041,0.0002593427],"domain_scores_gemma":[0.9969819,0.0005393816,0.00005000246,0.002137506,0.0002043168,0.0000868844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003283062,0.000335801,0.000001491569,0.00006875351,0.0001336344,1.184497e-7,0.00110314,0.4277454,0.04611117,0.002569578,0.0002987635,0.5215994],"study_design_scores_gemma":[0.0003714917,0.00007207198,0.00001096865,0.00006756155,0.00002867049,0.000006513063,0.0002645862,0.7369347,0.2368809,0.0001053604,0.02497598,0.0002812514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002573818,0.0005492327,0.9910604,0.0005119017,0.0001846766,0.0009137735,0.0001136301,0.001436597,0.002655959],"genre_scores_gemma":[0.9669185,0.0017506,0.02871102,0.00003776247,0.0000437095,0.002025097,0.00002535926,0.00007694083,0.0004109876],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9643447,"threshold_uncertainty_score":0.999999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2275669737","doi":"10.1109/tcomm.2015.2514089","title":"Design of a Short Reference Noncoherent Chaos-Based Communication Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Chaos control and synchronization","field":"Physics and Astronomy","cited_by":171,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Keying; Chaotic; Energy (signal processing); SIGNAL (programming language); Bit error rate; Electronic engineering; Additive white Gaussian noise; Data transmission; Transmission (telecommunications); Multipath propagation; Algorithm; Communications system; Telecommunications; Mathematics; Decoding methods; White noise; Statistics; Channel (broadcasting); Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.05790060647622867,"gpt":0.282197505951102,"spread":0.2242968994748733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292738,0.0001472582,0.0002083296,0.0001243427,0.0003111715,0.00002650899,0.000703318,0.00005537251,0.0002127283],"category_scores_gemma":[0.000002379975,0.0001157096,0.00008257522,0.0002314116,0.000159748,0.0001477232,0.000005173837,0.0001627635,0.00005177181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007486244,"about_ca_system_score_gemma":0.0001240337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002474157,"about_ca_topic_score_gemma":0.00003560971,"domain_scores_codex":[0.9987637,0.0003457049,0.0004068313,0.0001631636,0.0001680925,0.0001524822],"domain_scores_gemma":[0.9969712,0.000614401,0.0001406652,0.001971784,0.0002403963,0.00006154534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004163648,0.006350109,0.001963249,0.000080248,0.0008857637,3.983775e-7,0.001327227,0.2906216,0.1198942,0.08806915,0.0007785042,0.4896131],"study_design_scores_gemma":[0.008232137,0.00098037,0.001732617,0.002100496,0.0007261366,0.000004016343,0.001159981,0.855909,0.1100517,0.004506559,0.0126989,0.001898141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001443617,0.0001251435,0.9941458,0.000721705,0.00008390502,0.0005092773,0.0001282378,0.00006208007,0.002780275],"genre_scores_gemma":[0.9960671,0.000110035,0.002970992,0.00001521022,0.00001544937,0.0004137912,0.00003254425,0.00002024285,0.000354631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9946235,"threshold_uncertainty_score":0.4718502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154104609","doi":"10.1109/tcomm.2006.884852","title":"A Comparison of DCT-Based OFDM and DFT-Based OFDM in Frequency Offset and Fading Channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":164,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Additive white Gaussian noise; Discrete cosine transform; Rayleigh fading; Fading; Carrier frequency offset; Frequency offset; Algorithm; Mathematics; Bit error rate; Computer science; Guard interval; Quadrature amplitude modulation; Discrete Fourier transform (general); Electronic engineering; Phase-shift keying; Multipath propagation; Telecommunications; White noise; Engineering; Fourier transform; Fractional Fourier transform; Channel (broadcasting); Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.03248814429921955,"gpt":0.3047209759927909,"spread":0.2722328316935713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000155535,0.0001877602,0.0003053819,0.000451887,0.0002073585,0.00002387902,0.0004708809,0.000118866,0.00001316069],"category_scores_gemma":[0.000008136738,0.0002259148,0.00005056684,0.0004812852,0.0002657808,0.0001708392,0.000006229263,0.000446919,0.000002652731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000995126,"about_ca_system_score_gemma":0.00002971167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003040101,"about_ca_topic_score_gemma":0.001202018,"domain_scores_codex":[0.9988883,0.0001194131,0.0005265534,0.0001624107,0.0001232818,0.0001800281],"domain_scores_gemma":[0.9979379,0.0004909456,0.00009824576,0.00135123,0.00007044973,0.00005121971],"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.00004043341,0.001637231,0.004214745,0.0003109642,0.00005737519,9.796083e-7,0.00119964,0.8943289,0.06584588,0.005512794,0.0001785507,0.02667249],"study_design_scores_gemma":[0.0009620662,0.0001179585,0.001947646,0.0004250386,0.00004181175,0.000002469464,0.0002143531,0.8407962,0.1525858,0.001886661,0.0005833317,0.0004366398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09002104,0.001598719,0.9051185,0.0006385101,0.00005865089,0.0004859553,0.0001033004,0.0005044203,0.001470879],"genre_scores_gemma":[0.9459493,0.0003794394,0.05333731,0.00002697536,0.000003963221,0.0002270931,0.0000291743,0.00003596402,0.00001075728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8559283,"threshold_uncertainty_score":0.9212539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963415238","doi":"10.1109/tcomm.2018.2869596","title":"Mixed-ADC/DAC Multipair Massive MIMO Relaying Systems: Performance Analysis and Power Optimization","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Beijing Municipal Science and Technology Commission; Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; Southeast University; National Natural Science Foundation of China","keywords":"Converters; Effective number of bits; Electronic engineering; MIMO; Computer science; Quantization (signal processing); Bandwidth (computing); Power (physics); Engineering; Electrical engineering; Voltage; Algorithm; Beamforming; CMOS; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04484471352069685,"gpt":0.2755894887356007,"spread":0.2307447752149039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004108372,0.0002035291,0.0002477249,0.0005332222,0.001852134,0.0002757321,0.001653463,0.00009776672,0.00004686672],"category_scores_gemma":[0.00001680094,0.0002091005,0.0001100024,0.002132689,0.0003008907,0.0007188249,0.00005748813,0.0003781513,0.00005701387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001065007,"about_ca_system_score_gemma":0.00006654181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000295864,"about_ca_topic_score_gemma":0.0002066481,"domain_scores_codex":[0.9982938,0.0004571157,0.0004191866,0.0003753274,0.0002109179,0.0002436962],"domain_scores_gemma":[0.995708,0.0004110252,0.0001700844,0.003119945,0.0004657557,0.0001251153],"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.00004888529,0.001019484,0.000959478,0.00003788603,0.001481785,0.000001636924,0.009484978,0.8434852,0.001064351,0.02339372,0.0007183082,0.1183043],"study_design_scores_gemma":[0.0002709609,0.0001050477,0.0009876445,0.00005649364,0.000116028,0.000005374598,0.0001917445,0.9949922,0.0006713956,0.00001104184,0.002350537,0.0002415405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004952641,0.000528313,0.9894031,0.001698959,0.0003216941,0.0002952202,0.00001054227,0.0002824139,0.002507156],"genre_scores_gemma":[0.9178594,0.003714374,0.07774118,0.0001767361,0.00001612503,0.0001288905,0.000009603924,0.00001559241,0.0003380717],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9129068,"threshold_uncertainty_score":0.9994473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321021465","doi":"10.1109/tcomm.2023.3245659","title":"Physical-Layer Authentication for Ambient Backscatter-Aided NOMA Symbiotic Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":157,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; Université Laval","funders":"CHIST-ERA; Basic and Applied Basic Research Foundation of Guangdong Province; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Authentication (law); Multiplexing; Noma; Physical layer; Computer network; Wireless; Backscatter (email); Telecommunications; Telecommunications link; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.04454929094561075,"gpt":0.2780191702150951,"spread":0.2334698792694844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001669855,0.0002015275,0.0002069093,0.0002203754,0.0004381093,0.00008731626,0.0006654486,0.0001026538,0.000007612516],"category_scores_gemma":[0.000008907306,0.0002281978,0.0001444537,0.000687879,0.0000934195,0.0001421774,0.000005089575,0.0003041488,0.0003534081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001386555,"about_ca_system_score_gemma":0.00001923646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002647716,"about_ca_topic_score_gemma":0.00005367959,"domain_scores_codex":[0.9988946,0.00007853735,0.0003275802,0.0002166858,0.0001575242,0.0003250982],"domain_scores_gemma":[0.9972374,0.0007851406,0.0000529009,0.001731629,0.00009772617,0.00009522483],"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.000004531372,0.0001898299,0.000007169739,0.00008239662,0.000117089,2.974414e-7,0.0004907087,0.975259,0.01712101,0.00211302,0.001855998,0.002758938],"study_design_scores_gemma":[0.0002853717,0.00003926986,0.0002450192,0.0001318064,0.00007004003,0.000003025308,0.0001199781,0.9861029,0.009696972,0.0002296201,0.002820331,0.0002555983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1563994,0.000133264,0.8354693,0.0009417098,0.001773719,0.0009410097,0.0001434257,0.002875372,0.001322778],"genre_scores_gemma":[0.9959415,0.0002589919,0.001460816,0.00002727051,0.0000837544,0.001118448,0.00008656208,0.00009206947,0.0009306187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8395421,"threshold_uncertainty_score":0.9305637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070394551","doi":"10.1109/tcomm.2009.12.080396","title":"Bit-interleaved coded modulation for hybrid RF/FSO systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":148,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Electronic engineering; Radio frequency; Transmitter; Hybrid system; Fading; Code (set theory); Modulation (music); Bit error rate; Channel (broadcasting); Communications system; Telecommunications; Engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03391046944717376,"gpt":0.2674476213924171,"spread":0.2335371519452433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001538216,0.0002182894,0.0002504041,0.0002738413,0.0004391903,0.00009747338,0.001256602,0.0001363315,0.0000123016],"category_scores_gemma":[0.00001972856,0.0002430734,0.0001417026,0.0003396172,0.0001278069,0.0002348577,0.000004895374,0.0004532571,0.00007814512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001854708,"about_ca_system_score_gemma":0.00001876934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000116148,"about_ca_topic_score_gemma":0.00002994136,"domain_scores_codex":[0.9988737,0.00005831835,0.0004695853,0.0001868766,0.000143713,0.0002678816],"domain_scores_gemma":[0.9964065,0.0004501278,0.00006326523,0.002851504,0.0001543671,0.00007426113],"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.00004939806,0.0007713431,0.000003261119,0.00007527442,0.0002029581,5.123065e-7,0.0003092689,0.6358718,0.02458382,0.02207976,0.001963454,0.3140892],"study_design_scores_gemma":[0.0005094261,0.0001316254,0.00008159924,0.00008646089,0.0000366997,0.000006678376,0.0001692376,0.9653686,0.02364277,0.002953064,0.006694248,0.0003196347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007672944,0.0007182696,0.9827287,0.002400748,0.0003412067,0.0008160258,0.0001330664,0.002452717,0.002736295],"genre_scores_gemma":[0.9827971,0.00142069,0.01493879,0.00006217985,0.00001529521,0.0004911341,0.00005136142,0.00004370228,0.0001797035],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9751242,"threshold_uncertainty_score":0.9912247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166757187","doi":"10.1109/tcomm.2010.092810.090322","title":"On the Performance of Cooperative-Diversity Networks with the Nth Best-Relay Selection Scheme","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":147,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"","keywords":"Relay; Rayleigh fading; Expression (computer science); Cooperative diversity; Moment-generating function; Diversity combining; Signal-to-noise ratio (imaging); Node (physics); Maximal-ratio combining; Selection (genetic algorithm); Closed-form expression; Probability density function; Topology (electrical circuits); Computer science; Function (biology); Mathematics; Algorithm; Fading; Telecommunications; Statistics; Combinatorics; Channel (broadcasting); Engineering; Physics; Artificial intelligence; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03464705107615206,"gpt":0.2561856685289257,"spread":0.2215386174527736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005133623,0.0001607071,0.0001306709,0.00008539805,0.003732039,0.00009521621,0.003088156,0.00006898971,0.00007463556],"category_scores_gemma":[0.00001152949,0.00009659596,0.00006996108,0.001061045,0.0004677356,0.0002945004,0.00007514474,0.001304426,0.00002915601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003864343,"about_ca_system_score_gemma":0.00008768681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002474132,"about_ca_topic_score_gemma":0.001205516,"domain_scores_codex":[0.9988061,0.0003768403,0.0001992832,0.0002026627,0.0002363725,0.0001787813],"domain_scores_gemma":[0.9956089,0.00110883,0.0001302366,0.002728543,0.0003721734,0.00005129058],"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.0001845463,0.002647391,0.0007075766,0.00001297009,0.0004378914,4.813218e-7,0.006889758,0.5772837,0.008646047,0.3312107,0.003315056,0.06866392],"study_design_scores_gemma":[0.0003317888,0.0004052887,0.0006042416,0.00005344386,0.00002949409,0.00000910662,0.0001119775,0.9889361,0.005823275,0.00002313035,0.003474162,0.0001980453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.183362,0.00007767109,0.8001705,0.01322848,0.0001998553,0.0004835202,0.000004493301,0.0001212825,0.002352137],"genre_scores_gemma":[0.9930869,0.0009227099,0.00484724,0.0005813981,0.00001429677,0.0001009937,0.000001732657,0.00001025793,0.0004344168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8097249,"threshold_uncertainty_score":0.997565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130098973","doi":"10.1109/26.905889","title":"Simple and accurate methods for outage analysis in cellular mobile radio systems-a unified approach","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":147,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Rician fading; Nakagami distribution; Fading; Computer science; Interference (communication); Algorithm; Outage probability; Fading distribution; Random variable; Mathematics; Electronic engineering; Statistics; Channel (broadcasting); Telecommunications; Rayleigh fading; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05105211517095617,"gpt":0.3358924471817224,"spread":0.2848403320107662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533064,0.0001877765,0.000339693,0.000587247,0.0003283264,0.00007836502,0.0007296004,0.0001102354,0.00001293354],"category_scores_gemma":[0.000007863101,0.0002060628,0.0001490241,0.001362694,0.00008414654,0.00017566,0.000008604183,0.0003494498,0.000004575147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008858134,"about_ca_system_score_gemma":0.00001964718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001472096,"about_ca_topic_score_gemma":0.0002586065,"domain_scores_codex":[0.9987743,0.0002843463,0.0004436258,0.0001989567,0.00006506158,0.0002336749],"domain_scores_gemma":[0.9968072,0.0006764694,0.00005284472,0.002305691,0.00006742879,0.0000904363],"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.00002056631,0.0004693384,0.00008972584,0.00006223124,0.0005604233,4.000489e-7,0.000801874,0.9794745,0.002904181,0.0009804171,0.00007554641,0.01456079],"study_design_scores_gemma":[0.0004418899,0.00002703054,0.0001826862,0.00001100179,0.0003173681,0.000003109403,0.0004949272,0.9687297,0.0005934214,0.0001190115,0.02884787,0.0002319939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009262825,0.003132564,0.9844782,0.00007854273,0.0000867315,0.0007301075,0.00009669695,0.0002262943,0.001908035],"genre_scores_gemma":[0.9380535,0.004316934,0.05593772,0.00001196032,0.0000079133,0.001278171,0.0001029265,0.0000364607,0.0002543461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9287907,"threshold_uncertainty_score":0.8402996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3010012151","doi":"10.1109/tcomm.2020.2979149","title":"Robust Federated Learning With Noisy Communication","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":146,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China","keywords":"Computer science; Maxima and minima; Noise (video); Convergence (economics); Mathematical optimization; Node (physics); Process (computing); Function (biology); Convex function; Wireless; Convexity; Artificial intelligence; Regular polygon; Mathematics; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08482952423078478,"gpt":0.2744377171142667,"spread":0.1896081928834819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0002175077,0.0001977665,0.0001866103,0.0001346355,0.00119251,0.0003020058,0.02733868,0.0001162749,0.00003201437],"category_scores_gemma":[0.0004824182,0.0001943084,0.00005867539,0.001300333,0.0002668315,0.0008281294,0.001492875,0.00122502,0.0001765026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008646504,"about_ca_system_score_gemma":0.00009784722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006769928,"about_ca_topic_score_gemma":0.0001054954,"domain_scores_codex":[0.9984421,0.0003408962,0.0002949534,0.0004013484,0.0002631447,0.0002575698],"domain_scores_gemma":[0.9867573,0.0004792737,0.0001417036,0.01233027,0.0001728887,0.0001185456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003662079,0.004264281,0.0006106627,0.0001874038,0.001348552,0.00003660587,0.008210651,0.2285135,0.01850236,0.02934605,0.1494208,0.5591928],"study_design_scores_gemma":[0.0005544265,0.0002617282,0.00006031025,0.00006978383,0.00002906803,0.00001745968,0.0002239426,0.9773706,0.009596115,0.002474526,0.008967413,0.0003746389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006029184,0.0001302751,0.8529345,0.1415955,0.00003940404,0.0002328572,0.00001324726,0.001855424,0.00259593],"genre_scores_gemma":[0.6718155,0.0003984822,0.3270722,0.0005349991,0.000004322171,0.00009424509,0.00001932416,0.00001917558,0.00004176305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7488571,"threshold_uncertainty_score":0.9779239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104878965","doi":"10.1109/tcomm.2010.082010.090256","title":"Error Performance Analysis of BPSK Modulation in Physical-Layer Network-Coded Bidirectional Relay Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Relay channel; Phase-shift keying; Rayleigh fading; Linear network coding; Bit error rate; Computer science; Algorithm; Topology (electrical circuits); Fading; Node (physics); Mathematics; Decoding methods; Computer network; Network packet; Engineering; Physics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04881039997255162,"gpt":0.3068714708438505,"spread":0.2580610708712989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005452153,0.0001885602,0.0003363077,0.0005953644,0.0005834286,0.0000606312,0.001802367,0.0001242744,0.00005352026],"category_scores_gemma":[0.00001190436,0.0001976594,0.0002026338,0.004273118,0.0001677479,0.0005024291,0.00003701015,0.001034413,0.00001491452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006523862,"about_ca_system_score_gemma":0.00006928065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004010799,"about_ca_topic_score_gemma":0.002904256,"domain_scores_codex":[0.9983376,0.0003329265,0.0005048853,0.0003194532,0.0002427024,0.0002624287],"domain_scores_gemma":[0.9958175,0.0006661513,0.0002020248,0.002999151,0.0002346423,0.00008047042],"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.00001160521,0.0004029608,0.0009599856,0.000002146005,0.0001696472,1.130217e-7,0.0005236481,0.9472959,0.001886929,0.006632587,0.0000527836,0.04206169],"study_design_scores_gemma":[0.0002454037,0.00003646536,0.03184788,0.00002200214,0.00009080433,0.000001337404,0.000009743393,0.9660821,0.0006074522,0.00009335743,0.000780294,0.0001831453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1575547,0.00008800304,0.8391085,0.0009147626,0.0003822855,0.0002515568,0.000008331139,0.0001482825,0.001543656],"genre_scores_gemma":[0.9828804,0.0009503057,0.01569162,0.0001113504,0.00003304183,0.0001301826,0.00002562088,0.00001432954,0.000163127],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8253258,"threshold_uncertainty_score":0.8060315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2246689711","doi":"10.1109/tcomm.2016.2555908","title":"Analysis of Massive MIMO-Enabled Downlink Wireless Backhauling for Full-Duplex Small Cells","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":137,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Telecommunications link; Computer network; MIMO; Stochastic geometry; Computer science; Wireless; Wireless network; Base station; Zero-forcing precoding; Multi-user MIMO; Precoding; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03150486666265667,"gpt":0.2509358748837726,"spread":0.2194310082211159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002854952,0.0003378094,0.0005982593,0.0008644432,0.0005005756,0.00004274118,0.001937378,0.0002205776,0.0001829118],"category_scores_gemma":[0.00001952776,0.000310958,0.0005767681,0.001651663,0.0002964582,0.0002153976,0.00001707876,0.0003721471,0.00006535267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002368741,"about_ca_system_score_gemma":0.00007587096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006890004,"about_ca_topic_score_gemma":0.001701753,"domain_scores_codex":[0.9980375,0.0001638153,0.0008609501,0.0003191184,0.0001984896,0.0004201813],"domain_scores_gemma":[0.9925659,0.002440572,0.000195884,0.004229913,0.0004107592,0.0001570008],"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.00003293816,0.0003031855,0.00001205388,0.00004622839,0.001524194,1.793264e-7,0.0003955438,0.7871256,0.1951151,0.0005708825,0.0001230712,0.01475097],"study_design_scores_gemma":[0.0009462807,0.0000744149,0.0001191521,0.0001353564,0.001384004,0.000001161668,0.0002581199,0.9099167,0.08378293,0.00002045179,0.002917167,0.0004442622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1686452,0.0002430484,0.8268718,0.001363438,0.0002540231,0.0006983957,0.001148098,0.0004503022,0.0003256344],"genre_scores_gemma":[0.9681214,0.002617399,0.02784725,0.00003784032,0.00001815623,0.0007782088,0.00008577518,0.00008759335,0.0004063627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7994762,"threshold_uncertainty_score":0.9999343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171275970","doi":"10.1109/26.864163","title":"Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles (\"p-cycles\")","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Spare part; Bounding overwatch; Computer science; Set (abstract data type); Upper and lower bounds; Work (physics); Computer network; Span (engineering); Mathematical optimization; Mathematics; Engineering; Structural engineering; Operations management; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04230451188184459,"gpt":0.292792079495629,"spread":0.2504875676137844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000403761,0.0001532737,0.0001870038,0.00008227171,0.00107554,0.00009780648,0.002134907,0.0001072022,0.0001483683],"category_scores_gemma":[0.00001159757,0.000123653,0.0001753324,0.00061177,0.0005112809,0.0001874956,0.00001006507,0.0003292269,0.000009351887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004519934,"about_ca_system_score_gemma":0.00008655427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007169749,"about_ca_topic_score_gemma":0.0000392942,"domain_scores_codex":[0.9987632,0.0001539639,0.0003669205,0.0002547137,0.000169658,0.0002915658],"domain_scores_gemma":[0.9952416,0.002154191,0.00009610051,0.002332445,0.0001081349,0.00006757524],"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.00005307137,0.0005235552,0.00001174282,0.00001050032,0.00008894665,2.228906e-7,0.0007366945,0.7455499,0.0001208262,0.1334528,0.0003408606,0.1191109],"study_design_scores_gemma":[0.000316727,0.00008593172,0.00007941735,0.00006223234,0.00005607853,0.000008138984,0.00004013001,0.9889795,0.0006332329,0.00794846,0.001639447,0.0001507444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00211165,0.0007684623,0.9929208,0.00205578,0.0002138237,0.0004475292,0.00001390678,0.0001592055,0.00130886],"genre_scores_gemma":[0.9633183,0.0007154018,0.03545661,0.00022907,0.00002616585,0.0001121941,0.000002375448,0.00001950006,0.000120354],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9612067,"threshold_uncertainty_score":0.827229,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205439215","doi":"10.1109/tcomm.2022.3144986","title":"Joint Design of Hybrid Beamforming and Reflection Coefficients in RIS-Aided mmWave MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":131,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China; Canada Research Chairs","keywords":"Beamforming; MIMO; Relaxation (psychology); Telecommunications link; Computer science; Base station; Optimization problem; Mathematical optimization; Reduction (mathematics); Algorithm; Electronic engineering; Mathematics; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05858524051798612,"gpt":0.2675568819341841,"spread":0.208971641416198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003514093,0.0001394715,0.0002206019,0.0005358837,0.0004766139,0.00001659871,0.0006261318,0.00003992189,0.00001191264],"category_scores_gemma":[0.00001489501,0.0001738553,0.00004201526,0.000651689,0.0001434461,0.0001481865,0.00002604814,0.000656666,0.000003153884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003492503,"about_ca_system_score_gemma":0.00002689538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007723283,"about_ca_topic_score_gemma":0.00003468054,"domain_scores_codex":[0.9988199,0.0002092605,0.000468097,0.0001443958,0.0001637947,0.0001945567],"domain_scores_gemma":[0.9979724,0.000317566,0.0001006117,0.001524383,0.00004992379,0.00003516894],"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.00000987285,0.0001486712,0.000006024523,0.00002281682,0.00002374188,3.903817e-7,0.0003125491,0.9786575,0.01204029,0.000256436,0.00002172633,0.008499954],"study_design_scores_gemma":[0.0005396095,0.0001239235,0.00005258823,0.000082069,0.00002047874,0.0000390176,0.002343614,0.95398,0.04055847,0.0004075366,0.001600542,0.0002521355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02127979,0.001011258,0.9759942,0.0001414627,0.0001808111,0.0005209303,0.00006006399,0.0004538002,0.0003576509],"genre_scores_gemma":[0.9842314,0.002186593,0.01281631,0.000008591562,0.000001753354,0.0006700672,0.00001092516,0.00003315831,0.00004128004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9631779,"threshold_uncertainty_score":0.7089615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080920551","doi":"10.1109/tcomm.2011.093011.100693","title":"Cognitive Base Stations in LTE/3GPP Femtocells: A Correlated Equilibrium Game-Theoretic Approach","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":129,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Macrocell; Femtocell; Base station; Telecommunications link; Cognitive radio; Computer science; Resource allocation; Node (physics); Game theory; Potential game; Frequency allocation; Computer network; Interference (communication); Mathematical optimization; Resource management (computing); LTE Advanced; Nash equilibrium; Wireless; Engineering; Telecommunications; Mathematics; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.0461661637003191,"gpt":0.2544726297428994,"spread":0.2083064660425803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001765264,0.0002553099,0.0002412928,0.0004557614,0.000157361,0.00002841997,0.0004910031,0.0001560671,0.0001633271],"category_scores_gemma":[0.000018803,0.0003036468,0.00008923485,0.0009821182,0.0002161705,0.0003928869,0.000005474622,0.0006312043,0.0001720518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001840428,"about_ca_system_score_gemma":0.00004958043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007518439,"about_ca_topic_score_gemma":0.0001583148,"domain_scores_codex":[0.9985702,0.0002041911,0.0005288432,0.0002586034,0.0001266279,0.0003115266],"domain_scores_gemma":[0.9981379,0.0003456128,0.00007718924,0.001181703,0.0001429301,0.0001146974],"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.00006553894,0.001202088,0.00004924092,0.00009083985,0.0001324621,0.000003515945,0.01035532,0.9811628,0.001281588,0.00186453,0.0000619503,0.003730083],"study_design_scores_gemma":[0.001275233,0.00007988307,0.0001362058,0.0001942939,0.0001178081,0.00001897313,0.002487541,0.9895277,0.004808594,0.0007999374,0.00006802681,0.0004858237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003933079,0.0002393902,0.9657323,0.00003142838,0.0002261008,0.0008691539,0.0001503994,0.0006166758,0.02820146],"genre_scores_gemma":[0.9741048,0.0003896523,0.02425489,0.00002860299,0.000007769883,0.0007537469,0.00009342237,0.00008984486,0.0002773067],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9701717,"threshold_uncertainty_score":0.9999416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101899205","doi":"10.1109/tcomm.2005.849792","title":"Accurate Performance Evaluation of Time-Hopping and Direct-Sequence UWB Systems in Multi-User Interference","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":128,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Time-hopping; Keying; Additive white Gaussian noise; Interference (communication); Bit error rate; Algorithm; Frequency-hopping spread spectrum; Phase-shift keying; Gaussian noise; Computer science; Modulation (music); Electronic engineering; Gaussian; Spread spectrum; Noise (video); Signal-to-noise ratio (imaging); Binary number; Telecommunications; White noise; Mathematics; Decoding methods; Physics; Engineering; Acoustics; Artificial intelligence; Pulse-amplitude modulation; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.07523173087991988,"gpt":0.3045697179082266,"spread":0.2293379870283067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004906089,0.0001504829,0.000205382,0.0003586205,0.0001620119,0.00002532455,0.0007886416,0.0001175262,0.00002080525],"category_scores_gemma":[0.00002002977,0.0001692603,0.00003374651,0.0004883211,0.0001820793,0.0003494822,0.00001015082,0.0004385276,0.00004517943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002101512,"about_ca_system_score_gemma":0.00004363939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008663336,"about_ca_topic_score_gemma":0.0006374075,"domain_scores_codex":[0.9988949,0.0001859632,0.00045211,0.0001513466,0.000146266,0.000169391],"domain_scores_gemma":[0.9977721,0.0002752356,0.00007375663,0.001678071,0.0001642754,0.0000365343],"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.00001012041,0.0003304553,0.0002445607,0.00005053956,0.00007673673,8.373546e-8,0.001212444,0.8250264,0.03896978,0.0002484693,0.00002539787,0.133805],"study_design_scores_gemma":[0.0004311758,0.00002713296,0.0008615887,0.0002057265,0.00004418449,0.000006551106,0.0001596857,0.9874402,0.009799747,0.000008984639,0.0008473074,0.000167661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8032486,0.00572223,0.179715,0.0009620982,0.0002394053,0.001441281,0.00009076115,0.0008791315,0.0077015],"genre_scores_gemma":[0.9902734,0.004586318,0.004568563,0.00001074674,0.000003283894,0.000417231,0.000007935512,0.00002285351,0.0001096456],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1870248,"threshold_uncertainty_score":0.6902233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3019060914","doi":"10.1109/tcomm.2020.2989462","title":"Energy-Constrained UAV-Assisted Secure Communications With Position Optimization and Cooperative Jamming","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":127,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Transmitter power output; Artificial noise; Relay; Jamming; Optimization problem; Node (physics); Mathematical optimization; Energy (signal processing); Iterative method; Convex optimization; Maximization; Computer network; Power (physics); Wireless; Transmitter; Algorithm; Physical layer; Regular polygon; Engineering; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01755361681248436,"gpt":0.2163469140871662,"spread":0.1987932972746819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006581868,0.0002474692,0.000208798,0.0001439913,0.0008380173,0.0001226167,0.0005480392,0.000127408,0.00005800436],"category_scores_gemma":[0.000003146515,0.000258381,0.00005074552,0.0008312567,0.0002943922,0.0003655308,0.00001076746,0.000304477,0.00001274589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008910335,"about_ca_system_score_gemma":0.00005208304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003048473,"about_ca_topic_score_gemma":0.0002062567,"domain_scores_codex":[0.9989546,0.0001144881,0.0003488373,0.0002510779,0.0001432186,0.0001877553],"domain_scores_gemma":[0.9980503,0.0001875599,0.00007463183,0.001304929,0.0002099647,0.0001726585],"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.00003404229,0.0002356396,0.00000671908,0.00002983421,0.000182967,6.933149e-7,0.002122857,0.9552496,0.002745831,0.003116,0.0002136287,0.03606215],"study_design_scores_gemma":[0.0006066483,0.0001346704,0.00002045706,0.00005037767,0.0001177713,0.00002008792,0.0006344104,0.9939777,0.001870283,0.00002974791,0.002233163,0.0003046541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006197472,0.0003442836,0.9886069,0.005585423,0.00003386602,0.0003908437,0.0001437564,0.000597715,0.003677485],"genre_scores_gemma":[0.8893764,0.002404411,0.1070634,0.0004074691,0.00001666471,0.0003696495,0.0002612113,0.0000575505,0.00004323497],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8887566,"threshold_uncertainty_score":0.9999868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3164862323","doi":"10.1109/tcomm.2021.3082779","title":"Covert Transmission Assisted by Intelligent Reflecting Surface","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":127,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Beamforming; Channel state information; Transmission (telecommunications); Transmitter power output; Optimization problem; Algorithm; Mathematical optimization; Relaxation (psychology); Channel (broadcasting); Mathematics; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05478883911960099,"gpt":0.3152848826105058,"spread":0.2604960434909048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001066097,0.0002089751,0.0002087873,0.00009384749,0.0005466154,0.00005224585,0.0009879597,0.0001670481,0.0001258271],"category_scores_gemma":[0.00001340703,0.0002447262,0.0001168872,0.0007204133,0.0001330387,0.0002012628,0.00001053936,0.0008313314,0.00007892677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002264234,"about_ca_system_score_gemma":0.00004330673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001456357,"about_ca_topic_score_gemma":0.00007597474,"domain_scores_codex":[0.9988367,0.0001330723,0.0004037023,0.0002162135,0.0001703247,0.0002400068],"domain_scores_gemma":[0.9965606,0.0004591802,0.00005026795,0.002717183,0.0001332091,0.00007956261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000009264853,0.0004746936,0.000006302977,0.00003569031,0.0001328696,0.000001658237,0.0003898355,0.3409208,0.3802525,0.0004055199,0.002007091,0.2753638],"study_design_scores_gemma":[0.0002308284,0.00002502309,0.00001192749,0.00009463762,0.00002545963,0.00001788986,0.0004985887,0.06641319,0.8226634,0.0003835257,0.1093237,0.0003117907],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002147455,0.003738276,0.9859034,0.002235168,0.0001592779,0.0001670338,0.00005726896,0.001771023,0.003821041],"genre_scores_gemma":[0.9130688,0.01644297,0.06933158,0.00006585207,0.000003222196,0.00007498395,0.0000530759,0.00005816887,0.0009013232],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9165719,"threshold_uncertainty_score":0.9979643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969312047","doi":"10.1109/tcomm.2002.801465","title":"Analytical level crossing rates and average fade durations for diversity techniques in Nakagami fading channels","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Nakagami distribution; Fade; Diversity combining; Maximal-ratio combining; Rayleigh fading; Channel (broadcasting); Statistics; Diversity gain; Diversity scheme; Fading distribution; Level crossing; Telecommunications; Envelope (radar); Channel state information; Computer science; Mathematics; Algorithm; Wireless; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08259165893051813,"gpt":0.2958363710545022,"spread":0.2132447121239841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001101456,0.0001415696,0.0001633305,0.0002737987,0.001023839,0.00009432289,0.0002410921,0.00009994095,0.00001721948],"category_scores_gemma":[0.00001449324,0.0001711061,0.0000530833,0.0003452786,0.0001259508,0.00041125,0.000008798517,0.0002477709,0.000005819383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001586538,"about_ca_system_score_gemma":0.000007284168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003386095,"about_ca_topic_score_gemma":0.0002143252,"domain_scores_codex":[0.9992759,0.00004339527,0.0002716569,0.0001568172,0.00006588545,0.0001863393],"domain_scores_gemma":[0.9990371,0.0002913768,0.00003457953,0.0005180102,0.00006267204,0.00005623162],"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.000008126619,0.0001973068,0.0001214411,0.00006798901,0.00005912258,8.824098e-7,0.004024759,0.9793305,0.002249322,0.0007878049,0.0001514729,0.01300126],"study_design_scores_gemma":[0.0003364256,0.00002332657,0.00011513,0.00008378253,0.00002536015,0.000006345724,0.0001675669,0.9923527,0.005969741,0.0002303191,0.0004827167,0.0002066494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00335597,0.0001696959,0.9943424,0.0003220666,0.0001049038,0.0004853547,0.00009850858,0.0003164139,0.0008046965],"genre_scores_gemma":[0.971319,0.0004940784,0.02763153,0.00002381161,0.00001418358,0.0001850607,0.00001178464,0.00002770755,0.0002928118],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.967963,"threshold_uncertainty_score":0.7874645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147213649","doi":"10.1109/tcomm.2004.838739","title":"Parametric Construction of Nyquist-I Pulses","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Nyquist ISI criterion; Intersymbol interference; Pulse shaping; Raised-cosine filter; Nyquist–Shannon sampling theorem; Bandwidth (computing); Parametric statistics; Nyquist frequency; Mathematics; Nyquist stability criterion; Pulse (music); Frequency domain; Optics; Electronic engineering; Algorithm; Telecommunications; Computer science; Physics; Mathematical analysis; Engineering; Low-pass filter; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02116787198627938,"gpt":0.2390344597319923,"spread":0.217866587745713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005110914,0.0001062057,0.0001406618,0.00026928,0.0001291421,0.00001311298,0.0004673857,0.0001074764,0.00002706701],"category_scores_gemma":[0.00001230152,0.0001155538,0.00007424627,0.0008712357,0.0003518297,0.00009911962,0.00000276002,0.0003336979,0.00005145387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009576831,"about_ca_system_score_gemma":0.00001839574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000226037,"about_ca_topic_score_gemma":0.00005237837,"domain_scores_codex":[0.9993999,0.00001771458,0.0002500274,0.0000890537,0.0001008294,0.000142475],"domain_scores_gemma":[0.998542,0.0001938491,0.00002930925,0.001144481,0.00005443699,0.00003598746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000009573235,0.0004138561,0.00002918659,0.00004561807,0.0001468027,6.613388e-7,0.0001198188,0.8282334,0.002189203,0.05895887,0.00007296446,0.1097801],"study_design_scores_gemma":[0.004748511,0.001129766,0.002198316,0.000751541,0.0007057223,0.0001900249,0.002646778,0.2062213,0.6316813,0.1313467,0.01585447,0.002525583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09472414,0.0007100924,0.891042,0.0009364007,0.0005141507,0.0003118774,0.00005838904,0.0016598,0.01004315],"genre_scores_gemma":[0.9056126,0.001802422,0.09248367,0.000009374558,0.000005556183,0.00005150687,0.00000286599,0.00001794869,0.0000139931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8108885,"threshold_uncertainty_score":0.4712147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985952244","doi":"10.1109/tcomm.2011.121611.110181","title":"Diversity Gain and Outage Probability for MIMO Free-Space Optical Links with Misalignment","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Fading; Diversity gain; MIMO; Fading distribution; Signal-to-noise ratio (imaging); Diversity combining; Channel (broadcasting); Maximal-ratio combining; Electronic engineering; Channel state information; Computer science; Transmitter; Telecommunications; Wireless; Engineering; Rayleigh fading","retraction":null,"screen_n_in":null,"score":{"opus":0.05914659510255892,"gpt":0.2361440594475078,"spread":0.1769974643449489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001699261,0.0001769781,0.000183907,0.00009476559,0.0008462311,0.00002190168,0.001168537,0.0002080602,0.00002334253],"category_scores_gemma":[0.00002272043,0.0001708352,0.00006301289,0.0001838993,0.0005280589,0.0001429846,0.00007807459,0.0006009018,0.000008769847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001048498,"about_ca_system_score_gemma":0.00001590196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003884141,"about_ca_topic_score_gemma":0.000379854,"domain_scores_codex":[0.9992065,0.0000492751,0.000214311,0.0001924472,0.0001205872,0.0002168612],"domain_scores_gemma":[0.9965802,0.000446702,0.00003159735,0.002759924,0.00008380238,0.00009772903],"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.001375471,0.01448877,0.004297191,0.001506698,0.003428901,0.000009363492,0.04737673,0.05748116,0.009870932,0.5829209,0.002721735,0.2745221],"study_design_scores_gemma":[0.01123956,0.003678903,0.009780274,0.0007543326,0.001350316,0.00006243016,0.0105461,0.415944,0.4149439,0.1111007,0.01564841,0.004950993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03123246,0.0002513387,0.9588611,0.002570807,0.00006047587,0.0008717647,0.0001004521,0.001110647,0.004940961],"genre_scores_gemma":[0.820749,0.0005615198,0.1782623,0.00002474929,0.000002375214,0.0003093059,0.000003883231,0.00002369607,0.00006314694],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7895166,"threshold_uncertainty_score":0.6966457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148095386","doi":"10.1109/tcomm.2004.838718","title":"A More Accurate One-Dimensional Analysis and Design of Irregular LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Noisy-channel coding theorem; Additive white Gaussian noise; Gaussian; Mathematics; Computer science; Variable (mathematics); Turbo code; Limit (mathematics); Code (set theory); Range (aeronautics); Node (physics); Convergence (economics); Random variable; White noise; Statistics; Error floor","retraction":null,"screen_n_in":null,"score":{"opus":0.05692893816505234,"gpt":0.3093812915881105,"spread":0.2524523534230582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003450289,0.0001432716,0.0002480489,0.0005126772,0.0003934817,0.00005250702,0.001294485,0.00007671348,0.000006664639],"category_scores_gemma":[0.00001411106,0.0001526362,0.0001275605,0.001512179,0.0002403173,0.0003158835,0.00002371923,0.0002778145,0.000005803736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006992793,"about_ca_system_score_gemma":0.0001103146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000318179,"about_ca_topic_score_gemma":0.0002869933,"domain_scores_codex":[0.9988183,0.0001904028,0.0003192711,0.0002759822,0.0002378764,0.0001581327],"domain_scores_gemma":[0.9968283,0.0004848834,0.0001416161,0.002279924,0.0001907174,0.00007455812],"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.00008214979,0.003810234,0.0001732164,0.00005314358,0.002484527,0.000006668573,0.009080789,0.8250483,0.0747949,0.0332792,0.0001042844,0.05108256],"study_design_scores_gemma":[0.001126251,0.0005118674,0.00326579,0.0002575704,0.00115088,0.0000519063,0.0001966011,0.6472129,0.3211983,0.02407008,0.0001169184,0.0008409943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005852059,0.0001371554,0.9909405,0.00235324,0.00004656371,0.0002382655,0.00001492098,0.0003371521,0.00008022114],"genre_scores_gemma":[0.6166682,0.0001166187,0.3830569,0.00007296049,0.000001630542,0.00005110589,0.00000194181,0.000006950022,0.0000236849],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6108161,"threshold_uncertainty_score":0.6224324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052543119","doi":"10.1109/tcomm.2013.122013.130239","title":"Joint Optimization of Source Precoding and Relay Beamforming in Wireless MIMO Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"MIMO; Beamforming; Precoding; Relay; Optimization problem; Computer science; Mathematical optimization; Telecommunications link; Convex optimization; Linear programming; Algorithm; Mathematics; Computer network; Power (physics); Telecommunications; Regular polygon","retraction":null,"screen_n_in":null,"score":{"opus":0.03488718693070877,"gpt":0.2568818715504245,"spread":0.2219946846197157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007299985,0.0001545057,0.0002365163,0.0002978769,0.000541378,0.00007843475,0.00114783,0.00009830757,0.00001024269],"category_scores_gemma":[0.00002413155,0.0001676807,0.00006630758,0.0007892154,0.0001464898,0.0004385525,0.00005367236,0.0005101822,0.000003049681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007829381,"about_ca_system_score_gemma":0.00003887889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003168234,"about_ca_topic_score_gemma":0.0002894593,"domain_scores_codex":[0.9984089,0.0004749113,0.0005190221,0.0002590762,0.0001366634,0.000201421],"domain_scores_gemma":[0.9969891,0.0006425584,0.0001866258,0.001979065,0.00012576,0.0000768512],"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.000004870379,0.0001510026,0.00006606063,0.000007918421,0.00001421506,6.492471e-8,0.001101536,0.8797811,0.0003659605,0.007094982,0.00001484897,0.1113974],"study_design_scores_gemma":[0.0003568932,0.00005497857,0.0001801092,0.0001751773,0.0000104392,0.000005405417,0.00006686785,0.9973657,0.0008719482,0.00005383368,0.0006950591,0.0001635556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004154762,0.0002857353,0.9923989,0.00139808,0.0001182886,0.0002371705,0.000001294861,0.0001137613,0.001291989],"genre_scores_gemma":[0.8972487,0.004477174,0.09793336,0.0001256843,0.000008926642,0.00006506138,0.000004142865,0.00001545605,0.0001214731],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8944656,"threshold_uncertainty_score":0.6837821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079882399","doi":"10.1109/tcomm.2012.010313.100669","title":"Relay Selection Schemes and Performance Analysis Approximations for Two-Way Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Selection (genetic algorithm); Computer science; Relay channel; Maximization; Block Error Rate; Cumulative distribution function; Signal-to-noise ratio (imaging); Overhead (engineering); Mathematical optimization; Computer network; Topology (electrical circuits); Mathematics; Telecommunications; Probability density function; Engineering; Statistics; Telecommunications link; Electrical engineering; Power (physics); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03651052135279172,"gpt":0.2829416572995919,"spread":0.2464311359468001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003149685,0.0001743211,0.0002073802,0.0003930636,0.001747958,0.0002899269,0.001220392,0.00007405246,0.00005491068],"category_scores_gemma":[0.00001137259,0.0001779693,0.0001385009,0.00190107,0.0001314835,0.0008587369,0.00002840509,0.0003724292,0.00002844602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000718893,"about_ca_system_score_gemma":0.00003840964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002301496,"about_ca_topic_score_gemma":0.0002390693,"domain_scores_codex":[0.9987668,0.000203489,0.0003525375,0.000311511,0.0001238273,0.0002418494],"domain_scores_gemma":[0.9969629,0.0005706403,0.0001189859,0.001867671,0.0003716216,0.000108196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001449271,0.0006431891,0.0005396167,0.00002259259,0.0008126691,4.452042e-8,0.001200709,0.3283241,0.0009511798,0.04901129,0.0007085291,0.6177716],"study_design_scores_gemma":[0.0003118532,0.00006968379,0.00126393,0.0000157173,0.0001028392,0.000003050482,0.00002860823,0.994414,0.0005798057,0.0001330116,0.002881043,0.0001964054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005221313,0.0003367296,0.9897243,0.00298149,0.00008997142,0.0006373026,0.000005273134,0.0002614701,0.0007420885],"genre_scores_gemma":[0.8811407,0.002008507,0.1148726,0.0002412389,0.00001532816,0.001057742,0.00001460902,0.00001282273,0.0006364139],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8759194,"threshold_uncertainty_score":0.9995517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170678650","doi":"10.1109/tcomm.2012.12.100671","title":"Partial and Opportunistic Relay Selection with Outdated Channel Estimates","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Channel state information; Channel (broadcasting); Selection (genetic algorithm); Computer science; Signal-to-noise ratio (imaging); Scheduling (production processes); Outage probability; Bit error rate; Control theory (sociology); Telecommunications; Mathematics; Fading; Wireless; Mathematical optimization; Power (physics); Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.07913082268188901,"gpt":0.3018495595084293,"spread":0.2227187368265403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000275995,0.0001576006,0.0001391885,0.0001430781,0.001084785,0.0001194117,0.0008123358,0.00005743052,0.00002680235],"category_scores_gemma":[0.00001021271,0.0001437011,0.00003313461,0.0005714553,0.0001588412,0.0006556479,0.00002327531,0.0003575872,0.00003984569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005406273,"about_ca_system_score_gemma":0.00005626222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001348504,"about_ca_topic_score_gemma":0.00009246302,"domain_scores_codex":[0.9990013,0.0001996026,0.0002141045,0.0001913057,0.0001339296,0.0002598107],"domain_scores_gemma":[0.9978641,0.0003201219,0.00008078117,0.001428196,0.0001302469,0.0001765083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002217991,0.007176409,0.002408045,0.0000832374,0.000988822,0.000004429818,0.0223075,0.03319018,0.01247961,0.3642972,0.002983131,0.5538597],"study_design_scores_gemma":[0.0007693853,0.000276253,0.001709092,0.0001044463,0.00009761227,0.0001166538,0.0001392019,0.9771263,0.005333165,0.0001936856,0.01357616,0.000558026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001578149,0.0003667698,0.9932412,0.003052308,0.0001405305,0.0002165189,0.000006367463,0.0003164978,0.001081662],"genre_scores_gemma":[0.9637747,0.001554522,0.0340311,0.0002238564,0.00001963626,0.0001409477,0.000009766559,0.00001490351,0.0002305587],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9621965,"threshold_uncertainty_score":0.8343401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}