{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":504,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":504,"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":"8011c8f38656","filters":{"topic":"Cryptographic Implementations and Security"}},"results":[{"id":"W1549228503","doi":"10.1007/0-387-34805-0_39","title":"A Design Principle for Hash Functions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1190,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Hash function; Computer science; Mathematics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.06384997702380152,"gpt":0.3182864825069628,"spread":0.2544365054831613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001533707,0.0003743195,0.0003394175,0.00112108,0.0005233187,0.0005005756,0.00194803,0.0002172169,0.000032817],"category_scores_gemma":[0.00006192852,0.0003576826,0.0001630579,0.0007781311,0.0003959641,0.0004305596,0.0006052939,0.0004222629,0.00001929038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001976921,"about_ca_system_score_gemma":0.0005547336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001377525,"about_ca_topic_score_gemma":0.0001630532,"domain_scores_codex":[0.996958,0.00002052455,0.0004981021,0.001182681,0.0006628674,0.0006778511],"domain_scores_gemma":[0.9974695,0.0007623684,0.0002140987,0.001066722,0.0003311717,0.0001560781],"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.00001235221,0.00005656954,0.00002608774,0.00003439768,0.0000208658,0.00002192232,0.0008893625,0.01279316,0.00008172824,0.2191985,0.0001376075,0.7667274],"study_design_scores_gemma":[0.000655267,0.0004569765,0.00009877747,0.0001299988,0.00001780646,0.00006058364,3.682826e-7,0.602838,0.0007217298,0.3602792,0.03389931,0.0008420072],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000210456,0.0001335564,0.9957556,0.0003893639,0.001559954,0.0009544695,0.0000129307,0.0001546347,0.001018487],"genre_scores_gemma":[0.01190965,0.00001526761,0.9861951,0.001066152,0.0003392777,0.00004510697,0.00001363093,0.00002636603,0.0003894013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7658854,"threshold_uncertainty_score":0.9998875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2686848947","doi":"10.1109/sp.2017.14","title":"IoT Goes Nuclear: Creating a ZigBee Chain Reaction","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":447,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Firmware; Computer science; Exploit; Internet of Things; Computer security; Critical infrastructure; Wireless; Computer network; Telecommunications; Computer hardware","retraction":null,"screen_n_in":null,"score":{"opus":0.02688131978149743,"gpt":0.3016479182361479,"spread":0.2747665984546505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002025738,0.00005957373,0.00006454954,0.00005678754,0.0009232571,0.0005391382,0.0005142017,0.00002332308,0.00007454633],"category_scores_gemma":[0.00004310574,0.00005226779,0.00004366798,0.00006192731,0.00003195743,0.0003896519,0.000178135,0.00005968582,0.00003403351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001269906,"about_ca_system_score_gemma":0.00001212254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008902026,"about_ca_topic_score_gemma":0.0002779895,"domain_scores_codex":[0.9994135,0.00001678694,0.0001137954,0.0001852063,0.0001245403,0.0001461015],"domain_scores_gemma":[0.9992093,0.0000257707,0.00009403127,0.0005910242,0.00003583802,0.00004398089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000002031381,0.00004386176,0.002506635,0.000004821899,0.00001173408,0.000003647308,0.001685332,7.5608e-7,0.005109388,0.8785562,0.001059058,0.1110165],"study_design_scores_gemma":[0.002040222,0.0003348465,0.5293525,0.00006412782,0.00002552879,0.00008506066,0.002391528,0.188767,0.003966839,0.06222528,0.209741,0.00100596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8105614,0.00001119194,0.1036755,0.003458344,0.0003965872,0.0001595673,0.000001918115,0.0002885297,0.08144698],"genre_scores_gemma":[0.9494609,0.000007229612,0.05005325,0.000175663,0.00005324628,0.000004291239,7.973032e-7,0.00000370956,0.0002408845],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8163309,"threshold_uncertainty_score":0.710104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2727655671","doi":"10.6028/nist.sp.800-38d","title":"Recommendation for block cipher modes of operation :","year":2007,"lang":"en","type":"report","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":402,"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","keywords":"Block cipher; Computer science; Block (permutation group theory); Arithmetic; Parallel computing; Algorithm; Mathematics; Cryptography; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.113827035115353,"gpt":0.4061523450565048,"spread":0.2923253099411518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040939,0.0001215216,0.000196306,0.0002473423,0.00008464502,0.00007110234,0.000260103,0.0001232903,0.0002395347],"category_scores_gemma":[0.00003836221,0.0001105168,0.0001240835,0.000220333,0.00001481843,0.0002128672,0.00007449246,0.00007407844,0.000001508602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006199755,"about_ca_system_score_gemma":0.000328229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003400336,"about_ca_topic_score_gemma":0.0004026743,"domain_scores_codex":[0.9987504,0.0000192818,0.0004888936,0.0002810222,0.0003094263,0.0001509229],"domain_scores_gemma":[0.9986743,0.00008937826,0.0002393107,0.0002983506,0.0006663881,0.00003223659],"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.00001563696,0.0003353259,0.000604495,0.0004284835,0.0002085177,8.998705e-7,0.0008844959,0.0001278298,0.0007604428,0.2053588,0.1556515,0.6356235],"study_design_scores_gemma":[0.0008281753,0.00031619,0.0006371794,0.00004796532,0.00006809959,0.00001986608,0.0002039778,0.06741556,0.00843638,0.006428317,0.915016,0.0005822823],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004714838,0.00002750538,0.9480038,0.0002974629,0.0004793814,0.0004764657,0.00003902495,0.00004884341,0.05015607],"genre_scores_gemma":[0.4929508,0.0006360724,0.5016648,0.0003001828,0.0004447748,0.0001795337,0.001252584,0.00003496105,0.002536339],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7593645,"threshold_uncertainty_score":0.4506744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1505973206","doi":"10.1007/3-540-36492-7_17","title":"White-Box Cryptography and an AES Implementation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Crosslight Software (Canada)","funders":"","keywords":"Computer science; AES implementations; Cryptography; White box; Implementation; Encryption; Key (lock); Software implementation; Table (database); Software; Advanced Encryption Standard; Theoretical computer science; Computer security; Programming language; Database; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0171529933463793,"gpt":0.2942482527862945,"spread":0.2770952594399152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008285894,0.0004542075,0.0003663838,0.001342838,0.0004465018,0.0009227064,0.001385152,0.0001778401,0.00008046657],"category_scores_gemma":[0.00001107366,0.0004412418,0.000104257,0.000899492,0.0005601377,0.001104424,0.0005039055,0.0004273235,0.000004050126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008161012,"about_ca_system_score_gemma":0.0001967695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005020934,"about_ca_topic_score_gemma":0.0006527912,"domain_scores_codex":[0.996692,0.00005701088,0.0005189108,0.001391199,0.0007463421,0.0005945391],"domain_scores_gemma":[0.9981982,0.0001291639,0.0002449798,0.001002328,0.0002034442,0.0002218783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003237546,0.00004430327,0.003391542,0.000029842,0.00001774692,0.00002515916,0.003211246,0.0003786029,0.00006819038,0.2493157,0.00008053538,0.7434339],"study_design_scores_gemma":[0.00113046,0.0008101925,0.004863475,0.0001329167,0.00003141376,0.0001308663,0.00001065899,0.04178037,0.0008043358,0.9408982,0.007710702,0.001696452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001262892,0.0003179924,0.9955284,0.000673168,0.0007453296,0.0004405243,0.00001408773,0.0001101638,0.0009074273],"genre_scores_gemma":[0.1690785,0.0002024861,0.8271168,0.003223534,0.0002536812,0.00002551324,0.00003792578,0.00003975165,0.00002180013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7417374,"threshold_uncertainty_score":0.999804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W29626722","doi":"10.1007/978-3-319-10175-0_17","title":"ChipWhisperer: An Open-Source Platform for Hardware Embedded Security Research","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":238,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Open source hardware; Modular design; Embedded system; Software; Synchronization (alternating current); Computer hardware; Toolbox; Hardware compatibility list; Implementation; Field-programmable gate array; Cryptography; Operating system; Open source; Channel (broadcasting); Hardware architecture; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07313631529089948,"gpt":0.3640269377411954,"spread":0.2908906224502959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005078801,0.0005866356,0.0007044504,0.001461228,0.001370724,0.002914423,0.01017468,0.0003992093,0.00007131489],"category_scores_gemma":[0.0001923758,0.0005487252,0.0001465522,0.001168337,0.0009651065,0.001386116,0.004377406,0.001295956,0.0000244899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003025685,"about_ca_system_score_gemma":0.000814315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001609962,"about_ca_topic_score_gemma":0.001482086,"domain_scores_codex":[0.9937904,0.000106769,0.0007407042,0.002415126,0.001650851,0.001296101],"domain_scores_gemma":[0.9946131,0.001085931,0.0002899841,0.00269982,0.0009136703,0.000397549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002599767,0.0001007605,0.00003221727,0.00007884137,0.00001826497,0.00001453386,0.006160161,0.001199735,0.00007163388,0.3830149,0.0004548435,0.6088281],"study_design_scores_gemma":[0.0007697753,0.001014107,0.00005419043,0.0001965046,0.000007540913,0.00004151252,0.000003446674,0.3937692,0.0004083108,0.5533267,0.04960951,0.0007992866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007012282,0.0001291842,0.9928247,0.0007202367,0.00109424,0.001795071,0.00004367306,0.0001824556,0.002509206],"genre_scores_gemma":[0.4053624,0.00005303239,0.5901226,0.002301859,0.001225254,0.0001789461,0.0001194577,0.0001167072,0.0005197938],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6080288,"threshold_uncertainty_score":0.9999294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010870387","doi":"10.1080/0161-110291890885","title":"A TUTORIAL ON LINEAR AND DIFFERENTIAL CRYPTANALYSIS","year":2002,"lang":"en","type":"article","venue":"Cryptologia","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":230,"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":"Block cipher; Impossible differential cryptanalysis; Linear cryptanalysis; Computer science; Differential cryptanalysis; Higher-order differential cryptanalysis; Advanced Encryption Standard; Boomerang attack; Theoretical computer science; Cipher; Cryptanalysis; Differential (mechanical device); Simple (philosophy); Permutation (music); Algorithm; Cryptography; Arithmetic; Encryption; Mathematics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03049008528504131,"gpt":0.2580076248966527,"spread":0.2275175396116114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007980512,0.0001209266,0.0001590867,0.000158293,0.0001957991,0.000131666,0.000313884,0.00006154813,0.0004577851],"category_scores_gemma":[0.00004330028,0.0001008964,0.00007555311,0.0003740447,0.00006845266,0.0001402834,0.0001254981,0.0001210055,0.00005244309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001258071,"about_ca_system_score_gemma":0.000005324825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001469141,"about_ca_topic_score_gemma":0.000009346875,"domain_scores_codex":[0.9990213,0.00005427648,0.0001826338,0.0003276971,0.0001915122,0.0002226087],"domain_scores_gemma":[0.9993829,0.00008856568,0.0000546876,0.0003563121,0.00003843163,0.00007909047],"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.00001576917,0.000302276,0.005565667,0.0000108009,0.00009968967,0.00003503551,0.00135674,0.000009202414,0.0008070721,0.9187253,0.007842141,0.06523034],"study_design_scores_gemma":[0.009432502,0.002650969,0.1376389,0.00005680613,0.0003048903,0.0001259932,0.0004318987,0.6123682,0.003766735,0.1050951,0.1253932,0.002734767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7138272,0.0001103279,0.2817727,0.00128645,0.0008287278,0.0001401669,0.000006713953,0.0002012606,0.001826442],"genre_scores_gemma":[0.9865606,0.00004774464,0.01298297,0.0001956797,0.0001657595,0.0000113884,0.000002956669,0.000004132363,0.00002879995],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8136301,"threshold_uncertainty_score":0.5012426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149767240","doi":"10.1109/tc.2010.33","title":"Concurrent Structure-Independent Fault Detection Schemes for the Advanced Encryption Standard","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":183,"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":"Advanced Encryption Standard; Computer science; AES implementations; Encryption; Cryptography; Virtex; Field-programmable gate array; Algorithm; Inverse; Lookup table; Fault detection and isolation; Computer engineering; Embedded system; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01188713086536695,"gpt":0.2762625963288175,"spread":0.2643754654634505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001919865,0.0001829249,0.0001364331,0.0001677811,0.0007334031,0.0002267431,0.0005069165,0.00007467368,0.00003144576],"category_scores_gemma":[0.000003945656,0.0001447153,0.0001753003,0.0003403928,0.00007158236,0.0003609252,0.000004539332,0.0003930586,0.0000036464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005441557,"about_ca_system_score_gemma":0.00005372434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000207056,"about_ca_topic_score_gemma":0.0005590139,"domain_scores_codex":[0.9987008,0.00003633432,0.0002615035,0.0003881722,0.0003418028,0.000271416],"domain_scores_gemma":[0.998915,0.0002821776,0.00009873231,0.0004610413,0.0001602602,0.00008284719],"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.00002495661,0.00005272474,0.000003465525,0.000008210656,0.00004930239,4.869995e-7,0.0004423056,0.006938478,0.01301021,0.004176485,0.00005777806,0.9752356],"study_design_scores_gemma":[0.003351734,0.0006628874,0.0004102871,0.00002509817,0.0000717879,0.00004446262,0.0002456398,0.7306473,0.2214883,0.002225198,0.04025351,0.0005737625],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06200809,0.00001399785,0.9298062,0.000451353,0.006837851,0.0006397559,0.00007008525,0.0001670655,0.000005645419],"genre_scores_gemma":[0.9729315,0.00001923398,0.02666637,0.0001734431,0.00008105026,0.0001083279,0.000003933838,0.00001080416,0.000005304907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9746618,"threshold_uncertainty_score":0.5901318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4251236654","doi":"10.46586/tches.v2018.i3.547-572","title":"SIFA: Exploiting Ineffective Fault Inductions on Symmetric Cryptography","year":2018,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Infineon Technologies (Canada)","funders":"Bundesministerium für Verkehr, Innovation und Technologie; Österreichische Forschungsförderungsgesellschaft; Bundesministerium für Wissenschaft, Forschung und Wirtschaft; Austrian Science Fund; European Commission","keywords":"Fault (geology); Computer science; Exploit; Byte; Fault model; Fault coverage; Computer security; Stuck-at fault; Fault indicator; Cryptography; Fault detection and isolation; Engineering; Artificial intelligence; Computer hardware; Seismology","retraction":null,"screen_n_in":null,"score":{"opus":0.02469502833058283,"gpt":0.2745805529607446,"spread":0.2498855246301618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008590337,0.0005691283,0.0005536755,0.003268441,0.001908632,0.0006929308,0.0006178742,0.0002701752,0.00006629732],"category_scores_gemma":[0.0000474532,0.0005329038,0.0004317325,0.006269069,0.0003711277,0.0008484744,0.00002679407,0.0006791039,0.00007448118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006032614,"about_ca_system_score_gemma":0.00007035519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003270178,"about_ca_topic_score_gemma":0.0001332899,"domain_scores_codex":[0.9959971,0.0004795557,0.0007663821,0.001173401,0.0007864216,0.0007971072],"domain_scores_gemma":[0.9972243,0.0005703703,0.0002507431,0.001058282,0.0004996124,0.0003966861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002355258,0.002092902,0.001669498,0.0003192358,0.001521519,0.00005702762,0.01537284,0.0009953753,0.00184329,0.8190723,0.002313557,0.1545069],"study_design_scores_gemma":[0.04318347,0.04752032,0.05414979,0.007427576,0.002798316,0.002965703,0.1311449,0.2375403,0.02701847,0.1563405,0.2662729,0.02363781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09980541,0.0002407092,0.8928243,0.0003271574,0.002176583,0.0009702657,0.00009681149,0.0006727029,0.002886059],"genre_scores_gemma":[0.9921808,0.0002355148,0.00635103,0.0003205306,0.0003389607,0.0004937776,0.00001505908,0.00004677125,0.00001751721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8923754,"threshold_uncertainty_score":0.9997122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022521688","doi":"10.1007/s001450010009","title":"CBC MAC for Real-Time Data Sources","year":2000,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Iran Telecommunication Research Center; University of Toronto; Ontario Centres of Excellence","keywords":"CBC-MAC; Computer science; Message authentication code; Message broker; Chaining; Authentication (law); Encryption; Computer network; Cryptography; Theoretical computer science; Computer security; Block cipher","retraction":null,"screen_n_in":null,"score":{"opus":0.03463365323646356,"gpt":0.3271469201360835,"spread":0.29251326689962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004681634,0.00007906026,0.0002209572,0.0001489039,0.0001071076,0.00007020176,0.001307154,0.00004929939,0.0006303114],"category_scores_gemma":[0.00003601786,0.00006551483,0.00008588428,0.0001836206,0.00005607094,0.0004714936,0.0001010732,0.00009821902,0.00002063558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001182509,"about_ca_system_score_gemma":0.00008582593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001780131,"about_ca_topic_score_gemma":0.00001955643,"domain_scores_codex":[0.9989709,0.00006902579,0.0004276187,0.000162709,0.0001551475,0.000214614],"domain_scores_gemma":[0.9988966,0.0002114801,0.0002267398,0.0004691955,0.0001190077,0.00007698803],"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.0003137711,0.0005546538,0.006478801,0.00004680546,0.0003828137,0.0001375353,0.002600633,0.0001028765,0.00430392,0.3449631,0.1662123,0.4739028],"study_design_scores_gemma":[0.003373684,0.001359686,0.008016561,0.00002791072,0.0001020022,0.001657401,0.0003087395,0.02034717,0.0006282642,0.1503677,0.8134059,0.0004049277],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5777072,0.0003016728,0.4131311,0.006315772,0.0004618976,0.0001745565,0.0000391392,0.00003878958,0.001829923],"genre_scores_gemma":[0.3918299,0.000881255,0.6051953,0.001106575,0.0007317042,0.000007181048,0.00003659432,0.00002017672,0.0001913435],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6471937,"threshold_uncertainty_score":0.6901468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2487705751","doi":"10.4018/978-1-4666-3685-9.ch006","title":"An Overview of Cryptography","year":2013,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":131,"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; Cryptography; Computer security; Authentication (law); Encryption; Confidentiality; Identification (biology); Key (lock); Cryptographic protocol; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.04848189568759899,"gpt":0.3120439594122597,"spread":0.2635620637246607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001266785,0.0003351977,0.000428001,0.0001793543,0.00008854557,0.0001528297,0.001161497,0.0002173862,0.0002104655],"category_scores_gemma":[0.000002277738,0.0003261748,0.0003641968,0.000075112,0.0001215755,0.0001837473,0.0002229407,0.0001657256,0.00006359081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003457766,"about_ca_system_score_gemma":0.0001191431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002380778,"about_ca_topic_score_gemma":0.0001181319,"domain_scores_codex":[0.9982102,0.00002689467,0.0005065374,0.0005065468,0.000463353,0.000286455],"domain_scores_gemma":[0.9980793,0.00002219695,0.0003231452,0.001183808,0.0002140452,0.0001774882],"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.000001683624,0.00001805347,0.00002888755,0.00004012969,0.00005948339,0.000005376382,0.00008586957,3.408094e-7,0.00001396735,0.9748379,0.001562108,0.02334622],"study_design_scores_gemma":[0.0002150034,0.0001799212,0.0002635614,0.00009152088,0.00003394601,0.00001272533,0.00000757064,0.00009650039,0.00002592858,0.9548373,0.04388833,0.000347664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.00024925,0.001470422,0.0241588,0.00004053932,0.0003577419,0.0004266045,0.0001513079,0.0001595993,0.9729857],"genre_scores_gemma":[0.7329994,0.0007771384,0.249505,0.004344916,0.0008455077,0.0001991588,0.0000956404,0.0002079894,0.01102524],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9619605,"threshold_uncertainty_score":0.9999191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140223745","doi":"10.1109/ccece.2001.933564","title":"FPGA implementation of MD5 hash algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":121,"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":"Hash-based message authentication code; Computer science; Hash function; MD5; Cryptographic hash function; IPsec; Message authentication code; Secure Hash Algorithm; Cryptography; Algorithm; SHA-2; Authentication (law); Embedded system; Computer network; The Internet; Computer security; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02584768435206336,"gpt":0.2946936084367733,"spread":0.26884592408471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001075667,0.00005706267,0.00007247375,0.0001069376,0.00006513364,0.0000451567,0.0002553932,0.00001509502,0.001722679],"category_scores_gemma":[0.000001769548,0.00005246045,0.00004743762,0.0003827308,0.000019966,0.0002887313,0.00007289978,0.00003005939,0.00002499814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008577125,"about_ca_system_score_gemma":0.000008032865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002597746,"about_ca_topic_score_gemma":0.0001146869,"domain_scores_codex":[0.9993053,0.00002030541,0.000210901,0.0001453983,0.0001795479,0.0001385426],"domain_scores_gemma":[0.999584,0.00002273674,0.00006020343,0.0002374668,0.00005887948,0.00003666907],"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":[1.117057e-7,0.00005101357,0.0008792975,0.000003360575,0.00001105313,0.000001028545,0.001215127,7.94854e-7,0.0001423953,0.07256804,0.006217981,0.9189098],"study_design_scores_gemma":[0.009345123,0.001658701,0.1494368,0.00003229989,0.0000818187,0.00009845828,0.01086296,0.4129011,0.1658425,0.08383875,0.1639336,0.001967844],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01699085,0.00004703875,0.9788578,0.000719919,0.0001250024,0.0001281193,0.0000091627,0.00006759966,0.003054521],"genre_scores_gemma":[0.8218063,0.00003303037,0.1778321,0.0002031174,0.00001909546,0.000009961506,0.000005169373,0.000002841304,0.00008831555],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9169419,"threshold_uncertainty_score":0.9991899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169957670","doi":"10.1109/tvlsi.2009.2031651","title":"A Lightweight High-Performance Fault Detection Scheme for the Advanced Encryption Standard Using Composite Fields","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"National Institute of Standards and Technology","keywords":"Advanced Encryption Standard; Fault injection; Encryption; Computer science; Overhead (engineering); Inverse; AES implementations; Fault detection and isolation; Embedded system; Fault (geology); Algorithm; Error detection and correction; Computer engineering; Parallel computing; Cryptography; Mathematics; Software; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01471307471530304,"gpt":0.2676813202781219,"spread":0.2529682455628188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005158991,0.0002686276,0.0002677064,0.0003008034,0.001315398,0.0003927873,0.0003875297,0.000160859,0.00001457229],"category_scores_gemma":[0.000005250015,0.0002087881,0.0001925532,0.0007510131,0.00003652619,0.001169517,0.000002694903,0.0003311211,0.000008889521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002139472,"about_ca_system_score_gemma":0.0000614941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009323114,"about_ca_topic_score_gemma":0.0003687559,"domain_scores_codex":[0.9979777,0.0001182855,0.0005863702,0.0004591512,0.0004740973,0.0003844053],"domain_scores_gemma":[0.9986237,0.000159571,0.0002123816,0.0005507338,0.0003706902,0.00008287091],"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.001309704,0.001272653,0.00008548937,0.0002279669,0.0003577234,0.000005632277,0.008668175,0.2282371,0.2549356,0.01844544,0.0004969483,0.4859576],"study_design_scores_gemma":[0.001297183,0.0006648546,0.000256625,0.0001326725,0.00004726879,0.00002565278,0.0005490607,0.8607133,0.1338172,0.0002522809,0.001933253,0.0003106922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2575313,0.00006848671,0.7390504,0.0002938171,0.001936491,0.0008466478,0.00007500483,0.0001716544,0.00002614126],"genre_scores_gemma":[0.9866848,0.00008398071,0.01262255,0.00017961,0.0001281284,0.0002074704,0.00001622407,0.00001402823,0.00006323365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7291535,"threshold_uncertainty_score":0.9999847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1857035554","doi":"10.1007/3-540-36288-6_16","title":"Validation of Elliptic Curve Public Keys","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":102,"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; Elliptic curve cryptography; Public-key cryptography; Elliptic curve; Elliptic curve point multiplication; Key (lock); Computer security; Encryption; Protocol (science); Point (geometry); Curve25519; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03536184863177191,"gpt":0.2667073088965999,"spread":0.231345460264828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008175501,0.0003353328,0.0003932037,0.001247151,0.0001934805,0.0004186048,0.002332757,0.000184746,0.0001348827],"category_scores_gemma":[0.00006418849,0.0003208321,0.0001484593,0.001088936,0.0005252957,0.0007353223,0.000705737,0.0004245244,0.00002650212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001250584,"about_ca_system_score_gemma":0.0002429866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002621618,"about_ca_topic_score_gemma":0.00003273314,"domain_scores_codex":[0.9969329,0.00004269417,0.0006158466,0.0009507218,0.0009763816,0.0004814795],"domain_scores_gemma":[0.9976449,0.0003097213,0.0003846308,0.001173282,0.0003627654,0.0001246809],"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.000001786676,0.0001005532,0.0006231249,0.00007261462,0.00002465815,0.00002409632,0.002145569,0.00354149,0.0001745087,0.388687,0.00006329275,0.6045413],"study_design_scores_gemma":[0.0006230977,0.0003930544,0.0005593656,0.0002843836,0.00002066271,0.00006639661,7.476077e-7,0.5105755,0.005231733,0.476024,0.005071975,0.001149151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007456688,0.0002399101,0.9943787,0.0006414467,0.0008887664,0.0003003212,0.000008168512,0.00007861359,0.002718396],"genre_scores_gemma":[0.7493703,0.0001190019,0.2497758,0.0003713587,0.0001976224,0.000008665606,0.00001571504,0.00002217953,0.0001192849],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7486247,"threshold_uncertainty_score":0.9999244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1571203384","doi":"10.1007/3-540-45661-9_21","title":"Compression and Information Leakage of Plaintext","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Plaintext; Byte; Computer science; Cryptosystem; Ciphertext; Information leakage; Encryption; Cryptography; Side channel attack; Computer security; Theoretical computer science; Arithmetic; Algorithm; Computer hardware; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01465318112726333,"gpt":0.2442440318773686,"spread":0.2295908507501053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003862916,0.000229893,0.0002823954,0.0008339043,0.0001617359,0.0002435094,0.001023046,0.0001341431,0.00003752856],"category_scores_gemma":[0.00003668131,0.000205716,0.00005886632,0.0003900203,0.0004519277,0.001384997,0.0007461569,0.0003184802,0.000007352443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000487219,"about_ca_system_score_gemma":0.00007516873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002575819,"about_ca_topic_score_gemma":0.00002277259,"domain_scores_codex":[0.9982769,0.00001697597,0.0004606984,0.0004265466,0.0005584658,0.0002604134],"domain_scores_gemma":[0.9986195,0.0002722946,0.000279874,0.0005817712,0.0001657088,0.00008085973],"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.000002708034,0.00001703808,0.00008890251,0.00005947318,0.000005864063,0.000005300924,0.002454531,0.001132364,0.0000543973,0.1532376,0.00004912274,0.8428928],"study_design_scores_gemma":[0.0007585267,0.0003300416,0.001384275,0.0005744911,0.00001074148,0.00007998313,0.000001518103,0.8178288,0.001207467,0.1622989,0.01478193,0.0007433196],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004170853,0.0001905135,0.9957103,0.0003185721,0.0003972088,0.0002264428,0.000009581827,0.00004286459,0.002687467],"genre_scores_gemma":[0.7180071,0.0002688908,0.2804633,0.00109583,0.00008994039,0.000005489434,0.00001408589,0.00001215698,0.00004321719],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8421494,"threshold_uncertainty_score":0.8388854,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4225654141","doi":"10.1109/tii.2022.3158663","title":"LAS-SG: An Elliptic Curve-Based Lightweight Authentication Scheme for Smart Grid Environments","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"King Saud University","keywords":"Authentication (law); Cryptography; Smart grid; Elliptic curve cryptography; Computer science; Scheme (mathematics); Elliptic curve; Public-key cryptography; Traceability; Computer security; Computer network; Mathematics; Engineering; Encryption; Electrical engineering; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05937372442892695,"gpt":0.2779993758868514,"spread":0.2186256514579245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005803831,0.0001873638,0.0001727762,0.0003758712,0.001055949,0.000191524,0.0006331516,0.00009403819,0.000209561],"category_scores_gemma":[0.000006112191,0.0002006181,0.0001511367,0.0006121227,0.00005033447,0.0008383145,0.000007973132,0.0004067442,0.00002536044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001736189,"about_ca_system_score_gemma":0.0001597107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000228093,"about_ca_topic_score_gemma":0.00001042115,"domain_scores_codex":[0.9981773,0.0001009554,0.0006702176,0.0002008165,0.0005228987,0.0003278406],"domain_scores_gemma":[0.998827,0.0001527969,0.0002382962,0.0006039956,0.00003862543,0.0001393034],"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.00170839,0.01801183,0.001217457,0.0003898185,0.001402205,0.00001329639,0.06006641,0.3619442,0.005529272,0.1498757,0.03049395,0.3693475],"study_design_scores_gemma":[0.004745783,0.001510413,0.00005991529,0.00001574131,0.00008856982,0.000008849359,0.001121959,0.8365345,0.01488612,0.0008795921,0.1395549,0.0005936336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05331276,0.000002891706,0.9431471,0.0004161997,0.001820567,0.0008298852,0.0002989962,0.0001084937,0.00006315145],"genre_scores_gemma":[0.9641031,0.000006667202,0.03411433,0.0005633851,0.0001191931,0.0007605763,0.0001965177,0.0000204483,0.0001157454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9107904,"threshold_uncertainty_score":0.8180968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1583090871","doi":"10.1007/11545262_19","title":"EM Analysis of Rijndael and ECC on a Wireless Java-Based PDA","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":89,"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; Advanced Encryption Standard; Power analysis; Cryptography; Wireless; Elliptic curve cryptography; Embedded system; Encryption; Public-key cryptography; Computer network; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01569831564602385,"gpt":0.2671285648309102,"spread":0.2514302491848863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006528401,0.000368009,0.0006128229,0.002537012,0.000189085,0.0003003162,0.001519109,0.0001697331,0.00003811389],"category_scores_gemma":[0.0000218916,0.0003343926,0.0002112394,0.001972022,0.0005218827,0.0002372182,0.0004426067,0.0003887193,0.000002945223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009961522,"about_ca_system_score_gemma":0.0002686609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005234537,"about_ca_topic_score_gemma":0.0008968869,"domain_scores_codex":[0.9970638,0.00003409175,0.0005279209,0.001113686,0.0008592238,0.0004013104],"domain_scores_gemma":[0.9978011,0.0004662651,0.0003180276,0.001082937,0.0002010411,0.0001305998],"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.00001035519,0.00008635669,0.0007557083,0.00003400207,0.000124198,0.00002279704,0.001615587,0.02775841,0.00007466204,0.06662798,0.000013168,0.9028768],"study_design_scores_gemma":[0.000416251,0.0002593302,0.003582839,0.0001466881,0.0001100417,0.000005621028,5.949648e-7,0.9754753,0.0006904561,0.01815434,0.0006220181,0.0005364873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009864604,0.0001402542,0.9885509,0.0004249588,0.0002659247,0.0002284539,0.00002677474,0.00005184425,0.0004463073],"genre_scores_gemma":[0.8623996,0.00003370131,0.1361034,0.001314653,0.00009023525,0.000005821864,0.00001380852,0.00001392829,0.000024898],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9477169,"threshold_uncertainty_score":0.9999108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159543798","doi":"10.1016/j.jcss.2005.06.008","title":"Logics for reasoning about cryptographic constructions","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Soundness; Correctness; Cryptography; Cryptographic protocol; Cryptographic primitive; Theoretical computer science; Computer science; Interpretation (philosophy); Mathematics; Programming language; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0222037773679399,"gpt":0.2902167245142492,"spread":0.2680129471463093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166436,0.00008816151,0.000226262,0.0003305447,0.0005108822,0.0004529494,0.0004801702,0.0000285494,0.000001727086],"category_scores_gemma":[0.000006869289,0.00006374201,0.0001616924,0.0004791297,0.0001708596,0.0007156816,0.00006326197,0.00007336363,4.157107e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001339267,"about_ca_system_score_gemma":0.00008221048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003833012,"about_ca_topic_score_gemma":0.000005780351,"domain_scores_codex":[0.9988582,0.00005721599,0.0004476683,0.0001679302,0.0002799282,0.0001890765],"domain_scores_gemma":[0.9990832,0.0001555367,0.0003233559,0.0001091089,0.0002315696,0.00009720091],"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.000003503408,0.00003156782,0.002268623,0.00003417031,0.0001158694,0.000003185453,0.001195081,0.0005020923,0.00003473495,0.9547452,0.0005803599,0.04048567],"study_design_scores_gemma":[0.003343644,0.002730559,0.02002976,0.0003816416,0.0004727105,0.007891953,0.005091439,0.8979904,0.000240894,0.02314749,0.03776675,0.0009127649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05267794,0.0009646508,0.944524,0.0007831325,0.0006196596,0.0001095866,0.000002876787,0.00002502673,0.0002930756],"genre_scores_gemma":[0.6350778,0.0000299128,0.3645851,0.00008511254,0.0002172182,0.000001842788,1.118193e-7,0.000001307023,0.000001602989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9315977,"threshold_uncertainty_score":0.4367802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235846187","doi":"10.46586/tches.v2018.i1.142-174","title":"Practical CCA2-Secure and Masked Ring-LWE Implementation","year":2018,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Infineon Technologies (Canada)","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Encryption; Ciphertext; Learning with errors; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02994930005431462,"gpt":0.3295585039156693,"spread":0.2996092038613546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006870823,0.0003316492,0.0003334329,0.0006426371,0.0009692749,0.0006539173,0.0002471555,0.0001586067,0.0001098427],"category_scores_gemma":[0.00001175043,0.0003123625,0.0001354441,0.00107541,0.0002592465,0.000837624,0.00002415506,0.000314086,0.00002089626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002598361,"about_ca_system_score_gemma":0.00007407794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002850467,"about_ca_topic_score_gemma":0.0004486095,"domain_scores_codex":[0.9974154,0.0002717426,0.0005634882,0.0007541788,0.0004777826,0.0005174499],"domain_scores_gemma":[0.9985151,0.0002055114,0.000164556,0.0005803975,0.0002355454,0.0002988692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002374674,0.001029171,0.005179109,0.0005634892,0.001160734,0.00009814031,0.02681672,0.00005457015,0.002480377,0.8217279,0.006907346,0.133745],"study_design_scores_gemma":[0.03142027,0.013763,0.05614705,0.00159252,0.001835304,0.004761796,0.1287815,0.2080377,0.009555233,0.05987006,0.4737276,0.01050802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0567924,0.0001739007,0.9396471,0.001071571,0.0008268279,0.0006625791,0.00008226909,0.0002792591,0.0004640259],"genre_scores_gemma":[0.9815319,0.0003223383,0.01753676,0.000233671,0.0001508349,0.000165921,0.00001586399,0.00002444087,0.00001826817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9247395,"threshold_uncertainty_score":0.9999328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1494600236","doi":"10.1007/978-3-642-14623-7_3","title":"Protecting Cryptographic Keys against Continual Leakage","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Adversary; Cryptography; Information leakage; Computation; Homomorphic encryption; Computer security; Side channel attack; Encryption; Leakage (economics); Memory leak; Theoretical computer science; Distributed computing; Algorithm; Computer hardware; Memory management","retraction":null,"screen_n_in":null,"score":{"opus":0.01513584058024322,"gpt":0.2556747906477822,"spread":0.240538950067539,"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.001828251,0.0006584597,0.0005933334,0.001729159,0.0009224986,0.00109214,0.003575292,0.0004771494,0.00005096937],"category_scores_gemma":[0.0001913123,0.0006282359,0.0002753381,0.001364511,0.001074576,0.0007631557,0.00143637,0.002540665,0.00002900457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000106849,"about_ca_system_score_gemma":0.0004785994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000055419,"about_ca_topic_score_gemma":0.0006928481,"domain_scores_codex":[0.995206,0.00006717116,0.0007671942,0.001812335,0.001174464,0.0009728214],"domain_scores_gemma":[0.996627,0.0004901773,0.0004563243,0.001691434,0.0004918262,0.0002432337],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000552713,0.00006530831,0.0002357952,0.0000562203,0.00002677126,0.0001273012,0.002652272,0.0007023954,0.002979596,0.06991198,0.00001606484,0.9232208],"study_design_scores_gemma":[0.001991852,0.0007258979,0.001337955,0.0009407721,0.00003880605,0.0002553025,0.000005480993,0.2116809,0.01029527,0.7451599,0.02349441,0.004073513],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002081071,0.0001680899,0.9905194,0.0007275123,0.002060543,0.0008440258,0.00001025732,0.0003050705,0.00328402],"genre_scores_gemma":[0.411833,0.00005526145,0.5849587,0.002256574,0.00069395,0.00004550621,0.00001348849,0.00005952917,0.00008405829],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9191473,"threshold_uncertainty_score":0.9999448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3110871108","doi":"10.1109/jiot.2020.3044526","title":"Comparative Performance Analysis of Lightweight Cryptography Algorithms for IoT Sensor Nodes","year":2020,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Computer science; Cryptography; Edge computing; Wireless sensor network; Encryption; Algorithm; Internet of Things; Embedded system; Distributed computing; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.05453471449101069,"gpt":0.3164691288557457,"spread":0.2619344143647351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689327,0.0001453104,0.0005032358,0.0005811341,0.00008842882,0.0001117044,0.0008085711,0.00004242878,0.00004885832],"category_scores_gemma":[0.00001715171,0.0001214927,0.0005265252,0.001262314,0.00009234073,0.000432808,0.00006943972,0.0002057136,0.000001123669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001398417,"about_ca_system_score_gemma":0.00004450062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003027126,"about_ca_topic_score_gemma":0.000003945817,"domain_scores_codex":[0.9984753,0.00005452688,0.0006752287,0.0002221584,0.0003636934,0.0002091492],"domain_scores_gemma":[0.9984766,0.0001399325,0.0006328009,0.0001716735,0.0004509215,0.0001280715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001261297,0.00200584,0.1257049,0.0008998846,0.03253296,0.00005452904,0.5334559,0.01076206,0.1113258,0.09091607,0.02486716,0.06621354],"study_design_scores_gemma":[0.0008581022,0.0007696126,0.005535022,0.00006274612,0.0004531861,0.00002212764,0.0006102279,0.8921779,0.09677922,0.001053193,0.00143693,0.0002417804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4453561,0.0000632641,0.5538232,0.0004116246,0.0001721586,0.00007561933,0.00001168657,0.0000134166,0.00007295045],"genre_scores_gemma":[0.8214166,0.00003052038,0.1782279,0.0002522157,0.00005704576,0.000003486827,0.000002770662,0.000004421179,0.000005002693],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8814158,"threshold_uncertainty_score":0.4954329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112800903","doi":"10.1109/dft.2006.50","title":"Parity-Based Fault Detection Architecture of S-box for Advanced Encryption Standard","year":2006,"lang":"en","type":"article","venue":"Proceedings","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":73,"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":"Parity (physics); Fault detection and isolation; Computer science; S-box; Advanced Encryption Standard; Fault coverage; Overhead (engineering); Encryption; Parity bit; Algorithm; Computer engineering; Embedded system; Cryptography; Engineering; Computer network; Electronic circuit; Block cipher; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0078681142327356,"gpt":0.2572721615832338,"spread":0.2494040473504982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002117761,0.00009326112,0.0001176884,0.0001630085,0.0001393116,0.0000696153,0.0001928616,0.0000431996,0.000004129654],"category_scores_gemma":[0.00002857045,0.00008977699,0.00007974889,0.0004186245,0.00003225263,0.0002445976,0.00002585355,0.00007014914,4.134734e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002929766,"about_ca_system_score_gemma":0.00002717179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003675394,"about_ca_topic_score_gemma":0.00004335335,"domain_scores_codex":[0.9991531,0.000004102763,0.0002197635,0.0002321364,0.0002087607,0.0001821396],"domain_scores_gemma":[0.9994207,0.00003006856,0.0001393301,0.00008424928,0.0002970301,0.00002864188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003078367,0.000221403,0.00461918,0.000499576,0.00002340898,4.828624e-7,0.001533589,0.0004964554,0.35782,0.2849746,0.0007137211,0.3487898],"study_design_scores_gemma":[0.003005981,0.000928634,0.005557334,0.00005516098,0.00002800042,0.000006222914,0.0001663249,0.02847738,0.7383743,0.1885511,0.03444679,0.0004028179],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2744436,0.00001703833,0.7246273,0.0002583713,0.00006781864,0.0002827631,0.00001558794,0.00008186914,0.000205703],"genre_scores_gemma":[0.8675539,0.000001885526,0.1322659,0.00004492087,0.00004032394,0.0000740415,0.000008864908,0.000005371196,0.000004821889],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5931103,"threshold_uncertainty_score":0.3660999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088326678","doi":"10.1109/les.2010.2052401","title":"High-Speed AES Encryptor With Efficient Merging Techniques","year":2010,"lang":"en","type":"article","venue":"IEEE Embedded Systems Letters","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Field-programmable gate array; Byte; Advanced Encryption Standard; Encryption; Throughput; AES implementations; Architecture; Embedded system; Field (mathematics); Implementation; Computer hardware; Computer architecture; Computer engineering; Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.007919695672281091,"gpt":0.2374502852952359,"spread":0.2295305896229548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435732,0.0002475614,0.0002732859,0.0003226733,0.0002845311,0.0004260809,0.000768121,0.00007276503,0.00001550377],"category_scores_gemma":[0.00001182521,0.0001987294,0.00008305725,0.000608198,0.0001048693,0.00028412,0.00006482062,0.0003183623,0.00002203788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003638779,"about_ca_system_score_gemma":0.00004418792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004664318,"about_ca_topic_score_gemma":0.00006858295,"domain_scores_codex":[0.997972,0.0001196224,0.0003941469,0.000512046,0.000538646,0.0004636011],"domain_scores_gemma":[0.9986272,0.0001078639,0.0001976472,0.0008238318,0.000111171,0.0001323208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001198238,0.0001020253,0.0004600903,0.00006028943,0.00007603885,0.00007010291,0.003423235,0.001598668,0.9259685,0.05807465,0.008005609,0.002148785],"study_design_scores_gemma":[0.006570504,0.001033464,0.003954529,0.0008156632,0.0002132055,0.001105751,0.003939847,0.2671049,0.6370419,0.000742755,0.0712086,0.00626889],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6267555,0.0000120021,0.3696342,0.0009241049,0.001764233,0.0003842053,0.000005826515,0.0003912573,0.000128668],"genre_scores_gemma":[0.9657176,0.000001279304,0.03328192,0.000570056,0.0003167627,0.00007248999,0.000004861634,0.00002031556,0.00001477078],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.338962,"threshold_uncertainty_score":0.8103949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1579585272","doi":"10.1007/11935230_19","title":"Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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 Waterloo","funders":"Ministry of Education and Human Resources Development","keywords":"Random oracle; Hash function; Padding; Computer science; MDC-2; Prefix; Ideal (ethics); Block cipher; Theoretical computer science; Double hashing; Cryptographic hash function; Discrete mathematics; Algorithm; Mathematics; Cryptography; Encryption; Computer security; Public-key cryptography; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01279218138216728,"gpt":0.2376381325575098,"spread":0.2248459511753425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005577512,0.00043683,0.0007233518,0.002816859,0.0003585421,0.0004093994,0.002542154,0.0002001441,0.00006174642],"category_scores_gemma":[0.00002628644,0.000375926,0.0002663672,0.003481192,0.0005518973,0.0005172233,0.001054637,0.0005262378,0.000002062874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001427702,"about_ca_system_score_gemma":0.0002733631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003156214,"about_ca_topic_score_gemma":0.003041475,"domain_scores_codex":[0.9964007,0.00003791477,0.0006405385,0.00122866,0.001140555,0.000551636],"domain_scores_gemma":[0.9969928,0.0001674026,0.0004654107,0.001925817,0.0003305637,0.0001180248],"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.00005710144,0.000886892,0.04663946,0.0003976209,0.002513007,0.0001848765,0.009320081,0.2913927,0.0003187578,0.3258828,0.001029227,0.3213775],"study_design_scores_gemma":[0.001136766,0.0005517443,0.008629722,0.000401175,0.000864747,0.00003413794,0.000003047506,0.7411015,0.0005307321,0.2426347,0.002535988,0.001575711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003780961,0.0001645074,0.9936684,0.0001663484,0.0003879117,0.0003171506,0.00008601994,0.00009290712,0.001335756],"genre_scores_gemma":[0.7842162,0.00001448809,0.2151741,0.0001841801,0.0001115594,0.00001617771,0.0001170418,0.00002525062,0.0001410531],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7804352,"threshold_uncertainty_score":0.9998693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2585018408","doi":"10.1007/s00145-016-9251-7","title":"Making the Impossible Possible","year":2017,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptographic Implementations and Security","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 Waterloo","funders":"","keywords":"Impossible differential cryptanalysis; Block cipher; Key schedule; Boomerang attack; Differential cryptanalysis; Computer science; Linear cryptanalysis; Higher-order differential cryptanalysis; Cipher; Differential (mechanical device); Cryptanalysis; Algorithm; Arithmetic; Theoretical computer science; Computer security; Cryptography; Mathematics; Encryption; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.06722823537149986,"gpt":0.3812333853457928,"spread":0.314005149974293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537486,0.00006582752,0.0001497022,0.0001118278,0.0007260392,0.000420838,0.001775824,0.00003751714,0.00004725208],"category_scores_gemma":[0.0001039985,0.00004022662,0.0001165049,0.00008490877,0.0001349901,0.0005919241,0.0002241675,0.0002000117,0.00000606814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000128475,"about_ca_system_score_gemma":0.0001012904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001098806,"about_ca_topic_score_gemma":0.00002696411,"domain_scores_codex":[0.9991615,0.00006563962,0.000317019,0.00008630798,0.000178869,0.0001906935],"domain_scores_gemma":[0.9984729,0.00009726543,0.0006632815,0.000563934,0.00016192,0.00004067954],"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.00001567367,0.00005112488,0.02482158,0.000005426617,0.00005857984,0.00009179406,0.001269015,0.00001027484,0.0004312726,0.9354582,0.007820792,0.0299662],"study_design_scores_gemma":[0.001765452,0.0005824276,0.3595008,0.00004622068,0.0000475116,0.003126676,0.0004434528,0.002866266,0.001081605,0.5476255,0.08264728,0.0002667774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3639172,0.0005783425,0.6018905,0.02528875,0.002058526,0.00009306974,0.000001157403,0.00001755299,0.00615486],"genre_scores_gemma":[0.9690967,0.00004047847,0.03030688,0.0003942449,0.0001456976,0.00000108241,6.394051e-8,0.000002847986,0.00001198067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6051795,"threshold_uncertainty_score":0.558418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096644499","doi":"10.1109/iscas.2005.1465666","title":"An Efficient Architecture for the AES Mix Columns Operation","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Architecture; Inverse; Computer science; Embedded system; Computer hardware; Computer architecture; Parallel computing; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01531432036500012,"gpt":0.2979433297169912,"spread":0.2826290093519911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000206866,0.00005050317,0.0000390316,0.00003754865,0.000339324,0.0002334703,0.0003559731,0.00001470558,0.00004555438],"category_scores_gemma":[0.000005141593,0.00003156522,0.00003802682,0.0001376072,0.00002095715,0.0001037577,0.00003211096,0.00003636638,0.000004748485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008868785,"about_ca_system_score_gemma":0.00002128358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005761074,"about_ca_topic_score_gemma":0.001210372,"domain_scores_codex":[0.9994937,0.00002125225,0.00009930727,0.0001509412,0.0001074236,0.0001274103],"domain_scores_gemma":[0.9995423,0.00007790168,0.00001808998,0.000287482,0.00004207958,0.0000321704],"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.00000530627,0.0001763498,0.0001312756,0.000003426745,0.00001337387,1.757032e-7,0.005787867,0.05564679,0.0009587667,0.655255,0.006239087,0.2757826],"study_design_scores_gemma":[0.000260222,0.00008940246,0.001595449,7.293387e-7,0.000004046702,0.000003211131,0.0002018813,0.9181491,0.0009792735,0.0009536149,0.07768643,0.0000766716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05231967,0.00003193664,0.9389409,0.008029398,0.00008800398,0.0003317689,0.000004821157,0.00006076823,0.0001927],"genre_scores_gemma":[0.8713109,0.000002528902,0.1273322,0.001174114,0.00007648954,0.00005243573,0.000005758546,0.000002306168,0.00004323165],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8625023,"threshold_uncertainty_score":0.260984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3103728101","doi":"10.1109/tvlsi.2020.3033928","title":"Area-Efficient Nano-AES Implementation for Internet-of-Things Devices","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Datapath; Computer science; Encryption; Advanced Encryption Standard; Byte; Cryptosystem; Cryptography; Application-specific integrated circuit; Embedded system; Field-programmable gate array; Shift register; Computer hardware; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02994524984239608,"gpt":0.2884923201032786,"spread":0.2585470702608825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004755853,0.0002565076,0.0003388186,0.0003078385,0.0003054281,0.0002859878,0.0005020112,0.0001027263,0.00007273133],"category_scores_gemma":[0.000009310471,0.0002437343,0.0002899084,0.000729926,0.00004288797,0.0007448082,0.000006517188,0.0001780049,0.00001752055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009554225,"about_ca_system_score_gemma":0.00009020208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003530924,"about_ca_topic_score_gemma":0.0004382913,"domain_scores_codex":[0.9976203,0.0001383064,0.000866236,0.000549246,0.0004778551,0.0003480338],"domain_scores_gemma":[0.9986255,0.0001823315,0.0003385987,0.0003319677,0.0003733331,0.0001483307],"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.0009203083,0.004414215,0.00133486,0.002167046,0.001445116,0.00001526297,0.2246292,0.03628359,0.1022322,0.2372187,0.01414927,0.3751902],"study_design_scores_gemma":[0.001665407,0.0007218224,0.0001083499,0.0001534845,0.0000740721,0.00000989394,0.009623338,0.8925051,0.0886218,0.0001332446,0.005960663,0.0004228051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06178371,0.00006735449,0.9345753,0.0006246599,0.001411241,0.001105722,0.0001689495,0.0001810114,0.00008204018],"genre_scores_gemma":[0.9910471,0.00001276184,0.00800166,0.0004135133,0.00005466986,0.0003494072,0.00005939515,0.00001974436,0.00004170883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9292634,"threshold_uncertainty_score":0.9939198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283644776","doi":"10.1109/eurospw55150.2022.00010","title":"Improving Software Quality in Cryptography Standardization Projects","year":2022,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":62,"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; H2020 European Research Council; Academia Sinica; Deutsche Forschungsgemeinschaft","keywords":"NIST; Standardization; Implementation; Computer science; Cryptography; Software engineering; Software; Software quality; Quality (philosophy); Computer security; Software development; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02556082910383931,"gpt":0.2989783847245377,"spread":0.2734175556206984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008545145,0.00007610478,0.00009659203,0.0003641699,0.0003260328,0.0001098144,0.0003808671,0.00001392921,0.0001560308],"category_scores_gemma":[0.00003742334,0.00007888762,0.00005910488,0.001737947,0.00001638209,0.0003504734,0.0003710974,0.0001289473,8.210212e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006443674,"about_ca_system_score_gemma":0.0001020873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007107318,"about_ca_topic_score_gemma":0.0004531978,"domain_scores_codex":[0.9986639,0.0001757667,0.0002671484,0.0002947559,0.0003878835,0.0002105495],"domain_scores_gemma":[0.9994659,0.00005801372,0.0000803342,0.0003108826,0.00005073228,0.00003409936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001610529,0.000266232,0.1242724,0.00003518584,0.00001301639,0.000009982795,0.00569265,0.0005983437,0.0005010626,0.7656423,0.0008028272,0.1021499],"study_design_scores_gemma":[0.0107687,0.00169334,0.5437026,0.00002877555,0.00002714519,0.0000614754,0.02321843,0.1169132,0.003528107,0.2361907,0.06059345,0.003274135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1046353,0.00003001297,0.894195,0.0002084974,0.0001467802,0.0002472269,0.00001482414,0.0001625693,0.0003598046],"genre_scores_gemma":[0.8837188,0.000002607173,0.1158388,0.0002988896,0.000008739567,0.0001035098,0.00001675727,0.00000435424,0.000007554728],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7790835,"threshold_uncertainty_score":0.3216944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169407523","doi":"10.1109/dsd.2008.34","title":"PUFFIN: A Novel Compact Block Cipher Targeted to Embedded Digital Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Block cipher; Datapath; Encryption; Cipher; Application-specific integrated circuit; Triple DES; Block (permutation group theory); CBC-MAC; Cryptography; Embedded system; Parallel computing; Computer hardware; Algorithm; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03401584777319765,"gpt":0.2681295197086521,"spread":0.2341136719354545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000874937,0.0001378423,0.0001671308,0.0001557383,0.0001990441,0.0003324178,0.0005071191,0.00003270709,0.00005728546],"category_scores_gemma":[0.00001714996,0.0001177919,0.00007925541,0.0008026671,0.00002677454,0.0004895822,0.0001249707,0.0000690923,0.000113529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002559845,"about_ca_system_score_gemma":0.00005823025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002149481,"about_ca_topic_score_gemma":0.00002625576,"domain_scores_codex":[0.9987702,0.00001451232,0.0002703709,0.0003128336,0.0003108398,0.0003212431],"domain_scores_gemma":[0.9991494,0.00004652402,0.00004768728,0.0004527936,0.0001101119,0.0001934467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005221491,0.002552991,0.03449007,0.00006486578,0.0003822904,0.0001838396,0.02543302,0.004850133,0.009922753,0.5093697,0.4086877,0.004010426],"study_design_scores_gemma":[0.007615519,0.001486064,0.146057,0.00009009654,0.0000344551,0.0018122,0.003712602,0.3957115,0.003305637,0.001338492,0.4352552,0.003581235],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3748303,0.00003630911,0.6137832,0.0007234659,0.0004067802,0.0004121553,0.00003329057,0.0003278941,0.0094466],"genre_scores_gemma":[0.9910763,0.000001496677,0.007880188,0.0004269635,0.00004732894,0.00001149591,0.000009255353,0.00000725302,0.000539714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.616246,"threshold_uncertainty_score":0.4803416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071271835","doi":"10.1007/978-3-642-37949-9_54","title":"WG-8: A Lightweight Stream Cipher for Resource-Constrained Smart Devices","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":57,"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":"Stream cipher; Computer science; Stream cipher attack; Cryptography; Cipher; Embedded system; Block cipher; Computer network; Computer security; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.02295190498274648,"gpt":0.2468331321925181,"spread":0.2238812272097717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003554286,0.0002892801,0.0003566453,0.0002441377,0.001111244,0.0003909149,0.001954674,0.00018565,0.000003870737],"category_scores_gemma":[0.00003519689,0.0002274067,0.0002727614,0.0002416642,0.0003729369,0.0004334161,0.0006029883,0.0002604162,6.358259e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000403764,"about_ca_system_score_gemma":0.0001590385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000400817,"about_ca_topic_score_gemma":0.0001758467,"domain_scores_codex":[0.9986136,0.000009881109,0.0006738604,0.0001915028,0.0002320263,0.0002791044],"domain_scores_gemma":[0.9981908,0.0004329503,0.0004798896,0.0006216834,0.0002154451,0.00005925381],"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.000002881273,0.00004003077,0.0000117788,0.0004581764,0.0002666905,8.083827e-8,0.004650492,0.09168477,0.00001190417,0.8241767,0.001115649,0.07758087],"study_design_scores_gemma":[0.0004350255,0.0001287325,0.00005826863,0.0002045787,0.00007443834,0.000009876415,0.00001600553,0.6688405,0.00007155276,0.006859674,0.3228326,0.0004687444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002567029,0.0002816101,0.993445,0.001495169,0.0003547668,0.001004334,0.0001221779,0.00007504525,0.002965217],"genre_scores_gemma":[0.01014024,0.00004504003,0.9891266,0.0002949999,0.000129929,0.00008871791,0.00007813054,0.00001590488,0.00008046304],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.817317,"threshold_uncertainty_score":0.9273378,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169692300","doi":"10.1016/j.sysarc.2006.09.006","title":"Multi-mode operator for SHA-2 hash functions","year":2006,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hash function; Pseudorandom number generator; Latency (audio); Parallel computing; Bitwise operation; Implementation; Flexibility (engineering); Double hashing; Operator (biology); Hash table; Algorithm; Operating system; Programming language; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01719697418332224,"gpt":0.2828686433178479,"spread":0.2656716691345257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003578606,0.0001138556,0.0002144127,0.0002651589,0.0002233364,0.0002445282,0.0004193854,0.00004863831,0.00000532689],"category_scores_gemma":[0.00002147546,0.00008401767,0.0001940018,0.0002792993,0.00002281897,0.0002095916,0.0000406366,0.0001787726,0.000002106265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003327326,"about_ca_system_score_gemma":0.00009331131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001365653,"about_ca_topic_score_gemma":0.0001818231,"domain_scores_codex":[0.9988322,0.00005738068,0.0005133796,0.0001437706,0.0002497992,0.0002035084],"domain_scores_gemma":[0.9990405,0.00008499068,0.0002864657,0.0002216976,0.0002877389,0.00007854915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002773383,0.002715851,0.02097966,0.001049296,0.001087178,0.000217823,0.01499668,0.3040961,0.1358441,0.2243006,0.2364244,0.05801095],"study_design_scores_gemma":[0.009525176,0.001552844,0.01949558,0.0004262696,0.0001532255,0.003196308,0.001428987,0.1731125,0.001013429,0.008292889,0.7807191,0.001083664],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07327567,0.0004870062,0.9240701,0.000740907,0.001040574,0.0002648435,0.00004100242,0.00002507376,0.00005488853],"genre_scores_gemma":[0.9049857,0.000003552626,0.09411946,0.00007679604,0.0006097648,0.00002007838,0.000004853851,0.000009585107,0.0001701992],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.83171,"threshold_uncertainty_score":0.3426141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3197657782","doi":"10.1007/s13389-021-00271-w","title":"The SQALE of CSIDH: sublinear Vélu quantum-resistant isogeny action with low exponents","year":2021,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Clarendon Fund; European Commission; University of Waterloo; University of Oxford; Consejo Nacional de Ciencia y Tecnología; H2020 European Research Council; St. Cross College, University of Oxford","keywords":"Isogeny; Mathematics; Quantum; Sublinear function; NIST; Post-quantum cryptography; Discrete mathematics; Computer science; Elliptic curve; Pure mathematics; Quantum computer; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01231776596756729,"gpt":0.2427799771552245,"spread":0.2304622111876573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005910181,0.0001495952,0.0002448848,0.0003770537,0.0001618879,0.0001657194,0.0004909239,0.00004581232,0.000009742432],"category_scores_gemma":[0.00007084887,0.0001051923,0.0002268153,0.001458753,0.00004445046,0.0004777478,0.00006845484,0.0002773626,4.138031e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000218641,"about_ca_system_score_gemma":0.0001282122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001089728,"about_ca_topic_score_gemma":0.00003801948,"domain_scores_codex":[0.9983209,0.00005466478,0.0006141454,0.0001519753,0.0005905125,0.000267738],"domain_scores_gemma":[0.9983726,0.0001943461,0.0003962061,0.0003806031,0.0005444926,0.0001117474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0004702003,0.001072253,0.01792303,0.0005945964,0.001852147,0.0006006678,0.003798202,0.02080751,0.5130901,0.4204189,0.0008981369,0.01847426],"study_design_scores_gemma":[0.01436036,0.004796822,0.3460619,0.002577978,0.0006404136,0.003651736,0.007750491,0.2512924,0.280113,0.0207568,0.06505207,0.002945964],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6162161,0.001007577,0.3819588,0.0003134517,0.000407013,0.00005705065,0.00000238436,0.00002076536,0.00001680282],"genre_scores_gemma":[0.9777852,0.0007077971,0.02138244,0.00001829051,0.00008505461,0.000003536093,0.000001199093,0.00001302743,0.000003479338],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.399662,"threshold_uncertainty_score":0.4289618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095880256","doi":"10.1109/tit.2006.889721","title":"Multicollision Attacks on Some Generalized Sequential Hash Functions","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":53,"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":"Hash function; Collision attack; SHA-2; Double hashing; Iterated function; Collision resistance; Hash chain; Cryptographic hash function; Computer science; MDC-2; Rolling hash; Class (philosophy); Set (abstract data type); Theoretical computer science; Mathematics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.0188632441688447,"gpt":0.2817870051206014,"spread":0.2629237609517567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009733601,0.000187276,0.0001356196,0.0007614467,0.0007415969,0.0002403607,0.0003377709,0.0001061312,0.0002774243],"category_scores_gemma":[0.0000089554,0.000177347,0.0001784961,0.0006218786,0.00006721188,0.002475921,0.000003942518,0.0002702759,0.0004861391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001141118,"about_ca_system_score_gemma":0.00005832786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002722546,"about_ca_topic_score_gemma":0.00002626545,"domain_scores_codex":[0.9983822,0.00009950442,0.0005554946,0.0001962216,0.0004403556,0.000326254],"domain_scores_gemma":[0.9988378,0.0002353953,0.000148283,0.0005020255,0.0001418147,0.0001346946],"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.0003538934,0.0004434486,0.000007147315,0.00002287636,0.0001006291,0.00000351695,0.00481094,0.02470633,0.0008253813,0.6806677,0.00184766,0.2862105],"study_design_scores_gemma":[0.02688641,0.003843872,0.003852002,0.0002957227,0.0003733592,0.0002085708,0.008079047,0.3002423,0.2698692,0.160867,0.2208117,0.004670792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04238302,0.000005292586,0.9531571,0.0002994385,0.001857729,0.0003530585,0.00005761497,0.0003051694,0.001581628],"genre_scores_gemma":[0.990929,0.00002046668,0.006632834,0.002060478,0.00005240042,0.00005433949,0.00003336703,0.000009108394,0.0002080259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.948546,"threshold_uncertainty_score":0.7232001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1568642505","doi":"10.1007/3-540-44987-6_26","title":"New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Bounding overwatch; Combinatorics; Linear cryptanalysis; Mathematics; Discrete mathematics; Cryptanalysis; Computer science; Algorithm; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.03831357667032488,"gpt":0.3279951763168643,"spread":0.2896815996465394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002543642,0.0004723647,0.0004725045,0.0004837743,0.0008538004,0.0007864781,0.00304513,0.0002296443,0.00003738051],"category_scores_gemma":[0.0001796398,0.0003542507,0.0003749848,0.000683318,0.0003171403,0.0004497451,0.0007589692,0.0005022859,0.000004091449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002180083,"about_ca_system_score_gemma":0.0007096256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008714689,"about_ca_topic_score_gemma":0.0004245716,"domain_scores_codex":[0.9963722,0.00005056284,0.0006132678,0.001494822,0.0006508113,0.0008184023],"domain_scores_gemma":[0.996016,0.001773806,0.0002886253,0.001423424,0.000328141,0.0001699516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001424308,0.00002777479,0.00005155569,0.00006009735,0.00002047754,0.000003771363,0.001610757,0.00615633,0.00003293976,0.2500959,0.0001902874,0.7417359],"study_design_scores_gemma":[0.0003446156,0.0001548762,0.00002359047,0.00005743181,0.00001225201,0.0000257386,5.001423e-7,0.3293042,0.0001967073,0.6254727,0.04407555,0.0003318983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002585139,0.0001501019,0.9919592,0.003313959,0.001748372,0.002193464,0.00003288951,0.0001059867,0.0004702305],"genre_scores_gemma":[0.001964038,0.00002000853,0.9954736,0.001429863,0.000775131,0.00007936583,0.00001586392,0.00002944707,0.0002126665],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.741404,"threshold_uncertainty_score":0.9998909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160950619","doi":"10.1007/978-3-642-03356-8_16","title":"Message Authentication Codes from Unpredictable Block Ciphers","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Block cipher mode of operation; CBC-MAC; Computer science; Block cipher; Pseudorandom function family; Stream cipher; Block (permutation group theory); Message authentication code; Pseudorandom number generator; Block size; Triple DES; Hash function; Cryptography; Theoretical computer science; Computer security; Algorithm; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01516414637842154,"gpt":0.2570813028767769,"spread":0.2419171564983554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000619367,0.0004176117,0.0004101205,0.0006237673,0.0003505691,0.0007043441,0.002603478,0.0002328281,0.00008531872],"category_scores_gemma":[0.00003212874,0.0004033623,0.0001342891,0.000665563,0.0004419452,0.0004888177,0.0006090738,0.0005286356,0.00002893189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001884551,"about_ca_system_score_gemma":0.0003369593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001328771,"about_ca_topic_score_gemma":0.0003066608,"domain_scores_codex":[0.9965974,0.00003783711,0.0005270182,0.001319099,0.0009547113,0.0005639272],"domain_scores_gemma":[0.9976822,0.0003251019,0.0002690534,0.001362545,0.0001933746,0.0001677591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004728343,0.00006714126,0.0001664064,0.00001392199,0.00002567726,0.00004052845,0.002297,0.003889108,0.0003703572,0.08001727,0.0001385297,0.9129694],"study_design_scores_gemma":[0.0005167594,0.0001794699,0.001086287,0.0002655746,0.00003171129,0.000021989,0.000001473802,0.3429258,0.001317336,0.6433689,0.009384047,0.0009006726],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006044398,0.000616563,0.9919057,0.0009396871,0.0008920085,0.0003458022,0.00002807956,0.0001939852,0.004473746],"genre_scores_gemma":[0.5726194,0.000178039,0.4246039,0.001685255,0.0004440822,0.00001388996,0.0000610855,0.00003180258,0.0003625747],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9120687,"threshold_uncertainty_score":0.9998418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295169600","doi":"10.1145/2808230","title":"Design and Implementation of Warbler Family of Lightweight Pseudorandom Number Generators for Smart Devices","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":50,"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; Pseudorandom number generator; Cryptography; Randomness; Pseudorandomness; Random number generation; Wireless; Secure communication; Embedded system; Computer network; Computer security; Algorithm; Encryption; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02700190883463758,"gpt":0.3017269595602804,"spread":0.2747250507256428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006957205,0.000169361,0.0003162766,0.0002039568,0.0002108999,0.00006071493,0.0003970067,0.00006099385,0.000009135234],"category_scores_gemma":[0.000008539111,0.0001273045,0.0001075558,0.0003808024,0.00005147496,0.0002600919,0.00001577173,0.00004733887,0.000001673273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002800303,"about_ca_system_score_gemma":0.00006993753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001616557,"about_ca_topic_score_gemma":0.00001993534,"domain_scores_codex":[0.9982939,0.0001795681,0.0006765258,0.0003499106,0.0002588779,0.0002412158],"domain_scores_gemma":[0.9980725,0.0007979569,0.0003271901,0.0004937433,0.0002440911,0.00006451021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005293029,0.001177719,0.01474742,0.002073317,0.002115307,0.000006034371,0.03432471,0.008539856,0.09534936,0.1164898,0.001658985,0.7229882],"study_design_scores_gemma":[0.04729546,0.004136207,0.01307309,0.002245533,0.0008825223,0.0001919062,0.01600632,0.2336434,0.651062,0.02361053,0.004428155,0.003424921],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2693086,0.0000726622,0.7294881,0.0001066423,0.0003547521,0.0005918157,0.00002028155,0.00004715913,0.00001000095],"genre_scores_gemma":[0.875293,0.00003238373,0.1245449,0.00002957446,0.00002589145,0.00005504751,0.00000216314,0.0000115988,0.00000546734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7195632,"threshold_uncertainty_score":0.5191327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970866180","doi":"10.1016/j.micpro.2012.06.007","title":"FPGA-based implementation alternatives for the inner loop of the Secure Hash Algorithm SHA-256","year":2012,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Hash function; Field-programmable gate array; SHA-2; Algorithm; Block (permutation group theory); Secure Hash Algorithm; Cryptographic hash function; Throughput; Parallel computing; Embedded system; Cryptography; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01576489041114482,"gpt":0.2903836851625839,"spread":0.2746187947514391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005759689,0.0001552909,0.0001652831,0.00006939183,0.0004619431,0.0001985978,0.0005544358,0.00004283762,0.00001021682],"category_scores_gemma":[0.000009068134,0.00008884515,0.0001056428,0.0003641308,0.0001049976,0.00033844,0.0001313884,0.00008197071,8.706704e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002007179,"about_ca_system_score_gemma":0.00005967886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003859998,"about_ca_topic_score_gemma":0.0002004858,"domain_scores_codex":[0.9988645,0.00005939747,0.0003479401,0.0002250944,0.0001792968,0.0003237724],"domain_scores_gemma":[0.9990556,0.0001190486,0.0002745443,0.000317723,0.0001841966,0.00004885079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005817718,0.0007659347,0.05542529,0.001859656,0.0005739255,0.000001212791,0.06613948,0.00005629044,0.3499691,0.04255152,0.0129814,0.469618],"study_design_scores_gemma":[0.00556258,0.0002787792,0.02073323,0.0002387802,0.000196432,0.00007349078,0.01471588,0.0218483,0.7752453,0.001426335,0.1587658,0.0009150683],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5589858,0.003440821,0.4347195,0.0009087332,0.0006727046,0.001018035,0.0002121275,0.00002868854,0.00001355429],"genre_scores_gemma":[0.9941958,0.00003840864,0.005189705,0.0002760947,0.0001111734,0.0001172653,0.00001606465,0.00001142827,0.0000440627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4687029,"threshold_uncertainty_score":0.3623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115175687","doi":"10.1109/securware.2010.42","title":"Applications of SAT Solvers to AES Key Recovery from Decayed Key Schedule Images","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Key (lock); Computer science; Schedule; Key schedule; Algorithm; Cryptography; Operating system; Cryptanalysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009254499961853806,"gpt":0.2679426126451594,"spread":0.2586881126833056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001462151,0.00008576258,0.0001105556,0.0001513645,0.0001139837,0.000105636,0.000575956,0.00003943381,0.0003188309],"category_scores_gemma":[0.00002032933,0.00007979326,0.00007074954,0.0004968633,0.00004441149,0.0003060366,0.0001868286,0.00009605312,0.00006478122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007413628,"about_ca_system_score_gemma":0.00005285444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008730626,"about_ca_topic_score_gemma":0.00182187,"domain_scores_codex":[0.9991568,0.00001583232,0.0002176042,0.0002737817,0.0001724491,0.0001635237],"domain_scores_gemma":[0.9990078,0.0001133823,0.00006138643,0.0006045538,0.0001122652,0.0001005685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001733611,0.0004281829,0.01315304,0.0000153981,0.0001076748,0.000001623379,0.003480785,0.00003057021,0.2459126,0.5461742,0.02189401,0.1687846],"study_design_scores_gemma":[0.002177835,0.0004091465,0.1006996,0.00002743865,0.00007371129,0.000008633794,0.002286404,0.00591885,0.4354064,0.1807376,0.270864,0.001390383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2575267,0.00001313288,0.7385768,0.000946848,0.00015465,0.0002114432,0.00004673366,0.00007200611,0.002451747],"genre_scores_gemma":[0.6239468,0.000007006394,0.3756566,0.0002501412,0.00002995012,0.00004213034,0.00001536496,0.000003629772,0.000048273],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3664202,"threshold_uncertainty_score":0.3490975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132451830","doi":"10.1109/tc.2008.107","title":"Protection Circuit against Differential Power Analysis Attacks for Smart Cards","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Power analysis; Smart card; Microcontroller; Computer science; CMOS; Embedded system; Advanced Encryption Standard; Overhead (engineering); Transistor; Power (physics); Electrical engineering; Computer hardware; Encryption; Engineering; Cryptography; Voltage; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03693312533703984,"gpt":0.2647202868880352,"spread":0.2277871615509953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001149146,0.0002042805,0.000261066,0.000702637,0.000728216,0.0001186425,0.0004027383,0.00007779298,0.00003189873],"category_scores_gemma":[0.000001300027,0.0002105927,0.0005569228,0.001346261,0.00006460789,0.0002916643,0.000003631563,0.0001805813,0.000008843189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008120628,"about_ca_system_score_gemma":0.00005734929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008464354,"about_ca_topic_score_gemma":0.00009965655,"domain_scores_codex":[0.9984532,0.00006839837,0.0003199705,0.0005081504,0.0003242393,0.0003260708],"domain_scores_gemma":[0.9990657,0.00008296525,0.00008605501,0.0005133583,0.0001330957,0.0001188052],"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.0003601643,0.004990178,0.001498801,0.0001488949,0.01064216,0.00009524673,0.02348095,0.3002732,0.008595368,0.01095501,0.006802029,0.632158],"study_design_scores_gemma":[0.003623607,0.001035549,0.01239188,0.00003176651,0.0005247583,0.00005519,0.0001268349,0.967221,0.008134481,0.0005684361,0.005083366,0.00120318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1213585,0.000004481665,0.8762146,0.0001929191,0.001398716,0.0005132588,0.00004330041,0.0002144777,0.000059794],"genre_scores_gemma":[0.9901597,0.00001363064,0.009332636,0.0002228102,0.00004043986,0.000170495,0.00001249596,0.00001238282,0.00003541568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8688012,"threshold_uncertainty_score":0.8587723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087866481","doi":"10.1109/tvlsi.2007.893659","title":"On Concurrent Detection of Errors in Polynomial Basis Multiplication","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":45,"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":"Division of Materials Research","keywords":"Parity bit; Error detection and correction; Parity (physics); Arithmetic; Multiplier (economics); Binary number; Computer science; Algorithm; Multiplication (music); Standard basis; Overhead (engineering); Mathematics; Discrete mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01640876264141811,"gpt":0.2793068406043503,"spread":0.2628980779629322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065486,0.0002238622,0.0002716212,0.0009358138,0.0002322771,0.00009340329,0.0002940505,0.0001596199,0.00002504529],"category_scores_gemma":[0.00001469102,0.0002179017,0.0001839345,0.001118968,0.00005688842,0.0005213526,0.00000274995,0.0003291662,0.0000242092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003095733,"about_ca_system_score_gemma":0.00005858845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007922189,"about_ca_topic_score_gemma":0.007065519,"domain_scores_codex":[0.9976577,0.0002034564,0.0008576217,0.0004677095,0.000477674,0.0003358397],"domain_scores_gemma":[0.9986846,0.0002677609,0.0002629861,0.0004803214,0.0002028162,0.0001014653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001225038,0.009203581,0.001797734,0.0003972407,0.0003406659,0.00002376586,0.03234235,0.05052274,0.2151899,0.04707886,0.001261827,0.6406164],"study_design_scores_gemma":[0.004643961,0.001067166,0.007621754,0.0004862382,0.00005236368,0.00003368695,0.005723525,0.4228456,0.5544986,0.0002691558,0.001897064,0.0008608657],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2975577,0.00002849478,0.7000208,0.0000527813,0.001569262,0.0004950963,0.00005544362,0.00008250478,0.0001379206],"genre_scores_gemma":[0.9989421,0.00001899042,0.0007564495,0.0000465767,0.00004255884,0.000115243,0.00001418042,0.00001386936,0.00004997797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7013845,"threshold_uncertainty_score":0.8885772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1500382400","doi":"10.1007/3-540-48071-4_36","title":"DES is not a Group","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Encryption; Plaintext; Set (abstract data type); Exploit; Group (periodic table); Key (lock); Computer science; Mathematics; Plaintext-aware encryption; Theoretical computer science; Combinatorics; Multiple encryption; Deterministic encryption; Computer security; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04105082075794935,"gpt":0.2975688237329249,"spread":0.2565180029749756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001141378,0.0004427992,0.000380212,0.001257018,0.0004419324,0.0006258008,0.00277583,0.0002403318,0.0001013913],"category_scores_gemma":[0.00003106808,0.0004156738,0.000177209,0.001046973,0.001013099,0.0006257828,0.001129016,0.0006279716,0.00004186511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002102065,"about_ca_system_score_gemma":0.0002344811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008175309,"about_ca_topic_score_gemma":0.0005463717,"domain_scores_codex":[0.9963076,0.00001941539,0.0005273886,0.001332488,0.00104518,0.0007679546],"domain_scores_gemma":[0.9978043,0.0003247707,0.0002054526,0.001242049,0.0002279982,0.0001954516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000354955,0.00002750667,0.0001099513,0.00002360327,0.000009406299,0.00006238241,0.001954277,0.0001428194,0.00006061261,0.1290704,0.00003924305,0.8684963],"study_design_scores_gemma":[0.0006370798,0.0004005689,0.001552903,0.0003443972,0.00001585821,0.0001733374,9.057173e-7,0.1465861,0.001810825,0.8279456,0.01909507,0.001437366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000283936,0.00027641,0.9934601,0.0004372655,0.0009718805,0.0002919208,0.000009904995,0.0001413767,0.004127269],"genre_scores_gemma":[0.1483169,0.0001006408,0.8446559,0.006360494,0.0003763291,0.00000835526,0.000007160166,0.00003181657,0.0001424031],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8670589,"threshold_uncertainty_score":0.9998295,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3084828086","doi":"10.1049/iet-cdt.2019.0179","title":"High throughput and area‐efficient FPGA implementation of AES for high‐traffic applications","year":2020,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Cryptographic Implementations and Security","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Advanced Encryption Standard; Loop unrolling; Throughput; Byte; AES implementations; Encryption; Parallel computing; Embedded system; Computer hardware; Computer network; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01814031823590541,"gpt":0.2833424466529851,"spread":0.2652021284170797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009588083,0.0001653208,0.0002178978,0.0001142606,0.0001260382,0.0002910941,0.0004291443,0.00004120755,0.000003435864],"category_scores_gemma":[0.000005039681,0.0001643918,0.00008444729,0.0004342699,0.00008929984,0.0004349293,0.0002483308,0.00005863024,7.626468e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002034362,"about_ca_system_score_gemma":0.00003767804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003127929,"about_ca_topic_score_gemma":0.000005770397,"domain_scores_codex":[0.9987602,0.00001417563,0.0003951562,0.0004214758,0.0001962155,0.000212775],"domain_scores_gemma":[0.9992194,0.0001088756,0.0001762581,0.0002708788,0.0001337537,0.00009082784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001048231,0.0001525724,0.0001579902,0.00008938184,0.00005095277,0.000001223417,0.001473681,0.0001257767,0.0004123277,0.2038768,0.005003572,0.7886453],"study_design_scores_gemma":[0.008300502,0.009886449,0.01383473,0.0003313143,0.0002771378,0.0001162831,0.004741882,0.1110179,0.4376731,0.2215382,0.1875568,0.004725768],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07164299,0.0000376117,0.9242778,0.002288851,0.00004496527,0.001058724,0.0001868511,0.0004260997,0.00003612256],"genre_scores_gemma":[0.8230153,0.00001775317,0.1762761,0.000350139,0.00003926237,0.0001974549,0.00009381927,0.000009465901,6.36845e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7839195,"threshold_uncertainty_score":0.6703702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3042003498","doi":"10.1109/isqed48828.2020.9137051","title":"EM Fault Injection on ARM and RISC-V","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":43,"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":"Reduced instruction set computing; Fault injection; ARM architecture; Computer science; Embedded system; Fault (geology); Instruction set; Computer hardware; Operating system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.0276569169730396,"gpt":0.2721816388021825,"spread":0.2445247218291429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004316171,0.00003901644,0.0000375722,0.00003233866,0.00007236628,0.00009179039,0.00009148486,0.00001229358,0.00006655794],"category_scores_gemma":[0.000007759056,0.00003235687,0.00001511344,0.0002176172,0.000007564064,0.0001312131,0.00005349712,0.00004442926,0.00002399847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003208809,"about_ca_system_score_gemma":0.000005656717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002754662,"about_ca_topic_score_gemma":0.00003799205,"domain_scores_codex":[0.9996257,0.0000124176,0.00006566056,0.0001459175,0.00008264943,0.00006769994],"domain_scores_gemma":[0.9998173,0.00001666599,0.00001452178,0.00008437766,0.00001536223,0.00005182614],"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.000009226873,0.00009213634,0.002366445,0.00001088074,0.00001526333,0.000004976627,0.008381241,0.0000609265,0.0003222889,0.7677578,0.01313367,0.2078451],"study_design_scores_gemma":[0.003386096,0.005059857,0.07557704,0.00001863568,0.00002254432,0.00005757562,0.005218424,0.6214608,0.007718339,0.06567215,0.2147144,0.001094161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4038235,0.0000154148,0.582557,0.005700592,0.0001129484,0.0001065421,0.000001743376,0.0001658632,0.007516385],"genre_scores_gemma":[0.9907092,0.000006309643,0.006832717,0.002395549,0.00002742296,0.000002704841,0.000001035753,0.000001375724,0.00002371368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7020857,"threshold_uncertainty_score":0.1319475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027766149","doi":"10.1007/s10836-009-5108-4","title":"Fault Detection Structures of the S-boxes and the Inverse S-boxes for the Advanced Encryption Standard","year":2009,"lang":"en","type":"article","venue":"Journal of Electronic Testing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Inverse; Advanced Encryption Standard; Encryption; Computer science; Fault detection and isolation; Algorithm; Computer engineering; Fault (geology); Embedded system; Fault coverage; Parallel computing; Cryptography; Mathematics; Engineering; Electronic circuit; Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01181774797424144,"gpt":0.2725081471953783,"spread":0.2606903992211368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009347463,0.0000716335,0.0001182569,0.00005235538,0.0004067785,0.00007812918,0.0003570633,0.0000199386,0.000001106488],"category_scores_gemma":[0.0004991968,0.00003239806,0.00009369,0.0003419207,0.00008308297,0.0002341999,0.0000317123,0.0002182294,1.428919e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004157289,"about_ca_system_score_gemma":0.0001165463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001711647,"about_ca_topic_score_gemma":0.000185102,"domain_scores_codex":[0.9991454,0.00007841593,0.0002987144,0.00007909222,0.0002213495,0.0001769589],"domain_scores_gemma":[0.9983938,0.0007097843,0.0004911998,0.0001530634,0.0002348062,0.0000172958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003217816,0.00002767145,0.0007889862,0.00001968104,0.00009653381,5.954994e-7,0.003610662,0.006902643,0.02728041,0.1503444,0.000122692,0.8104839],"study_design_scores_gemma":[0.005901487,0.002517501,0.04829044,0.0001027694,0.0001943729,0.0004206565,0.001666219,0.164143,0.02155247,0.7520216,0.002952741,0.0002367927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7265143,0.0009871637,0.2698178,0.002245239,0.0001444396,0.000263026,0.000001446091,0.000009600812,0.00001692919],"genre_scores_gemma":[0.9930493,0.0000496178,0.006689744,0.0001387199,0.00006532521,0.000002857535,7.515869e-8,0.000002384857,0.000001947586],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8102471,"threshold_uncertainty_score":0.3128653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2889579243","doi":"10.1109/tifs.2018.2869344","title":"A High Throughput and Secure Authentication-Encryption AES-CCM Algorithm on Asynchronous Multicore Processor","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Electrical, Communications and Cyber Systems; Agency for Science, Technology and Research; Egg Farmers of Canada","keywords":"Computer science; Advanced Encryption Standard; Encryption; Asynchronous communication; Throughput; Plaintext; AES implementations; Embedded system; Parallel computing; Computer network; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.008776883584582446,"gpt":0.2423006497473074,"spread":0.233523766162725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002456258,0.0002311558,0.0001856797,0.0002911133,0.0007975054,0.0003825757,0.0001935128,0.0001261072,0.0000347861],"category_scores_gemma":[0.000008549632,0.0002145473,0.00006360446,0.0004623825,0.0002328669,0.001800578,0.00000908419,0.0002516157,0.00003597764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004986691,"about_ca_system_score_gemma":0.0000584579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001190736,"about_ca_topic_score_gemma":0.0001017156,"domain_scores_codex":[0.9985884,0.00003877494,0.0004331777,0.0003042158,0.0003616798,0.0002736794],"domain_scores_gemma":[0.9989077,0.00007163488,0.0001775108,0.0003668554,0.0003392033,0.0001371304],"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.00007351226,0.0003152357,0.00004553873,0.0001427465,0.00009346598,0.0000017536,0.04220913,0.000162075,0.00005044186,0.2661442,0.0004637913,0.6902981],"study_design_scores_gemma":[0.003915523,0.002219494,0.004021571,0.000124561,0.0001130061,0.00008823488,0.002176968,0.8501564,0.006243039,0.1231891,0.00665456,0.001097568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1482794,0.0000115922,0.8497766,0.000619841,0.0004962357,0.0004038428,0.000123116,0.0001400852,0.0001492853],"genre_scores_gemma":[0.9692067,0.00009450539,0.02993807,0.0005967444,0.00005834508,0.0000585665,0.0000338573,0.00000790095,0.000005312883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8499943,"threshold_uncertainty_score":0.8748985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168048374","doi":"10.1109/tc.2011.85","title":"A Low-Power High-Performance Concurrent Fault Detection Approach for the Composite Field S-Box and Inverse S-Box","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","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; Advanced Encryption Standard; S-box; Encryption; Application-specific integrated circuit; Fault detection and isolation; Critical path method; Embedded system; Computer engineering; Fault coverage; Algorithm; Parallel computing; Block cipher; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02385932636325061,"gpt":0.2450125041940351,"spread":0.2211531778307845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001671968,0.0001769629,0.0001420188,0.0001600486,0.0005794093,0.0001155824,0.0003917431,0.00006141705,0.000012576],"category_scores_gemma":[8.553371e-7,0.0001423058,0.00009982682,0.0003265972,0.00008700627,0.0003414936,0.00000797559,0.0002110628,0.000003528623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002776368,"about_ca_system_score_gemma":0.00001941173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001262737,"about_ca_topic_score_gemma":0.00006646025,"domain_scores_codex":[0.9989387,0.00004308946,0.0002338809,0.0003619298,0.0001702707,0.00025215],"domain_scores_gemma":[0.9992078,0.0002134621,0.00007375167,0.0003501948,0.00007242757,0.00008238857],"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.0001545196,0.0007573702,0.00007356862,0.00009381214,0.0002598393,0.000002457253,0.009016979,0.012512,0.001160646,0.003315762,0.0005132602,0.9721398],"study_design_scores_gemma":[0.001765978,0.001047453,0.00108036,0.0000347424,0.00006429759,0.00003368219,0.0002461375,0.9158918,0.07837049,0.0001554981,0.000903488,0.0004060614],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09569234,0.00001490413,0.90223,0.0001356477,0.00126693,0.0004935915,0.00001184197,0.0001121981,0.00004257961],"genre_scores_gemma":[0.9464377,0.00005111597,0.05277998,0.0005600979,0.00002489414,0.000127908,0.000001916566,0.000008977962,0.000007379135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9717337,"threshold_uncertainty_score":0.5803062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965792738","doi":"10.1109/dft.2011.60","title":"Reliable Hardware Architectures for the Third-Round SHA-3 Finalist Grostl Benchmarked on FPGA Platform","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Field-programmable gate array; Overhead (engineering); Benchmark (surveying); Embedded system; Advanced Encryption Standard; Virtex; Scheme (mathematics); Encryption; Byte; Reliability (semiconductor); Computer hardware; Parallel computing; Computer network; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.07017081495506261,"gpt":0.2858916068990096,"spread":0.215720791943947,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003889507,0.0001500016,0.0001187288,0.00009923492,0.0005819156,0.0001980491,0.0008986674,0.00004257118,0.0003485022],"category_scores_gemma":[0.00003404863,0.00009154581,0.0001360863,0.0002866818,0.00006856598,0.0001279804,0.0001523337,0.000133224,0.00001374212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001450896,"about_ca_system_score_gemma":0.00004183489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000886974,"about_ca_topic_score_gemma":0.001137335,"domain_scores_codex":[0.9988652,0.0000144551,0.0002234077,0.0003244727,0.0002377297,0.000334699],"domain_scores_gemma":[0.9988458,0.0002993196,0.00007136298,0.0006422303,0.00007753258,0.00006378039],"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.00008550457,0.00015871,0.00115201,0.00002454483,0.00006360334,0.000004239696,0.005585721,0.00004442292,0.00002321103,0.9342204,0.03518689,0.02345069],"study_design_scores_gemma":[0.002799553,0.001777883,0.1177441,0.00006289186,0.00007719109,0.00005394022,0.001775214,0.04765997,0.005556024,0.5598505,0.2615128,0.001129927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1533951,0.0002087431,0.7739873,0.003337346,0.001201936,0.001868686,0.00009231598,0.0004325241,0.06547602],"genre_scores_gemma":[0.9597573,0.00001332783,0.03731283,0.002007143,0.00007363284,0.0001465004,0.00001580099,0.00001011675,0.0006633811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8063622,"threshold_uncertainty_score":0.4475683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385237357","doi":"10.1109/tc.2023.3296899","title":"HPKA: A High-Performance CRYSTALS-Kyber Accelerator Exploring Efficient Pipelining","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Engineering and Physical Sciences Research Council; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Computer science; NIST; Post-quantum cryptography; Cryptography; Parallel computing; Field-programmable gate array; Embedded system; Public-key cryptography; Encryption; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.05966546207419866,"gpt":0.2679069968707073,"spread":0.2082415347965086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002995556,0.0002229481,0.0001980129,0.0006277563,0.0006115414,0.0002532914,0.000604027,0.00004857029,0.00003361525],"category_scores_gemma":[0.000001547818,0.0002284206,0.0001265738,0.001941785,0.00004562531,0.0005162045,0.00001335182,0.0002563446,0.0001804576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006841527,"about_ca_system_score_gemma":0.00005466503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004112618,"about_ca_topic_score_gemma":0.00001056343,"domain_scores_codex":[0.9981291,0.00005699899,0.0003633072,0.0005316738,0.0004216157,0.000497257],"domain_scores_gemma":[0.9989693,0.0001824431,0.00007084306,0.0005581063,0.00007787076,0.0001414183],"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.00002106887,0.0002578721,0.00004733634,0.000038683,0.0000883384,0.00003281528,0.005324085,0.7526916,0.001015938,0.001840553,0.001063413,0.2375783],"study_design_scores_gemma":[0.001036155,0.000209572,0.001784176,0.00008758215,0.0000167141,0.00001481971,0.0002476069,0.9814105,0.01304801,0.00008506652,0.001593759,0.0004660641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.440128,0.000003414162,0.557019,0.0002457123,0.001931802,0.0001304425,0.000007501916,0.0005041081,0.0000300573],"genre_scores_gemma":[0.9856839,0.00006073248,0.01373743,0.0002700077,0.00007222802,0.0001267985,0.000003980138,0.00002003393,0.00002486515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5455559,"threshold_uncertainty_score":0.931472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W181112729","doi":"","title":"A 32-bit RC4-like Keystream Generator.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","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 Waterloo","funders":"","keywords":"Keystream; RC4; Computer science; Generator (circuit theory); Stream cipher; Self-shrinking generator; Randomness; Encryption; Bit (key); Software; State (computer science); Algorithm; Computer hardware; Cryptography; Mathematics; Power (physics); Computer network; Electrical engineering; Operating system; Induction generator; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01928593122520285,"gpt":0.2828424928633809,"spread":0.263556561638178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000475086,0.0006994384,0.0008132813,0.0006845743,0.000378718,0.000325565,0.002822866,0.0003801029,0.0002870584],"category_scores_gemma":[0.00005409094,0.0007240883,0.0005469475,0.0003682075,0.0004022602,0.0002073933,0.005517431,0.001567071,0.0003317408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001222629,"about_ca_system_score_gemma":0.0005154807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000249328,"about_ca_topic_score_gemma":0.0008094603,"domain_scores_codex":[0.9953406,0.0004780314,0.0009379031,0.001767347,0.0004765684,0.0009995376],"domain_scores_gemma":[0.9962844,0.0003093331,0.0004930624,0.002392065,0.0001764371,0.000344699],"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.00001602456,0.0002435797,0.003276516,0.0000470729,0.0002315632,0.0001063381,0.003932498,0.0005179621,0.0003066965,0.9603016,0.005295608,0.02572458],"study_design_scores_gemma":[0.0008703272,0.0001229236,0.01355051,0.00006501094,0.00007279713,0.0001703085,0.0001419522,0.0168696,0.0006189088,0.9113793,0.05503492,0.00110343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1142527,0.0002790759,0.8745086,0.002598149,0.001952273,0.0007355288,0.0001468879,0.0004399646,0.005086882],"genre_scores_gemma":[0.1677813,0.000376574,0.8292869,0.001261438,0.0005947137,0.0004039917,0.0002397744,0.00004702319,0.000008314174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05352859,"threshold_uncertainty_score":0.999521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095155522","doi":"10.1109/temc.2015.2390229","title":"XOR Encryption Versus Phase Encryption, an In-Depth Analysis","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Electromagnetic Compatibility","topic":"Cryptographic Implementations and Security","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 Waterloo","funders":"","keywords":"Encryption; Bitwise operation; Probabilistic encryption; 40-bit encryption; Multiple encryption; Computer science; 56-bit encryption; Watermarking attack; Ciphertext; Attribute-based encryption; Algorithm; Theoretical computer science; Computer network; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.05756185944754254,"gpt":0.3443666921591025,"spread":0.2868048327115599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008657939,0.0002656631,0.000363515,0.0009089193,0.0002128104,0.0001571527,0.0005937251,0.00009110726,0.0001840274],"category_scores_gemma":[0.0000163649,0.0002822941,0.0002172114,0.00369804,0.00009709481,0.0006938067,0.000004326082,0.0003477996,0.00002474479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002963383,"about_ca_system_score_gemma":0.0002192866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001147066,"about_ca_topic_score_gemma":0.01187863,"domain_scores_codex":[0.9970602,0.0004376685,0.0006133245,0.0008225196,0.0005664702,0.0004998277],"domain_scores_gemma":[0.9979905,0.0001734319,0.0001188592,0.00116222,0.0002389033,0.0003161111],"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.005495097,0.04520039,0.009438016,0.000127164,0.001721247,0.00008643087,0.03517722,0.07503223,0.04952031,0.02855422,0.000502948,0.7491447],"study_design_scores_gemma":[0.01661067,0.0142757,0.05349645,0.00001369987,0.0006004857,0.00001509121,0.0007543991,0.8890708,0.01007744,0.01368432,0.0002180907,0.00118283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5149003,0.00001644834,0.484212,0.0001281982,0.0002401352,0.0002496241,0.00001150864,0.0001283103,0.0001135709],"genre_scores_gemma":[0.9866819,0.00001389652,0.01310282,0.00004962801,0.00002067305,0.00008428133,0.00002846297,0.000009840491,0.000008475578],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8140386,"threshold_uncertainty_score":0.9999629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621100381","doi":"10.1007/978-3-319-57339-7_7","title":"Impossible Differential Cryptanalysis of Reduced-Round SKINNY","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Differential cryptanalysis; Differential (mechanical device); Linear cryptanalysis; Arithmetic; Boomerang attack; Parallel computing; Cipher; Algorithm; Cryptography; Mathematics; Operating system; Encryption; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02221386052367519,"gpt":0.2891596360453267,"spread":0.2669457755216516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006207298,0.0004470719,0.0006821413,0.001293564,0.0005361733,0.0008680997,0.004336476,0.0002377323,0.0000981269],"category_scores_gemma":[0.00006089336,0.0004056014,0.0003222405,0.0004640518,0.001016747,0.0006628404,0.001446481,0.0005269519,0.000008410199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336323,"about_ca_system_score_gemma":0.0005363691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001675712,"about_ca_topic_score_gemma":0.0003731672,"domain_scores_codex":[0.9963422,0.00003255305,0.0007070618,0.00125524,0.001094022,0.0005688914],"domain_scores_gemma":[0.9962452,0.0002162714,0.0006973848,0.00234781,0.0003397213,0.0001536302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001095731,0.0001167961,0.0003394469,0.00008522157,0.0001318354,0.00006453357,0.002156387,0.00103294,0.001940356,0.1796085,0.00005510496,0.8144579],"study_design_scores_gemma":[0.0008264925,0.0003645378,0.00278363,0.0004384496,0.0001099936,0.00006432839,6.070388e-7,0.2227143,0.006828107,0.7626792,0.001844996,0.001345432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002901097,0.0002153419,0.9928827,0.0003344949,0.001308092,0.000259431,0.00001753229,0.00005677679,0.002024509],"genre_scores_gemma":[0.8408821,0.00006374005,0.1584196,0.0001350817,0.0002930477,0.000007104755,0.00001160342,0.00002143747,0.0001663561],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.837981,"threshold_uncertainty_score":0.9998396,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}