{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":285,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":285,"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":"541c6539ece4","filters":{"topic":"Security in Wireless Sensor Networks"}},"results":[{"id":"W1957358593","doi":"10.1109/jproc.2016.2558521","title":"A Survey on Wireless Security: Technical Challenges, Recent Advances, and Future Trends","year":2016,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":1225,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Eavesdropping; Wireless network; Wireless; Wireless security; Wireless Transport Layer Security; Node (physics); Key (lock); Open research; Network security","retraction":null,"screen_n_in":null,"score":{"opus":0.02003196663890915,"gpt":0.245012735059832,"spread":0.2249807684209228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005783688,0.0002136496,0.0002816503,0.00009917279,0.00009605216,0.00005316588,0.001353101,0.0001715629,0.000004663716],"category_scores_gemma":[0.00006935102,0.0001224887,0.00006575112,0.0004971519,0.0001659407,0.0003829088,0.0003145099,0.0002543475,0.00000320111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000623502,"about_ca_system_score_gemma":0.0000175893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005934312,"about_ca_topic_score_gemma":0.00004799545,"domain_scores_codex":[0.9983691,0.0000286536,0.0002627936,0.0005212128,0.0004745517,0.0003436632],"domain_scores_gemma":[0.9988845,0.0001875929,0.000234971,0.0003532048,0.0002367085,0.0001030042],"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.00007060428,0.0001446009,0.001367098,0.00007508548,0.0000221818,0.000001154563,0.0005872088,7.309209e-7,0.002102056,0.03816234,0.0071723,0.9502947],"study_design_scores_gemma":[0.005331606,0.001814921,0.1673407,0.002532624,0.00008271819,0.0002871775,0.0002880806,0.003164899,0.09169199,0.05396402,0.6706847,0.002816598],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8018805,0.04022935,0.0005404592,0.1267203,0.006657677,0.001091331,0.00008691045,0.001167726,0.02162583],"genre_scores_gemma":[0.9680097,0.03084813,0.0003984186,0.0001834147,0.0004450474,0.00001532328,2.951778e-7,0.00002070227,0.00007900873],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9474781,"threshold_uncertainty_score":0.4994943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019267322","doi":"10.1109/90.836475","title":"Secure group communications using key graphs","year":2000,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":1096,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Cairo University; York University","keywords":"Rekeying; Computer science; Communication in small groups; Group key; Secure multicast; Key (lock); Key management; Multicast; Scalability; Computer network; Joins; Computer security; Distributed computing; Encryption; Source-specific multicast; Database; Reliable multicast","retraction":null,"screen_n_in":null,"score":{"opus":0.0416883586162558,"gpt":0.2717763594392165,"spread":0.2300880008229607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003174658,0.0003532304,0.0003159103,0.0002450645,0.001212586,0.0003316893,0.003151102,0.000246317,0.0001319339],"category_scores_gemma":[0.000003399171,0.000399254,0.0002603984,0.00159516,0.0001830687,0.0005914363,0.0000312695,0.0009564949,0.0001033333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001413241,"about_ca_system_score_gemma":0.00004203249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009966441,"about_ca_topic_score_gemma":0.000264381,"domain_scores_codex":[0.9973963,0.0003032234,0.0004925892,0.0006440923,0.0004461074,0.0007177272],"domain_scores_gemma":[0.9956354,0.0004836204,0.0001255189,0.00348478,0.00007119701,0.0001995039],"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.00003344193,0.0004769741,0.0001122826,0.00001643284,0.0001566658,0.00003007097,0.002428155,0.3831496,0.0002810629,0.006696667,0.0004380031,0.6061806],"study_design_scores_gemma":[0.0006262637,0.0001040225,0.00009005388,0.0002891131,0.00006866436,0.0001419012,0.00006226976,0.9440047,0.0002251501,0.01010634,0.0435353,0.0007461881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02791005,0.0009958459,0.9635932,0.001050983,0.002415374,0.0004113887,0.000008312893,0.0009382092,0.002676567],"genre_scores_gemma":[0.9036347,0.001276725,0.09377337,0.0007967375,0.0003275164,0.00003586405,0.000006641907,0.00005004026,0.0000984225],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8757246,"threshold_uncertainty_score":0.9998459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104208424","doi":"10.1109/infcom.2007.237","title":"PDA: Privacy-Preserving Data Aggregation in Wireless Sensor Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":436,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Data aggregator; Computer science; Overhead (engineering); Wireless sensor network; Information privacy; Computer network; Cluster analysis; Wireless; Distributed computing; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0348365351018771,"gpt":0.2818953844684843,"spread":0.2470588493666072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609596,0.0002238474,0.0002537585,0.0002150474,0.0001087371,0.0002483778,0.004601981,0.0002120727,0.00003459023],"category_scores_gemma":[0.0001644968,0.000225531,0.00003819001,0.001154083,0.00005271126,0.001386207,0.003113322,0.0004769239,0.00004195384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001004734,"about_ca_system_score_gemma":0.000039845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003504121,"about_ca_topic_score_gemma":0.001162204,"domain_scores_codex":[0.997265,0.0001154198,0.0005478397,0.0008452598,0.000453754,0.0007727678],"domain_scores_gemma":[0.9958094,0.000592384,0.0001516457,0.003202731,0.00008941559,0.00015441],"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.00008806438,0.0005659495,0.06471893,0.00008260363,0.00008602815,0.0009296341,0.003079968,0.04526139,0.0007812337,0.1033755,0.0223014,0.7587293],"study_design_scores_gemma":[0.0003618591,0.00001565517,0.008802423,0.0000690685,0.00000296559,0.0000288337,0.00007076356,0.9871663,0.0005312085,0.0006061531,0.002050558,0.0002941529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1583299,0.0002412633,0.8350452,0.0008826587,0.0007908114,0.0002701235,0.000001313488,0.0003769856,0.004061796],"genre_scores_gemma":[0.937989,0.0001020414,0.06071108,0.0005727992,0.0003998933,0.000003074989,0.00003498742,0.00002190018,0.0001652403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.941905,"threshold_uncertainty_score":0.9196888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765492968","doi":"10.1109/lcomm.2018.2815018","title":"Anti-Jamming Communications Using Spectrum Waterfall: A Deep Reinforcement Learning Approach","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":248,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Jamming; Waterfall; Reinforcement learning; Computer science; Waterfall model; Artificial neural network; Artificial intelligence; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.05123723027287137,"gpt":0.2837576061952535,"spread":0.2325203759223821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006174147,0.0002873653,0.0003062861,0.0003018466,0.001887802,0.0004301039,0.008616295,0.0001137759,0.000009376267],"category_scores_gemma":[0.00004262641,0.0003186223,0.0001258703,0.0009449204,0.0008847433,0.0007263384,0.002511141,0.000850964,0.0001278901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002526873,"about_ca_system_score_gemma":0.00005044127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003380939,"about_ca_topic_score_gemma":0.00007594621,"domain_scores_codex":[0.9973349,0.0006029509,0.0005921318,0.0004611891,0.0003692814,0.0006395524],"domain_scores_gemma":[0.9907516,0.0003157073,0.0003206635,0.00832121,0.0001565375,0.0001342477],"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.00002545812,0.001096895,0.005373973,0.0001041536,0.0006984354,0.00001583024,0.06118554,0.6836237,0.1312476,0.09250859,0.003419052,0.02070075],"study_design_scores_gemma":[0.0002600067,0.0000416673,0.0001450956,0.00005379285,0.00002630467,0.00005035749,0.0001796783,0.9890029,0.001594606,0.0001388692,0.008121301,0.0003853868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06506305,0.0003013099,0.9183953,0.01160038,0.0003700776,0.0003982148,5.54286e-7,0.0005308763,0.003340262],"genre_scores_gemma":[0.7665755,0.0002118483,0.2313991,0.001551262,0.0001418181,0.00003702117,0.00002625393,0.00003153576,0.00002568039],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7015125,"threshold_uncertainty_score":0.9999266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1534489247","doi":"10.1109/wimob.2005.1512911","title":"An intrusion detection system for wireless sensor networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":247,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Wireless sensor network; Computer science; Key distribution in wireless sensor networks; Intrusion detection system; Computer network; Network packet; Sensor node; Node (physics); Mobile wireless sensor network; Key (lock); Wireless; Wireless network; Distributed computing; Real-time computing; Computer security; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.006957958936630261,"gpt":0.216176108906416,"spread":0.2092181499697858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002998665,0.0001967,0.0002142916,0.0001019004,0.0002854015,0.0002947643,0.0006348995,0.0002076476,0.0000033673],"category_scores_gemma":[0.000004890343,0.0001840606,0.00008938582,0.000375765,0.00003116331,0.0004774524,0.00008371822,0.0001467748,0.00001567329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001277278,"about_ca_system_score_gemma":0.00001413756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002689782,"about_ca_topic_score_gemma":0.0002510541,"domain_scores_codex":[0.9983428,0.0000997814,0.0003313991,0.0005371326,0.0002305627,0.0004583482],"domain_scores_gemma":[0.9987267,0.0001637257,0.0001218796,0.0007292276,0.0001589751,0.00009949011],"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.000112833,0.0003420004,0.0006214671,0.0001554633,0.00003818263,0.00004158836,0.0002947881,0.3931018,0.03701085,0.2658778,0.002202128,0.3002011],"study_design_scores_gemma":[0.0003549582,0.0001117471,0.0002858393,0.00002379876,0.000006784582,0.00004783699,0.00006562682,0.9767944,0.02111973,0.0003198815,0.0006217753,0.0002476012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1261214,0.00003944226,0.8700629,0.00008073069,0.001487408,0.0003928147,0.000001163279,0.001073446,0.0007406661],"genre_scores_gemma":[0.963181,0.000003160064,0.03542599,0.00009624069,0.001131193,0.00004467948,0.000009919769,0.00002382699,0.00008395833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8370597,"threshold_uncertainty_score":0.7505773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995397007","doi":"10.1145/1330332.1330333","title":"On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Information and System Security","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":203,"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":"Key (lock); Set (abstract data type); Computer science; Combinatorial design; Transversal (combinatorics); Class (philosophy); Quadratic equation; Wireless sensor network; Field (mathematics); Ring (chemistry); Theoretical computer science; Mathematics; Discrete mathematics; Computer network; Pure mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0352407569787436,"gpt":0.258810254101161,"spread":0.2235694971224174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004891268,0.0001817481,0.0002466164,0.0001033429,0.0007545405,0.0001147263,0.0002765133,0.0002162424,0.0000044272],"category_scores_gemma":[0.0002138763,0.0001500332,0.0001089866,0.0003782268,0.0001678127,0.001011129,0.0000146036,0.0003117881,0.000003069127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001480033,"about_ca_system_score_gemma":0.00008945633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000193242,"about_ca_topic_score_gemma":0.000001341597,"domain_scores_codex":[0.9984158,0.0002007726,0.0005995615,0.000184116,0.0003611961,0.0002385807],"domain_scores_gemma":[0.9975836,0.001052628,0.0003758016,0.0005290372,0.0003703809,0.00008861095],"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.0004189124,0.0002029395,0.00007343647,0.0002112987,0.000125964,0.00000224949,0.002270393,0.02782319,0.00003350386,0.9664469,0.0003617134,0.002029438],"study_design_scores_gemma":[0.001229204,0.0002412683,0.00006580683,0.0001190486,0.00003893063,0.0002815214,0.0008585164,0.9909719,0.001693218,0.003462553,0.0008283368,0.0002097402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09114727,0.0000102962,0.9063113,0.0004923355,0.001016668,0.0006901514,0.0001579881,0.0001386558,0.00003527287],"genre_scores_gemma":[0.9868485,0.00002703901,0.01289752,0.00006034897,0.00006033975,0.00004597983,0.00005432142,0.000005497574,4.64783e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9631487,"threshold_uncertainty_score":0.6118177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1529909807","doi":"10.1007/978-3-540-30564-4_21","title":"Deterministic Key Predistribution Schemes for Distributed Sensor Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless sensor network; Key (lock); Distributed computing; Computer network; Theoretical computer science; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01429025679891991,"gpt":0.2420272068505105,"spread":0.2277369500515906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007882578,0.000902069,0.0008769502,0.0005042171,0.0005201024,0.0009369301,0.003865553,0.0008724395,0.00001413685],"category_scores_gemma":[0.0003136389,0.0009137842,0.0003089604,0.0007918385,0.001028375,0.000561785,0.001188975,0.001185912,0.00001981734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001036836,"about_ca_system_score_gemma":0.0007531642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001051605,"about_ca_topic_score_gemma":0.00003006027,"domain_scores_codex":[0.9943353,0.00004371948,0.0009043964,0.002270647,0.001041651,0.001404287],"domain_scores_gemma":[0.99541,0.001170712,0.0005550003,0.001947501,0.0005842141,0.0003325735],"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.00003243393,0.00007197107,0.000030008,0.0001163132,0.00003760332,0.0001570077,0.0002865787,0.6223063,0.00004281302,0.10252,0.00006438089,0.2743346],"study_design_scores_gemma":[0.0006116027,0.0002410827,0.00004855123,0.0005746365,0.0000244274,0.0001032867,1.328281e-7,0.8577428,0.0003733503,0.1367446,0.002620913,0.0009146463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00007117253,0.0005329009,0.9934235,0.0006075376,0.003427379,0.001152256,0.0001314315,0.0004526072,0.0002011908],"genre_scores_gemma":[0.5531091,0.00009402641,0.4431415,0.0009513851,0.002148826,0.00006988026,0.0003153727,0.0001004649,0.00006947563],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5530379,"threshold_uncertainty_score":0.9993313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127657034","doi":"10.1109/wcnc.2005.1424679","title":"A combinatorial approach to key predistribution for distributed sensor networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":186,"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":"Wireless sensor network; Key (lock); Computer science; Resilience (materials science); Distributed computing; Set (abstract data type); Combinatorial design; Theoretical computer science; Computer network; Mathematics; Computer security; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01312118378007004,"gpt":0.2343835220181597,"spread":0.2212623382380897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003585937,0.0002418578,0.0002754313,0.00006429382,0.0002118667,0.0002828416,0.0009616146,0.000218673,0.000006401489],"category_scores_gemma":[0.0001111943,0.0002361666,0.0001296019,0.0006224121,0.00003643999,0.000356897,0.0002570852,0.000203179,0.00003467457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000197025,"about_ca_system_score_gemma":0.00003764945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001239366,"about_ca_topic_score_gemma":0.000004741726,"domain_scores_codex":[0.9978991,0.00007036619,0.0003689521,0.0006415441,0.0003244055,0.000695629],"domain_scores_gemma":[0.9984362,0.0002197772,0.00008862784,0.0007247903,0.0002428628,0.0002877396],"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.00007150086,0.0004263663,0.00006955356,0.00001279306,0.0000376885,0.000001346571,0.0002969571,0.1935607,0.00004780207,0.7382051,0.05808803,0.009182221],"study_design_scores_gemma":[0.001000167,0.0001086768,0.0001611982,0.000008375383,0.00001000195,0.00001360839,0.00002170941,0.943286,0.0004693414,0.001442671,0.05316453,0.0003136937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003322009,0.00004001772,0.989526,0.00178133,0.001360026,0.0009846325,0.00006043519,0.0006367657,0.002288825],"genre_scores_gemma":[0.8477239,0.00000366102,0.1496657,0.0005301396,0.001581249,0.0001489401,0.0002568744,0.00001786552,0.0000717455],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8444018,"threshold_uncertainty_score":0.9630592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058242263","doi":"10.1007/s11276-011-0383-2","title":"On batch verification with group testing for vehicular communications","year":2011,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"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","keywords":"Computer science; Scheme (mathematics); Group signature; Identity (music); Overhead (engineering); Tracing; Signature (topology); Transmission (telecommunications); Public-key cryptography; Distributed computing; Computer network; Encryption; Telecommunications; Operating system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05280334535817559,"gpt":0.2409167144077342,"spread":0.1881133690495586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003874397,0.0002652851,0.0002610535,0.00008684736,0.0004563727,0.0001377162,0.002153228,0.0001919859,0.00000471046],"category_scores_gemma":[0.00004372477,0.0002450344,0.00007413675,0.0007238911,0.0001650941,0.0003299215,0.0002356945,0.0004136137,0.00001709689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006932912,"about_ca_system_score_gemma":0.00003491387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006386759,"about_ca_topic_score_gemma":0.0000572046,"domain_scores_codex":[0.9981582,0.0001368358,0.000336606,0.0005794291,0.000259016,0.0005299131],"domain_scores_gemma":[0.9961206,0.0008715487,0.0002408713,0.002390978,0.0002392159,0.0001368381],"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.0001423014,0.0006371834,0.002343308,0.0000389994,0.0001120246,0.00001731443,0.001947609,0.02902424,0.0001688477,0.7676455,0.00148602,0.1964367],"study_design_scores_gemma":[0.0005765396,0.0003500772,0.003359306,0.0001534425,0.00002094349,0.00001693486,0.00004147211,0.9913556,0.0001257987,0.002991362,0.0006392483,0.0003692831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04436402,0.0002387817,0.9509236,0.0002713394,0.000358023,0.0007197556,0.000002757296,0.0005463259,0.002575408],"genre_scores_gemma":[0.866604,0.00003597192,0.1324857,0.000385863,0.0001469908,0.000251002,0.00003132807,0.00004057677,0.0000185124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9623314,"threshold_uncertainty_score":0.9992214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996124278","doi":"10.1109/tpds.2011.302","title":"A Cloud-Based Scheme for Protecting Source-Location Privacy against Hotspot-Locating Attack in Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":141,"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; Hotspot (geology); Computer network; Network packet; Cloud computing; Adversary; Wireless sensor network; Adversary model; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.04459131439947693,"gpt":0.2509897226617607,"spread":0.2063984082622837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006636114,0.0003755819,0.0004594075,0.0002013531,0.0005436764,0.0002223023,0.0005105509,0.0003153415,0.000001603508],"category_scores_gemma":[0.0000306117,0.0003866953,0.0001232952,0.000883182,0.00008386909,0.0003070637,0.000007064863,0.0005781316,0.000006314252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001621043,"about_ca_system_score_gemma":0.0000843891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002373478,"about_ca_topic_score_gemma":0.0000554331,"domain_scores_codex":[0.9972726,0.0002932927,0.0007358454,0.0007528357,0.0002791571,0.0006663029],"domain_scores_gemma":[0.9981573,0.000445275,0.0003127285,0.000657045,0.0002336497,0.000193962],"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.000167687,0.0002597099,0.0002242953,0.0001882686,0.00004105563,0.000007918758,0.001172764,0.9927942,0.0001871382,0.0001694233,0.00004843704,0.004739105],"study_design_scores_gemma":[0.001558312,0.0001706135,0.0001631687,0.0004270781,0.00001551368,0.00001925551,0.0005360118,0.9961328,0.0004262867,0.00001799371,0.00009836206,0.0004346323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1571927,0.0001170121,0.8400173,0.0000886336,0.0007278024,0.001480597,0.00003032879,0.0003211662,0.00002441021],"genre_scores_gemma":[0.9898087,0.00001888901,0.009143539,0.00007962764,0.0001392857,0.0007159564,0.0000270915,0.00003782859,0.00002908139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.832616,"threshold_uncertainty_score":0.9998585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2785881462","doi":"10.1109/access.2018.2793841","title":"Denial of Service Defence for Resource Availability in Wireless Sensor Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Wireless sensor network; Computer science; Denial-of-service attack; Software deployment; Computer network; Computer security; Key distribution in wireless sensor networks; Countermeasure; Wireless; Wireless network; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0332462722098783,"gpt":0.2996961083214578,"spread":0.2664498361115795,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007190344,0.0002413757,0.0004102395,0.0001401421,0.000127005,0.0001888181,0.003044934,0.000236815,0.00001434062],"category_scores_gemma":[0.00008926422,0.0002506111,0.00009409514,0.001346682,0.0002188113,0.0007192004,0.0004460408,0.0002670788,0.00001548851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007704045,"about_ca_system_score_gemma":0.00007848425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004571065,"about_ca_topic_score_gemma":0.001711903,"domain_scores_codex":[0.9974754,0.000184754,0.0006085496,0.0007453227,0.0003552035,0.000630726],"domain_scores_gemma":[0.9970652,0.0008009734,0.0002832802,0.001241575,0.000486575,0.00012239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004037678,0.003918877,0.3170913,0.002685713,0.000453759,0.0002296587,0.02926171,0.287237,0.02347723,0.04539027,0.04403507,0.2421818],"study_design_scores_gemma":[0.001027202,0.0001393781,0.008141484,0.0001501385,0.00001267504,0.00001547879,0.00004400191,0.9657207,0.02159689,0.001613406,0.001083385,0.0004552924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6997626,0.00004323828,0.297891,0.000472631,0.0008813547,0.0004805088,0.000006301068,0.0001149046,0.0003474478],"genre_scores_gemma":[0.991434,0.000007667869,0.006598189,0.001173677,0.0006918325,0.00004661524,0.000003183872,0.00002377164,0.000021087],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6784837,"threshold_uncertainty_score":0.9999946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2804867869","doi":"10.3390/s18061691","title":"A Statistical Approach to Detect Jamming Attacks in Wireless Sensor Networks","year":2018,"lang":"en","type":"article","venue":"Sensors","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"University of Pretoria; National Research Foundation; Stiftelsen för Miljöstrategisk Forskning","keywords":"Wireless sensor network; Denial-of-service attack; Jamming; Computer science; Network packet; Computer network; Overhead (engineering); EWMA chart; Key distribution in wireless sensor networks; Process (computing); Real-time computing; Computer security; Wireless; Wireless network; Telecommunications; Control chart","retraction":null,"screen_n_in":null,"score":{"opus":0.01591685330020147,"gpt":0.2581662956069022,"spread":0.2422494423067008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005664281,0.0003705556,0.000465409,0.0003087,0.0001859097,0.0002449156,0.001096455,0.0002650907,0.00001605812],"category_scores_gemma":[0.0001551303,0.0003816207,0.00007811251,0.001383171,0.0002187166,0.0001816282,0.0004189367,0.0005720886,0.0002605796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001555185,"about_ca_system_score_gemma":0.00004759593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001559456,"about_ca_topic_score_gemma":0.0001416903,"domain_scores_codex":[0.9963989,0.000332385,0.0005331087,0.001057185,0.0005153879,0.001162991],"domain_scores_gemma":[0.9977898,0.0004955523,0.0001023446,0.001073702,0.0001532364,0.0003853354],"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.0004371219,0.0007503542,0.00654225,0.0001501983,0.0001943889,0.001101977,0.0241051,0.411703,0.001281156,0.125678,0.01094481,0.4171116],"study_design_scores_gemma":[0.0004590811,0.0001860313,0.003414314,0.00005536349,0.000006808257,0.00009215197,0.0001970074,0.9928406,0.0005260439,0.0003314637,0.001349278,0.0005418598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4810245,0.00002126026,0.5129749,0.0002087239,0.0006024175,0.0003705025,0.000003875792,0.0002740698,0.004519767],"genre_scores_gemma":[0.8531291,0.000009113963,0.1454124,0.0006574173,0.0006203273,0.00002257953,0.00000474096,0.00004191121,0.0001023081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5811376,"threshold_uncertainty_score":0.9998636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3013579342","doi":"10.1109/access.2020.2983091","title":"A Systematic Review on Clone Node Detection in Static Wireless Sensor Networks","year":2020,"lang":"en","type":"review","venue":"IEEE Access","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"University of Northern British Columbia","keywords":"Computer science; Adversary; Node (physics); Wireless sensor network; clone (Java method); Computer network; Replication (statistics); Software deployment; Sensor node; Distributed computing; Wireless; Key distribution in wireless sensor networks; Computer security; Wireless network; Engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0430065761215009,"gpt":0.3328421486714461,"spread":0.2898355725499452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009620259,0.001060228,0.005716558,0.0004563641,0.0001230508,0.0007172105,0.004631642,0.0005833587,0.000007806329],"category_scores_gemma":[0.0002797926,0.0008890292,0.00071079,0.003413388,0.00005780039,0.0006254069,0.0004699316,0.00185748,0.0002895925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005699838,"about_ca_system_score_gemma":0.0001894626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005540801,"about_ca_topic_score_gemma":0.00004708531,"domain_scores_codex":[0.9923914,0.001924123,0.002442864,0.001498465,0.0008856237,0.0008575263],"domain_scores_gemma":[0.9939367,0.001709253,0.001722506,0.002226743,0.0001309705,0.0002738788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","study_design_scores_codex":[0.000002615251,0.00006180062,1.455364e-7,0.75656,0.0001361228,0.0003824382,0.00005178155,0.0007759758,6.720209e-8,0.000082973,0.0003231154,0.2416229],"study_design_scores_gemma":[0.0001943013,0.00006559951,2.579121e-7,0.8785568,0.0008342753,0.0001975037,0.000003138816,0.1051886,0.000002642314,0.00003296076,0.01393849,0.0009854338],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000002545846,0.9116749,0.08112269,0.0001396303,0.001912909,0.004696863,0.000009622516,0.0003718789,0.00006896756],"genre_scores_gemma":[0.0001710934,0.9961409,0.0002720978,0.001786441,0.0004346347,0.001030009,0.00001988879,0.0001255001,0.00001943188],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.2406375,"threshold_uncertainty_score":0.999356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4410358938","doi":"10.1109/tifs.2025.3570202","title":"Generative AI Based Secure Wireless Sensing for ISAC Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":130,"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":"National Natural Science Foundation of China; National Research Foundation Singapore; National Research Foundation of Korea; Ministry of Education","keywords":"Computer science; Wireless; Wireless network; Computer network; Generative grammar; Computer security; Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.00733626976435155,"gpt":0.2331169141142349,"spread":0.2257806443498833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002752736,0.0002673502,0.0002781815,0.0002785605,0.0006524614,0.000461272,0.0002569188,0.0002594779,0.000003937275],"category_scores_gemma":[0.000008012201,0.0002740016,0.0001475201,0.000561688,0.0001145929,0.001245444,0.000006375526,0.0004549764,0.000003793038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008656112,"about_ca_system_score_gemma":0.0001081854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002904877,"about_ca_topic_score_gemma":0.0000784829,"domain_scores_codex":[0.998576,0.00006482225,0.0004750745,0.0002853478,0.000236226,0.0003625381],"domain_scores_gemma":[0.9985861,0.0003121484,0.0001432875,0.0004302313,0.0004178783,0.0001103612],"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.0001807291,0.0001103399,0.00001068259,0.0002110243,0.0001676843,0.000002645862,0.006463575,0.4481081,0.00002921671,0.2254476,0.008156444,0.311112],"study_design_scores_gemma":[0.0009009298,0.00008337735,0.000008008471,0.00007405051,0.00002799437,0.000005246974,0.0001366487,0.9805132,0.003264674,0.01022131,0.004499995,0.0002645749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004441466,0.00003535764,0.9903488,0.002283624,0.001648877,0.0005801095,0.00005780962,0.0002243076,0.0003796523],"genre_scores_gemma":[0.9745838,0.00004527662,0.01814813,0.00706311,0.00005901492,0.00003468964,0.00003260203,0.00000971929,0.00002363201],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9722007,"threshold_uncertainty_score":0.9999712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137940221","doi":"10.1109/tmc.2010.40","title":"Localized Multicast: Efficient and Distributed Replica Detection in Large-Scale Sensor Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Wuhan University; National University of Singapore; George Mason University","keywords":"Multicast; Computer science; Node (physics); Computer network; Replica; Distributed computing; Replication (statistics); Adversary; Wireless sensor network; Reliable multicast; Source-specific multicast; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.006467901101342321,"gpt":0.2365291250792432,"spread":0.2300612239779009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005265278,0.0002707817,0.0003131999,0.0002062029,0.0004266783,0.0001750796,0.0003804078,0.0002580825,0.00001020962],"category_scores_gemma":[0.00001343603,0.0002895014,0.0001051397,0.0008453476,0.0001027329,0.0001148586,0.00001751096,0.001206842,0.00001258921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007745901,"about_ca_system_score_gemma":0.00001922679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004743313,"about_ca_topic_score_gemma":0.0002937622,"domain_scores_codex":[0.9976815,0.0001548529,0.0004786613,0.0007990942,0.0002594907,0.0006263892],"domain_scores_gemma":[0.9983208,0.0005328725,0.0001218957,0.000763974,0.00007599682,0.0001844524],"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.00002425926,0.0002876447,0.00007058722,0.000009555974,0.00001004001,0.00001544355,0.0005828402,0.9246076,0.002234787,0.00004051285,0.000003085276,0.0721136],"study_design_scores_gemma":[0.001002518,0.00009009562,0.0005010189,0.00004746982,0.000009938182,0.00008213755,0.0001085423,0.9898652,0.007798124,0.00001470348,0.0001937736,0.0002864406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4238471,0.00001846354,0.5745193,0.00004722292,0.0009733731,0.0003229681,0.000005752593,0.0002545499,0.00001121817],"genre_scores_gemma":[0.9842697,0.00001164452,0.01544834,0.00008964903,0.0001066074,0.00004038631,0.000002567249,0.00002535752,0.00000576756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5604226,"threshold_uncertainty_score":0.9999557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1483299212","doi":"10.1002/sec.517","title":"Two‐factor mutual authentication with key agreement in wireless sensor networks","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mutual authentication; Wireless sensor network; Authentication protocol; Computer network; Authentication (law); Robustness (evolution); Hash function; Key (lock); Security analysis; Protocol (science); Key-agreement protocol; Forward secrecy; Computer security; Public-key cryptography; Key distribution; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.0128715771761963,"gpt":0.2390913624177317,"spread":0.2262197852415354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008352167,0.0003476084,0.0003683463,0.0001480307,0.0003530774,0.0002642287,0.001232959,0.0002566762,0.0000255329],"category_scores_gemma":[0.00001754761,0.0003355924,0.00006036359,0.0007658175,0.0002439655,0.00104894,0.0006466993,0.0009195446,0.00001629301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000121744,"about_ca_system_score_gemma":0.00003099442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001468094,"about_ca_topic_score_gemma":0.0005278014,"domain_scores_codex":[0.997137,0.0006619212,0.0005347981,0.0004662925,0.0003784193,0.0008216263],"domain_scores_gemma":[0.9969671,0.0004941585,0.0002972612,0.001822104,0.0001328265,0.0002865105],"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.0003136173,0.002127034,0.1153469,0.00009578695,0.000276666,0.0000189041,0.06056947,0.05029243,0.00005915124,0.664277,0.0008692926,0.1057538],"study_design_scores_gemma":[0.001137782,0.00007316345,0.019052,0.0001683568,0.00002221477,0.00004240988,0.0005282685,0.9765402,0.0000379925,0.0008304309,0.001026668,0.0005405102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7599557,0.008063162,0.2261915,0.001745834,0.000510353,0.0009567143,0.000004338827,0.000363492,0.002208902],"genre_scores_gemma":[0.9916951,0.001993111,0.005422128,0.0004674287,0.0002407909,0.00007456191,0.00005346091,0.00002684817,0.0000265534],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9262478,"threshold_uncertainty_score":0.9999096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2789858278","doi":"10.1016/j.jnca.2018.01.004","title":"Data collection for attack detection and security measurement in Mobile Ad Hoc Networks: A survey","year":2018,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Science Basic Research Program of Shaanxi Province; National Key Research and Development Program of China; Higher Education Discipline Innovation Project; Academy of Finland; National Natural Science Foundation of China","keywords":"Computer science; Mobile ad hoc network; Computer security; Data collection; Trustworthiness; Data security; Computer network; Encryption; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.05595645844568747,"gpt":0.2953006636702692,"spread":0.2393442052245817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002008337,0.000145347,0.0002708404,0.0001117638,0.0002831639,0.0002008683,0.0006275153,0.0001028325,7.872467e-7],"category_scores_gemma":[0.00001470369,0.0001425659,0.00003671078,0.0006958222,0.00008295693,0.0003822009,0.0003166748,0.0002384905,6.59255e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007632148,"about_ca_system_score_gemma":0.00005618037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000618341,"about_ca_topic_score_gemma":0.001051639,"domain_scores_codex":[0.9984203,0.0001822618,0.0005086373,0.0003775447,0.0002414036,0.0002698617],"domain_scores_gemma":[0.9981527,0.0003316744,0.0003455725,0.0005154885,0.0005333073,0.0001212574],"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.0002334193,0.0004030581,0.005638734,0.00005358342,0.0001734866,0.000003473201,0.00111526,0.01959397,0.00002768311,0.0006762022,0.02957116,0.9425099],"study_design_scores_gemma":[0.0006722517,0.0004832389,0.01970969,0.00005790286,0.00001891779,0.00009449909,0.00001201614,0.9203569,0.000005772244,0.001544786,0.05688795,0.0001560557],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02043272,0.009013064,0.9692574,0.0001284781,0.0004934202,0.0006334486,0.000005247904,0.00002728611,0.000008964126],"genre_scores_gemma":[0.9467931,0.003382964,0.04752562,0.0002007503,0.001970645,0.00009882016,0.000009757201,0.00001511427,0.000003277527],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9423539,"threshold_uncertainty_score":0.581367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2743856420","doi":"10.1109/comptelix.2017.8004033","title":"Security vulnerabilities and countermeasures against jamming attacks in Wireless Sensor Networks: A survey","year":2017,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Jamming; Computer science; Computer security; Adversary; Wireless sensor network; Wireless; Computer network; Cover (algebra); Wireless network; Countermeasure; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02422001928547811,"gpt":0.2695577054197179,"spread":0.2453376861342398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001976618,0.0003381071,0.0004896798,0.0001239341,0.0006463106,0.0014625,0.00161864,0.0002346338,0.000009315919],"category_scores_gemma":[0.0003913268,0.0003274351,0.00006604165,0.0001633336,0.0004236674,0.001047288,0.0008008365,0.0005293807,0.000007778185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009192143,"about_ca_system_score_gemma":0.00005323139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002661984,"about_ca_topic_score_gemma":0.009989545,"domain_scores_codex":[0.9970837,0.0005021737,0.0004625383,0.0008177878,0.0004097743,0.0007240472],"domain_scores_gemma":[0.9968545,0.0008194755,0.0002399575,0.001712469,0.0001905723,0.0001829558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001020716,0.0002841809,0.914661,0.0001370254,0.00009002168,0.0002910564,0.006840663,0.01361441,0.0001730921,0.01346309,0.002943836,0.04739957],"study_design_scores_gemma":[0.0006363216,0.00003807998,0.2279252,0.0001010594,0.00000276227,0.00001867602,0.0002029361,0.7698953,0.00009616089,0.0003948503,0.0002403976,0.0004483551],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9799882,0.0001812961,0.01472339,0.0005814217,0.0006569771,0.000294547,0.00000811787,0.0002013128,0.00336477],"genre_scores_gemma":[0.9979973,0.0002907664,0.000981276,0.0004183193,0.0001773727,0.00001642816,0.000007070626,0.00002310299,0.00008829501],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7562808,"threshold_uncertainty_score":0.9999177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4302878404","doi":"10.6028/nist.sp.800-56ar","title":"Recommendation for pair-wise key establishment schemes using discrete logarithm cryptography","year":2007,"lang":"en","type":"report","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","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":"National Institute of Standards and Technology; Government of Canada; National Security Agency","keywords":"Discrete logarithm; Logarithm; Cryptography; Key (lock); Computer science; Theoretical computer science; Computer security; Public-key cryptography; Mathematics; Encryption; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.07569188455788825,"gpt":0.3465291240291849,"spread":0.2708372394712967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002177902,0.000660476,0.0007600653,0.0008407009,0.0003303572,0.0007502981,0.001304263,0.0007945431,0.0001660301],"category_scores_gemma":[0.0002188381,0.0006414275,0.000563904,0.0009685638,0.000106691,0.0008209877,0.0005963644,0.0006751845,0.000009364351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006038438,"about_ca_system_score_gemma":0.000592494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004444278,"about_ca_topic_score_gemma":0.00009078019,"domain_scores_codex":[0.9952889,0.0001010237,0.001061649,0.001353949,0.001207576,0.0009868643],"domain_scores_gemma":[0.9959756,0.0005476869,0.0008142098,0.001287061,0.001112113,0.0002633239],"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.00005815592,0.0004870891,0.002205288,0.0009542344,0.0008681299,0.00007165334,0.0007295306,0.0008434925,0.00007185477,0.03169426,0.35157,0.6104463],"study_design_scores_gemma":[0.0004579241,0.0001141527,0.00004208942,0.0002453188,0.00009059647,0.00007069208,0.00005363144,0.1380085,0.0007697683,0.001817628,0.8573645,0.0009651863],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002435982,0.0004476634,0.9716809,0.0009621647,0.004849608,0.001171538,0.00005601007,0.0005850691,0.02000345],"genre_scores_gemma":[0.004413357,0.0008527685,0.9898852,0.0007483509,0.002122768,0.0001134726,0.0008895338,0.0001391773,0.0008354355],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6094811,"threshold_uncertainty_score":0.9996037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110566685","doi":"10.1016/j.adhoc.2006.05.007","title":"Self-healing group key distribution with time-limited node revocation for wireless sensor networks","year":2006,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer network; Keying; Computer science; Node (physics); Forward secrecy; Overhead (engineering); Group key; Wireless sensor network; Encryption; Authentication (law); Distributed computing; Public-key cryptography; Computer security; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.006280264767130297,"gpt":0.2051067343236865,"spread":0.1988264695565561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006958412,0.0005619347,0.0005708033,0.0001029181,0.0006215236,0.0004569933,0.000985834,0.0005311887,0.000006125851],"category_scores_gemma":[0.0000205894,0.00055007,0.0001895404,0.001279092,0.0001158154,0.0006693302,0.0001859863,0.0006191157,0.00002487033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003276934,"about_ca_system_score_gemma":0.00005661386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004065336,"about_ca_topic_score_gemma":0.0001022469,"domain_scores_codex":[0.9960716,0.0002380989,0.0007483941,0.001130082,0.0005110974,0.001300691],"domain_scores_gemma":[0.9968935,0.0007395482,0.0005087471,0.001215542,0.0004233331,0.0002193093],"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.0002315268,0.0003375045,0.0007215246,0.00007162769,0.0001198104,0.00003116454,0.0001951138,0.9386092,0.00005611348,0.01834641,0.01290422,0.0283758],"study_design_scores_gemma":[0.001255598,0.00022208,0.001073367,0.0001771024,0.00007888631,0.00005369345,0.00001693192,0.9819733,0.00005051202,0.0003786403,0.01401583,0.0007040484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02057672,0.002610475,0.9725637,0.0007030981,0.0007848787,0.001215663,0.00001987048,0.00129279,0.000232837],"genre_scores_gemma":[0.8805179,0.0007653329,0.1132224,0.0006356459,0.002348768,0.0002571928,0.00195761,0.000129902,0.0001652366],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8599412,"threshold_uncertainty_score":0.9996951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2730287276","doi":"10.1007/s11276-017-1551-9","title":"A hierarchical learning approach to anti-jamming channel selection strategies","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Stackelberg competition; Computer science; Jamming; Channel (broadcasting); Selection (genetic algorithm); Convergence (economics); Interference (communication); Adversarial system; Mathematical optimization; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01907749977353366,"gpt":0.2549604267114776,"spread":0.235882926937944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006117931,0.0004038605,0.0004929902,0.0001827296,0.001953592,0.002558562,0.002621547,0.0003600761,0.000004195648],"category_scores_gemma":[0.00007145566,0.0004207229,0.0001464607,0.0004530206,0.0001681439,0.001264717,0.0009129413,0.001322013,0.00003686253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008829793,"about_ca_system_score_gemma":0.00008651878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001422275,"about_ca_topic_score_gemma":0.00004143485,"domain_scores_codex":[0.9967209,0.0002278256,0.0004020889,0.001039248,0.0005111617,0.001098785],"domain_scores_gemma":[0.9978122,0.000150663,0.0003106783,0.001222313,0.0001517741,0.0003524154],"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.00002273928,0.0001244984,0.001170935,0.0000248137,0.00004989218,0.00002547482,0.001840576,0.8778567,0.0001451144,0.05416599,0.0006756224,0.06389762],"study_design_scores_gemma":[0.0003494148,0.0001104469,0.005044136,0.00009111551,0.000009716564,0.00006253488,0.0001751898,0.9918672,0.00009361902,0.0006959984,0.0009824994,0.000518085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1569601,0.00008656756,0.833629,0.0005317021,0.0009703831,0.0003330238,4.448387e-7,0.0006209044,0.00686795],"genre_scores_gemma":[0.9864212,0.00007068047,0.01162112,0.0002201582,0.001368544,0.00006596275,0.000007500422,0.00005181705,0.0001730611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.829461,"threshold_uncertainty_score":0.9998245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984179204","doi":"10.1007/s10623-012-9749-4","title":"A unified approach to combinatorial key predistribution schemes for sensor networks","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"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","keywords":"Key (lock); Computer science; Class (philosophy); Scheme (mathematics); Combinatorial design; Wireless sensor network; Theoretical computer science; Mathematics; Artificial intelligence; Computer network; Discrete mathematics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02729268902626618,"gpt":0.2467781936238008,"spread":0.2194855045975346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000515608,0.0002533975,0.00028631,0.0001613975,0.0003047129,0.0002675242,0.0004485107,0.0002021111,0.000001453919],"category_scores_gemma":[0.00003716624,0.0002456433,0.0001452374,0.0007949653,0.00008718552,0.0003540257,0.0001349368,0.0001713236,0.000002040292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002123947,"about_ca_system_score_gemma":0.00001547183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008868703,"about_ca_topic_score_gemma":5.602922e-7,"domain_scores_codex":[0.9982263,0.000113711,0.0002590535,0.0004391322,0.0002366941,0.0007251454],"domain_scores_gemma":[0.9987156,0.0002445045,0.00009179457,0.0004467824,0.000145321,0.0003559808],"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.00008540712,0.0002958961,0.002260426,0.00003472916,0.0000775581,6.305958e-7,0.0007972141,0.0007108789,0.0003761358,0.9869466,0.003219437,0.00519503],"study_design_scores_gemma":[0.005013137,0.001234568,0.007712621,0.0001368046,0.0002126572,0.00008579901,0.0006949537,0.8152102,0.003920468,0.03558283,0.1276609,0.002535084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02604936,0.0007041206,0.970721,0.000107182,0.0009333685,0.0007535044,0.00002050399,0.0002391558,0.000471796],"genre_scores_gemma":[0.8275588,0.0000457118,0.1714462,0.0001969678,0.000548792,0.0001386097,0.0000447943,0.00001690199,0.000003243044],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9513638,"threshold_uncertainty_score":0.9999996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017982663","doi":"10.1016/j.jpdc.2010.03.009","title":"Private key agreement and secure communication for heterogeneous sensor networks","year":2010,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Key management; Key (lock); Computer network; Key space; Computer security; Public-key cryptography; Encryption; Protocol (science); Node (physics); Key distribution; Wireless sensor network; Cryptography; Symmetric-key algorithm; Key-agreement protocol; Elliptic curve cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.01095677645040634,"gpt":0.2451478531103873,"spread":0.234191076659981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000584668,0.0001647767,0.0002905271,0.00005792516,0.0002947976,0.0002730725,0.0005133917,0.000125219,0.000001560569],"category_scores_gemma":[0.0000701927,0.0001461973,0.00008373503,0.000129388,0.00007782899,0.0001883354,0.0003026208,0.0004793937,3.698751e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001867556,"about_ca_system_score_gemma":0.00002000412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003881551,"about_ca_topic_score_gemma":0.000008716466,"domain_scores_codex":[0.998723,0.00008190459,0.0005134833,0.0001978571,0.0001857688,0.0002980228],"domain_scores_gemma":[0.9983224,0.0003872187,0.0005509765,0.0003197589,0.0002396163,0.0001800145],"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.0002909751,0.0004472859,0.01824526,0.0001742939,0.0005218991,0.0001537561,0.003678012,0.7822843,0.001886739,0.08718082,0.002862817,0.1022738],"study_design_scores_gemma":[0.001109954,0.0001593037,0.003555789,0.00007439002,0.0000263149,0.0007214984,0.00005178259,0.9884292,0.00005712908,0.002866889,0.002751542,0.0001962364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3748927,0.0007928156,0.6232337,0.0006858132,0.0002471373,0.0001140103,0.000004242972,0.00002012489,0.000009447082],"genre_scores_gemma":[0.8567473,0.0001716543,0.1426888,0.0001392262,0.0002323282,0.000001158809,0.00001078371,0.000007113658,0.000001716294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4818546,"threshold_uncertainty_score":0.5961751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039340660","doi":"10.1016/j.jpdc.2015.04.003","title":"An energy-efficient and sink-location privacy enhanced scheme for WSNs through ring based routing","year":2015,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Sink (geography); Computer science; Computer network; Multipath routing; Geographic routing; Network packet; Static routing; Wireless sensor network; Equal-cost multi-path routing; Routing protocol; Anonymity; Dynamic Source Routing; Routing (electronic design automation); Policy-based routing; Topology (electrical circuits); Distributed computing; Computer security; Engineering; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.0313722191953885,"gpt":0.2852194507636361,"spread":0.2538472315682476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007504167,0.0001835178,0.000313126,0.00007256275,0.0002533123,0.0003240441,0.0004281935,0.00009144342,3.141289e-7],"category_scores_gemma":[0.0002260981,0.0001699989,0.00006058787,0.0003037611,0.0000507673,0.0004172041,0.000148108,0.0001957994,2.177231e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008795041,"about_ca_system_score_gemma":0.0001358341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001680518,"about_ca_topic_score_gemma":0.000001669046,"domain_scores_codex":[0.9983646,0.0001030049,0.0005677573,0.000296064,0.0003121809,0.0003564276],"domain_scores_gemma":[0.9980685,0.0002900413,0.0005941389,0.0002372084,0.0005620213,0.0002481359],"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.00009152592,0.0002090965,0.0008621829,0.00004222894,0.00004328615,0.00001534424,0.002821311,0.9562609,0.001292048,0.0220987,0.0001481334,0.01611526],"study_design_scores_gemma":[0.001714553,0.0002493531,0.00080544,0.0001556907,0.00001560416,0.00006677244,0.0003258314,0.9936529,0.0008247964,0.001789838,0.0001990414,0.0002001255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3185792,0.0004155688,0.6803451,0.0003288813,0.0002011255,0.00006896332,0.000002194994,0.00004000754,0.00001889979],"genre_scores_gemma":[0.8109796,0.000007867981,0.1886117,0.0001268162,0.0002532616,0.00000118767,0.00001033445,0.000008490538,7.939129e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4924003,"threshold_uncertainty_score":0.6932353,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068300465","doi":"10.1007/s11227-008-0184-2","title":"Scalable and efficient key management for heterogeneous sensor networks","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University; Acadia University","funders":"Higher Education Commision, Pakistan; Higher Education Commission, Pakistan; Acadia University","keywords":"Computer science; Scalability; Wireless sensor network; Key management; Key (lock); Distributed computing; Hash function; Computer network; Overhead (engineering); Key generation; Hash chain; Encryption; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01707679819292564,"gpt":0.2226535227446218,"spread":0.2055767245516962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073019,0.0001573155,0.0002565137,0.00009575712,0.0004950369,0.00008348759,0.0007756442,0.00005519899,0.000001656281],"category_scores_gemma":[0.00002055105,0.0001111597,0.00010869,0.0002244978,0.0001004044,0.0001199039,0.0003158404,0.0002554103,0.000002053743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004498906,"about_ca_system_score_gemma":0.00001536097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005739269,"about_ca_topic_score_gemma":6.48242e-7,"domain_scores_codex":[0.9985085,0.0001316685,0.0004657821,0.0001713443,0.0003151389,0.0004075481],"domain_scores_gemma":[0.9986712,0.0005460198,0.0001943677,0.0003195259,0.0001584711,0.0001104365],"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.0000297459,0.00005298977,0.0002568489,0.0000209847,0.0000774627,0.0001110729,0.002395219,0.9841201,0.00008439453,0.0008226084,0.0005250557,0.01150353],"study_design_scores_gemma":[0.0005680451,0.0001253249,0.0004798078,0.00008526416,0.00003036263,0.003944315,0.0001584264,0.9935218,0.000271744,0.0001309571,0.0005430987,0.0001408391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5221676,0.001102354,0.4757806,0.0003058934,0.0004112354,0.0001425451,2.440606e-7,0.00002593016,0.00006352606],"genre_scores_gemma":[0.9380743,0.000313853,0.0608721,0.0003057262,0.0003992665,8.381701e-7,2.217047e-7,0.00001468241,0.00001905258],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4159066,"threshold_uncertainty_score":0.4532962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034732438","doi":"10.1109/bsc.2010.5472979","title":"Energy efficiency of symmetric key cryptographic algorithms in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Symmetric-key algorithm; Block cipher; Key schedule; Cryptography; S-box; Algorithm; Wireless sensor network; Key (lock); Stream cipher; Efficient energy use; Encryption; Block size; Differential cryptanalysis; Computer network; Public-key cryptography; Computer security; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007223561059395812,"gpt":0.2152429271953964,"spread":0.2080193661360006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005434362,0.0002952869,0.0004524851,0.001029248,0.00008097194,0.0001082775,0.001721848,0.0003494848,0.00003815533],"category_scores_gemma":[0.00004782862,0.0002773122,0.0001629689,0.005254865,0.0002087125,0.0003036698,0.0003547152,0.0006615219,0.000008164313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002211183,"about_ca_system_score_gemma":0.00005513505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007160801,"about_ca_topic_score_gemma":0.0004830094,"domain_scores_codex":[0.9972396,0.0001313337,0.0006502311,0.0006858264,0.0005498684,0.0007431515],"domain_scores_gemma":[0.9976982,0.0005536649,0.0002146559,0.001153826,0.00019027,0.0001894006],"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.0000116196,0.0006148487,0.007506521,0.00002132531,0.00003099707,0.00007690604,0.000393185,0.00857998,0.003338205,0.8546741,0.0002357757,0.1245166],"study_design_scores_gemma":[0.0004845508,0.00008024787,0.003256072,0.0000250912,0.000004813805,0.00003524145,0.00002627586,0.990901,0.003014643,0.001474393,0.000340246,0.0003574437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.349115,0.0002054684,0.644392,0.000172936,0.001545643,0.0001425141,0.000001054821,0.0002337597,0.004191637],"genre_scores_gemma":[0.9653713,0.0001469783,0.03398997,0.0002208138,0.0001822846,0.00001316869,0.000002361779,0.000022866,0.00005029239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.982321,"threshold_uncertainty_score":0.9999679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033154378","doi":"10.1007/s10623-010-9481-x","title":"On the complexity of the herding attack and some related attacks on hash functions","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Herding; Hash function; Computer science; Theoretical computer science; Computational complexity theory; Discrete mathematics; Mathematics; Algorithm; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.109308169504407,"gpt":0.2494344636524989,"spread":0.1401262941480919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002981823,0.0001718945,0.0001820543,0.0001030459,0.0004953066,0.0000910325,0.0005067416,0.00009132668,0.000023456],"category_scores_gemma":[0.00002086232,0.0001023414,0.0001223095,0.0005523274,0.0007901505,0.0001341285,0.0001583395,0.0002926507,0.000004569566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000676062,"about_ca_system_score_gemma":0.000009721954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003473424,"about_ca_topic_score_gemma":0.00001391432,"domain_scores_codex":[0.9987882,0.0002180425,0.0002131758,0.0003213309,0.0002228406,0.0002364299],"domain_scores_gemma":[0.9987365,0.0003862347,0.0001309672,0.0006300395,0.00004963251,0.00006662607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002388731,0.0001006103,0.002984616,0.00001004641,0.00007445517,0.000001994337,0.001804762,0.00009828372,0.0002434494,0.9910134,0.001853078,0.001791437],"study_design_scores_gemma":[0.001593264,0.001520012,0.1782828,0.0005657751,0.0001414087,0.00006716447,0.001169683,0.07283217,0.004841279,0.7362332,0.001718673,0.001034479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9624659,0.000401425,0.03052882,0.001315866,0.0004078872,0.0004032957,0.0000115697,0.0001197438,0.004345438],"genre_scores_gemma":[0.9977066,0.00008339289,0.001565318,0.0005889087,0.00002173038,0.00001070801,8.554434e-7,0.00001010363,0.00001240096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2547801,"threshold_uncertainty_score":0.4173363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4200619267","doi":"10.1142/s021848852140016x","title":"Black-Hole Attack Mitigation in Medical Sensor Networks Using the Enhanced Gravitational Search Algorithm","year":2021,"lang":"en","type":"article","venue":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Network packet; Computer science; Wireless sensor network; Computer network; Denial-of-service attack; Sybil attack; Energy consumption; Packet drop attack; Node (physics); Physics; Routing protocol; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02474379105482059,"gpt":0.3153753559117211,"spread":0.2906315648569004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001708012,0.0002118998,0.000382714,0.0002852349,0.0001264846,0.0004563359,0.001004054,0.0001846957,0.00001824007],"category_scores_gemma":[0.0002637802,0.000163846,0.0001533778,0.0006372685,0.0002131709,0.0003396049,0.0001748304,0.0006062947,0.000004055056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002898568,"about_ca_system_score_gemma":0.00100733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007167668,"about_ca_topic_score_gemma":0.0001327534,"domain_scores_codex":[0.9963217,0.0007229138,0.0009419617,0.0003320054,0.001364209,0.0003172469],"domain_scores_gemma":[0.9950851,0.001177825,0.0004029355,0.0002544817,0.002886009,0.0001936289],"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.00005380765,0.0002175108,0.0007377205,0.00003867726,0.0001286705,0.0004389665,0.0009944269,0.9774075,0.0005860046,0.002947168,0.0001945129,0.01625501],"study_design_scores_gemma":[0.00152461,0.00004055781,0.0006438933,0.0007640207,0.00001194498,0.0003111985,0.000795259,0.9946224,0.0004718755,0.0001400136,0.0004971393,0.0001770881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2825109,0.001826839,0.7087457,0.002592338,0.00401396,0.0001651243,0.00000998145,0.00001886234,0.0001162147],"genre_scores_gemma":[0.9948395,0.0001260464,0.00317265,0.0002373772,0.001538081,0.000006661461,0.00002055071,0.00001572475,0.00004334791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7123286,"threshold_uncertainty_score":0.6681448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150604138","doi":"10.1109/infcom.2011.5935175","title":"Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs","year":2011,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise comparison; Combinatorial design; Key (lock); Computer science; Wireless sensor network; Key distribution; Wireless; Key generation; Computer network; Distributed computing; Theoretical computer science; Public-key cryptography; Mathematics; Encryption; Discrete mathematics; Computer security; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04018127128670118,"gpt":0.2341599628031297,"spread":0.1939786915164285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004973358,0.0002724153,0.0003374892,0.0000943437,0.000162797,0.0001629809,0.000541029,0.0002986288,0.00002127383],"category_scores_gemma":[0.00003570683,0.0002715662,0.00006464247,0.0006703571,0.0001142036,0.000536489,0.0002859654,0.0003979931,0.000005654331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001331735,"about_ca_system_score_gemma":0.00005755339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004178013,"about_ca_topic_score_gemma":0.00009795697,"domain_scores_codex":[0.9978356,0.0002744839,0.000414043,0.0005839988,0.0002758173,0.0006160801],"domain_scores_gemma":[0.9988887,0.0001507671,0.0001362441,0.0005219641,0.0001101383,0.0001921574],"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.0004004769,0.001017421,0.03617272,0.00007780128,0.00009585518,0.0005501108,0.007957595,0.006496422,0.0009262577,0.9287502,0.002574672,0.01498053],"study_design_scores_gemma":[0.001403289,0.0001250445,0.002820408,0.00005492689,0.00001277052,0.00005944847,0.0001234182,0.988766,0.0008115271,0.005259319,0.000127472,0.0004363726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4154333,0.0001044729,0.5823747,0.00005607886,0.00129876,0.00029442,0.000003944569,0.0001925318,0.0002417186],"genre_scores_gemma":[0.9850045,0.00004323449,0.01458414,0.00009699969,0.0002139841,0.000009187895,0.00001364445,0.00001888527,0.00001541857],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9822696,"threshold_uncertainty_score":0.9999737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2618844859","doi":"10.3390/s17061227","title":"A Protocol Layer Trust-Based Intrusion Detection Scheme for Wireless Sensor Networks","year":2017,"lang":"en","type":"article","venue":"Sensors","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Intrusion detection system; Node (physics); Computer network; Protocol (science); Metric (unit); Wireless sensor network; Layer (electronics); Application layer; Physical layer; Trustworthiness; Network layer; Wireless; Computer security; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02849859972891861,"gpt":0.2982389406133565,"spread":0.2697403408844379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005290757,0.0003969855,0.0004026707,0.0001513026,0.001293049,0.0007989519,0.00154533,0.0003947036,0.0000147279],"category_scores_gemma":[0.0002333967,0.0003811607,0.0002432425,0.0002071776,0.0001783524,0.0004528988,0.0003022481,0.0004399278,0.00004260825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001245342,"about_ca_system_score_gemma":0.00006803241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007639823,"about_ca_topic_score_gemma":0.00008953875,"domain_scores_codex":[0.9972757,0.0001412918,0.0004596627,0.000882841,0.0004329786,0.000807584],"domain_scores_gemma":[0.9964681,0.0002675008,0.0005426228,0.002194195,0.0003074095,0.0002201248],"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.002226565,0.00104197,0.006780535,0.0007418098,0.0002905597,0.0002783318,0.001434968,0.2691806,0.03147856,0.01626328,0.003826269,0.6664566],"study_design_scores_gemma":[0.001968023,0.0001837678,0.00101411,0.00008621143,0.00001094147,0.00001812726,0.00002181412,0.9590644,0.02616967,0.0002832304,0.01070546,0.0004741991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3901046,0.000007328376,0.5460175,0.00142994,0.00176789,0.05904289,0.000007992522,0.0008833899,0.0007384925],"genre_scores_gemma":[0.9368017,0.000001973072,0.03758435,0.0004018609,0.001007383,0.02384933,0.000005049993,0.00007418385,0.0002741684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6898838,"threshold_uncertainty_score":0.999864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3143233897","doi":"","title":"A Survey on Security in Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":42,"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":"Wireless sensor network; Computer science; Key distribution in wireless sensor networks; Computer security; Wireless; Wireless network; Computer network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02662347490899472,"gpt":0.2435203509249622,"spread":0.2168968760159675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000597442,0.0002599314,0.0003464996,0.0001766061,0.0001381919,0.00007584111,0.001054404,0.0002139476,0.00003178817],"category_scores_gemma":[0.00006394116,0.0002488614,0.00007778843,0.001099068,0.0001030115,0.0002619637,0.0002462851,0.0005718865,0.0001278116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009129308,"about_ca_system_score_gemma":0.00005087526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001195407,"about_ca_topic_score_gemma":0.001759729,"domain_scores_codex":[0.9974406,0.000433949,0.0003771021,0.0006675124,0.0004198058,0.0006610253],"domain_scores_gemma":[0.9979184,0.0007648318,0.0000835281,0.0009737831,0.00009277242,0.0001667164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000268761,0.002492459,0.6248506,0.00003334722,0.0001044784,0.00350694,0.008128329,0.1384457,0.00007181842,0.1270725,0.07102897,0.02399605],"study_design_scores_gemma":[0.0005137592,0.00007628246,0.2033361,0.00002466871,7.839918e-7,0.0000488084,0.00001146774,0.7949951,0.0001603095,0.0002600183,0.0002098759,0.000362856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9220949,0.00008309696,0.07001913,0.0003748409,0.0007743315,0.0002800147,0.000003526649,0.0004454812,0.005924612],"genre_scores_gemma":[0.9971111,0.0001312475,0.001277903,0.001123096,0.0001346782,0.00000942063,0.00000957359,0.00001906638,0.0001838973],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6565494,"threshold_uncertainty_score":0.9999964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4293778742","doi":"10.3390/s22166215","title":"Trust and Mobility-Based Protocol for Secure Routing in Internet of Things","year":2022,"lang":"en","type":"article","venue":"Sensors","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"King Saud University","keywords":"Computer science; Routing protocol; Computer network; Routing (electronic design automation); Protocol (science); Network packet; Throughput; Computer security; Distributed computing; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01805223179302284,"gpt":0.2734583863774345,"spread":0.2554061545844116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171238,0.0001206858,0.0002038764,0.0001188557,0.00007471554,0.00003975451,0.0004757477,0.00004943302,0.00001707025],"category_scores_gemma":[0.00007597598,0.0001267329,0.00005690236,0.0003232736,0.00005703343,0.0001142891,0.0002866363,0.000265495,4.743682e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007016319,"about_ca_system_score_gemma":0.00004361598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001230759,"about_ca_topic_score_gemma":0.00001104389,"domain_scores_codex":[0.9986713,0.0001528779,0.0003166473,0.0003732779,0.0002293332,0.0002565579],"domain_scores_gemma":[0.9991152,0.0003006422,0.0001552034,0.0003420016,0.00004467995,0.00004232601],"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.002105362,0.003608273,0.09364834,0.003217736,0.0001576978,0.0002297867,0.1755785,0.3067814,0.003392394,0.3215683,0.004041577,0.08567062],"study_design_scores_gemma":[0.001146058,0.0001993322,0.0004666303,0.00004178112,0.000001845899,0.000007902136,0.0003064534,0.9922656,0.002021491,0.001303434,0.002097961,0.0001415451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8956134,0.000007744713,0.02269417,0.0007483729,0.0002040172,0.08009095,0.000007969445,0.0001711579,0.0004622331],"genre_scores_gemma":[0.9489022,7.553174e-8,0.01499324,0.0002950458,0.00002135302,0.03572613,0.00000225507,0.00001418295,0.00004550553],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6854842,"threshold_uncertainty_score":0.5168017,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390691512","doi":"10.1109/tnsm.2024.3352014","title":"Multi-Agent Deep Reinforcement Learning for Packet Routing in Tactical Mobile Sensor Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":41,"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":"Computer science; Computer network; Network packet; Wireless sensor network; Reinforcement learning; Source routing; Routing protocol; Intrusion detection system; Packet forwarding; Jamming; Distributed computing; Link-state routing protocol; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01666666808175059,"gpt":0.2542266574341779,"spread":0.2375599893524273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005882371,0.0003417939,0.0002997454,0.0002088426,0.0003965593,0.0004562014,0.0003919034,0.0001551683,0.00002134654],"category_scores_gemma":[0.000001513077,0.0003497736,0.0001311654,0.0009776161,0.00002754997,0.000296408,0.00002828242,0.0006157476,0.00002620411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001656309,"about_ca_system_score_gemma":0.00001567141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000495829,"about_ca_topic_score_gemma":0.0002693345,"domain_scores_codex":[0.9974551,0.0001317228,0.0005044461,0.0008025906,0.0002965703,0.0008095667],"domain_scores_gemma":[0.9988559,0.0004222012,0.00006628318,0.0004461487,0.00005148437,0.0001580064],"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.00003707538,0.00008557337,0.00001194445,0.0001734966,0.0001172031,0.00005710037,0.0009269548,0.905856,0.000003198337,0.001836375,0.00009619571,0.09079889],"study_design_scores_gemma":[0.0007139429,0.0001631463,0.00006925718,0.0003034802,0.00006837396,0.00001158284,0.0004560054,0.9914638,0.0000201269,0.00006842428,0.006300168,0.000361641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002592955,0.0003742972,0.9926149,0.000687016,0.001727848,0.001228746,7.265344e-7,0.0004126845,0.0003608557],"genre_scores_gemma":[0.9705853,0.001445948,0.02568231,0.001174298,0.0002389541,0.0005128462,0.000007793051,0.00004595262,0.0003065779],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9679924,"threshold_uncertainty_score":0.9998955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999772590","doi":"10.1016/j.compeleceng.2009.03.013","title":"Using honeynodes for defense against jamming attacks in wireless infrastructure-based networks","year":2009,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National Institute of Standards and Technology; Federation for the Humanities and Social Sciences","keywords":"Jamming; Computer network; Denial-of-service attack; Wireless; Computer science; Wireless network; Channel (broadcasting); Overhead (engineering); Network packet; Computer security; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01224458730287122,"gpt":0.2358809801864521,"spread":0.2236363928835809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002610438,0.0004236207,0.0005361487,0.0004908244,0.0001249328,0.0002606503,0.001027304,0.0002729645,3.859406e-7],"category_scores_gemma":[0.00006931439,0.0004827044,0.0001832656,0.001605028,0.00002417216,0.0003227392,0.0001007701,0.0006532581,8.925383e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004005354,"about_ca_system_score_gemma":0.00007975767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000650013,"about_ca_topic_score_gemma":7.608223e-7,"domain_scores_codex":[0.9973038,0.0000545012,0.0005258063,0.0006931209,0.0002916915,0.001131078],"domain_scores_gemma":[0.9984235,0.0006298766,0.0001206735,0.0005320768,0.00008637257,0.0002075272],"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.00001565216,0.00003943071,0.0000734499,0.00001428484,0.00001187314,0.00003994171,0.00009930814,0.9038264,0.001698899,0.004196892,0.00008608709,0.08989783],"study_design_scores_gemma":[0.0009015594,0.0001306916,0.000479714,0.0001459799,0.000007968548,0.00002051933,0.000001733163,0.9964751,0.0009830142,0.0001971797,0.0001275754,0.0005289921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1435856,0.0003176412,0.8545738,0.0001361644,0.0005966459,0.0003458766,6.492073e-7,0.0004296428,0.00001404145],"genre_scores_gemma":[0.7960894,0.00001569668,0.2029194,0.000650661,0.0002750981,0.00001001809,0.000006866538,0.00003232504,6.245216e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6525038,"threshold_uncertainty_score":0.9997625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979291092","doi":"10.1155/2011/893592","title":"Secure Clustering and Symmetric Key Establishment in Heterogeneous Wireless Sensor Networks","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":39,"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; Wireless sensor network; Computer network; Node (physics); Key distribution in wireless sensor networks; Public-key cryptography; Dissemination; Key (lock); Key management; Cluster analysis; Authentication (law); Routing (electronic design automation); Distributed computing; Computer security; Wireless; Wireless network; Encryption; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02007466059847063,"gpt":0.2561040856951653,"spread":0.2360294250966947,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001298414,0.0004170869,0.0005118094,0.0005588912,0.001017052,0.001223379,0.001953043,0.0002847031,0.000004425543],"category_scores_gemma":[0.00002625966,0.0004104321,0.00009882473,0.001194506,0.000241046,0.0005488735,0.001317161,0.002814605,0.000002662272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009230919,"about_ca_system_score_gemma":0.00004423006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003492041,"about_ca_topic_score_gemma":0.0004870862,"domain_scores_codex":[0.9969161,0.0005269619,0.0008093334,0.00055913,0.0004049745,0.0007835428],"domain_scores_gemma":[0.9961249,0.001196374,0.0004666599,0.001679792,0.000143181,0.0003891591],"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.0000657072,0.0003989961,0.02018129,0.00003832693,0.0001153543,0.0002923681,0.002922247,0.02511564,0.0004986138,0.01898554,0.000136359,0.9312496],"study_design_scores_gemma":[0.0007755075,0.0001293825,0.002330105,0.0003696128,0.00001598567,0.001537387,0.00009374274,0.9874469,0.00003128268,0.0003859749,0.006398352,0.0004857813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9307982,0.009220209,0.05335963,0.002830425,0.002233614,0.0004590204,0.00000246071,0.0001955612,0.0009009128],"genre_scores_gemma":[0.9679356,0.02105467,0.009793561,0.0005537784,0.0005775145,0.00001913832,0.000004863663,0.00004871191,0.00001218218],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9623312,"threshold_uncertainty_score":0.9998348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034976616","doi":"10.1109/jiot.2020.3002221","title":"Lightweight Broadcast Authentication Protocol for Edge-Based Applications","year":2020,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Hash function; Hash-based message authentication code; Authentication protocol; Hash chain; Cryptographic hash function; Session key; Forward secrecy; Authentication (law); Message authentication code; Cryptographic protocol; Cryptography; Encryption; Distributed computing; Computer security; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.03690622020636138,"gpt":0.300051333758601,"spread":0.2631451135522397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002961633,0.0001522193,0.0002115015,0.0001005355,0.0000911954,0.0002718093,0.001569474,0.00009263292,0.00003280128],"category_scores_gemma":[0.00006095878,0.0001376488,0.0001858765,0.0002360804,0.00006084533,0.0005206803,0.0000726273,0.0003459438,0.00003031771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005521567,"about_ca_system_score_gemma":0.0000939266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003677493,"about_ca_topic_score_gemma":2.282388e-7,"domain_scores_codex":[0.9985079,0.00005668827,0.0005614755,0.0002852781,0.0003462509,0.0002424173],"domain_scores_gemma":[0.9983811,0.0001568559,0.0005849112,0.0003098963,0.0003705509,0.0001966771],"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.001488579,0.002824901,0.0009661344,0.002339828,0.0007565375,0.00006749477,0.07293232,0.008896239,0.1184971,0.1322162,0.3098677,0.349147],"study_design_scores_gemma":[0.001386329,0.0003665797,0.00002065862,0.000197847,0.00001844728,0.00006127934,0.00002245727,0.7624744,0.1177224,0.00331767,0.1141794,0.0002326029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004761157,0.00001175411,0.9726264,0.004517537,0.000259119,0.02174261,0.000001631554,0.00009785777,0.0002669034],"genre_scores_gemma":[0.6020958,0.000002315197,0.320165,0.004461393,0.001891392,0.07110896,0.000004523023,0.00006268407,0.0002079681],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7535781,"threshold_uncertainty_score":0.5613154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1595266361","doi":"10.1007/978-3-540-30564-4_20","title":"Product Construction of Key Distribution Schemes for Sensor Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Resilience (materials science); Key (lock); Distributed computing; Scheme (mathematics); Key distribution in wireless sensor networks; Computer network; Wireless; Topology (electrical circuits); Wireless network; Computer security; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01208705639441406,"gpt":0.2311671063067042,"spread":0.2190800499122901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007242969,0.0005476592,0.0006953374,0.0003884333,0.0002431521,0.000272472,0.002131002,0.00044046,0.000007471936],"category_scores_gemma":[0.0001771875,0.0005438815,0.0002152853,0.0006988646,0.001314579,0.0004913607,0.000619402,0.0007507183,0.000004130613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004688996,"about_ca_system_score_gemma":0.0005434475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001544634,"about_ca_topic_score_gemma":0.00001601076,"domain_scores_codex":[0.996079,0.00003245847,0.0007508461,0.001592615,0.0008063002,0.0007388078],"domain_scores_gemma":[0.9966242,0.0005047237,0.0006216995,0.001436426,0.0006749729,0.0001380212],"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.00002012671,0.00003797299,0.00005324699,0.0001119301,0.00002423537,0.00001335031,0.0002645341,0.3202223,0.00008615398,0.2202059,0.00002362696,0.4589366],"study_design_scores_gemma":[0.0005116054,0.000214763,0.00004603958,0.0007321659,0.00002079065,0.0001170463,2.636756e-7,0.7993563,0.005469273,0.1910358,0.001751946,0.0007440138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002411194,0.0007130768,0.993888,0.0006080792,0.003264426,0.0009047989,0.00002942834,0.0001769946,0.0001740966],"genre_scores_gemma":[0.2858798,0.0001193368,0.7123042,0.0002423681,0.001291896,0.0000200121,0.00006562058,0.00004421494,0.00003259158],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.479134,"threshold_uncertainty_score":0.9997013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133199053","doi":"10.1186/1687-1499-2014-131","title":"Anti-traffic analysis attack for location privacy in WSNs","year":2014,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computer science; Adversary; Sink (geography); Encryption; Computer security; Traffic analysis; Heuristics; Computer network; Energy consumption; Security analysis; Entropy (arrow of time)","retraction":null,"screen_n_in":null,"score":{"opus":0.04416391207995991,"gpt":0.30468021088216,"spread":0.2605162988022001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001476663,0.0002153273,0.0004338624,0.000521915,0.0007302678,0.0005058239,0.001966449,0.0001148734,0.000001699742],"category_scores_gemma":[0.00004635066,0.0002127393,0.0001478442,0.001854632,0.0001029574,0.000380713,0.0003448612,0.0006460228,0.000003763699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008857209,"about_ca_system_score_gemma":0.00003922651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004634263,"about_ca_topic_score_gemma":0.00008170419,"domain_scores_codex":[0.9978201,0.000524023,0.0006267428,0.0003486975,0.0002505556,0.0004298922],"domain_scores_gemma":[0.9962243,0.001421501,0.0004205584,0.001581856,0.0002021585,0.0001495842],"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.00002171728,0.0003062833,0.01071912,0.00002272129,0.0002437291,0.000004115564,0.002123546,0.3796601,0.00003014409,0.01656666,0.0003255412,0.5899764],"study_design_scores_gemma":[0.0005018492,0.00009283506,0.006898744,0.00017837,0.00005959186,0.00002942896,0.00003738678,0.974372,0.00000639463,0.0002981457,0.01728572,0.0002395327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5653403,0.003087069,0.4261912,0.004175985,0.0004822289,0.0003239059,0.000001139652,0.0001127089,0.0002854575],"genre_scores_gemma":[0.9784902,0.004425752,0.01629507,0.0004037844,0.0003186901,0.000022245,0.00001240811,0.00002072616,0.00001106896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.594712,"threshold_uncertainty_score":0.8675258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4295046730","doi":"10.1109/tac.2022.3205548","title":"Linear Encryption Against Eavesdropping on Remote State Estimation","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":37,"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","keywords":"Eavesdropping; Encryption; Computer science; Covariance; Transmission (telecommunications); Algorithm; Mathematics; Computer security; Statistics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01203567767486045,"gpt":0.2391493196691815,"spread":0.2271136419943211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004800162,0.0002524929,0.0002934149,0.0003652531,0.0007449195,0.0001298159,0.0006175212,0.00006007923,0.0001072182],"category_scores_gemma":[0.00001607635,0.0002781747,0.0001680263,0.0006081305,0.00003782995,0.0003082204,0.00000530092,0.0005042665,0.0001861901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003729634,"about_ca_system_score_gemma":0.00008165327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003173703,"about_ca_topic_score_gemma":0.000009239204,"domain_scores_codex":[0.9974906,0.0003803571,0.0004956839,0.0004863861,0.0007461327,0.0004008292],"domain_scores_gemma":[0.9983235,0.0004952839,0.000213587,0.0007910252,0.00005927888,0.0001173486],"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.00001876426,0.0001148139,2.026384e-7,0.00001034143,0.00003332365,0.00001564332,0.0005868202,0.6764161,0.0005994263,0.0001471628,0.00004672051,0.3220107],"study_design_scores_gemma":[0.001304264,0.0002978952,0.00003851875,0.000058019,0.00002183609,0.0000236995,0.00003638535,0.9956705,0.001127722,0.000987671,0.0001672157,0.0002662705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04830308,0.00001480248,0.9471113,0.001320619,0.001428426,0.0006174521,0.00002263303,0.0009402588,0.0002414121],"genre_scores_gemma":[0.979423,0.00001028905,0.01869144,0.001584218,0.00003482355,0.00008494394,0.000004182963,0.0000286168,0.0001385111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9311199,"threshold_uncertainty_score":0.999967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3186661962","doi":"10.1109/lcomm.2021.3097290","title":"A Novel Distributed Multi-Agent Reinforcement Learning Algorithm Against Jamming Attacks","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":36,"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":"Computer science; Jamming; Reinforcement learning; Convergence (economics); Interference (communication); Context (archaeology); Transmission (telecommunications); Wireless; Algorithm; Wireless network; Distributed algorithm; Computer network; Distributed computing; Artificial intelligence; Telecommunications; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.04374652492039147,"gpt":0.2835009846907155,"spread":0.239754459770324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003052732,0.0002310011,0.0002346416,0.0001093346,0.0007084947,0.0003324175,0.002723416,0.00009376762,0.000006826943],"category_scores_gemma":[0.0001007875,0.0002756995,0.0001422921,0.0007988181,0.000151073,0.0003734419,0.001215272,0.0007585446,0.00007787922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002659406,"about_ca_system_score_gemma":0.0000755181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000048979,"about_ca_topic_score_gemma":0.0000302474,"domain_scores_codex":[0.9979824,0.0002660664,0.0004822254,0.000440784,0.000352462,0.0004760533],"domain_scores_gemma":[0.9956511,0.0003778073,0.0002188648,0.003390874,0.0002211036,0.0001402539],"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.000004130088,0.0007964212,0.0004494453,0.00003921651,0.0003548583,0.0001335217,0.007910215,0.6640893,0.1423641,0.00334391,0.009356832,0.171158],"study_design_scores_gemma":[0.0006195181,0.00001239128,0.0002331914,0.00007877596,0.00001386092,0.00003440007,0.0002079762,0.9540468,0.003166444,0.00000488612,0.04124936,0.0003324335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00560983,0.0003237726,0.9784371,0.01438461,0.0004981273,0.0001885626,0.00001073641,0.0003412717,0.0002059353],"genre_scores_gemma":[0.5049624,0.0004389155,0.488773,0.005184986,0.00009019949,0.00007239165,0.0003513084,0.00002798784,0.00009878416],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4993526,"threshold_uncertainty_score":0.9999695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077706268","doi":"10.1109/mobhoc.2009.5337014","title":"Randomly directed exploration: An efficient node clone detection protocol in wireless sensor networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":35,"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","keywords":"Computer science; Computer network; Node (physics); Protocol (science); Wireless sensor network; Routing protocol; clone (Java method); Adversary; Distributed computing; Cloning (programming); Routing (electronic design automation); Computer security; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01612890310629079,"gpt":0.2641027686599116,"spread":0.2479738655536208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005378485,0.0003012788,0.0003619759,0.0002339035,0.0001848558,0.0003226198,0.0006629945,0.0002277788,0.00001658887],"category_scores_gemma":[0.00003206697,0.0002818781,0.00007986966,0.001395681,0.00004347775,0.0007841022,0.00007763568,0.0004115764,0.00002450317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001324467,"about_ca_system_score_gemma":0.00003530055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006708198,"about_ca_topic_score_gemma":0.0001904107,"domain_scores_codex":[0.9972288,0.0003931147,0.0005814147,0.0007463013,0.0004559758,0.0005943957],"domain_scores_gemma":[0.9984742,0.0001378308,0.0001640142,0.0008708102,0.0001729877,0.0001801957],"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.0005828104,0.0009710997,0.0001528663,0.00001449474,0.00001212616,0.00009041193,0.001267537,0.8649138,0.003768019,0.004045702,0.0001988773,0.1239822],"study_design_scores_gemma":[0.003178101,0.000229577,0.001674006,0.00004082139,0.000003140907,0.00002472704,0.00004155267,0.9876554,0.006395322,0.0002181595,0.0001742238,0.0003649491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07314876,0.000007559869,0.8930648,0.0007991216,0.0003908216,0.03023515,3.684522e-7,0.001441174,0.0009122509],"genre_scores_gemma":[0.9765601,0.000003909734,0.01106264,0.0005366882,0.0003242128,0.01143431,0.00000521261,0.00001933125,0.00005357831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9034113,"threshold_uncertainty_score":0.9999633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081218576","doi":"10.1109/jsyst.2020.3015424","title":"A Secure and Lightweight Protocol for Message Authentication in Wireless Sensor Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":35,"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; Computer network; Authentication (law); Message authentication code; Wireless sensor network; Overhead (engineering); Authentication protocol; Key distribution in wireless sensor networks; Node (physics); Wireless; Wireless network; Computer security; Cryptography; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02960678820082361,"gpt":0.2788258283006992,"spread":0.2492190400998756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000643266,0.0002272041,0.0003736139,0.0001133519,0.0001936414,0.000612338,0.0006299426,0.0001970127,0.000002896726],"category_scores_gemma":[0.00003463264,0.0001978513,0.00008420934,0.0003922933,0.00003981342,0.0004733068,0.00006666799,0.0005310991,0.00000551619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007322824,"about_ca_system_score_gemma":0.00006778607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006267269,"about_ca_topic_score_gemma":0.000004966122,"domain_scores_codex":[0.9978271,0.0002828942,0.0006609977,0.0004195791,0.0003492834,0.0004601575],"domain_scores_gemma":[0.9986454,0.0001900873,0.0003980676,0.0002821026,0.0001772671,0.0003070517],"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.001354977,0.001134916,0.01653636,0.004732082,0.0007106744,0.001551011,0.06457848,0.6205373,0.009197811,0.1460086,0.08186258,0.05179521],"study_design_scores_gemma":[0.001735158,0.0001455423,0.0002478008,0.0003467778,0.00000801723,0.0004469703,0.00007744355,0.9905745,0.0002531373,0.0001790154,0.005721709,0.0002638858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01404939,0.0002310352,0.9206443,0.002918795,0.001289429,0.06058906,0.000003995748,0.0001575522,0.0001164384],"genre_scores_gemma":[0.9729801,0.00001356377,0.00249908,0.0002654142,0.001755079,0.02242405,9.022608e-7,0.00003216079,0.00002965878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9589307,"threshold_uncertainty_score":0.8068143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019330379","doi":"10.1145/1824766.1824767","title":"Key predistribution for homogeneous wireless sensor networks with group deployment of nodes","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":33,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Resilience (materials science); Software deployment; Computer science; Wireless sensor network; Key (lock); Computer network; Scheme (mathematics); Distributed computing; Homogeneous; Computer security; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01061263376500888,"gpt":0.2258395276173174,"spread":0.2152268938523085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004550161,0.0006453779,0.0007106927,0.0002264266,0.0005844398,0.000214399,0.001632411,0.0006485085,0.00003085154],"category_scores_gemma":[0.00003593092,0.0006026253,0.0003723874,0.0009747986,0.0003403345,0.0003932394,0.00004736946,0.001254022,0.00000775218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001090585,"about_ca_system_score_gemma":0.00006324476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000722813,"about_ca_topic_score_gemma":0.0003282066,"domain_scores_codex":[0.9961013,0.0001712464,0.0008191597,0.001136719,0.0006410422,0.001130578],"domain_scores_gemma":[0.9949743,0.001318092,0.0004283867,0.002456565,0.0004703356,0.0003523575],"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.0005173589,0.0006915911,0.0003665636,0.00004781406,0.0002959569,0.00003635968,0.0002752859,0.9193107,0.001711773,0.002252149,0.0002583012,0.07423612],"study_design_scores_gemma":[0.002020698,0.0008382947,0.0006285441,0.0001492761,0.0001876958,0.0002743745,0.0001146392,0.9869358,0.006197761,0.0002450541,0.00153678,0.0008711024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1381708,0.0001174948,0.8576992,0.0004184775,0.001791981,0.001130588,0.00007974671,0.0005355995,0.00005603938],"genre_scores_gemma":[0.8793058,0.0001958304,0.1193136,0.0002225585,0.0005129897,0.0002112672,0.00006935934,0.00009844948,0.00007010894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.741135,"threshold_uncertainty_score":0.9996425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108256563","doi":"10.1109/glocom.2009.5425922","title":"CAT: Building Couples to Early Detect Node Compromise Attack in Wireless Sensor Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Compromise; Wireless sensor network; Computer science; Computer network; Node (physics); Key distribution in wireless sensor networks; Wireless ad hoc network; Software deployment; Sensor node; Wireless; Jamming; Wireless network; Computer security; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01808687052984521,"gpt":0.2637207907496406,"spread":0.2456339202197954,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003998126,0.0003812526,0.0004889432,0.0002620381,0.0001543914,0.0004151945,0.001600291,0.000231573,0.00001843938],"category_scores_gemma":[0.00003446066,0.0003861214,0.0001114148,0.001141269,0.00004922424,0.0003329009,0.0002903053,0.0004068559,0.00009211661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001697952,"about_ca_system_score_gemma":0.00003683524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003745251,"about_ca_topic_score_gemma":0.0002962172,"domain_scores_codex":[0.9969372,0.0001265652,0.0005469944,0.0009057674,0.000452513,0.001030981],"domain_scores_gemma":[0.9980515,0.0003097032,0.000109592,0.001079091,0.0001007109,0.0003494004],"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.0001044927,0.000290731,0.006305392,0.00002041638,0.00003512021,0.0004295437,0.001974404,0.848906,0.01108927,0.01320207,0.004092515,0.11355],"study_design_scores_gemma":[0.0005991528,0.0001544921,0.01720879,0.0001057508,0.000004745411,0.00003262773,0.00002644894,0.9784023,0.002222676,0.0002033813,0.0004683994,0.0005712266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6589296,0.00008883034,0.3381419,0.001163039,0.0003273369,0.0003671246,8.881346e-7,0.0003985977,0.0005826707],"genre_scores_gemma":[0.896421,0.00003643532,0.1009435,0.002237679,0.0002221753,0.00001415095,0.000001488159,0.00002414985,0.00009942787],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2374914,"threshold_uncertainty_score":0.9998591,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2619165578","doi":"10.1145/2990500","title":"Preserving Smart Sink-Location Privacy with Delay Guaranteed Routing Scheme for WSNs","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Sink (geography); Computer network; Routing (electronic design automation); Wireless sensor network; Scheme (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03319824003764073,"gpt":0.2851199767411468,"spread":0.2519217367035061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009062456,0.0004161998,0.0004942261,0.0001997239,0.002625794,0.001620331,0.003892816,0.0002198384,0.000002965538],"category_scores_gemma":[0.0002573528,0.000401504,0.0001598119,0.000363308,0.0001015705,0.0008343419,0.0001086665,0.000491003,0.00001901622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001802483,"about_ca_system_score_gemma":0.0001323955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003369287,"about_ca_topic_score_gemma":0.00004772613,"domain_scores_codex":[0.9968138,0.0001694696,0.000680069,0.0009702932,0.0005773519,0.0007890509],"domain_scores_gemma":[0.9938486,0.00086463,0.0007101885,0.003927093,0.0004917782,0.0001577004],"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.0002864831,0.0007277665,0.00211593,0.0008834407,0.0008508752,0.00005478293,0.01993289,0.9051844,0.001355212,0.02097455,0.0007396374,0.04689403],"study_design_scores_gemma":[0.001363424,0.0002168984,0.0003792352,0.0009970714,0.00004064837,0.000127582,0.0004120161,0.9943324,0.0007963499,0.0002282856,0.0005977941,0.0005082381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07336707,0.00008724053,0.9217787,0.0006504823,0.001793054,0.001154005,0.00000616036,0.0006902321,0.0004729896],"genre_scores_gemma":[0.8870187,0.000003567658,0.1122665,0.0001034127,0.0003031447,0.00007967903,0.000004050782,0.0000564601,0.0001645204],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8136516,"threshold_uncertainty_score":0.9998437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134114504","doi":"10.1109/euc.2008.176","title":"A Key Management Scheme for Cluster Based Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":29,"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":"Wireless sensor network; Computer science; Computer network; Key management; Key distribution in wireless sensor networks; Default gateway; Public-key cryptography; Node (physics); Key (lock); Overhead (engineering); Cryptography; Sensor node; Session key; Key distribution; Cluster analysis; Distributed computing; Wireless network; Wireless; Computer security; Encryption; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01869704281860701,"gpt":0.229069610473825,"spread":0.210372567655218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002638804,0.0002773953,0.000281111,0.0001334938,0.0002992143,0.0001239647,0.001078513,0.0001572061,0.00003476916],"category_scores_gemma":[0.000009735919,0.0002622476,0.0001815369,0.0004608302,0.00008728918,0.0002790554,0.0002926451,0.0001870171,0.00006290125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006547449,"about_ca_system_score_gemma":0.00002779519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001078969,"about_ca_topic_score_gemma":0.000008425,"domain_scores_codex":[0.9978073,0.00007048875,0.0003551921,0.0006791364,0.0003746644,0.0007131693],"domain_scores_gemma":[0.9982512,0.0003075295,0.00009991669,0.001034292,0.000132565,0.0001744895],"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.0003399447,0.001139798,0.003599018,0.0003429575,0.0004731668,0.0004951257,0.001863932,0.2915804,0.0001749639,0.3921131,0.255125,0.05275264],"study_design_scores_gemma":[0.001306808,0.00005850453,0.000277006,0.00002870243,0.000008439809,0.00003431012,0.00002317453,0.982738,0.0002778007,0.0001682134,0.01471584,0.0003632338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.017371,0.00006159778,0.9731836,0.001536176,0.0006633517,0.0008079277,0.000001575205,0.0005804394,0.005794321],"genre_scores_gemma":[0.4987176,0.00004275451,0.4939075,0.005144053,0.0002933503,0.0001320434,0.00001041208,0.0000352024,0.001717028],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6911576,"threshold_uncertainty_score":0.999983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162928044","doi":"10.1155/2009/240610","title":"A Flexible and Efficient Key Distribution Scheme for Renewable Wireless Sensor Networks","year":2009,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Wireless sensor network; Scalability; Computer network; Overhead (engineering); Encryption; Robustness (evolution); Key distribution in wireless sensor networks; Key management; Distributed computing; Key (lock); Key distribution; Cryptosystem; Key generation; Wireless; Public-key cryptography; Wireless network; Computer security; Telecommunications; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.02924232852899703,"gpt":0.276445515077973,"spread":0.247203186548976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001156185,0.0003603559,0.0004558243,0.0001486252,0.001977653,0.000922421,0.001355509,0.0002032228,0.000001332898],"category_scores_gemma":[0.00002642693,0.000347355,0.0001338438,0.0006426674,0.0001874165,0.0003162871,0.0003886703,0.000865211,0.000001639114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001263917,"about_ca_system_score_gemma":0.00005177975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009964591,"about_ca_topic_score_gemma":0.000009456368,"domain_scores_codex":[0.9974337,0.0003305129,0.0006686246,0.0005005474,0.0003298852,0.0007366841],"domain_scores_gemma":[0.9966161,0.0009390376,0.000480203,0.001364527,0.0002624055,0.0003376979],"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.0002466499,0.0007154379,0.001356012,0.00003997422,0.0001621271,0.00003271024,0.001475179,0.0809138,0.0008609813,0.1229178,0.003335813,0.7879435],"study_design_scores_gemma":[0.0009025747,0.0003204099,0.0006825948,0.0004469423,0.00002565228,0.0002924952,0.00006983708,0.9741167,0.0001075363,0.001314141,0.02130703,0.0004141342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1105713,0.01060806,0.8702731,0.006488127,0.0007216976,0.0005663366,0.000009331569,0.0002746369,0.0004874306],"genre_scores_gemma":[0.9671682,0.01193718,0.01944845,0.0007114797,0.000604856,0.00002187027,0.00003404466,0.0000280312,0.00004586014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8932028,"threshold_uncertainty_score":0.9998978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2787234235","doi":"10.23977/jnca.2017.21001","title":"An Improved Data Fusion Method IICKPAD for Privacy Protection in Wireless Sensor Networks","year":2017,"lang":"en","type":"article","venue":"Journal of Network Computing and Applications","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Sensor fusion; Wireless sensor network; Computer science; Data redundancy; Redundancy (engineering); Fusion; Process (computing); Node (physics); Computer network; Wireless; Data mining; Privacy protection; Computer security; Artificial intelligence; Engineering; Telecommunications; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.04658887744468047,"gpt":0.3502391232046969,"spread":0.3036502457600164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002235273,0.0001819739,0.0003700833,0.00009337656,0.001020276,0.0006076444,0.002442643,0.0001506663,3.989984e-7],"category_scores_gemma":[0.00007037284,0.0001718623,0.00006443517,0.0002376617,0.00006524385,0.0007101219,0.0006612191,0.0005158246,3.430027e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004097555,"about_ca_system_score_gemma":0.0000592183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003169494,"about_ca_topic_score_gemma":0.00002273213,"domain_scores_codex":[0.9981079,0.0001759329,0.0006604045,0.0004901472,0.0001765581,0.0003891212],"domain_scores_gemma":[0.996245,0.0004095703,0.001245797,0.001690832,0.0002505234,0.0001582333],"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.00004488263,0.0001610255,0.0008998981,0.00002843072,0.00003347486,0.000003997103,0.0002520707,0.1379,0.000437284,0.004473247,0.000311487,0.8554542],"study_design_scores_gemma":[0.0006644376,0.000130233,0.003103624,0.0001288551,0.00001974174,0.0001093153,0.00002638756,0.9899377,0.0000310697,0.00272361,0.002941738,0.0001832689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02484296,0.0002390726,0.972748,0.0009812228,0.0003885234,0.000728967,0.00000273424,0.00005072787,0.00001781496],"genre_scores_gemma":[0.6895723,0.0001087638,0.3079562,0.00007983032,0.002237761,0.00001711368,0.000007742125,0.00001577886,0.000004428034],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8552709,"threshold_uncertainty_score":0.7847245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063832555","doi":"10.1117/12.824207","title":"Using received signal strength indicator to detect node replacement and replication attacks in wireless sensor networks","year":2009,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Replication (statistics); Wireless sensor network; Signal strength; Node (physics); SIGNAL (programming language); Computer network; Wireless; Telecommunications; Acoustics","retraction":null,"screen_n_in":null,"score":{"opus":0.01505011997571213,"gpt":0.2512952129008912,"spread":0.2362450929251791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009412278,0.0003436523,0.0004511519,0.0001949356,0.00009887994,0.0002126616,0.001293159,0.0002481485,0.000002746787],"category_scores_gemma":[0.0002894647,0.0003251095,0.0002533041,0.0006449452,0.0001133586,0.0005806948,0.0002672976,0.0004408115,5.637742e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002911693,"about_ca_system_score_gemma":0.00003286723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001280458,"about_ca_topic_score_gemma":3.557253e-7,"domain_scores_codex":[0.997191,6.988535e-8,0.0008186455,0.0007854847,0.0006771623,0.0005276802],"domain_scores_gemma":[0.9982575,0.0001909211,0.0004498026,0.0001661928,0.0007390939,0.0001964638],"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.0003057409,0.0002493193,0.002020915,0.000239956,0.000281683,6.414303e-7,0.001063179,0.01231103,0.7195653,0.2538501,0.001164759,0.008947397],"study_design_scores_gemma":[0.001041443,0.0004382289,0.003970714,0.0004394801,0.00005022619,0.00002825131,0.0003620231,0.92163,0.07051142,0.0007764006,0.0002829591,0.0004688657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9914069,0.00007852432,0.004706747,0.002612795,0.0001415931,0.0007373806,0.000008548245,0.0001093795,0.0001981539],"genre_scores_gemma":[0.7276825,0.00008095473,0.2716377,0.0002756639,0.0002278332,0.00005215245,0.000003006068,0.00002835307,0.00001179922],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.909319,"threshold_uncertainty_score":0.9999201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1537172217","doi":"10.1109/mahss.2005.1542881","title":"MAC layer security of 802.15.4-compliant networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; PHY; Layer (electronics); Physical layer; Computer security; MAC address; Application layer; Wireless; Telecommunications; Operating system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.01548474378317427,"gpt":0.2447252605454344,"spread":0.2292405167622601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000302222,0.0002171586,0.0003185884,0.00009286612,0.00008327987,0.0000897102,0.001368845,0.0001623862,0.0003036281],"category_scores_gemma":[0.00001657331,0.0001992554,0.000138613,0.0004952394,0.00008938762,0.0004269287,0.0004216494,0.0003182415,0.0001577983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004700133,"about_ca_system_score_gemma":0.00002966839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007060306,"about_ca_topic_score_gemma":0.0001159345,"domain_scores_codex":[0.9980808,0.00008578518,0.0004508661,0.0004655135,0.0003892384,0.0005278136],"domain_scores_gemma":[0.9983383,0.0001777278,0.0001497122,0.001042399,0.0001301294,0.0001616907],"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.00003659118,0.0007822871,0.00339881,0.0000565669,0.0001421297,0.00005648875,0.003139438,0.1212883,0.0008718838,0.6684687,0.08500442,0.1167544],"study_design_scores_gemma":[0.0003371336,0.00004730623,0.0007542858,0.00002753105,0.000006776827,0.00003215923,0.00002610521,0.9750782,0.004022161,0.002556663,0.01682173,0.000289946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09000347,0.001300241,0.8518009,0.00384171,0.00115708,0.0004020717,0.000004101531,0.0007545165,0.05073589],"genre_scores_gemma":[0.9673455,0.00006727526,0.03067166,0.001203868,0.0004107891,0.000006138143,0.000002463357,0.00001512804,0.0002771964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.877342,"threshold_uncertainty_score":0.8125399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}