{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":711,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":711,"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":"fea12930f71b","filters":{"topic":"Wireless Communication Security Techniques"}},"results":[{"id":"W1916886752","doi":"10.1007/3-540-48285-7_35","title":"Secret-Key Reconciliation by Public Discussion","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":790,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Collège Montmorency","funders":"","keywords":"Alice (programming language); Key (lock); Computer science; Channel (broadcasting); Alice and Bob; Computer security; Construct (python library); Protocol (science); Theoretical computer science; Binary number; Algorithm; Computer network; Mathematics; Arithmetic; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02534850090791529,"gpt":0.2537469176716241,"spread":0.2283984167637088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007381297,0.000329988,0.0002938472,0.0005873396,0.0001167702,0.0002076232,0.001297415,0.0004154897,0.00006076423],"category_scores_gemma":[0.00005890043,0.0002724825,0.00006429134,0.0003366419,0.0002925813,0.0003957035,0.0003249447,0.0008674798,0.00002728941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005213043,"about_ca_system_score_gemma":0.0000894152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007948533,"about_ca_topic_score_gemma":0.0001232785,"domain_scores_codex":[0.9981483,0.00001798873,0.0004140052,0.0004800958,0.0005573336,0.0003823333],"domain_scores_gemma":[0.9984748,0.0001709378,0.0001106053,0.0009877848,0.000139301,0.0001166188],"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.00000160313,0.00001036321,0.00003687631,0.00004565063,0.000007097855,0.000003890558,0.0005526283,0.004083871,0.0007362312,0.003351678,0.000498594,0.9906715],"study_design_scores_gemma":[0.0002636055,0.00009328279,0.00008039453,0.0007514355,0.000009543284,0.00002549143,5.932175e-7,0.7216452,0.015127,0.07499565,0.1855498,0.001457921],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001071642,0.0007340819,0.9853732,0.0006815278,0.0005064188,0.0002539025,0.000011359,0.0006848321,0.01164751],"genre_scores_gemma":[0.69508,0.000832158,0.3012224,0.001177748,0.0005303212,0.0000307694,0.0001981057,0.0001920671,0.0007364059],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9892136,"threshold_uncertainty_score":0.9999728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062610219","doi":"10.1109/tit.2008.2009807","title":"Capacity Bounds for the Gaussian Interference Channel","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":469,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian; Gaussian random field; Mathematics; Topology (electrical circuits); Range (aeronautics); Interference (communication); Gaussian noise; Upper and lower bounds; Channel (broadcasting); Channel capacity; Algorithm; Gaussian function; Combinatorics; Computer science; Physics; Telecommunications; Mathematical analysis; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01790983207713149,"gpt":0.2350918578325372,"spread":0.2171820257554058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312653,0.0001207262,0.00009130211,0.0001424371,0.0002576296,0.00008829095,0.0003294144,0.00008048855,0.00004439458],"category_scores_gemma":[0.000007684526,0.00009884317,0.00007907436,0.0001485015,0.00005712264,0.0007952858,6.165681e-7,0.0002578593,0.00004900857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007432503,"about_ca_system_score_gemma":0.0000107973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003057485,"about_ca_topic_score_gemma":0.000005775268,"domain_scores_codex":[0.9994137,0.00002928201,0.0002631932,0.0000493583,0.00009964652,0.0001448458],"domain_scores_gemma":[0.9992226,0.0002057228,0.00004371349,0.000423235,0.0000682246,0.00003645203],"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.0001690884,0.0001081889,2.709913e-7,0.0001022503,0.0001177705,8.247618e-8,0.01565024,0.1106131,0.0008484594,0.1783775,0.002944502,0.6910685],"study_design_scores_gemma":[0.001182682,0.0004559861,0.0002517491,0.0001995579,0.00009275619,0.00002423136,0.002175397,0.5821549,0.2509549,0.1160705,0.04551071,0.0009266047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008550455,0.00002519136,0.9915543,0.000529199,0.0002730726,0.0003550279,0.00004832701,0.0007273623,0.005632489],"genre_scores_gemma":[0.9980506,0.0001160287,0.001031616,0.0005413071,0.00001709729,0.0001871856,0.000006622665,0.000008748274,0.00004083743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9971955,"threshold_uncertainty_score":0.4030707,"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":"W2907860850","doi":"10.1109/comst.2018.2865607","title":"A Comprehensive Survey on Cooperative Relaying and Jamming Strategies for Physical Layer Security","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":278,"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","funders":"Horizon 2020 Framework Programme","keywords":"Eavesdropping; Jamming; Computer science; Physical layer; Computer network; Key (lock); Wireless; Cryptography; Beamforming; Computer security; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.09882018726467656,"gpt":0.3569622764406954,"spread":0.2581420891760189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002267839,0.0003155163,0.0005160074,0.0001456277,0.0006399416,0.0002355333,0.001085342,0.0001718367,0.000006125447],"category_scores_gemma":[0.000381881,0.0003387618,0.00007590884,0.0003793694,0.0006433062,0.0004103596,0.0002528301,0.0004324931,0.00002779496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000115273,"about_ca_system_score_gemma":0.00008519277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004757866,"about_ca_topic_score_gemma":0.001595061,"domain_scores_codex":[0.9963818,0.00232554,0.0004865266,0.0002952575,0.0001951003,0.0003157529],"domain_scores_gemma":[0.9911663,0.005349893,0.0001265098,0.002311725,0.0009499848,0.00009557023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008381107,0.003316913,0.006301096,0.000980404,0.002737524,0.000004859893,0.1609314,0.004981923,0.377155,0.2935835,0.1059402,0.04322913],"study_design_scores_gemma":[0.008052554,0.004384566,0.09505981,0.001518941,0.0003909463,0.00002706328,0.01068646,0.2093491,0.2601096,0.06055105,0.342456,0.007413957],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9726547,0.0007185506,0.01884929,0.0002265086,0.0009691471,0.001440026,0.0006494501,0.001198049,0.003294287],"genre_scores_gemma":[0.9951598,0.0005657453,0.003229664,0.00006060037,0.0003573335,0.0003280368,0.0002098397,0.00007190063,0.00001705512],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2365157,"threshold_uncertainty_score":0.9999064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1505562276","doi":"10.1109/jsac.2015.2432513","title":"Physical-Layer Security for MISO Visible Light Communication Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":259,"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","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; McMaster University","keywords":"Computer science; Transmitter; Visible light communication; Beamforming; Physical layer; Channel (broadcasting); Secure transmission; Secrecy; Computer network; Transmission (telecommunications); Telecommunications; Topology (electrical circuits); Wireless; Computer security; Electrical engineering; Physics; Light-emitting diode; Optics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05083687756006165,"gpt":0.3223381658429731,"spread":0.2715012882829115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009498384,0.0003083776,0.0004310681,0.0005140773,0.0003921544,0.0002111229,0.002849747,0.0001986434,0.000008252218],"category_scores_gemma":[0.0003612218,0.0003297686,0.000137508,0.001157525,0.0001099476,0.0005123731,0.0001851782,0.001549572,0.00003911811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005782861,"about_ca_system_score_gemma":0.0001542726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002399272,"about_ca_topic_score_gemma":0.0001476444,"domain_scores_codex":[0.9977908,0.0005365899,0.0007071542,0.0001886143,0.0003533575,0.000423498],"domain_scores_gemma":[0.9946915,0.0007963668,0.0002333543,0.003037526,0.0009734479,0.0002678188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005850846,0.01023639,0.001946028,0.0003010917,0.001153933,0.00001479213,0.08174808,0.07515912,0.05389662,0.105916,0.6453888,0.02365396],"study_design_scores_gemma":[0.004337585,0.0006247126,0.000624407,0.001084884,0.0001209637,0.0001777917,0.001204487,0.4382252,0.085465,0.1131184,0.353269,0.001747498],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8494331,0.0148003,0.03239514,0.03103489,0.001638481,0.004823408,0.0001964086,0.004990007,0.06068826],"genre_scores_gemma":[0.9869585,0.002557174,0.009561969,0.0001714937,0.0001576678,0.0003741305,0.00008424408,0.00009084197,0.00004394538],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3630661,"threshold_uncertainty_score":0.9999154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032278718","doi":"10.1109/tsp.2011.2172433","title":"Joint Secure Beamforming Design at the Source and the Relay for an Amplify-and-Forward MIMO Untrusted Relay System","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":246,"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; Beamforming; Computer science; MIMO; Relay channel; Computer network; Secrecy; Artificial noise; Signal-to-noise ratio (imaging); Telecommunications; Computer security; Transmitter; Channel (broadcasting); Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.04682904883414673,"gpt":0.2363888729056775,"spread":0.1895598240715307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009161966,0.0002436625,0.0002612201,0.0001067846,0.001078678,0.0001296713,0.0002752841,0.0001725019,0.00001028924],"category_scores_gemma":[0.000005262221,0.0001625749,0.00007451116,0.0001858519,0.0002523275,0.0003516632,0.000006088523,0.0004976231,0.000002959699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000113457,"about_ca_system_score_gemma":0.00002608909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004084664,"about_ca_topic_score_gemma":0.00004165235,"domain_scores_codex":[0.9987584,0.0001698147,0.0003838903,0.0002409155,0.0001811316,0.0002658892],"domain_scores_gemma":[0.998977,0.0003441305,0.0001090031,0.0003991654,0.00008415564,0.00008652097],"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.002246744,0.0002787749,0.00001826119,0.003157866,0.0006747324,0.000005130812,0.1170565,0.4172767,0.03147346,0.003373297,0.000412866,0.4240257],"study_design_scores_gemma":[0.001188757,0.000161493,0.00001045172,0.0004975129,0.0002305193,0.0001423907,0.003712208,0.8865381,0.1052732,0.0003655991,0.001453894,0.000425812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01649271,0.0008200731,0.9806346,0.0001100979,0.00005330023,0.0008468895,0.00001202174,0.0007208455,0.0003094159],"genre_scores_gemma":[0.9833056,0.0001019321,0.0159528,0.00007523067,0.00002754012,0.0003940594,0.000002479318,0.0000745201,0.00006585621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9668128,"threshold_uncertainty_score":0.8296428,"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":"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":"W2080257599","doi":"10.1109/glocom.2001.965721","title":"Coding for the Slepian-Wolf problem with turbo codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":187,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Turbo code; Computer science; Algorithm; Distributed source coding; Encoder; Serial concatenated convolutional codes; Concatenated error correction code; Coding (social sciences); Decoding methods; Encoding (memory); Variable-length code; Binary number; Turbo; Theoretical computer science; Block code; Mathematics; Artificial intelligence; Arithmetic; Engineering; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02495451027252609,"gpt":0.2243430274925475,"spread":0.1993885172200214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001028531,0.00008639606,0.00008510466,0.00002820048,0.00009112747,0.00004728356,0.0002883881,0.00003585388,0.0001446047],"category_scores_gemma":[0.000008018309,0.00005466842,0.00002559515,0.00009517865,0.00003535755,0.00009048857,0.0000260829,0.0001037785,0.00001489548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002347673,"about_ca_system_score_gemma":0.000001736266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001179784,"about_ca_topic_score_gemma":0.00005839457,"domain_scores_codex":[0.9995985,0.000008990777,0.0001096176,0.00007067856,0.00007518399,0.0001370217],"domain_scores_gemma":[0.9993349,0.0002052991,0.00001609625,0.0003836353,0.0000375526,0.00002247894],"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.00003174989,0.0001983444,0.001001638,0.0006420112,0.0005267434,0.000003392712,0.008789729,0.01731591,0.01295034,0.4173161,0.3137759,0.2274481],"study_design_scores_gemma":[0.0003641068,0.00007319695,0.0001225041,0.00009023744,0.00003009521,0.00001264999,0.0002851791,0.6543877,0.07571714,0.001365453,0.267167,0.0003846563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008780746,0.002495995,0.7405559,0.005318534,0.0000854609,0.002217968,0.00002028028,0.005915707,0.2346095],"genre_scores_gemma":[0.9532852,0.0003576854,0.04548097,0.0001000105,0.00002136329,0.0001475966,0.000002332908,0.00002763927,0.0005772234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9445044,"threshold_uncertainty_score":0.2229313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3101985270","doi":"10.1109/twc.2015.2500578","title":"Linear Precoding of Data and Artificial Noise in Secure Massive MIMO Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":177,"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":"Precoding; Artificial noise; Telecommunications link; Base station; MIMO; Data transmission; Zero-forcing precoding; Polynomial; Ergodic theory","retraction":null,"screen_n_in":null,"score":{"opus":0.09114750185726761,"gpt":0.3124666539971344,"spread":0.2213191521398668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000461382,0.0001903926,0.0003214533,0.0003503624,0.000120247,0.00004249734,0.001669596,0.0001668574,0.000004582121],"category_scores_gemma":[0.00001413506,0.0002234456,0.00003676788,0.0005084781,0.0002083276,0.000467715,0.00004408873,0.0006107303,0.000009553092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001275989,"about_ca_system_score_gemma":0.00006866531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002343884,"about_ca_topic_score_gemma":0.0009028533,"domain_scores_codex":[0.9985606,0.0002228066,0.0006023252,0.0002201014,0.0002031555,0.0001910247],"domain_scores_gemma":[0.9957744,0.0003499912,0.0001034299,0.003511021,0.000146759,0.0001143927],"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.0002560383,0.003853368,0.000984607,0.001270381,0.0007419115,0.00001103222,0.03441878,0.6807866,0.05593451,0.02885371,0.002738367,0.1901507],"study_design_scores_gemma":[0.0003708933,0.00004229402,0.00005418776,0.0002995926,0.00003804577,0.000007338344,0.001508173,0.9842048,0.01101906,0.0002409544,0.001924354,0.0002903019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2455007,0.002960496,0.7441327,0.001246608,0.0004221449,0.001326948,0.0009593169,0.001095735,0.002355365],"genre_scores_gemma":[0.9875768,0.002282043,0.009828116,0.00001107958,0.00001470304,0.0001585729,0.00006798216,0.00004624707,0.00001441354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7420762,"threshold_uncertainty_score":0.9111847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2218552649","doi":"10.1109/mcom.2015.7355563","title":"Physical layer security in wireless cooperative relay networks: state of the art and beyond","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Wireless Communication Security Techniques","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":"McGill University","funders":"","keywords":"Computer science; Computer network; Physical layer; PHY; Wireless; Relay; Wireless network; Exploit; Telecommunications; Computer security; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02460468358784306,"gpt":0.275302888953692,"spread":0.250698205365849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003711548,0.0001543321,0.0002589621,0.00008305858,0.00007002539,0.00002760941,0.001104504,0.00006097976,0.000002068877],"category_scores_gemma":[0.00004590525,0.0001354297,0.00003945724,0.0005506809,0.0003790858,0.0002026597,0.0004596312,0.000577063,0.00001450599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008156127,"about_ca_system_score_gemma":0.00003594231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001810466,"about_ca_topic_score_gemma":0.0008571603,"domain_scores_codex":[0.9989308,0.00029929,0.0003385325,0.000119054,0.0001503527,0.0001619896],"domain_scores_gemma":[0.9972451,0.0002441563,0.00008088251,0.002172028,0.0001893583,0.00006845153],"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.0002254557,0.005111788,0.02752519,0.0004718486,0.0006904107,0.00001027534,0.1053314,0.3645173,0.07738254,0.1267974,0.2395582,0.05237821],"study_design_scores_gemma":[0.0008385543,0.00005924927,0.00416358,0.0001532191,0.00002563743,0.000009443012,0.0002247381,0.9554427,0.01189307,0.005074704,0.02171643,0.0003986912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9709216,0.001957353,0.003504662,0.002015071,0.0001556192,0.0006934083,0.00004805482,0.0003622803,0.02034192],"genre_scores_gemma":[0.9969045,0.001386988,0.001398712,0.00006922261,0.00001725671,0.00009254733,0.00001990623,0.00002963056,0.00008126233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5909254,"threshold_uncertainty_score":0.5522661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2516026999","doi":"10.1109/mcom.2016.7537191","title":"Physical layer security issues in interference- alignment-based wireless networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":150,"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; Carleton University","funders":"","keywords":"Eavesdropping; Physical layer; Jamming; Computer science; Interference (communication); Computer network; Wireless; Computer security; Scheme (mathematics); Wireless network; Key (lock); Telecommunications; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.02674801258199283,"gpt":0.2914866726527696,"spread":0.2647386600707767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002821415,0.0002588199,0.0003353349,0.0002127368,0.00008487555,0.00004946893,0.002071204,0.000134753,0.00005026143],"category_scores_gemma":[0.00003045639,0.0002277103,0.00008650729,0.0004534046,0.0002722162,0.0002831861,0.0003121594,0.0004319202,0.0001665626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002199081,"about_ca_system_score_gemma":0.0000237918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003557287,"about_ca_topic_score_gemma":0.0005641991,"domain_scores_codex":[0.9985802,0.0002586415,0.0004418954,0.0002163023,0.0001684497,0.0003344981],"domain_scores_gemma":[0.9958104,0.0004683632,0.00007512153,0.003451338,0.000106236,0.00008852232],"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.0001967817,0.00626683,0.02160189,0.0004165018,0.0004555067,0.00002522097,0.008632003,0.01493103,0.4386988,0.1069799,0.1407775,0.261018],"study_design_scores_gemma":[0.001689379,0.0001076444,0.002528223,0.000936924,0.00003438983,0.00000548671,0.00008968484,0.8319926,0.07309076,0.006605749,0.08178437,0.001134746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7656041,0.004356849,0.174619,0.01806596,0.0006636793,0.001707414,0.0001384444,0.005450634,0.02939389],"genre_scores_gemma":[0.9943769,0.002499615,0.002467383,0.0001019578,0.00007076821,0.0003064908,0.00003434817,0.00005856625,0.00008398305],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8170616,"threshold_uncertainty_score":0.9285757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024304958","doi":"10.1109/jsac.2013.131130","title":"Cooperative Spectrum Access Towards Secure Information Transfer for CRNs","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Relay; Computer network; Secrecy; Transmission (telecommunications); Secure transmission; Beamforming; Jamming; Cognitive radio; Computer security; Power (physics); Telecommunications; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.03042371598402709,"gpt":0.2991643891685096,"spread":0.2687406731844825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003042699,0.0002332211,0.0002775091,0.0005207417,0.0003392018,0.0004753251,0.002028576,0.0001747672,0.0001133105],"category_scores_gemma":[0.000135753,0.0002323865,0.00008783256,0.0009147549,0.00007908342,0.002010497,0.00007140997,0.001209384,0.00004591867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003619783,"about_ca_system_score_gemma":0.0001383378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006316319,"about_ca_topic_score_gemma":0.0003415482,"domain_scores_codex":[0.998439,0.0002032568,0.0007145839,0.00009627716,0.0002223332,0.0003245114],"domain_scores_gemma":[0.9975892,0.0003517901,0.00008640521,0.00115131,0.0006966974,0.0001245569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004831649,0.00420074,0.004117794,0.0007234451,0.001987024,0.00000799416,0.05799995,0.2350472,0.02722047,0.1448205,0.3178235,0.2055682],"study_design_scores_gemma":[0.005780034,0.0008963029,0.04181224,0.001352983,0.0001329621,0.000278668,0.001432343,0.5650505,0.1000556,0.02925109,0.2511958,0.002761506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4033461,0.001486611,0.5188192,0.03248425,0.0009761262,0.00644232,0.0003607438,0.002890394,0.03319435],"genre_scores_gemma":[0.9915301,0.002655393,0.004568822,0.000379564,0.00005965437,0.000631863,0.0001155871,0.00004102,0.00001806347],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5881839,"threshold_uncertainty_score":0.9476448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2314565273","doi":"10.1109/twc.2016.2535442","title":"Physical Layer Authentication Enhancement Using Two-Dimensional Channel Quantization","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":141,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; False alarm; Quantization (signal processing); Physical layer; Algorithm; MIMO; Multipath propagation; Channel (broadcasting); Wireless; Test statistic; Spoofing attack; Statistical hypothesis testing; Mathematics; Statistics; Artificial intelligence; Computer network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04496404008474349,"gpt":0.3044346510291962,"spread":0.2594706109444527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000205746,0.0002958192,0.0002813293,0.0003171242,0.0005003018,0.00005012889,0.0009844664,0.000118338,0.00007204719],"category_scores_gemma":[0.00000603722,0.0002707964,0.0001486226,0.0004967765,0.0002478675,0.0004521436,0.00001808118,0.0003405944,0.0001755248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000345961,"about_ca_system_score_gemma":0.00004841595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004034434,"about_ca_topic_score_gemma":0.00008427265,"domain_scores_codex":[0.9983653,0.0002042295,0.0004779774,0.0002829549,0.0003499133,0.0003195714],"domain_scores_gemma":[0.9966647,0.0003833998,0.0001114532,0.00250325,0.0002178693,0.0001193153],"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.00003660199,0.0009703487,0.00001223384,0.0000370092,0.000178957,5.426056e-7,0.001182314,0.05872681,0.8823819,0.008703183,0.000186657,0.04758343],"study_design_scores_gemma":[0.0005190501,0.00004629285,0.00002845832,0.0002027606,0.00005774984,0.000005784651,0.00003350828,0.5190367,0.4783182,0.00104435,0.0003392095,0.0003678826],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.255188,0.00007870824,0.7419382,0.0008979479,0.0001980324,0.0003964022,0.00005685632,0.0009107059,0.0003351348],"genre_scores_gemma":[0.9905809,0.0004534876,0.008315641,0.00006953068,0.00003669978,0.0003412514,0.00002501293,0.00008568063,0.00009183143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7353928,"threshold_uncertainty_score":0.9999744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032013577","doi":"10.1109/icc.2014.6883837","title":"Physical-layer security for indoor visible light communications","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","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":"Visible light communication; Transmitter; Computer science; Physical layer; Precoding; Channel state information; Artificial noise; Channel (broadcasting); Transmission (telecommunications); Computer network; Secure transmission; Secrecy; Additive white Gaussian noise; Electronic engineering; Wireless; Telecommunications; Computer security; MIMO; Electrical engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02036847488631251,"gpt":0.2850855773704327,"spread":0.2647171024841202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000191744,0.0001284455,0.0001801895,0.00007236354,0.0001153873,0.00004640041,0.000900322,0.00007387542,0.00002376106],"category_scores_gemma":[0.00004454644,0.0001290465,0.00008253834,0.0001596745,0.00004313597,0.0001670302,0.000184824,0.0001902978,0.00006671785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003639136,"about_ca_system_score_gemma":0.000006702019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001245779,"about_ca_topic_score_gemma":0.00004407536,"domain_scores_codex":[0.9993806,0.00004668008,0.0001859524,0.0001136732,0.00009103628,0.0001820336],"domain_scores_gemma":[0.9977888,0.0002722459,0.00002851226,0.001759161,0.00008952022,0.00006179383],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006923906,0.0003605794,0.0001828493,0.0001705723,0.00008555157,6.4776e-8,0.002791406,0.0001409591,0.04350709,0.8301894,0.1073928,0.01517179],"study_design_scores_gemma":[0.0002433933,0.00003358597,0.00007103595,0.00001947742,0.00001279698,7.454485e-7,0.00004272203,0.3237202,0.1420653,0.03088732,0.5026546,0.00024882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1201918,0.0007158979,0.4099878,0.00800809,0.0002132721,0.001876336,0.00005318309,0.009388428,0.4495651],"genre_scores_gemma":[0.975085,0.0001008253,0.02412299,0.0001673278,0.00006213025,0.0002984202,0.00002887135,0.00004018121,0.00009423614],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8548932,"threshold_uncertainty_score":0.5262363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963728200","doi":"10.1109/twc.2017.2659724","title":"Analysis and Design of Secure Massive MIMO Systems in the Presence of Hardware Impairments","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":123,"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":"Artificial noise; Precoding; Computer science; Telecommunications link; MIMO; Base station; Noise (video); Transceiver; Transmission (telecommunications); Computer hardware; Phase noise; Secrecy; Electronic engineering; Wireless; Computer network; Transmitter; Telecommunications; Channel (broadcasting); Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03368444558871831,"gpt":0.2853404049934569,"spread":0.2516559594047386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609499,0.0001526646,0.0003458283,0.0003580935,0.0003554,0.00006935777,0.002333948,0.0001101869,0.000005141435],"category_scores_gemma":[0.00001479676,0.0001394688,0.0001025718,0.0004481472,0.0003993433,0.0002527461,0.00001986432,0.000396249,0.000001111113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000431497,"about_ca_system_score_gemma":0.00002512884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006525358,"about_ca_topic_score_gemma":0.0005780492,"domain_scores_codex":[0.9986551,0.0003861482,0.0004668655,0.00013327,0.0002180374,0.00014061],"domain_scores_gemma":[0.9948201,0.00067266,0.0002344126,0.004100553,0.0001357305,0.00003654626],"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.00009572234,0.002074436,0.007088752,0.0007985627,0.002704809,0.000005823728,0.02938319,0.8966205,0.0237874,0.006670288,0.0002978816,0.03047263],"study_design_scores_gemma":[0.0006093986,0.000108686,0.01414063,0.0004838691,0.0005035992,0.000007159585,0.00239938,0.9593044,0.02164488,0.0002283692,0.0001961979,0.0003734376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1202391,0.0009908996,0.8762569,0.000559958,0.00007283293,0.001036285,0.0002178727,0.0001452793,0.0004808789],"genre_scores_gemma":[0.9925393,0.003837703,0.003237053,0.000006383815,0.000002522924,0.00034016,0.000007668038,0.00001867336,0.00001053207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8730198,"threshold_uncertainty_score":0.5687374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071160621","doi":"10.1007/s00220-008-0624-0","title":"Counterexamples to the Maximal p-Norm Multiplicativity Conjecture for all p &gt; 1","year":2008,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Counterexample; Conjecture; Von Neumann entropy; Quantum; Classical capacity; Entropy (arrow of time); Quantum channel; Quantum mutual information; Joint quantum entropy","retraction":null,"screen_n_in":null,"score":{"opus":0.09462451070217012,"gpt":0.3255230945191994,"spread":0.2308985838170292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003081035,0.0001871044,0.0002720609,0.00005001119,0.0002272395,0.00003430226,0.002175556,0.00008871119,0.00001005303],"category_scores_gemma":[0.0001874336,0.0001586366,0.0000906178,0.0003137578,0.0002640909,0.0001222427,0.0004705865,0.0003916453,0.00007662542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152403,"about_ca_system_score_gemma":0.00001718205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006986811,"about_ca_topic_score_gemma":0.00005620517,"domain_scores_codex":[0.9989716,0.00008766364,0.0003901639,0.0001497853,0.000153416,0.0002474146],"domain_scores_gemma":[0.9950309,0.001363468,0.00005334398,0.003398359,0.00009199566,0.00006190631],"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.00001546047,0.0009143677,0.0002760943,0.0002514026,0.0001054539,6.976716e-7,0.01341979,0.003438709,0.002791001,0.9416155,0.01949935,0.01767219],"study_design_scores_gemma":[0.0006123739,0.00005288961,0.001406005,0.000184835,0.00003707864,0.00002514557,0.0002548435,0.3849048,0.00519245,0.3283531,0.2782677,0.0007086383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04528296,0.0007787253,0.9306895,0.007350346,0.00004873755,0.002844024,0.0001540961,0.001130255,0.01172138],"genre_scores_gemma":[0.8411782,0.0003326908,0.1568936,0.0002560532,0.00002953878,0.001193584,0.0000514105,0.00004366364,0.00002124791],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7958952,"threshold_uncertainty_score":0.6469015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1489319061","doi":"10.1007/3-540-39200-9_35","title":"New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Secrecy; Upper and lower bounds; Shared secret; Key (lock); Theoretical computer science; Context (archaeology); Fraction (chemistry); Information theory; Mutual information; Adversary; Pre-shared key; Key distribution; Public-key cryptography; Algorithm; Cryptography; Mathematics; Computer security; Encryption; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0237777613687142,"gpt":0.2571438290335551,"spread":0.2333660676648409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005913775,0.000251133,0.0002335818,0.000417357,0.0001161555,0.0002293073,0.0006647186,0.0002351479,0.0000197129],"category_scores_gemma":[0.00002414128,0.0002234386,0.00003329141,0.0002729956,0.0001624987,0.0004959956,0.0001742482,0.0007794636,0.000005544091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002954302,"about_ca_system_score_gemma":0.00005726338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004593675,"about_ca_topic_score_gemma":0.0003372027,"domain_scores_codex":[0.9987249,0.00003101815,0.0003618166,0.0002879169,0.0003468139,0.0002474733],"domain_scores_gemma":[0.9989272,0.0002408136,0.0001018332,0.0006206239,0.0000481449,0.00006143659],"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.000002205885,0.000005207536,0.0001627191,0.00008475596,0.00001001164,0.000003510381,0.003045571,0.01176835,0.0003517366,0.007272049,0.0001542599,0.9771397],"study_design_scores_gemma":[0.0005850903,0.0001277485,0.001701494,0.001324886,0.00002996373,0.00008376551,0.000003571117,0.492074,0.01258491,0.439517,0.050574,0.001393618],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006262096,0.001014029,0.9921645,0.0004874096,0.0002045852,0.0003416598,0.000003478054,0.0001414573,0.00501665],"genre_scores_gemma":[0.8347348,0.0011808,0.1630228,0.0005176554,0.0003019635,0.00002075972,0.00003690493,0.00005875049,0.0001254932],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.975746,"threshold_uncertainty_score":0.9111562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974240071","doi":"10.1109/glocomw.2014.7063485","title":"Securing visible light communications via friendly jamming","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":104,"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":"Eavesdropping; Jamming; Computer science; Visible light communication; Beamforming; Secrecy; Channel (broadcasting); Wireless; Computer network; Channel state information; Transmitter; Interference (communication); Telecommunications; Computer security; Engineering; Light-emitting diode; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.00967349987504123,"gpt":0.23814003765069,"spread":0.2284665377756488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002523457,0.0001353558,0.0001498879,0.0001276509,0.0001544411,0.00005934877,0.001028597,0.00008498618,0.00008611219],"category_scores_gemma":[0.00002640229,0.0001475011,0.00004969987,0.0002237699,0.00003999633,0.0002405173,0.0003051595,0.0002725073,0.0001687124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005304973,"about_ca_system_score_gemma":0.000005132511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003524309,"about_ca_topic_score_gemma":0.00009059598,"domain_scores_codex":[0.9992341,0.00005946146,0.0002615375,0.0001160801,0.0001195503,0.0002092806],"domain_scores_gemma":[0.9977385,0.0001269957,0.00003078773,0.001977513,0.00005371373,0.00007250362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006131256,0.000252093,0.001182613,0.0002858917,0.0001734875,0.000001504866,0.006451188,0.001924553,0.1625652,0.5333791,0.0285772,0.265201],"study_design_scores_gemma":[0.0001821892,0.0000330892,0.0001988755,0.00005912193,0.00001108677,0.000007472791,0.000127137,0.2598353,0.1136305,0.003879367,0.621627,0.0004088362],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01901545,0.0006383674,0.5036891,0.001475433,0.0001222975,0.0002477692,0.000002187394,0.005462511,0.4693469],"genre_scores_gemma":[0.9323931,0.0002241587,0.06705961,0.00008838558,0.00003288353,0.00005242893,0.00001149299,0.00004178345,0.00009609827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9133777,"threshold_uncertainty_score":0.601492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106711692","doi":"10.1109/tit.2003.809560","title":"Secret-key agreement over unauthenticated public channels-part II: the simulatability condition","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"A priori and a posteriori; Computer science; Formalism (music); Key (lock); Secret sharing; Context (archaeology); Theoretical computer science; Representation (politics); Authentication (law); Channel (broadcasting); Cryptography; Computer security; Mathematics; Topology (electrical circuits); Computer network; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01434947389589895,"gpt":0.2329499708838691,"spread":0.2186004969879702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009574367,0.0001961483,0.0001413458,0.0002219405,0.0005003656,0.0001258199,0.0003103247,0.000129194,0.001704574],"category_scores_gemma":[0.00003188527,0.0001700236,0.0001044293,0.000379862,0.0001322133,0.001371651,0.000002963004,0.0003891983,0.0002349605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001849987,"about_ca_system_score_gemma":0.00003120514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003966779,"about_ca_topic_score_gemma":0.000006164964,"domain_scores_codex":[0.9986126,0.0002372243,0.0005130903,0.0001015591,0.0002941553,0.0002413852],"domain_scores_gemma":[0.9986449,0.0002261716,0.00009319461,0.0008175038,0.000140001,0.00007815953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001089571,0.000629967,0.0000184107,0.0002735689,0.000507566,5.174671e-7,0.02485497,0.2907066,0.0007607045,0.6281822,0.004871272,0.04908519],"study_design_scores_gemma":[0.002095905,0.0002366585,0.0001734152,0.0001387162,0.0001426935,0.00002005243,0.003073139,0.2151779,0.1887924,0.06044799,0.5284276,0.001273503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07782079,0.00003786374,0.9072878,0.0002821414,0.0007277015,0.0007057307,0.00009769601,0.001080176,0.01196008],"genre_scores_gemma":[0.9989473,0.00007829159,0.000206698,0.0003256019,0.00001279871,0.0002409016,0.00006371761,0.00001835636,0.0001063871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9211264,"threshold_uncertainty_score":0.999208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2518646054","doi":"10.1109/access.2016.2604618","title":"Experimental Study on Key Generation for Physical Layer Security in Wireless Communications","year":2016,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Queen's University; University College Dublin; Queen's University Belfast; Royal Academy of Engineering; Rice University","keywords":"Computer science; Multipath propagation; Testbed; Decorrelation; Key generation; Wireless; Key (lock); Physical layer; Channel (broadcasting); Anechoic chamber; Randomness; Computer network; Telecommunications; Computer security; Encryption; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.09424227749366394,"gpt":0.3803990057561329,"spread":0.286156728262469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001621376,0.0001463754,0.0001813708,0.0001138027,0.00008166116,0.0000690979,0.001051809,0.00006037755,0.000006248899],"category_scores_gemma":[0.00001289077,0.000125856,0.00004569491,0.0001524378,0.00004671663,0.000437067,0.0001368777,0.0001353917,0.00001311792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001580929,"about_ca_system_score_gemma":0.00001045395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003219359,"about_ca_topic_score_gemma":0.0002192892,"domain_scores_codex":[0.9991785,0.00009846552,0.0002309827,0.0001824222,0.0001408671,0.0001687156],"domain_scores_gemma":[0.9984908,0.0001929518,0.00003943499,0.001186391,0.00005086511,0.00003956318],"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.00006477291,0.005038338,0.004918728,0.00003366297,0.00007621208,0.000002007596,0.01121611,0.000283291,0.9525288,0.01230826,0.005622976,0.00790684],"study_design_scores_gemma":[0.001090275,0.0002119108,0.001392805,0.00005383582,0.000007529776,5.299128e-7,0.0002159846,0.0400329,0.9549509,0.0007793626,0.0009575485,0.000306423],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9935088,0.00004856792,0.00415611,0.0002582956,0.0001169815,0.0008333987,0.00002342532,0.0003781558,0.0006762964],"genre_scores_gemma":[0.9983681,0.00003604562,0.0002112615,0.00004731813,0.0001160828,0.001163063,0.00001215247,0.00003882142,0.00000716784],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03974961,"threshold_uncertainty_score":0.513226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2557746379","doi":"10.1109/twc.2016.2633336","title":"Robust Resource Allocation to Enhance Physical Layer Security in Systems With Full-Duplex Receivers: Active Adversary","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Iran National Science Foundation","keywords":"Computer science; Jamming; Secrecy; Physical layer; Maximization; Transmitter; Computer network; Transmitter power output; Adversary; Artificial noise; Resource allocation; Transmission (telecommunications); Secure communication; Channel (broadcasting); Secure transmission; Computer security; Wireless; Telecommunications; Mathematical optimization; Encryption; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02343356054720087,"gpt":0.2638491814607101,"spread":0.2404156209135092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002341253,0.000352149,0.0003887498,0.0004567833,0.0002902866,0.00005804568,0.00149522,0.0001806361,0.0000191792],"category_scores_gemma":[0.00001053276,0.0003162769,0.00009206269,0.001018095,0.0002273597,0.0005825729,0.00002201927,0.0007122041,0.0001105285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006873303,"about_ca_system_score_gemma":0.00006183874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001977521,"about_ca_topic_score_gemma":0.001640369,"domain_scores_codex":[0.9980479,0.0003552466,0.0004525926,0.0004026617,0.0003501049,0.0003914363],"domain_scores_gemma":[0.9957337,0.0006960671,0.0001023998,0.003089161,0.000200761,0.0001778542],"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.0005818969,0.002313435,0.00004995331,0.0001716383,0.000375982,0.000006024869,0.01683546,0.7299845,0.1202722,0.003772875,0.001459722,0.1241763],"study_design_scores_gemma":[0.002579183,0.000787303,0.0007141402,0.003816948,0.0001875009,0.00004694279,0.005624255,0.5393474,0.4152415,0.0002102552,0.02857134,0.002873171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4161863,0.0001256677,0.5753375,0.003371732,0.0001069969,0.001306651,0.000195682,0.001423719,0.001945707],"genre_scores_gemma":[0.9949186,0.0008963885,0.002713481,0.00006812727,0.00002538504,0.001166716,0.00002204366,0.00009029087,0.00009896003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5787323,"threshold_uncertainty_score":0.999929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2815431952","doi":"10.1109/access.2018.2853700","title":"On Physical Layer Security Over the Fisher-Snedecor ${\\mathcal{F}}$ Wiretap Fading Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Secrecy; Physical layer; Fading; Computer science; Channel (broadcasting); Monte Carlo method; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Wireless; Computer security; Statistics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03558016228437436,"gpt":0.3232698907196654,"spread":0.2876897284352911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001996376,0.0002285745,0.0002285408,0.00008183279,0.0001973579,0.0002702668,0.001383233,0.000115913,0.0001472161],"category_scores_gemma":[0.00003650926,0.0001804792,0.0001007995,0.0003191387,0.0001441325,0.0005299601,0.0001802806,0.0004349858,0.0001677093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007902133,"about_ca_system_score_gemma":0.00001020829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006303535,"about_ca_topic_score_gemma":0.00005977412,"domain_scores_codex":[0.9988789,0.00007393004,0.0002134282,0.0002308353,0.0002810721,0.0003218522],"domain_scores_gemma":[0.9985062,0.0002554494,0.00005588302,0.00102967,0.00008003856,0.00007275993],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002181053,0.00156667,0.00399861,0.0006580761,0.0009759774,0.00005303331,0.06401554,0.01051826,0.05722295,0.058196,0.7540883,0.04848852],"study_design_scores_gemma":[0.0006237546,0.0001772131,0.005968472,0.0002499234,0.00005238409,0.00001044771,0.00007414454,0.3873338,0.514005,0.05227599,0.03811999,0.001108868],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9844812,0.0000450138,0.002897324,0.0003325908,0.0006825522,0.0002797267,0.00001218673,0.001008242,0.01026116],"genre_scores_gemma":[0.9984256,0.00003754681,0.00005468455,0.000549994,0.0007301909,0.00009771423,0.000004114975,0.00006070935,0.00003943886],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7159683,"threshold_uncertainty_score":0.7359726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2530027684","doi":"10.1109/twc.2016.2617328","title":"Optimal Relay Selection for Secure Cooperative Communications With an Adaptive Eavesdropper","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Eavesdropping; Relay; Computer science; Jamming; Secrecy; Channel (broadcasting); Computer network; Selection (genetic algorithm); Relay channel; Channel state information; Secure communication; Wireless; Telecommunications; Computer security; Encryption; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03125541988931355,"gpt":0.2776628305870145,"spread":0.2464074106977009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031043,0.0004592025,0.0004111809,0.0003738028,0.001280386,0.00009902514,0.002510941,0.0002892628,0.00005467819],"category_scores_gemma":[0.000007948493,0.0003835419,0.000155865,0.0007245392,0.0007443651,0.0007265753,0.00002443958,0.0007684507,0.00004938435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004333918,"about_ca_system_score_gemma":0.0001351966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005689068,"about_ca_topic_score_gemma":0.002120143,"domain_scores_codex":[0.9978699,0.0004068771,0.0005850007,0.0004138356,0.0002719914,0.0004523773],"domain_scores_gemma":[0.9930524,0.001001003,0.0001392163,0.004926664,0.0006629867,0.0002177465],"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.00209684,0.007119602,0.0001879962,0.0001956636,0.002784738,0.000002293377,0.01374055,0.3848167,0.138276,0.121,0.003736111,0.3260436],"study_design_scores_gemma":[0.002544935,0.002022299,0.00007685324,0.0005654261,0.0002571714,0.00005620517,0.001225622,0.8558928,0.117704,0.0002960223,0.01780589,0.001552867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03466296,0.0001921376,0.9581422,0.002170037,0.00008570709,0.001379095,0.0004557701,0.001971475,0.0009405887],"genre_scores_gemma":[0.8491511,0.001701584,0.1458958,0.00009527044,0.0000234197,0.002698267,0.00005982279,0.0001554684,0.0002192642],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8144881,"threshold_uncertainty_score":0.9998617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003714332","doi":"10.1109/icc.2013.6655319","title":"A two dimensional quantization algorithm for CIR-based physical layer authentication","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":79,"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; Quantization (signal processing); Algorithm; Physical layer; Orthogonal frequency-division multiplexing; False alarm; Spoofing attack; Wireless; Channel (broadcasting); Computer network; Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01906621006241805,"gpt":0.2790688984755446,"spread":0.2600026884131266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006307569,0.00009495514,0.00009866491,0.00006597927,0.00004742596,0.00003935037,0.0001411627,0.0000409489,0.00008360669],"category_scores_gemma":[0.00001266884,0.00009281181,0.00005051096,0.0001086327,0.00002239067,0.0001767279,0.00001934199,0.00006538012,0.000100096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003615767,"about_ca_system_score_gemma":0.00001056793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002993844,"about_ca_topic_score_gemma":0.000003140864,"domain_scores_codex":[0.999488,0.0000180834,0.0001437538,0.0001065013,0.0001178027,0.0001258488],"domain_scores_gemma":[0.999379,0.0001133156,0.00002322369,0.0003061871,0.0001377147,0.00004055413],"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.000008473128,0.001105241,0.0002450788,0.0001634151,0.0001308059,3.313344e-7,0.001007699,0.0311164,0.4644817,0.1336806,0.03538492,0.3326754],"study_design_scores_gemma":[0.000217376,0.00001658303,0.0002527576,0.000009318706,0.000006448717,2.727388e-7,0.000008402409,0.9261352,0.06940439,0.003121458,0.0007154141,0.0001123335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1235211,0.0000234497,0.8735412,0.0003664747,0.00005388804,0.0005753697,0.00000845614,0.00115059,0.000759414],"genre_scores_gemma":[0.8321995,0.000001530935,0.1671359,0.00008167489,0.00003944028,0.0003672069,0.00009770066,0.00002549012,0.00005153486],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8950189,"threshold_uncertainty_score":0.3784756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097440336","doi":"10.1109/tit.2006.871608","title":"On the joint source-channel coding error exponent for discrete memoryless systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":75,"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":"Exponent; Additive white Gaussian noise; Mathematics; Channel (broadcasting); Source code; Decoding methods; Discrete mathematics; Topology (electrical circuits); Algorithm; White noise; Combinatorics; Computer science; Statistics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01852788324696426,"gpt":0.2214152741838413,"spread":0.202887390936877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006327484,0.000189069,0.0001644827,0.0002405409,0.0003684942,0.0001320421,0.0002653841,0.0001028937,0.00003471173],"category_scores_gemma":[0.00001024782,0.0001538567,0.0001302901,0.0001403626,0.00006113075,0.0005128738,0.00000180954,0.0002767122,0.00008188814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001556658,"about_ca_system_score_gemma":0.00001084442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002421015,"about_ca_topic_score_gemma":0.000005652539,"domain_scores_codex":[0.9989049,0.0000924341,0.0004963495,0.0000808331,0.0002201295,0.0002053098],"domain_scores_gemma":[0.9987881,0.0004609606,0.0001074293,0.0005220987,0.00008300313,0.00003838747],"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.00005466124,0.00003703349,5.389263e-8,0.0001296491,0.00004335677,7.612864e-8,0.00198833,0.8380008,0.0005513654,0.154445,0.002074227,0.002675444],"study_design_scores_gemma":[0.0007419739,0.0001132431,0.00001189762,0.000328139,0.00005126419,0.00000961996,0.004469896,0.8342786,0.1367139,0.0135112,0.009209309,0.000560967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008000182,0.00002895295,0.9853379,0.0002302116,0.0004761314,0.0008789623,0.0001027374,0.0009292787,0.004015636],"genre_scores_gemma":[0.9984008,0.00002629932,0.0002114955,0.000138012,0.00003331441,0.0009600684,0.00002726339,0.00003232034,0.0001703998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9904007,"threshold_uncertainty_score":0.6274096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095214648","doi":"10.1109/tit.2013.2256952","title":"MIMO Multiple Access Channel With an Arbitrarily Varying Eavesdropper: Secrecy Degrees of Freedom","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":67,"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":"Eavesdropping; Secrecy; Transmitter; MIMO; Computer science; Channel (broadcasting); Transmission (telecommunications); Converse; Computer network; Secure transmission; Degrees of freedom (physics and chemistry); Topology (electrical circuits); Mathematics; Telecommunications; Computer security; Combinatorics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01569488056692708,"gpt":0.2280826123690391,"spread":0.212387731802112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001931588,0.0001971465,0.000193991,0.0003963991,0.0001412386,0.0001181875,0.0004984613,0.0001250771,0.0001996334],"category_scores_gemma":[0.00000573912,0.0001843722,0.0000625184,0.0002914635,0.0001013581,0.00343308,0.00000309272,0.0003274226,0.00006630951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000556778,"about_ca_system_score_gemma":0.00002505615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002022723,"about_ca_topic_score_gemma":0.0000536244,"domain_scores_codex":[0.9989949,0.00006787905,0.0004411167,0.00008826997,0.0002168303,0.0001910025],"domain_scores_gemma":[0.9988492,0.0001625924,0.0001093695,0.0006026091,0.0001846981,0.00009150891],"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.0001188501,0.0001359545,0.00002148467,0.0001930992,0.0001185985,2.075225e-7,0.005756396,0.9591131,0.001578438,0.004176127,0.00009781262,0.02868999],"study_design_scores_gemma":[0.001035777,0.0002404935,0.0006678324,0.0001990087,0.0000397638,0.00001459271,0.00131258,0.8685303,0.1243163,0.002892568,0.0002007236,0.0005501055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1008802,0.00002103609,0.893424,0.0000273748,0.0001237495,0.0004752486,0.00004842202,0.0008258439,0.004174042],"genre_scores_gemma":[0.9912804,0.00006493935,0.008227712,0.00006645192,0.00001268205,0.0002793939,0.00002480185,0.00003028897,0.00001335885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8904001,"threshold_uncertainty_score":0.7518481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036235015","doi":"10.1109/glocom.2014.7037452","title":"Channel-based physical layer authentication","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Support vector machine; Channel (broadcasting); Authentication (law); False alarm; Linear discriminant analysis; Pattern recognition (psychology); Artificial intelligence; Machine learning; Computer network; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01327401227603445,"gpt":0.2425191623087703,"spread":0.2292451500327359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007031609,0.00006097759,0.00006759675,0.00004089177,0.0000216475,0.00001581315,0.0001644368,0.0000316323,0.00002872623],"category_scores_gemma":[0.00001262211,0.00005966906,0.00002768429,0.00007427553,0.00001710648,0.00005427731,0.00001621776,0.00007172606,0.0001387203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001681984,"about_ca_system_score_gemma":0.000002471733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003220739,"about_ca_topic_score_gemma":0.000002385066,"domain_scores_codex":[0.9996915,0.00001978791,0.00007160161,0.00006137517,0.0000709956,0.00008469382],"domain_scores_gemma":[0.999504,0.00004826072,0.00000913844,0.0003849802,0.00002413416,0.00002947072],"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.00001451951,0.001031995,0.0003941474,0.0003729651,0.00009795678,7.073705e-7,0.004638385,0.0457916,0.2624831,0.5746641,0.03700348,0.07350714],"study_design_scores_gemma":[0.00006412835,0.00001057717,0.0003377344,0.000006433332,0.00000283922,1.372944e-7,0.000005182188,0.8454891,0.1410525,0.002662793,0.01028461,0.00008404758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2297164,0.00001965126,0.7239649,0.0006144647,0.00006529536,0.0001415997,0.000001274216,0.003323379,0.04215305],"genre_scores_gemma":[0.9972001,0.000002645441,0.002558006,0.0000828578,0.00004296232,0.00003415842,0.000008323187,0.00001715879,0.00005383169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7996975,"threshold_uncertainty_score":0.2433234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2286924897","doi":"10.1017/s1759078715001099","title":"A review of directional modulation technology","year":2015,"lang":"en","type":"review","venue":"International Journal of Microwave and Wireless Technologies","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Queen's University","keywords":"Physical layer; Computer science; Key (lock); Wireless; Cryptography; Modulation (music); Computer network; Computer security; Telecommunications; Electronic engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03417661417780892,"gpt":0.3319726679919592,"spread":0.2977960538141503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004621056,0.0002966536,0.001377263,0.001391063,0.00001815539,0.00002405518,0.001253075,0.0005206677,0.000004562959],"category_scores_gemma":[0.0001880416,0.0002539925,0.0002727261,0.0004621712,0.0002556978,0.000178791,0.000315504,0.0007417964,0.000002677872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002186969,"about_ca_system_score_gemma":0.0001394058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001777628,"about_ca_topic_score_gemma":0.00000118457,"domain_scores_codex":[0.9980616,0.0000467632,0.001262856,0.0001431199,0.0003552274,0.0001304385],"domain_scores_gemma":[0.9974527,0.0001038373,0.0009811569,0.0003516883,0.001082445,0.00002817894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002252264,0.00002647354,0.000003144282,0.01065752,0.000344679,0.000008355079,0.00001193771,0.000001710114,0.0001940909,0.0007881274,0.004019863,0.9839419],"study_design_scores_gemma":[0.0001045737,0.00004107547,6.651653e-7,0.08713759,0.0001522868,0.0007642917,0.00004195625,0.00003292425,0.00134243,0.002489956,0.9076849,0.0002073343],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00004440508,0.9963772,0.00201951,0.000288254,0.0003101278,0.000215449,0.00004331007,0.000449625,0.00025214],"genre_scores_gemma":[0.001716324,0.9940814,0.00403318,0.00001321653,0.0000525411,0.00002735524,0.00002794703,0.00004042591,0.000007637736],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9837345,"threshold_uncertainty_score":0.9999912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971066773","doi":"10.1109/icc.2012.6364429","title":"Physical layer authentication in OFDM systems based on hypothesis testing of CFO estimates","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Western University","funders":"","keywords":"Carrier frequency offset; Computer science; Transmitter; Wireless; Physical layer; Fading; Multipath propagation; Orthogonal frequency-division multiplexing; Computer network; Authentication (law); Transmission (telecommunications); Wireless security; Electronic engineering; Channel (broadcasting); Frequency offset; Computer security; Telecommunications; Wireless network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05102343942521926,"gpt":0.2706768845818486,"spread":0.2196534451566294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001880698,0.00008505151,0.000142649,0.0001162219,0.00001258782,0.00001061904,0.000147197,0.00004264647,0.000008764265],"category_scores_gemma":[0.0001951862,0.00008102923,0.00002215369,0.0001972039,0.00001872457,0.0001068591,0.00001770242,0.00008541183,0.00001963441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004893905,"about_ca_system_score_gemma":0.000004875525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007213255,"about_ca_topic_score_gemma":0.000002660813,"domain_scores_codex":[0.9994732,0.00003178462,0.0001845976,0.00005918292,0.0001145228,0.0001367585],"domain_scores_gemma":[0.9988024,0.0007442544,0.00003537166,0.0003555276,0.00003204609,0.00003034942],"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.00001964267,0.001825687,0.1607806,0.001434601,0.00005239639,8.297917e-7,0.003800131,0.1329058,0.6299908,0.04548787,0.0007038299,0.02299782],"study_design_scores_gemma":[0.00006344035,0.00001126207,0.0139246,0.00009213686,0.0000053413,3.135283e-7,0.00003443945,0.8310834,0.1545166,0.0001501286,0.00003367775,0.00008470041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9781966,0.00007236352,0.007717177,0.00003748208,0.00003356308,0.0002061974,0.000003283669,0.000631872,0.01310143],"genre_scores_gemma":[0.9773113,0.000001515689,0.02257703,0.000008340635,0.0000197981,0.00005227989,0.00000191365,0.00002096307,0.0000068687],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6981776,"threshold_uncertainty_score":0.3304276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061534192","doi":"10.1109/glocom.2014.7036875","title":"Relay authentication by exploiting I/Q imbalance in amplify-and-forward system","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":65,"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":"Relay; Computer science; Authentication (law); Wireless; Computer network; Transmission (telecommunications); Fingerprint (computing); Computer security; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.003241368673090305,"gpt":0.1848245326538505,"spread":0.1815831639807602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003049271,0.00008167363,0.0001196365,0.00006217219,0.00002759343,0.00003014993,0.0001618719,0.00006954878,0.000005857051],"category_scores_gemma":[0.00002772832,0.00008653673,0.0000123912,0.00009525301,0.00001683298,0.0001224773,0.00004088087,0.0001371096,0.00002328223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006611034,"about_ca_system_score_gemma":0.000001791424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000295709,"about_ca_topic_score_gemma":0.00001147085,"domain_scores_codex":[0.9994301,0.00004313847,0.0002176862,0.0001046973,0.00007730177,0.0001271305],"domain_scores_gemma":[0.9995006,0.00008468292,0.0000270137,0.0003370924,0.00001603952,0.00003453679],"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.00001098472,0.0001047767,0.02824816,0.001477826,0.00005837339,0.00000146684,0.00568465,0.00165512,0.1550966,0.7486694,0.0176027,0.04138995],"study_design_scores_gemma":[0.0004775697,0.00002512075,0.006703991,0.0003949055,0.000009949898,0.00001076978,0.0009837877,0.9070588,0.04592742,0.0008516252,0.03700409,0.0005519229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6527311,0.0005053611,0.3049097,0.000349194,0.00007723644,0.0003187642,0.00000492539,0.003331015,0.03777266],"genre_scores_gemma":[0.9937721,0.00008697736,0.005946844,0.00003144486,0.00001134483,0.00006638585,0.00001146736,0.00002078635,0.00005264831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9054037,"threshold_uncertainty_score":0.3528866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401326099","doi":"10.1109/tccn.2024.3438379","title":"Generative AI for Secure Physical Layer Communications: A Survey","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Physical layer; Computer network; Layer (electronics); Telecommunications; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.08242531335143641,"gpt":0.3473854756081475,"spread":0.264960162256711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004462222,0.0002747919,0.0002758057,0.0002281985,0.0007448648,0.000251817,0.0007781258,0.0001356974,0.000008514402],"category_scores_gemma":[0.000008884428,0.0002972299,0.0001362448,0.0005856765,0.0003487334,0.0002968301,0.00002939565,0.0008719217,0.00001642731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008615047,"about_ca_system_score_gemma":0.00004306966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003090939,"about_ca_topic_score_gemma":0.0005574545,"domain_scores_codex":[0.9986531,0.0003558742,0.0003289974,0.0002733171,0.0001253652,0.0002633128],"domain_scores_gemma":[0.9948247,0.003299702,0.00003737091,0.001477411,0.0002736155,0.00008720253],"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.00007424707,0.0005957415,0.00005127025,0.0002527949,0.0009222637,0.000001362197,0.006279788,0.00122584,0.002160812,0.009195071,0.002731621,0.9765092],"study_design_scores_gemma":[0.0003149865,0.0001038209,0.00004551152,0.0007197982,0.0001356935,0.000008646195,0.0002257541,0.9500621,0.003482101,0.002360596,0.04209996,0.0004410149],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003217835,0.01687634,0.9741393,0.001202073,0.0002845935,0.0009195118,0.0005892002,0.001205702,0.00156543],"genre_scores_gemma":[0.9600771,0.03215238,0.005753534,0.0003107296,0.00008654472,0.001283954,0.0002004141,0.0000875769,0.00004777172],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9760682,"threshold_uncertainty_score":0.999948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2967282136","doi":"10.1109/twc.2019.2934462","title":"WFRFT-Aided Power-Efficient Multi-Beam Directional Modulation Schemes Based on Frequency Diverse Array","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"State Key Laboratory of Rail Traffic Control and Safety; Queen's University Belfast; Natural Science Foundation of Beijing Municipality; Beijing Municipal Science and Technology Commission; China Scholarship Council; Queen's University; National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Artificial noise; Wireless; Beam (structure); Physical layer; Bit error rate; Modulation (music); Fractional Fourier transform; Transmission (telecommunications); Power (physics); Electronic engineering; Telecommunications; Optics; Channel (broadcasting); Physics; Fourier transform; Acoustics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02476716576469004,"gpt":0.2619575081261347,"spread":0.2371903423614447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002761893,0.0004260424,0.0003678216,0.0006370983,0.0006110972,0.00008801845,0.001433077,0.0002736111,0.0003601961],"category_scores_gemma":[0.00001141044,0.0004953425,0.0002663887,0.0008059305,0.0002050317,0.0002867747,0.00001227585,0.001047764,0.0004927349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004946505,"about_ca_system_score_gemma":0.00007749045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008810424,"about_ca_topic_score_gemma":0.0001169586,"domain_scores_codex":[0.9978566,0.0002199123,0.0006123107,0.0004215756,0.0005077285,0.0003818778],"domain_scores_gemma":[0.995006,0.0005324086,0.0001377806,0.00391855,0.0002488945,0.0001563235],"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.00006503971,0.002347671,0.0003489976,0.00007974051,0.0001543132,8.268332e-7,0.0009255546,0.8989047,0.08242785,0.002874369,0.0001389072,0.01173203],"study_design_scores_gemma":[0.001217094,0.0001280941,0.0015742,0.000311675,0.00003677583,0.000003284932,0.0002281754,0.9101201,0.0839107,0.00007278688,0.001694019,0.0007031473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2350138,0.0001271566,0.754355,0.0005451464,0.0006066067,0.001160633,0.0002080436,0.002528057,0.005455523],"genre_scores_gemma":[0.9751003,0.0002693157,0.02364171,0.0001475522,0.0000138128,0.0005128459,0.00009664481,0.0001097013,0.000108102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7400865,"threshold_uncertainty_score":0.9997498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390534264","doi":"10.1109/tmc.2023.3347580","title":"Cooperative Deep Reinforcement Learning Enabled Power Allocation for Packet Duplication URLLC in Multi-Connectivity Vehicular Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Natural Science Foundation of Jiangsu Province for Distinguished Young Scholars; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Retransmission; Network packet; Computer network; Reinforcement learning; Scheduling (production processes); Telecommunications link; Distributed computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0151678118729457,"gpt":0.2680953196626805,"spread":0.2529275077897348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005034254,0.000219404,0.000218015,0.0002557287,0.0002274654,0.000115873,0.000176697,0.000157979,0.00002016939],"category_scores_gemma":[0.00001258805,0.0002534805,0.000100439,0.0004868271,0.00002950778,0.00024613,0.000004060798,0.0006412703,0.0000115169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003787488,"about_ca_system_score_gemma":0.00002499721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002981213,"about_ca_topic_score_gemma":0.0000844466,"domain_scores_codex":[0.9987599,0.0001071512,0.0004109339,0.000314487,0.0001235475,0.0002839278],"domain_scores_gemma":[0.9990104,0.0004597126,0.00004427315,0.0003376527,0.00009767424,0.00005025792],"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.000009861174,0.00006348016,0.000009211878,0.00006621573,0.00004441715,8.728218e-7,0.001404331,0.9719054,0.002837832,0.0002244564,0.00001723042,0.02341669],"study_design_scores_gemma":[0.0003283184,0.00009978614,0.00005737105,0.0002147076,0.00001599825,0.000002774332,0.0001957255,0.9733427,0.02471813,0.00001820871,0.0007649756,0.000241278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07929388,0.0004145323,0.9175459,0.00004739422,0.0002745053,0.001149887,0.000001866408,0.001191163,0.00008088884],"genre_scores_gemma":[0.9946668,0.0001907803,0.004143197,0.00002780133,0.00002735207,0.0008198329,0.00003055407,0.00006369405,0.00003005883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9153728,"threshold_uncertainty_score":0.9999917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108250525","doi":"10.1109/tit.2009.2032803","title":"On the Redundancy of Slepian–Wolf Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; University of Waterloo","funders":"","keywords":"Emphasis (telecommunications); Notation; Mathematics; Decoding methods; Discrete mathematics; Combinatorics; Computer science; Algorithm; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.009391756757221476,"gpt":0.2204916587051245,"spread":0.211099901947903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003666907,0.0001073168,0.0001034473,0.0002004628,0.0001321141,0.00002977507,0.0002687646,0.00007063308,0.0001651875],"category_scores_gemma":[0.00001337988,0.00008933151,0.00007245896,0.0002187336,0.00004810044,0.0005003568,5.671533e-7,0.0002865233,0.00008480243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005648984,"about_ca_system_score_gemma":0.00001029144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001367477,"about_ca_topic_score_gemma":6.501568e-7,"domain_scores_codex":[0.9992887,0.00006179105,0.000335365,0.00004087048,0.0001656595,0.0001075903],"domain_scores_gemma":[0.9990884,0.0002834232,0.00006890998,0.0004745692,0.0000575834,0.00002709024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006903575,0.00007530658,2.190453e-7,0.0000441299,0.00004294297,1.281126e-7,0.004607588,0.08506569,0.001830514,0.7279578,0.001648153,0.1786585],"study_design_scores_gemma":[0.0006307109,0.0003170256,0.0001329918,0.0003794803,0.00003789484,0.00000951198,0.001199884,0.0598167,0.824475,0.1039478,0.008548114,0.000504868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00926022,0.00001681729,0.9439207,0.0003438145,0.0001531628,0.0002292685,0.00002273697,0.0005719605,0.04548131],"genre_scores_gemma":[0.9988527,0.000122441,0.0004879961,0.0004489204,0.000006346626,0.00003123105,0.000003708127,0.000008307116,0.00003835128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9895925,"threshold_uncertainty_score":0.3642833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034185511","doi":"10.1109/icc.2013.6654851","title":"Intercept probability analysis of cooperative wireless networks with best relay selection in the presence of eavesdropping attack","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":57,"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":"Eavesdropping; Relay; Rayleigh fading; Computer network; Computer science; Relay channel; Wireless; Selection (genetic algorithm); Physical layer; Transmission (telecommunications); Fading; Wireless network; Channel (broadcasting); Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03107081758075867,"gpt":0.2787437981276489,"spread":0.2476729805468903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006211688,0.0002666121,0.0007023803,0.0003551794,0.00002858332,0.00004543407,0.0009204444,0.0002965513,0.00006174519],"category_scores_gemma":[0.00004101573,0.0001917748,0.0001272275,0.001412227,0.0002100153,0.0001426037,0.0003627109,0.001079552,7.987996e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001436227,"about_ca_system_score_gemma":0.00004295835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001624866,"about_ca_topic_score_gemma":0.005490474,"domain_scores_codex":[0.9981394,0.0003966595,0.0007275269,0.000304373,0.0002549021,0.0001771326],"domain_scores_gemma":[0.9979478,0.0003255625,0.0002554145,0.00102256,0.0004222472,0.00002640289],"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.00001067418,0.0001136639,0.007432478,0.0002114453,0.0005006777,1.644319e-7,0.003862918,0.9863278,0.0003268314,0.0004892336,0.0001103525,0.0006137678],"study_design_scores_gemma":[0.00006754206,0.00006139131,0.008872115,0.0004163305,0.0002314295,7.730331e-7,0.0005300925,0.9874423,0.002116898,0.0000378382,0.00001675047,0.0002066055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8413407,0.0001200741,0.1559041,0.00004589907,0.00001966226,0.0009979951,0.000008194208,0.0001475285,0.001415798],"genre_scores_gemma":[0.9916793,0.0003807512,0.007489096,0.000008282711,0.00001009199,0.0003429689,0.00004307409,0.00002443773,0.00002200162],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1503386,"threshold_uncertainty_score":0.7820351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006624419","doi":"10.1109/18.923736","title":"Renyi's divergence and entropy rates for finite alphabet Markov sources","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":57,"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":"Mathematics; Rényi entropy; Combinatorics; Markov chain; Alphabet; Discrete mathematics; Entropy (arrow of time); Coding theory; Divergence (linguistics); Entropy rate; Statistics; Binary entropy function; Physics; Principle of maximum entropy; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.009192276345957163,"gpt":0.2380018457705932,"spread":0.228809569424636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002531956,0.0001251109,0.0001075114,0.0001960977,0.000190504,0.00006860011,0.0001620705,0.00007888984,0.0001397189],"category_scores_gemma":[0.00001235251,0.0001304327,0.00005080931,0.000144244,0.00005969795,0.0009002766,0.00000165287,0.0001428326,0.00004018115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003483113,"about_ca_system_score_gemma":0.000007451739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000039998,"about_ca_topic_score_gemma":0.000003886741,"domain_scores_codex":[0.9993854,0.0000375515,0.0002714388,0.00006254679,0.00009867726,0.0001443629],"domain_scores_gemma":[0.9992448,0.000339768,0.00004927226,0.0002498618,0.00006583185,0.00005043807],"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.0007496865,0.0001884409,0.0002439994,0.0005577728,0.000376406,0.000001049365,0.02099822,0.1428192,0.003388386,0.04441352,0.005091744,0.7811716],"study_design_scores_gemma":[0.002384634,0.0003443216,0.0007225922,0.0002454659,0.0001308457,0.00003518569,0.002699345,0.4590104,0.2757568,0.0369606,0.220373,0.001336773],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03114807,0.0001018057,0.966429,0.0001002586,0.0001651175,0.0002895083,0.00007208103,0.0006015346,0.001092611],"genre_scores_gemma":[0.9942922,0.00150331,0.003665615,0.0001684289,0.00001355656,0.0002014335,0.00002091616,0.00001428068,0.0001202409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9631441,"threshold_uncertainty_score":0.5318893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2808669017","doi":"10.1109/tdsc.2018.2846258","title":"Physical Layer based Message Authentication with Secure Channel Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; China Postdoctoral Science Foundation","keywords":"Computer science; Authentication (law); Message authentication code; Authentication protocol; Computer network; Physical layer; Data Authentication Algorithm; PHY; Hash function; Channel (broadcasting); Theoretical computer science; Computer security; Cryptography; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01334786109977719,"gpt":0.2423302788624251,"spread":0.2289824177626479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001392589,0.0002231114,0.000219519,0.000143337,0.0003439024,0.00008426919,0.0001983831,0.0001059234,0.00002293304],"category_scores_gemma":[0.000001928676,0.0002090632,0.00005100808,0.0002782469,0.00009289973,0.0001685346,0.000003220535,0.0003788253,0.00001808646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004145633,"about_ca_system_score_gemma":0.00002017099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000183614,"about_ca_topic_score_gemma":0.00009942509,"domain_scores_codex":[0.9990525,0.0000558672,0.0001828131,0.0002526983,0.0001952901,0.0002608865],"domain_scores_gemma":[0.9992543,0.0001124362,0.00004435655,0.0003936426,0.0001072428,0.00008805745],"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.0006364643,0.002826007,0.0002072745,0.001787881,0.001375222,0.00007139236,0.06159559,0.5922557,0.1616948,0.007122875,0.003047792,0.167379],"study_design_scores_gemma":[0.0003335599,0.0001370449,0.00003910861,0.0001378134,0.00003898256,0.00001314098,0.000183332,0.7940019,0.2042344,0.0001671607,0.0004611744,0.0002524113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3060029,0.00005513544,0.6923467,0.0001170872,0.00008181524,0.0001728922,0.00001572176,0.0006903629,0.0005173525],"genre_scores_gemma":[0.9950835,0.0000221617,0.004625995,0.00008036772,0.00008345837,0.00002281008,0.000007926506,0.00005144646,0.00002240133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6890805,"threshold_uncertainty_score":0.852535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2802595113","doi":"10.1109/access.2018.2833423","title":"Cascaded &lt;inline-formula&gt; &lt;tex-math notation=\"LaTeX\"&gt;$\\alpha-\\mu$ &lt;/tex-math&gt; &lt;/inline-formula&gt; Fading Channels: Reliability and Security Analysis","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":55,"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":"","keywords":"Fading; Nakagami distribution; Fading distribution; Cumulative distribution function; Weibull fading; Mathematics; Algorithm; Probability density function; Rayleigh fading; Statistics; Computer science; Topology (electrical circuits); Applied mathematics; Combinatorics; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.02291076915993983,"gpt":0.2939410104852559,"spread":0.2710302413253161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002435265,0.001374567,0.001909113,0.001458497,0.0009325967,0.001031092,0.003089249,0.001048475,0.0001563331],"category_scores_gemma":[0.0006039087,0.001416756,0.0006787635,0.003595896,0.0005975008,0.003431253,0.0009953636,0.001287762,0.0001718061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007195119,"about_ca_system_score_gemma":0.0001592507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003129881,"about_ca_topic_score_gemma":0.001606471,"domain_scores_codex":[0.9926292,0.0003937033,0.002388381,0.001625008,0.00138998,0.001573741],"domain_scores_gemma":[0.9927629,0.0007720747,0.000783177,0.003622246,0.001387849,0.0006717687],"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.002010075,0.007736934,0.03827195,0.01109968,0.02056076,0.0006528553,0.1263236,0.1697575,0.3233808,0.1271648,0.04956572,0.1234753],"study_design_scores_gemma":[0.00169108,0.0002146833,0.007310033,0.0003689941,0.0009762502,0.00006183716,0.00009915378,0.8816299,0.06622098,0.005508073,0.03352584,0.002393223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9624027,0.001751666,0.02741535,0.0005742504,0.001017431,0.001506485,0.0003289144,0.002898255,0.002104918],"genre_scores_gemma":[0.9904079,0.002229584,0.005027042,0.0002976837,0.0008393918,0.0003737816,0.0003779998,0.0002819929,0.0001646178],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7118723,"threshold_uncertainty_score":0.9999005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2883612868","doi":"10.1109/access.2018.2859781","title":"A Collaborative PHY-Aided Technique for End-to-End IoT Device Authentication","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada; Western University","funders":"","keywords":"Computer science; Computer network; Cryptography; Authentication (law); Authentication protocol; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03024612565095277,"gpt":0.3444718235006143,"spread":0.3142256978496615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002886615,0.0001742888,0.0001964068,0.000208936,0.0001288284,0.00014468,0.0009379942,0.0001281198,0.00006341765],"category_scores_gemma":[0.00008487696,0.0001921207,0.00004135685,0.0007352642,0.00007842415,0.0003169906,0.00009481523,0.00013231,0.00005159281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001220861,"about_ca_system_score_gemma":0.00004537464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003573305,"about_ca_topic_score_gemma":0.0001735744,"domain_scores_codex":[0.9990456,0.00004828338,0.0002886981,0.0002216525,0.0001563431,0.0002393866],"domain_scores_gemma":[0.998453,0.0001571449,0.00007134509,0.0007393894,0.0004966086,0.0000825294],"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.00006548875,0.0001314066,0.0002166151,0.0002482492,0.0001234919,0.000001122626,0.004743063,0.0002221601,0.9346111,0.008043476,0.03368768,0.01790608],"study_design_scores_gemma":[0.0001510718,0.00005659275,0.0004263097,0.00007254016,0.00001684562,0.000001578911,0.00004696719,0.00372849,0.9480574,0.002558459,0.04463241,0.0002513638],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1385586,0.0001292979,0.8491446,0.0007993241,0.0003705276,0.003001106,0.0001226979,0.001901841,0.005972026],"genre_scores_gemma":[0.9570115,0.00002431224,0.0403958,0.0002342315,0.0001691204,0.00204072,0.00001989592,0.00005646067,0.00004795153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.818453,"threshold_uncertainty_score":0.7834454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040861319","doi":"10.1109/tit.2013.2291787","title":"Optimality and Approximate Optimality of Source-Channel Separation in Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":54,"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":"Distortion (music); Channel (broadcasting); Separation (statistics); Bounded function; Quadratic equation; Decoding methods; Measure (data warehouse); Mathematics; Upper and lower bounds; Converse; Computer science; Source separation; Topology (electrical circuits); Mathematical optimization; Algorithm; Telecommunications; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.007589482128150708,"gpt":0.2281653840888259,"spread":0.2205759019606752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009031378,0.0001228235,0.0001694005,0.0002250811,0.00006332326,0.00003126777,0.0001302013,0.0001239319,0.00001969881],"category_scores_gemma":[0.000009160873,0.000135494,0.00004077827,0.0001902212,0.00007642237,0.0008034562,0.000002256693,0.0002476691,0.000006106893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004711847,"about_ca_system_score_gemma":0.000006178413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001469916,"about_ca_topic_score_gemma":0.000007759782,"domain_scores_codex":[0.999099,0.0001319307,0.0004606747,0.00006806811,0.0001137842,0.0001266084],"domain_scores_gemma":[0.9993297,0.0001618749,0.00008588447,0.0003266051,0.00005621969,0.00003969849],"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.0000386635,0.00002696798,0.000006740876,0.00007949999,0.00001147739,1.486068e-8,0.001643718,0.969629,0.00005834534,0.005482447,0.0000162536,0.02300681],"study_design_scores_gemma":[0.0002771522,0.00003204718,0.0002037935,0.00004161639,0.000007790318,0.000002090502,0.0002124058,0.9864163,0.01028883,0.00216948,0.0002129822,0.0001355451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04073596,0.00002247426,0.9557441,0.00002045125,0.00007013301,0.0002172471,0.00001159474,0.0003196449,0.002858367],"genre_scores_gemma":[0.9970425,0.0001291435,0.002666627,0.00005188432,0.000006151796,0.00007214156,0.00001264924,0.00001112284,0.000007806007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9563065,"threshold_uncertainty_score":0.5525287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950883843","doi":"10.1109/tcomm.2019.2921966","title":"Transmit Antenna Selection in Secure MIMO Systems Over $\\alpha-\\mu$ Fading Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"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; Concordia University","funders":"","keywords":"Fading; Transmitter; MIMO; Channel state information; Secrecy; Computer science; Channel (broadcasting); Channel capacity; Antenna (radio); Topology (electrical circuits); Upper and lower bounds; Computer network; Electronic engineering; Telecommunications; Mathematics; Engineering; Wireless; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01944448894364269,"gpt":0.2558385507497109,"spread":0.2363940618060682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003238186,0.0002925861,0.0003501945,0.0006447656,0.0002481888,0.0001080204,0.001179836,0.0002589562,0.0001216376],"category_scores_gemma":[0.000003479557,0.0003519265,0.0001462575,0.001041132,0.00007647808,0.0005052906,0.000007190838,0.001133826,0.0001663949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003519621,"about_ca_system_score_gemma":0.00003736293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002902211,"about_ca_topic_score_gemma":0.0006262216,"domain_scores_codex":[0.9983148,0.000242601,0.0005803324,0.0002630494,0.0002417314,0.0003575149],"domain_scores_gemma":[0.9976365,0.0003111708,0.00007366612,0.001785529,0.0001013515,0.00009175553],"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.00008534054,0.001728835,0.0009969765,0.0006436614,0.0005027497,0.000003502362,0.01079338,0.833822,0.1272854,0.00987525,0.001363944,0.012899],"study_design_scores_gemma":[0.0008642487,0.00009129814,0.0006897306,0.0005193281,0.0000435219,0.00002607906,0.0004741772,0.9720318,0.009773185,0.000263985,0.01456582,0.0006568106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1894362,0.002553013,0.7898799,0.001113619,0.001266185,0.002530406,0.0001435885,0.003568845,0.009508259],"genre_scores_gemma":[0.9944583,0.002867672,0.001700485,0.00005461422,0.00002104037,0.0005007022,0.00001973446,0.000091201,0.0002862147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8050221,"threshold_uncertainty_score":0.9998932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2547852178","doi":"10.1109/tcomm.2016.2625257","title":"Secure Full-Duplex Spectrum-Sharing Wiretap Networks with Different Antenna Reception Schemes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Science Foundation of Jiangsu Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Royal Academy of Engineering","keywords":"Jamming; Secrecy; Computer science; Beamforming; Topology (electrical circuits); Antenna (radio); Signal-to-noise ratio (imaging); Telecommunications; Algorithm; Computer network; Mathematics; Physics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02110003073799828,"gpt":0.2398603218612283,"spread":0.21876029112323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001500504,0.0003346108,0.0002850469,0.0002575733,0.0004822114,0.00008303406,0.001491305,0.0001872634,0.0002060182],"category_scores_gemma":[0.000004370254,0.0002599789,0.0001269416,0.0004505271,0.0002612023,0.0003905701,0.00001966984,0.0006995109,0.0000579645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000283218,"about_ca_system_score_gemma":0.0000177847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000225474,"about_ca_topic_score_gemma":0.0009058089,"domain_scores_codex":[0.9985812,0.0001107985,0.000432424,0.0002893957,0.0002278885,0.0003582659],"domain_scores_gemma":[0.9958512,0.0002844795,0.00009167727,0.003536397,0.0001055874,0.0001306727],"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.0008236506,0.004920506,0.002104604,0.0004177047,0.003085567,0.00001193201,0.007535491,0.2222284,0.3056725,0.03888777,0.003713028,0.4105989],"study_design_scores_gemma":[0.002071464,0.0004604737,0.001713902,0.001713055,0.0002319601,0.00008199619,0.0003299957,0.908662,0.06703436,0.0009385195,0.01492827,0.001834048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05805383,0.0004067715,0.9357613,0.002375935,0.0001371701,0.0004227414,0.00004584231,0.002042472,0.0007538796],"genre_scores_gemma":[0.9845682,0.008398134,0.006204499,0.00005291327,0.00003279297,0.0004247263,0.00002450337,0.00009781693,0.0001963969],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9295568,"threshold_uncertainty_score":0.9999852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108739512","doi":"10.1109/glocom.2008.ecp.356","title":"Secret Key Generation and Agreement in UWB Communication Channels","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"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":"Computer science; Key generation; Shared secret; Low-density parity-check code; Key (lock); Transceiver; Computer network; Channel (broadcasting); Public-key cryptography; Decoding methods; Computer security; Wireless; Algorithm; Telecommunications; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.03540755572473176,"gpt":0.2360003153422738,"spread":0.2005927596175421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001364601,0.00006992724,0.000082622,0.0000869825,0.00005380077,0.00001593551,0.0001443173,0.00005236743,0.00004415107],"category_scores_gemma":[0.000006970318,0.00007698907,0.000009954767,0.0000993568,0.00003050511,0.0001576924,0.00006212899,0.0001064934,0.00000991855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004707656,"about_ca_system_score_gemma":0.000004424628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009560322,"about_ca_topic_score_gemma":0.0002595523,"domain_scores_codex":[0.9995672,0.00004099552,0.0001655701,0.00006965767,0.00007317906,0.00008342569],"domain_scores_gemma":[0.9995058,0.00002115978,0.00001535821,0.000408768,0.00002346827,0.00002541226],"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.0000367457,0.0008575801,0.05575759,0.0004439469,0.0002265284,0.00003065551,0.101998,0.05777165,0.3005415,0.2456605,0.1334041,0.1032711],"study_design_scores_gemma":[0.0006804282,0.00004376087,0.01469794,0.00006432983,0.000004975793,0.00003049786,0.0002552177,0.8540799,0.1029399,0.001275316,0.02541719,0.0005105115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9730421,0.001202349,0.01115167,0.0004417579,0.00002953825,0.0002218852,0.00000134867,0.0004155923,0.01349371],"genre_scores_gemma":[0.9849728,0.004319687,0.01043867,0.00007075891,0.00001450138,0.00005296913,0.000036611,0.00001086622,0.00008312498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7963082,"threshold_uncertainty_score":0.3139523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293476944","doi":"10.1049/el.2015.2160","title":"Performance analysis of physical layer security over <i>α</i> – <i>μ</i> fading channel","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"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":"","keywords":"Fading; Physical layer; Channel (broadcasting); Computer science; Electronic engineering; Computer network; Telecommunications; Engineering; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01289516113677402,"gpt":0.2377892598172842,"spread":0.2248940986805101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002138776,0.0001567687,0.0003153983,0.0002506178,0.0000292346,0.00001658465,0.0003648278,0.0000563558,0.000004723014],"category_scores_gemma":[0.000009358449,0.0001733477,0.0001406143,0.0008831163,0.00004325616,0.0002062725,0.00006125894,0.0003241288,0.000005855737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001904156,"about_ca_system_score_gemma":0.00002067248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001245465,"about_ca_topic_score_gemma":0.00002162935,"domain_scores_codex":[0.9990333,0.0000369306,0.000203446,0.0001445719,0.0002600061,0.000321752],"domain_scores_gemma":[0.9992585,0.0000462259,0.00005839475,0.0005146376,0.00005014949,0.00007214446],"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.00005920987,0.0003119215,0.006788076,0.0002091129,0.003172153,0.000005253272,0.0170397,0.4563828,0.4773374,0.006014659,0.03006618,0.002613518],"study_design_scores_gemma":[0.0002412023,0.00005518213,0.0003991711,0.00001605716,0.0002458373,0.000001253161,0.00002678513,0.8451814,0.1455466,0.0001800789,0.007803851,0.0003026299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9950946,0.000399057,0.002171262,0.0002218772,0.00003525103,0.00009033604,0.000007968042,0.0003768069,0.001602831],"genre_scores_gemma":[0.9992364,0.0001577773,0.0001634767,0.0003183486,0.00004216757,0.00001958421,0.000028281,0.00003029991,0.000003640433],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3887986,"threshold_uncertainty_score":0.7068914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1795009452","doi":"10.1109/tit.2012.2212874","title":"On Optimal Causal Coding of Partially Observed Markov Sources in Single and Multiterminal Settings","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"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":"Counterexample; Markov process; Bounded function; Coding (social sciences); Mathematics; Markov chain; Conjecture; Markov property; Mathematical optimization; Algorithm; Discrete mathematics; Computer science; Markov model; Applied mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0164464681399069,"gpt":0.2275218846122062,"spread":0.2110754164722993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004402816,0.0001102771,0.000125213,0.0002545228,0.00005813258,0.00002708571,0.0001046303,0.00008344954,0.00004349784],"category_scores_gemma":[0.00001365386,0.0001193154,0.00003316359,0.0001231573,0.00005618023,0.0009908393,0.000001968824,0.0002119298,0.00001087654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005804894,"about_ca_system_score_gemma":0.000006577823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000066893,"about_ca_topic_score_gemma":0.000005849208,"domain_scores_codex":[0.9992665,0.00006585773,0.000349544,0.00004354335,0.0001193895,0.0001551572],"domain_scores_gemma":[0.9994128,0.0002497943,0.00007099454,0.000187994,0.00003110756,0.00004732209],"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.001036924,0.001068698,0.0006732079,0.001498363,0.000210831,0.000001901391,0.1282675,0.427748,0.0465596,0.03074463,0.0003729859,0.3618173],"study_design_scores_gemma":[0.001717919,0.0003138646,0.003986935,0.0007361666,0.00005176336,0.00002860176,0.003573224,0.1730019,0.813437,0.0007898504,0.001606053,0.0007567222],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6614615,0.00002803094,0.337461,0.00002087116,0.00008488962,0.0001312712,0.0000199188,0.0001839853,0.0006085666],"genre_scores_gemma":[0.9968094,0.0000408641,0.003016495,0.00006255707,0.000006490687,0.00003831041,0.000006149245,0.00001151108,0.000008237021],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7668774,"threshold_uncertainty_score":0.4865541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2358248302","doi":"10.1109/tifs.2016.2566446","title":"Delay-Aware Optimization of Physical Layer Security in Multi-Hop Wireless Body Area Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Physical layer; Computer network; Wireless sensor network; Network topology; Nash equilibrium; Topology (electrical circuits); Node (physics); Distributed computing; Wireless; Mathematical optimization; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01267830787162267,"gpt":0.2320039779186135,"spread":0.2193256700469908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001666358,0.0002101418,0.0002775705,0.000253091,0.00008407533,0.00003664256,0.0001595762,0.000194762,0.00001822463],"category_scores_gemma":[0.000005439565,0.000184875,0.00008479818,0.0003007148,0.0001131255,0.001095952,0.000005558817,0.0003127397,0.000003695049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009159467,"about_ca_system_score_gemma":0.00001721781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004348844,"about_ca_topic_score_gemma":0.0001128768,"domain_scores_codex":[0.9989203,0.00004441584,0.0005051951,0.000119712,0.0002007167,0.0002096495],"domain_scores_gemma":[0.9991421,0.0001272466,0.0001111384,0.0003532286,0.0001854784,0.000080822],"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.0001126165,0.000347554,0.000236193,0.0002475934,0.00009292835,0.000001470587,0.009513061,0.9277706,0.0004519938,0.004844096,0.0002695807,0.05611238],"study_design_scores_gemma":[0.0007548228,0.00005454865,0.0000970952,0.0001292237,0.00001375243,0.00000380261,0.0001423875,0.9872624,0.01059516,0.0005262295,0.0001948313,0.0002257949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1740531,0.00001813477,0.8249471,0.00005328573,0.0001050134,0.0002680112,0.0001165948,0.000240161,0.0001986507],"genre_scores_gemma":[0.9981855,0.0006620131,0.0009960775,0.00003678755,0.000010812,0.00005855183,0.00002899555,0.00001927315,0.000002008317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8241324,"threshold_uncertainty_score":0.7538982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2769390761","doi":"10.1109/tcomm.2017.2776114","title":"Cooperative Secure Communication in Two-Hop Buffer-Aided Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":49,"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; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Buffer (optical fiber); Hop (telecommunications); Spread spectrum; Telecommunications; Code division multiple access","retraction":null,"screen_n_in":null,"score":{"opus":0.03048161951083067,"gpt":0.3125432982240032,"spread":0.2820616787131726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000476697,0.0003134623,0.0003506996,0.000290143,0.001627943,0.0002959105,0.004085281,0.0001855316,0.00008102621],"category_scores_gemma":[0.00002800534,0.0003701044,0.0001251336,0.0003194921,0.0005293273,0.0007353751,0.00004777863,0.00156766,0.00007244728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000266733,"about_ca_system_score_gemma":0.00004344394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004770367,"about_ca_topic_score_gemma":0.009415312,"domain_scores_codex":[0.9982514,0.000401432,0.000582532,0.0002404078,0.0001924504,0.0003317158],"domain_scores_gemma":[0.9900215,0.000533908,0.0001546655,0.008993543,0.0001860117,0.0001103924],"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.00009694583,0.002061712,0.0005488899,0.00008346467,0.0004297061,0.000006965578,0.008038118,0.8611524,0.004622398,0.03426182,0.003568292,0.08512926],"study_design_scores_gemma":[0.001824561,0.0000678832,0.001857393,0.0004991438,0.00006711249,0.00001890834,0.0005325695,0.969468,0.012671,0.00228478,0.009730679,0.0009779828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02919548,0.002735863,0.8988119,0.006627066,0.0005302261,0.001944261,0.0001515488,0.002763047,0.05724055],"genre_scores_gemma":[0.9805509,0.009203423,0.009149859,0.0001099488,0.00001669806,0.0007037591,0.00005039734,0.00007884712,0.0001361419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9513555,"threshold_uncertainty_score":0.9998751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157463142","doi":"10.1109/isit.2002.1023363","title":"Coding for the Wyner-Ziv problem with turbo-like codes","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Turbo code; Computer science; Concatenation (mathematics); Algorithm; Coding (social sciences); Decoding methods; Encoder; Theoretical computer science; Mathematics; Arithmetic; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01582211061168708,"gpt":0.2289077578699727,"spread":0.2130856472582857,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002003887,0.00009820452,0.00009453071,0.00002907682,0.00009909414,0.0000487553,0.0002438334,0.00004103215,0.00003993289],"category_scores_gemma":[0.00001346641,0.00006217151,0.00002728418,0.000108939,0.00003665555,0.00008461884,0.00001749884,0.0001108008,0.000005470501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002805011,"about_ca_system_score_gemma":0.00001040469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001110037,"about_ca_topic_score_gemma":0.00009098608,"domain_scores_codex":[0.9995542,0.00001321383,0.000118388,0.00008108939,0.00008085385,0.0001523104],"domain_scores_gemma":[0.9992672,0.000220305,0.00001804401,0.000420026,0.00004922624,0.00002515001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002254136,0.00008457656,0.0009642096,0.0003011933,0.000266311,0.000001283203,0.002241751,0.01086504,0.01199518,0.9004469,0.05860685,0.01420414],"study_design_scores_gemma":[0.0006844591,0.00009379599,0.0001792532,0.0001076013,0.00004870001,0.00002127476,0.0007379724,0.06219978,0.29148,0.005624682,0.6382321,0.0005903469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01274697,0.001125797,0.8652894,0.0008712887,0.00009964377,0.001614692,0.00001021705,0.003176983,0.115065],"genre_scores_gemma":[0.9284045,0.0001545207,0.07076195,0.0001057927,0.000009779514,0.0001727646,0.000003153288,0.00003048281,0.0003571261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9156575,"threshold_uncertainty_score":0.2535281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2588149931","doi":"10.1109/access.2017.2667882","title":"Secrecy Energy Efficiency Maximization in Cognitive Radio Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Trois-Rivières; Concordia University","funders":"China Postdoctoral Science Foundation; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Beamforming; Computer science; Mathematical optimization; Maximization; Cognitive radio; Utility maximization problem; Quality of service; Transmitter power output; Fractional programming; Convex optimization; Wireless; Mathematics; Regular polygon; Telecommunications; Transmitter","retraction":null,"screen_n_in":null,"score":{"opus":0.0322003907322754,"gpt":0.3063281055353455,"spread":0.2741277148030701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001237227,0.0001105332,0.0001370821,0.0001112461,0.0001317987,0.0002533944,0.0009803891,0.0001053164,0.00003136734],"category_scores_gemma":[0.00004440088,0.0001263727,0.00002586203,0.0001231114,0.00005586615,0.0006417846,0.0001082912,0.0001664488,0.000003201441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005188676,"about_ca_system_score_gemma":0.00001005246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002467308,"about_ca_topic_score_gemma":0.0003370607,"domain_scores_codex":[0.9993806,0.0000329156,0.0001821786,0.00013131,0.00009445204,0.0001785358],"domain_scores_gemma":[0.9991978,0.00006594756,0.00006858946,0.0005759726,0.00005419266,0.00003743569],"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.00007635861,0.0003981324,0.07897566,0.0001463389,0.0001234066,0.00007073679,0.001964164,0.5530729,0.0016083,0.01825492,0.005761945,0.3395472],"study_design_scores_gemma":[0.0006328602,0.00001646359,0.03621321,0.0002297581,0.00001144047,0.000004723749,0.00002193135,0.9267059,0.03179004,0.002825852,0.001108657,0.0004391476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1761723,0.0004845209,0.804302,0.00005542744,0.0003508685,0.0001537841,0.00000419698,0.0005057292,0.01797121],"genre_scores_gemma":[0.9988121,0.0007544185,0.0001771298,0.00004647951,0.0000728718,0.00006527588,0.00001529068,0.00002730537,0.00002910975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8226399,"threshold_uncertainty_score":0.5153329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}