{"meta":{"query_hash":"8011c8f38656","filters":{"topic":"Cryptographic Implementations and Security"},"cohort_total":504,"direct_labels_cover":0,"predictions_cover":504,"exported":504,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/8011c8f38656","api":"https://metacan.xera.ac/api/v1/cohort?topic=Cryptographic+Implementations+and+Security"},"results":[{"id":"W110051878","doi":"10.1007/978-3-319-06734-6_7","title":"Preimage Attacks on Reduced-Round Stribog","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Cryptographic hash function; GOST (hash function); Collision attack; Function (biology); SHA-2; Algorithm; Compression (physics); Theoretical computer science; Double hashing; Computer security","score_opus":0.024194305578451928,"score_gpt":0.2866755637425099,"score_spread":0.262481258164058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110051878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000567677,0.00008632527,0.9897285,0.0009659319,0.0017871648,0.0004318928,0.000013422546,0.00017133307,0.0062477416],"genre_scores_gemma":[0.67486393,0.00005424151,0.31953365,0.0039382786,0.0010117752,0.000024582721,0.000030050829,0.000060066723,0.000483445],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582136,0.000050768926,0.00056502013,0.0016726668,0.0011581524,0.000732015],"domain_scores_gemma":[0.9969048,0.000515987,0.00029627536,0.001859814,0.00021952682,0.00020357674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009687616,0.00054443657,0.0004839135,0.0010296828,0.00041193157,0.0009029251,0.00327086,0.0002609445,0.000064640946],"category_scores_gemma":[0.00006680758,0.0005011465,0.00018171432,0.0007240746,0.00059735443,0.00040468996,0.0010009742,0.0008879508,0.00007719732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006237027,0.000047349073,0.00003705408,0.000030947296,0.000015645679,0.000048191443,0.0008260195,0.0026417125,0.00011504328,0.33101645,0.0002927933,0.66492254],"study_design_scores_gemma":[0.0010941582,0.0012281359,0.0007623925,0.00067132973,0.000025549312,0.00012631057,6.25454e-7,0.30896705,0.0024927387,0.6368322,0.04558233,0.0022171948],"about_ca_topic_score_codex":0.000033427303,"about_ca_topic_score_gemma":0.00010281787,"teacher_disagreement_score":0.67429626,"about_ca_system_score_codex":0.00022938348,"about_ca_system_score_gemma":0.00037683905,"threshold_uncertainty_score":0.999744},"labels":[],"label_agreement":null},{"id":"W128424555","doi":"10.1007/978-1-4419-1530-6_11","title":"Summary, Standards, and Ongoing Efforts","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer security; Computer science; Eavesdropping; Authentication (law); Table (database); Cryptography","score_opus":0.01462911610796757,"score_gpt":0.2651184103029052,"score_spread":0.25048929419493765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128424555","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028665121,0.0007342309,0.07732035,0.00043602593,0.00014268333,0.00020248488,0.00003947482,0.00014661536,0.92094946],"genre_scores_gemma":[0.010895987,0.0055979555,0.11310033,0.0037224179,0.00043124473,0.000014774905,0.00015842658,0.00008172935,0.86599714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884754,0.0000056577874,0.00022372826,0.0003630715,0.00038276374,0.00017722193],"domain_scores_gemma":[0.99932265,0.00003533553,0.00008005152,0.00038372644,0.000090324844,0.000087905515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024378227,0.00019104508,0.00019911272,0.00018305262,0.00013968979,0.00022449976,0.0002624322,0.00009907813,0.00018108044],"category_scores_gemma":[0.0000034831114,0.00017354541,0.00007663346,0.000036015215,0.000040678464,0.00018133505,0.00017776273,0.00014992652,0.000006301657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.890616e-7,0.0000031219117,0.000008307029,0.000007422247,0.000012014879,0.0000127407375,0.000073340285,9.791265e-8,7.3372115e-7,0.81171775,0.010304314,0.17785937],"study_design_scores_gemma":[0.00014889905,0.0000697878,0.00006968351,0.00004421232,0.000009470132,0.000017957947,0.0000030528258,0.0001447233,0.0000058555574,0.15661845,0.8426503,0.00021763281],"about_ca_topic_score_codex":0.00002629,"about_ca_topic_score_gemma":0.00022557781,"teacher_disagreement_score":0.83234596,"about_ca_system_score_codex":0.00003251274,"about_ca_system_score_gemma":0.00008730477,"threshold_uncertainty_score":0.7076977},"labels":[],"label_agreement":null},{"id":"W135404535","doi":"","title":"Toward Provable Security Against Differential and Linear Cryptanalysis for Camellia and Related Ciphers","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Linear cryptanalysis; Differential cryptanalysis; Higher-order differential cryptanalysis; Block cipher; Computer science; Impossible differential cryptanalysis; Upper and lower bounds; Algorithm; Cryptanalysis; Differential (mechanical device); Provable security; Invertible matrix; Arithmetic; Mathematics; Cryptography","score_opus":0.01685692392957279,"score_gpt":0.2760241140376115,"score_spread":0.25916719010803874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135404535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5380956,0.00007821659,0.46022406,0.0003376221,0.000087724955,0.00025159464,0.0000058733685,0.00006888942,0.0008504497],"genre_scores_gemma":[0.9679503,0.00007231645,0.03173488,0.0001156716,0.000022908174,0.000009828852,0.000013686593,0.000005688681,0.00007476511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892515,0.000019979983,0.0002760769,0.00034983223,0.00014572969,0.00028324506],"domain_scores_gemma":[0.99943966,0.00008871714,0.00006580125,0.00020659086,0.00007338387,0.00012585701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003882598,0.000120970326,0.00016442178,0.00014544236,0.00020372521,0.00013800652,0.0001618628,0.000063756284,0.000039245413],"category_scores_gemma":[0.000019652796,0.00010482819,0.000070327485,0.00039347075,0.00006547899,0.00023743043,0.00011892835,0.00008456654,9.984728e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118924196,0.00050366356,0.02233605,0.00026352514,0.0007433943,0.000039508966,0.023385797,0.000023400195,0.004692895,0.8026076,0.0025381038,0.14274713],"study_design_scores_gemma":[0.007606769,0.0007642591,0.033037037,0.000043452867,0.00033193323,0.00005085677,0.005407287,0.81229466,0.008996238,0.109624885,0.020158786,0.0016838213],"about_ca_topic_score_codex":0.000109946435,"about_ca_topic_score_gemma":0.00023944004,"teacher_disagreement_score":0.8122713,"about_ca_system_score_codex":0.000014229549,"about_ca_system_score_gemma":0.000016788927,"threshold_uncertainty_score":0.42747697},"labels":[],"label_agreement":null},{"id":"W1409844201","doi":"10.1007/978-3-319-16363-5_8","title":"Differential Sieving for 2-Step Matching Meet-in-the-Middle Attack with Application to LBlock","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Block cipher; Matching (statistics); Algorithm; Differential (mechanical device); Plaintext; Cipher; Theoretical computer science; Cryptography; Mathematics; Computer security; Encryption","score_opus":0.04213478822813087,"score_gpt":0.2959762802090728,"score_spread":0.2538414919809419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1409844201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017065239,0.0000677637,0.99486756,0.0012922011,0.00039159082,0.0012863972,0.000009697243,0.00005914814,0.00031911623],"genre_scores_gemma":[0.5414754,0.000003749499,0.45691657,0.0010863044,0.00032519066,0.00012279132,0.000015279165,0.00002544042,0.000029281295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703276,0.000031076514,0.00042364871,0.0010835672,0.00088574504,0.00054322823],"domain_scores_gemma":[0.9980548,0.00036757707,0.00019448111,0.001026262,0.00023289304,0.00012398222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087258336,0.00035661046,0.00034507,0.00061577023,0.00029180248,0.00061590155,0.0025760047,0.000120786826,0.000004848863],"category_scores_gemma":[0.000023543193,0.0002656244,0.00008181296,0.000776304,0.00016875901,0.0003402711,0.00053689914,0.0003276971,0.000005635234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004404936,0.0001383586,0.00021125034,0.00014546026,0.000025666073,0.000026820393,0.015857896,0.05949501,0.00020593836,0.24060935,0.00027738875,0.68296283],"study_design_scores_gemma":[0.0012443743,0.0007372872,0.00036101314,0.0005238953,0.000028249484,0.00008221966,0.000013051663,0.7516693,0.0001980063,0.23002808,0.013803242,0.0013113042],"about_ca_topic_score_codex":0.000063611966,"about_ca_topic_score_gemma":0.0015736707,"teacher_disagreement_score":0.69217426,"about_ca_system_score_codex":0.00017067262,"about_ca_system_score_gemma":0.00023713817,"threshold_uncertainty_score":0.9999796},"labels":[],"label_agreement":null},{"id":"W1424990225","doi":"10.1007/3-540-36552-4_12","title":"Hardware Design and Analysis of Block Cipher Components","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Parameterized complexity; Block cipher; Advanced Encryption Standard; Block (permutation group theory); Encryption; Permutation (music); S-box; Arithmetic; Theoretical computer science; Cryptography; Parallel computing; Algorithm; Mathematics; Computer network","score_opus":0.031141528668451362,"score_gpt":0.2683331192917851,"score_spread":0.23719159062333375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1424990225","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008101528,0.000348231,0.9976275,0.00019994823,0.00034039727,0.00030061172,0.000013134275,0.000036909514,0.00032311294],"genre_scores_gemma":[0.24088861,0.00009475524,0.7580156,0.0008736314,0.00003699229,0.000007100379,0.000013296281,0.000017972521,0.000052067273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733025,0.0000625382,0.000512424,0.0009958217,0.00071608427,0.00038290175],"domain_scores_gemma":[0.9980606,0.00037424217,0.00028859894,0.00092274573,0.0002283407,0.00012550462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080681505,0.0003356602,0.0006059222,0.0017295635,0.00018499016,0.00024111493,0.001329308,0.0001565301,0.000031132695],"category_scores_gemma":[0.0000264158,0.00031302386,0.00016684689,0.0017784559,0.0005284153,0.0002679286,0.000550119,0.00030385668,0.0000017525089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027097198,0.00028766427,0.005496444,0.00016694261,0.0013017323,0.00014755505,0.0075455294,0.19452658,0.0010365602,0.1426634,0.00019205874,0.6466084],"study_design_scores_gemma":[0.00041179784,0.00018021952,0.0032819596,0.000119852775,0.00021533789,0.00002655637,4.6939388e-7,0.9290272,0.0006547821,0.064035706,0.0013569132,0.0006892102],"about_ca_topic_score_codex":0.00003370791,"about_ca_topic_score_gemma":0.000054768763,"teacher_disagreement_score":0.73450065,"about_ca_system_score_codex":0.000068261215,"about_ca_system_score_gemma":0.00012920584,"threshold_uncertainty_score":0.99993217},"labels":[],"label_agreement":null},{"id":"W1429456869","doi":"10.18260/p.24326","title":"Integrating Emerging Cryptographic Engineering Research and Security Education","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Computer science; Security engineering; Cryptography; Computer security; Cryptographic primitive; Cryptographic protocol; Engineering management; Information security; Software security assurance; Engineering; Security service","score_opus":0.06162785716840246,"score_gpt":0.3661514160592586,"score_spread":0.30452355889085614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1429456869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6222398,0.00043624788,0.369019,0.0014821655,0.00040778943,0.00023077178,7.351066e-7,0.00021927162,0.0059641767],"genre_scores_gemma":[0.9304695,0.00002026078,0.06935052,0.00005789375,0.000052626445,0.000026141917,0.0000024130356,0.000004662396,0.000015987087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989593,0.00005321171,0.00016638928,0.00025772175,0.0003077269,0.0002556741],"domain_scores_gemma":[0.9991348,0.00008401315,0.000024701396,0.00026511104,0.00032308593,0.00016830779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011453116,0.00008127868,0.000075972916,0.00048421219,0.00016719756,0.00029224044,0.000281139,0.000031001775,0.000009478579],"category_scores_gemma":[0.00010636687,0.00007531419,0.000021200645,0.0012449285,0.00004008587,0.00051604066,0.00021977267,0.00020559096,0.0000037702748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.270324e-7,0.00005328752,0.0039218753,0.0000099992385,0.000005138129,7.037454e-7,0.0045057316,0.000003076796,0.00017570311,0.976235,0.0011403359,0.013948328],"study_design_scores_gemma":[0.0010125402,0.00048967643,0.01041584,0.00011387036,0.000008367243,0.000085561536,0.023384225,0.26603633,0.0013034717,0.6403382,0.05601283,0.00079908094],"about_ca_topic_score_codex":0.00041473572,"about_ca_topic_score_gemma":0.00013087282,"teacher_disagreement_score":0.3358968,"about_ca_system_score_codex":0.000026211936,"about_ca_system_score_gemma":0.00013057122,"threshold_uncertainty_score":0.30712232},"labels":[],"label_agreement":null},{"id":"W1480161508","doi":"10.1007/978-1-4757-3789-9_8","title":"Toward the True Random Cipher: On Expected Linear Probability Values for SPNS with Randomly Selected S-Boxes","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Mount Allison University","funders":"","keywords":"Block cipher; Running key cipher; Stream cipher; Random permutation; Cipher; Mathematics; CBC-MAC; Linear cryptanalysis; Parameterized complexity; Cryptography; Discrete mathematics; Permutation (music); Computer science; Theoretical computer science; Encryption; Algorithm; Combinatorics; Block (permutation group theory); Computer security","score_opus":0.03920851737744863,"score_gpt":0.26640151842363147,"score_spread":0.22719300104618284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480161508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001133408,0.0002677775,0.9046615,0.0044608894,0.00046536114,0.0074696615,0.000113474336,0.0006180536,0.08080992],"genre_scores_gemma":[0.1290321,0.0010120854,0.56398433,0.010664503,0.0019838149,0.0059809717,0.0012294258,0.0006860934,0.28542665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738467,0.00013401496,0.00059988326,0.000876095,0.00056535006,0.000440001],"domain_scores_gemma":[0.9969987,0.00087847904,0.0002878722,0.0010816538,0.0006443569,0.00010889732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006777191,0.00053341966,0.000660866,0.00017606726,0.0004150083,0.00024444528,0.0008577171,0.00020614214,0.00028672238],"category_scores_gemma":[0.00010616308,0.00030441664,0.0003493483,0.0002903989,0.00020120418,0.00016273733,0.00008326137,0.0003690353,0.000009226247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017542613,0.0002080409,0.000033703298,0.00010843683,0.00058800954,0.000007967055,0.003863963,0.000057961533,0.00001540927,0.97292787,0.015124336,0.005310039],"study_design_scores_gemma":[0.05490309,0.004304696,0.00022522426,0.0003279939,0.00063953013,0.0000973811,0.00040451923,0.010127209,0.0013981197,0.5439621,0.38049778,0.0031123552],"about_ca_topic_score_codex":0.00004664464,"about_ca_topic_score_gemma":0.0002888954,"teacher_disagreement_score":0.42896578,"about_ca_system_score_codex":0.00006344525,"about_ca_system_score_gemma":0.00023273658,"threshold_uncertainty_score":0.9999408},"labels":[],"label_agreement":null},{"id":"W14902720","doi":"","title":"A compact ASIC implementation of the advanced encryption standard with concurrent error detection","year":2007,"lang":"en","type":"article","venue":"International Conference on Circuits","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Application-specific integrated circuit; Computer science; Advanced Encryption Standard; Error detection and correction; Redundancy (engineering); Embedded system; Encryption; Implementation; Computer engineering; Parity bit; Integrated circuit; Decoding methods; Computer hardware; Algorithm; Computer network","score_opus":0.04212914097190405,"score_gpt":0.3538237402326596,"score_spread":0.31169459926075554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14902720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5735514,0.0000057236625,0.42280212,0.0005732355,0.0006416016,0.00029154416,0.0000356506,0.000036601046,0.0020621147],"genre_scores_gemma":[0.9995645,0.000006810255,0.00026443636,0.000096433476,0.000029781771,0.00001064189,0.000012760016,0.0000049768414,0.000009637332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985424,0.000047820675,0.00031886346,0.0002447677,0.00066787057,0.00017824039],"domain_scores_gemma":[0.9989155,0.00006058981,0.0002866919,0.00023670447,0.00045225312,0.000048279555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034852247,0.00011878778,0.000111357294,0.0001750757,0.00012350414,0.00008377009,0.0005078543,0.000028155158,0.0001253227],"category_scores_gemma":[0.00001587811,0.00008783118,0.00006368123,0.0003486411,0.00006451117,0.00034524832,0.000041440435,0.00012836409,0.000004069658],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004060286,0.000086016196,0.008550915,0.000009039601,0.000056656107,0.0000022095148,0.0015810936,0.000055573346,0.022099338,0.50162226,0.00003121707,0.46586505],"study_design_scores_gemma":[0.0046099513,0.0014676276,0.7336699,0.00020258082,0.00003230432,0.00004677279,0.004131573,0.0057259374,0.23350242,0.012939619,0.0031491208,0.0005222283],"about_ca_topic_score_codex":0.0000967128,"about_ca_topic_score_gemma":0.0014053294,"teacher_disagreement_score":0.72511894,"about_ca_system_score_codex":0.00012700648,"about_ca_system_score_gemma":0.0001219172,"threshold_uncertainty_score":0.35816514},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015135840580243216,"score_gpt":0.2556747906477822,"score_spread":0.24053895006753898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494600236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020810715,0.00016808991,0.9905194,0.0007275123,0.0020605426,0.0008440258,0.000010257325,0.0003050705,0.0032840201],"genre_scores_gemma":[0.41183296,0.000055261447,0.5849587,0.002256574,0.00069395,0.000045506207,0.000013488494,0.000059529168,0.00008405829],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995206,0.00006717116,0.0007671942,0.0018123348,0.0011744638,0.00097282144],"domain_scores_gemma":[0.99662703,0.0004901773,0.00045632428,0.0016914337,0.00049182615,0.00024323369],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018282512,0.0006584597,0.00059333345,0.001729159,0.00092249864,0.0010921401,0.0035752924,0.00047714944,0.00005096937],"category_scores_gemma":[0.00019131225,0.0006282359,0.0002753381,0.0013645112,0.0010745758,0.0007631557,0.0014363704,0.002540665,0.000029004572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055271303,0.00006530831,0.00023579516,0.0000562203,0.000026771262,0.00012730125,0.002652272,0.0007023954,0.0029795957,0.06991198,0.000016064843,0.92322075],"study_design_scores_gemma":[0.0019918517,0.0007258979,0.0013379547,0.00094077206,0.000038806054,0.0002553025,0.0000054809934,0.21168086,0.010295268,0.74515986,0.023494406,0.0040735127],"about_ca_topic_score_codex":0.000055419005,"about_ca_topic_score_gemma":0.0006928481,"teacher_disagreement_score":0.91914725,"about_ca_system_score_codex":0.00010684899,"about_ca_system_score_gemma":0.00047859937,"threshold_uncertainty_score":0.9999448},"labels":[],"label_agreement":null},{"id":"W1500221189","doi":"10.1007/3-540-45537-x_4","title":"Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monomial; Boolean function; Bijection; Mathematics; Discrete mathematics; Simple (philosophy); Function (biology); Cryptography; Combinatorics; Algorithm","score_opus":0.021156289696462535,"score_gpt":0.2745474964824746,"score_spread":0.25339120678601207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500221189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006289705,0.00013916587,0.99426395,0.0010067497,0.0008177153,0.00069407985,0.00007603674,0.0001435896,0.0022297706],"genre_scores_gemma":[0.54052985,0.00004514287,0.453188,0.005006876,0.0005665161,0.00007971708,0.00003225418,0.000067722896,0.00048389097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963112,0.000036806014,0.00047206995,0.0016574642,0.0006774576,0.0008450034],"domain_scores_gemma":[0.997504,0.00026740364,0.00021966331,0.001402508,0.00029459377,0.00031185104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006720942,0.0005279253,0.00045358506,0.0010641097,0.0005940625,0.00067379297,0.0016075613,0.00016305529,0.00007052975],"category_scores_gemma":[0.00003212086,0.00046056733,0.00012161004,0.0013382409,0.00031959754,0.0006424395,0.0008174919,0.00060530606,0.000051504216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067703026,0.00028594685,0.0006377433,0.000053018917,0.00012613452,0.005050927,0.010721199,0.029662304,0.00004434593,0.19227013,0.00079389906,0.7602866],"study_design_scores_gemma":[0.0030489215,0.0028044223,0.0008306351,0.00086277863,0.00012699768,0.009219155,0.00003545958,0.43686143,0.00035062828,0.1898808,0.35083425,0.0051445165],"about_ca_topic_score_codex":0.00018378606,"about_ca_topic_score_gemma":0.007145372,"teacher_disagreement_score":0.75514215,"about_ca_system_score_codex":0.00034438065,"about_ca_system_score_gemma":0.0003684154,"threshold_uncertainty_score":0.9997846},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04105082075794935,"score_gpt":0.2975688237329249,"score_spread":0.25651800297497557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500382400","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028393595,0.00027640996,0.99346006,0.0004372655,0.0009718805,0.00029192076,0.000009904995,0.00014137667,0.004127269],"genre_scores_gemma":[0.1483169,0.000100640755,0.8446559,0.006360494,0.00037632915,0.00000835526,0.0000071601658,0.000031816573,0.0001424031],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630755,0.000019415389,0.0005273886,0.0013324881,0.0010451797,0.00076795457],"domain_scores_gemma":[0.9978043,0.0003247707,0.00020545255,0.0012420489,0.00022799819,0.00019545159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011413776,0.00044279915,0.00038021203,0.0012570181,0.00044193238,0.0006258008,0.0027758298,0.00024033182,0.00010139132],"category_scores_gemma":[0.000031068077,0.0004156738,0.00017720902,0.0010469732,0.001013099,0.0006257828,0.0011290156,0.0006279716,0.000041865107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035495505,0.000027506672,0.00010995126,0.000023603274,0.000009406299,0.00006238241,0.0019542773,0.00014281935,0.00006061261,0.12907036,0.000039243052,0.8684963],"study_design_scores_gemma":[0.0006370798,0.00040056885,0.001552903,0.00034439715,0.000015858206,0.00017333738,9.0571734e-7,0.14658608,0.001810825,0.8279456,0.019095067,0.0014373657],"about_ca_topic_score_codex":0.00008175309,"about_ca_topic_score_gemma":0.00054637174,"teacher_disagreement_score":0.86705893,"about_ca_system_score_codex":0.00021020649,"about_ca_system_score_gemma":0.00023448112,"threshold_uncertainty_score":0.99982953},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0171529933463793,"score_gpt":0.2942482527862945,"score_spread":0.2770952594399152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505973206","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001262892,0.00031799238,0.9955284,0.000673168,0.0007453296,0.00044052428,0.000014087734,0.00011016378,0.0009074273],"genre_scores_gemma":[0.16907853,0.00020248606,0.8271168,0.003223534,0.0002536812,0.000025513242,0.000037925776,0.000039751652,0.000021800128],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996692,0.00005701088,0.0005189108,0.0013911992,0.00074634206,0.0005945391],"domain_scores_gemma":[0.9981982,0.00012916392,0.00024497983,0.0010023284,0.0002034442,0.0002218783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082858943,0.00045420747,0.00036638384,0.0013428378,0.00044650177,0.0009227064,0.0013851525,0.00017784006,0.00008046657],"category_scores_gemma":[0.00001107366,0.0004412418,0.000104257,0.000899492,0.0005601377,0.0011044244,0.0005039055,0.00042732348,0.0000040501263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032375456,0.00004430327,0.0033915415,0.000029842004,0.000017746917,0.000025159157,0.003211246,0.0003786029,0.000068190384,0.24931571,0.00008053538,0.7434339],"study_design_scores_gemma":[0.0011304596,0.00081019255,0.0048634745,0.00013291673,0.000031413758,0.00013086635,0.000010658985,0.04178037,0.0008043358,0.9408982,0.0077107023,0.0016964524],"about_ca_topic_score_codex":0.000050209343,"about_ca_topic_score_gemma":0.00065279123,"teacher_disagreement_score":0.7417374,"about_ca_system_score_codex":0.000081610124,"about_ca_system_score_gemma":0.00019676953,"threshold_uncertainty_score":0.99980396},"labels":[],"label_agreement":null},{"id":"W1510663655","doi":"10.1007/978-3-642-17619-7_3","title":"An Algorithm Based Concurrent Error Detection Scheme for AES","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Algorithm; Scheme (mathematics); Mathematics","score_opus":0.024430379844197873,"score_gpt":0.3032993712653675,"score_spread":0.2788689914211696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510663655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021128378,0.00008118042,0.99535596,0.0003227189,0.003031579,0.00073248846,0.000038675855,0.00017277943,0.000053343727],"genre_scores_gemma":[0.13788074,0.000005059596,0.8608605,0.00071065756,0.0004272573,0.00005055978,0.000029890103,0.00002506247,0.000010247141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690837,0.00002714757,0.00046557092,0.0013718485,0.00064670143,0.0005803421],"domain_scores_gemma":[0.99768907,0.00030654803,0.00026355888,0.0011404604,0.00039999167,0.00020037303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008964282,0.00042903237,0.00036402015,0.00083951355,0.00052724953,0.000649591,0.0021207703,0.00030832147,0.00002835795],"category_scores_gemma":[0.000040688752,0.0004090103,0.000176612,0.0005119152,0.0005223333,0.0006306168,0.00028713676,0.0007027266,0.000005620498],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002522985,0.00004637506,0.000011563903,0.00002081684,0.0000052157125,0.0000048735005,0.00025627037,0.00067291904,0.0012860973,0.010203759,0.0000033901017,0.9874862],"study_design_scores_gemma":[0.00045496595,0.00037527157,0.000058388465,0.000055056837,0.0000074978448,0.000014720633,2.7082498e-7,0.9219834,0.007855274,0.064200565,0.0044923592,0.00050218974],"about_ca_topic_score_codex":0.00003221434,"about_ca_topic_score_gemma":0.00055411796,"teacher_disagreement_score":0.986984,"about_ca_system_score_codex":0.00012376696,"about_ca_system_score_gemma":0.00045294975,"threshold_uncertainty_score":0.99983615},"labels":[],"label_agreement":null},{"id":"W151366713","doi":"10.1007/978-3-642-33481-8_15","title":"On the Sosemanuk Related Key-IV Sets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Stream cipher; Keystream; Key (lock); Cryptanalysis; Cipher; State (computer science); Set (abstract data type); Theoretical computer science; Transposition cipher; Software; Running key cipher; Algorithm; Computer security; Cryptography; Programming language; Encryption","score_opus":0.02225030580231654,"score_gpt":0.2639576375156497,"score_spread":0.24170733171333317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151366713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006887628,0.0003952072,0.9871832,0.0036637823,0.0017120113,0.00047905507,0.000007460589,0.00014117292,0.0057293307],"genre_scores_gemma":[0.88239676,0.00011538374,0.11093023,0.0058981525,0.00033243073,0.000026825186,0.00001471058,0.000048918042,0.00023658031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966752,0.00006420651,0.0004935859,0.001019364,0.001027599,0.00072005833],"domain_scores_gemma":[0.9967991,0.0009509108,0.0002668756,0.0016837764,0.00014621625,0.00015313897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014021316,0.0004479711,0.00033489225,0.00065742555,0.00056709524,0.0005272032,0.0032060207,0.00023902406,0.00018686944],"category_scores_gemma":[0.00007088037,0.00031405018,0.0001699501,0.0008286744,0.0006554359,0.00044236198,0.0010224935,0.0009828976,0.00014221537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021487142,0.00003303033,0.000033508983,0.0000086894315,0.000014103404,0.000020155401,0.0020114046,0.00089413935,0.000018066046,0.6409502,0.00018962016,0.35582492],"study_design_scores_gemma":[0.00025958833,0.00016296239,0.00037264216,0.00017926555,0.000011592707,0.000066271714,5.646704e-7,0.109887406,0.0002290539,0.88248605,0.005692061,0.00065256393],"about_ca_topic_score_codex":0.000021801214,"about_ca_topic_score_gemma":0.000071899194,"teacher_disagreement_score":0.881708,"about_ca_system_score_codex":0.00014927181,"about_ca_system_score_gemma":0.00022926998,"threshold_uncertainty_score":0.99993116},"labels":[],"label_agreement":null},{"id":"W1513787550","doi":"10.1007/978-3-642-01877-0_14","title":"ERINDALE: A Polynomial Based Hashing Algorithm","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hash function; Computer science; Double hashing; Algorithm; Flexibility (engineering); Set (abstract data type); Field-programmable gate array; Software; SHA-2; Polynomial; Skein; Theoretical computer science; Hash table; Cryptographic hash function; Computer hardware; Mathematics; Programming language; Statistics","score_opus":0.016432280802129273,"score_gpt":0.261587612840424,"score_spread":0.2451553320382947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513787550","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055157918,0.00018064064,0.99496883,0.001238337,0.0013042253,0.00035639008,0.000013785529,0.00018849512,0.0016941149],"genre_scores_gemma":[0.045141496,0.000014239131,0.95125836,0.002886624,0.00055328244,0.000008698745,0.00001559344,0.000026464146,0.00009524981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621636,0.00003451048,0.0005532851,0.0014217125,0.0010243622,0.00074975274],"domain_scores_gemma":[0.99779713,0.0002785552,0.00025567293,0.0012780413,0.0001843043,0.00020630482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008362077,0.0005069108,0.0004603742,0.0012359514,0.0004307479,0.0010023774,0.0029592745,0.0002577173,0.000049478764],"category_scores_gemma":[0.00003387845,0.0004976733,0.0001962513,0.00088633277,0.00045171502,0.0006357062,0.0006544052,0.00079436676,0.00001842493],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001993165,0.00002766478,0.000021001802,0.000008025622,0.0000050798285,0.00006809205,0.00031919355,0.0021864555,0.000029768353,0.0048126113,0.000052947573,0.99246716],"study_design_scores_gemma":[0.0006939987,0.00030912555,0.00039887952,0.00021383063,0.000010637447,0.000070787006,2.020576e-7,0.9071699,0.00056396995,0.07510694,0.014461904,0.0009998254],"about_ca_topic_score_codex":0.00004564953,"about_ca_topic_score_gemma":0.00021029147,"teacher_disagreement_score":0.99146736,"about_ca_system_score_codex":0.00024293743,"about_ca_system_score_gemma":0.0007860937,"threshold_uncertainty_score":0.9997475},"labels":[],"label_agreement":null},{"id":"W1514802406","doi":"10.1109/ccece.2015.7129360","title":"An integrated hardware platform for four different lightweight block ciphers","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Block cipher; Computer science; Block (permutation group theory); Embedded system; Computer hardware; Field-programmable gate array; Computer architecture; Operating system; Parallel computing; Encryption; Mathematics","score_opus":0.06455842939994365,"score_gpt":0.30413445926549276,"score_spread":0.2395760298655491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514802406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17221148,0.000022937063,0.8247149,0.0007170543,0.0004197957,0.00036775466,0.000019995776,0.0002559706,0.0012701047],"genre_scores_gemma":[0.9359705,0.0000038296785,0.06338946,0.00028148136,0.000058184713,0.000060918075,0.000044725763,0.0000083907025,0.00018252073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989889,0.000019187693,0.00021358223,0.00029157262,0.00021379435,0.00027295123],"domain_scores_gemma":[0.99904317,0.000040358856,0.000050509818,0.00042148482,0.00020582243,0.00023863045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017986102,0.00013891,0.00013761765,0.00011423193,0.00012754009,0.00024000679,0.0005701651,0.00004668842,0.000045283734],"category_scores_gemma":[0.000012968238,0.000097984026,0.00007719568,0.00028316764,0.000020335588,0.00049916195,0.00007347795,0.00006789588,0.000008781537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005956723,0.0005768192,0.005079005,0.000024119983,0.000110897694,0.000011365263,0.006475947,0.000058564863,0.0005087342,0.8205872,0.056291517,0.11021625],"study_design_scores_gemma":[0.0061724265,0.0024126312,0.0046046926,0.000031123407,0.000052405434,0.00004773902,0.0064936066,0.38030452,0.011551627,0.06708274,0.5199316,0.0013148877],"about_ca_topic_score_codex":0.00009139152,"about_ca_topic_score_gemma":0.0005557278,"teacher_disagreement_score":0.763759,"about_ca_system_score_codex":0.000045992274,"about_ca_system_score_gemma":0.00007028238,"threshold_uncertainty_score":0.39956725},"labels":[],"label_agreement":null},{"id":"W1515843655","doi":"10.1109/isscs.2015.7203995","title":"An embedded low-overhead PLL-based countermeasure against DPA side channel attack","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Power analysis; Computer science; Encryption; Side channel attack; Advanced Encryption Standard; Embedded system; Overhead (engineering); Countermeasure; Phase-locked loop; Cryptography; Computer network; Engineering; Computer security; Telecommunications","score_opus":0.05886492215506703,"score_gpt":0.32396638318440263,"score_spread":0.2651014610293356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515843655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3824266,0.000036786267,0.6097512,0.0008662577,0.0005278723,0.00029563875,0.000023695782,0.0003712032,0.00570071],"genre_scores_gemma":[0.9860504,0.0000030634824,0.010823731,0.0029117912,0.00008093799,0.000021452044,0.00004619596,0.000011559782,0.000050871105],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825704,0.000096471485,0.00028193128,0.00043761916,0.0005366354,0.00039028763],"domain_scores_gemma":[0.9984537,0.00004144409,0.00008170214,0.00081047567,0.00028545875,0.00032724594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053380075,0.00018557956,0.00017646224,0.00016341372,0.00015224138,0.00032086956,0.00077190064,0.000066032204,0.00003733283],"category_scores_gemma":[0.000026220465,0.00016659405,0.00008498788,0.00050287147,0.000056966073,0.00071958324,0.00008288345,0.000119637516,0.00006715618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005160927,0.009396331,0.029034676,0.0004279334,0.0005438631,0.0006726942,0.07400449,0.05372648,0.0150041,0.27663627,0.4130897,0.12694739],"study_design_scores_gemma":[0.0032465141,0.00047274024,0.0042676292,0.000036605656,0.000012421087,0.000010392503,0.0015204864,0.97480184,0.002914027,0.0026580957,0.009338666,0.0007205939],"about_ca_topic_score_codex":0.00011555621,"about_ca_topic_score_gemma":0.0006135496,"teacher_disagreement_score":0.92107534,"about_ca_system_score_codex":0.00005868202,"about_ca_system_score_gemma":0.00024351552,"threshold_uncertainty_score":0.6793508},"labels":[],"label_agreement":null},{"id":"W152417178","doi":"10.1007/978-3-642-31513-8_13","title":"An Obfuscated Implementation of RC4","year":2012,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Oracle; Bytecode; Obfuscation; Software; Stream cipher; RC4; Encryption; Operating system; Embedded system; Software engineering; Computer security; Virtual machine","score_opus":0.023168646641933327,"score_gpt":0.3299857443982166,"score_spread":0.3068170977562833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152417178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008126459,0.055518042,0.91148597,0.000028434102,0.002138393,0.0011980486,0.00004108159,0.00013690097,0.021326661],"genre_scores_gemma":[0.99223775,0.0034318203,0.0038021689,0.00002035495,0.00014061705,0.00000891017,0.000046165213,0.000020413552,0.00029180243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821734,0.00004627581,0.0008321063,0.00038429833,0.00025626208,0.00026372654],"domain_scores_gemma":[0.998801,0.00009822289,0.0005442374,0.00037049572,0.0001077664,0.0000782741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048796096,0.00023428266,0.00037583636,0.00031996815,0.00009295556,0.00008389399,0.00038059385,0.00009442758,0.00004161522],"category_scores_gemma":[0.000002366738,0.00023281162,0.000063235886,0.00010945883,0.00005359608,0.0005229507,0.00014559392,0.00016394902,0.000002978678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014016462,0.000017242588,0.001921729,0.00012669887,0.000016832999,0.0000017094058,0.0014342737,0.0001887633,0.000011272999,0.67753625,0.000006123157,0.31873772],"study_design_scores_gemma":[0.0024262976,0.0018058153,0.006692555,0.004155897,0.00020274123,0.00024622367,0.013955511,0.14117187,0.0011935433,0.12924284,0.694558,0.0043486576],"about_ca_topic_score_codex":0.0002981086,"about_ca_topic_score_gemma":0.00020025129,"teacher_disagreement_score":0.9841113,"about_ca_system_score_codex":0.000045004253,"about_ca_system_score_gemma":0.00003151245,"threshold_uncertainty_score":0.94937825},"labels":[],"label_agreement":null},{"id":"W1526991611","doi":"10.1007/978-3-642-37119-6_22","title":"A Case Study of Side-Channel Analysis Using Decoupling Capacitor Power Measurement with the OpenADC","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Decoupling capacitor; Decoupling (probability); Side channel attack; Capacitor; Electronic engineering; Computer science; Electrical engineering; Engineering; Control engineering; Algorithm; Voltage","score_opus":0.05616553117984636,"score_gpt":0.28381358671472123,"score_spread":0.22764805553487488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526991611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09647675,0.0001044101,0.9019952,0.000106256004,0.00031498645,0.0008901836,0.0000035640542,0.000029336406,0.000079314814],"genre_scores_gemma":[0.93268037,0.0000022733395,0.067058735,0.00016099404,0.000058860973,0.00001753797,6.540035e-7,0.000015661912,0.000004920274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961268,0.000062220075,0.00059420365,0.0010925605,0.0016442045,0.0004800659],"domain_scores_gemma":[0.9967465,0.00026573625,0.00048640283,0.001521932,0.0008582125,0.00012121599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016007025,0.00042928744,0.0005859289,0.0012451366,0.00057013,0.0005858021,0.0019616983,0.00010120911,0.000025599418],"category_scores_gemma":[0.000025168996,0.0002807801,0.00016035106,0.00209578,0.0004352716,0.00046799573,0.0007895673,0.00045911432,0.0000016568662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028629715,0.0008417565,0.0014332708,0.00009039989,0.0019840144,0.0027406977,0.10708387,0.75399965,0.00034602016,0.0063405265,0.00002604518,0.12508512],"study_design_scores_gemma":[0.000626514,0.00068299245,0.00021813065,0.00011879627,0.00032521432,0.0006366225,0.0001593806,0.99187964,0.00015746357,0.004467458,0.000029563742,0.00069824664],"about_ca_topic_score_codex":0.001973618,"about_ca_topic_score_gemma":0.008723598,"teacher_disagreement_score":0.83620363,"about_ca_system_score_codex":0.00020831237,"about_ca_system_score_gemma":0.00037814476,"threshold_uncertainty_score":0.9999644},"labels":[],"label_agreement":null},{"id":"W1531789551","doi":"10.1007/11506447_5","title":"Refined Analysis of Bounds Related to Linear and Differential Cryptanalysis for the AES","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Upper and lower bounds; Mathematics; Linear cryptanalysis; Value (mathematics); Combinatorics; Cryptanalysis; Algorithm; Discrete mathematics; Statistics; Mathematical analysis; Cryptography","score_opus":0.016803766238044155,"score_gpt":0.28802413530138127,"score_spread":0.27122036906333713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531789551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022076245,0.0002879047,0.9948183,0.001883866,0.00029447553,0.00036322034,0.000031394608,0.000034432494,0.00007880051],"genre_scores_gemma":[0.68065864,0.00010803255,0.31819347,0.0007309065,0.0001265677,0.000022339802,0.000023172972,0.000017064882,0.000119824006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749404,0.000024453895,0.00061831146,0.00090300216,0.0006050915,0.00035509764],"domain_scores_gemma":[0.99752903,0.0007784016,0.00027669617,0.0010242156,0.00028807987,0.00010360294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006420189,0.0002968871,0.00058749254,0.0018645413,0.00035173804,0.00030096402,0.0016278663,0.00014326819,0.00004243454],"category_scores_gemma":[0.0000686255,0.00021488988,0.00032041623,0.0025347448,0.0004352456,0.00018675308,0.0006725872,0.00025628708,9.762604e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000175949,0.00004501464,0.00034345602,0.000019720404,0.0007759474,0.0000032377952,0.002843148,0.036442213,0.000164913,0.09420324,0.000027828524,0.8651137],"study_design_scores_gemma":[0.00025154077,0.00014307268,0.0024899053,0.000034383847,0.00048283738,0.0000031803668,8.765778e-7,0.969645,0.00016969029,0.024599819,0.0018659948,0.00031369066],"about_ca_topic_score_codex":0.000059819173,"about_ca_topic_score_gemma":0.001019411,"teacher_disagreement_score":0.9332028,"about_ca_system_score_codex":0.000065777036,"about_ca_system_score_gemma":0.00012710808,"threshold_uncertainty_score":0.8762955},"labels":[],"label_agreement":null},{"id":"W1533428031","doi":"10.1007/978-3-540-85053-3_8","title":"A Lightweight Concurrent Fault Detection Scheme for the AES S-Boxes Using Normal Basis","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Polynomial basis; Basis (linear algebra); Field-programmable gate array; Advanced Encryption Standard; Overhead (engineering); Normal basis; Algorithm; Fault detection and isolation; Polynomial; Representation (politics); Binary number; Realization (probability); Parallel computing; Embedded system; Mathematics; Arithmetic; Artificial intelligence; Cryptography; Discrete mathematics; Galois theory; Statistics","score_opus":0.034083789874908836,"score_gpt":0.2873423837770239,"score_spread":0.2532585939021151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533428031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078602246,0.0010095277,0.9943764,0.00051215827,0.0023610785,0.00073522906,0.00001822467,0.000095920106,0.00010542468],"genre_scores_gemma":[0.50308335,0.0004044705,0.49417868,0.0011283942,0.0010304145,0.00007007047,0.000010454896,0.000043625834,0.000050537903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970163,0.00002858497,0.00051961053,0.0010403963,0.00078143046,0.00061366585],"domain_scores_gemma":[0.99767363,0.00068307796,0.0003053649,0.00087788334,0.00035090692,0.00010915177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061538885,0.0004321043,0.00035839799,0.0006494184,0.0011744486,0.00054546853,0.0020733778,0.00019376847,0.000016319398],"category_scores_gemma":[0.00005222742,0.00032240723,0.00024888577,0.000736073,0.00066113914,0.00058912736,0.0006909231,0.00050976593,0.0000044131802],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071184163,0.000036043784,0.000061523075,0.000037141017,0.000035073226,0.000013019845,0.0019058187,0.004743497,0.0004037232,0.011994509,0.000052010353,0.9807105],"study_design_scores_gemma":[0.0004100064,0.00017360465,0.000119499804,0.00011324302,0.000020965539,0.00012643829,9.50409e-7,0.96777785,0.0048883166,0.010231708,0.015577458,0.0005599582],"about_ca_topic_score_codex":0.000077925324,"about_ca_topic_score_gemma":0.00039716414,"teacher_disagreement_score":0.9801506,"about_ca_system_score_codex":0.00019361991,"about_ca_system_score_gemma":0.00037084246,"threshold_uncertainty_score":0.9999228},"labels":[],"label_agreement":null},{"id":"W1539010212","doi":"10.1002/sec.674","title":"Wireless security: securing mobile UMTS communications from interoperation of GSM","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Roaming; Computer network; Wireless network; GSM; UMTS frequency bands; Computer security; Interoperation; Cellular network; Wireless; Telecommunications","score_opus":0.015928027057280525,"score_gpt":0.27251818799445293,"score_spread":0.2565901609371724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539010212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8686969,0.018380908,0.10922371,0.0009233841,0.00027362278,0.00060705614,0.000047652986,0.00019396495,0.001652807],"genre_scores_gemma":[0.98746157,0.006005574,0.0059073493,0.00020370996,0.0000615938,0.00010312486,0.00024264515,0.000012046769,0.0000024099425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998209,0.00048538242,0.0005433624,0.0002402317,0.00020880021,0.0003132406],"domain_scores_gemma":[0.9967607,0.00036709217,0.00028015327,0.0022737281,0.00017215271,0.00014615047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007257317,0.00018510754,0.0002617158,0.00012288397,0.0005198369,0.00016269491,0.0015407982,0.00013540003,0.000034024586],"category_scores_gemma":[0.000015021034,0.00019668539,0.00008453426,0.0004923242,0.00025570838,0.001162687,0.0014261684,0.0004348814,0.000003813499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023870809,0.0009997572,0.014664,0.00004923527,0.00016066452,3.839423e-7,0.094694875,0.000092627335,0.00025799422,0.82969934,0.0006972888,0.05865994],"study_design_scores_gemma":[0.001811477,0.00020260898,0.010167924,0.0003091084,0.000116123454,0.000022277118,0.008932762,0.8733402,0.0013529988,0.06897926,0.033723276,0.001041997],"about_ca_topic_score_codex":0.0005519713,"about_ca_topic_score_gemma":0.00066199584,"teacher_disagreement_score":0.87324756,"about_ca_system_score_codex":0.00003212458,"about_ca_system_score_gemma":0.000025378786,"threshold_uncertainty_score":0.8020597},"labels":[],"label_agreement":null},{"id":"W1539170589","doi":"10.1109/ccece.1997.614854","title":"A new criterion for the design of 8×8 S-boxes in private-key ciphers","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Linear cryptanalysis; Block cipher; Differential cryptanalysis; Higher-order differential cryptanalysis; S-box; Impossible differential cryptanalysis; Key schedule; Cryptanalysis; Key (lock); Computer science; Permutation (music); Differential (mechanical device); Boomerang attack; Cryptography; Mathematics; Theoretical computer science; Algorithm; Computer security; Engineering; Physics","score_opus":0.06892890081614052,"score_gpt":0.29703180115643335,"score_spread":0.22810290034029285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539170589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003744767,0.00009921319,0.9939617,0.0015595554,0.00006436858,0.00029702228,7.5030795e-7,0.000019081923,0.00025356584],"genre_scores_gemma":[0.61158615,0.00004578098,0.3880669,0.00020849143,0.000012158037,0.000022598671,3.2996266e-7,0.0000024256412,0.000055195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995117,0.00002469889,0.00015088046,0.00010793439,0.000086680506,0.000118080585],"domain_scores_gemma":[0.9995231,0.00019605718,0.000032676366,0.00020517637,0.000021206117,0.000021795275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019958688,0.00004664538,0.000061407736,0.00006376925,0.000048203416,0.00004705944,0.0003293205,0.000015017803,0.00017138285],"category_scores_gemma":[0.000016516697,0.000031156396,0.000035362642,0.000327403,0.000015618927,0.00015652132,0.000044535387,0.000026079219,0.0000017793335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007860324,0.00006879142,0.001031428,0.000011262533,0.000013855745,7.03287e-7,0.00674842,0.00026006307,0.0011097916,0.85659784,0.012315805,0.121834196],"study_design_scores_gemma":[0.0021657064,0.000456909,0.011440845,0.000026776726,0.000013742002,0.0000054952043,0.0008291926,0.8885668,0.0043861177,0.0561713,0.035635006,0.0003020966],"about_ca_topic_score_codex":0.00017877277,"about_ca_topic_score_gemma":0.000094006275,"teacher_disagreement_score":0.88830674,"about_ca_system_score_codex":0.000004879928,"about_ca_system_score_gemma":0.000010634473,"threshold_uncertainty_score":0.18765222},"labels":[],"label_agreement":null},{"id":"W1545338196","doi":"10.1109/pacrim.2003.1235842","title":"DSP security communication designing and implementation","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Encryption; Message authentication code; Computer network; Password; Authentication (law); Public-key cryptography; Communication source; Embedded system; Cryptography; Computer hardware; Computer security","score_opus":0.014333765961474908,"score_gpt":0.3034782634890618,"score_spread":0.2891444975275869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545338196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28055856,0.00008767909,0.7166139,0.0015905407,0.000026191894,0.00015702037,0.0000012411468,0.00009872596,0.00086617004],"genre_scores_gemma":[0.8653583,0.000062938874,0.13428873,0.00025795161,0.0000052021724,0.000013850305,0.000009155173,0.0000020565842,0.0000018075466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994448,0.000036132024,0.00014334124,0.0001473632,0.00010631674,0.00012205132],"domain_scores_gemma":[0.9995765,0.000030871455,0.0000428159,0.0002654361,0.000040848765,0.00004349057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000255687,0.000058382542,0.000052192518,0.00007498296,0.00023421294,0.00015452188,0.00021439449,0.000017092381,0.000032516527],"category_scores_gemma":[0.000003873479,0.000056824505,0.0000180939,0.00023213879,0.000027161492,0.00053733436,0.0001350547,0.00005165517,0.000004081592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8748994e-7,0.000022510401,0.002006226,0.00000361041,0.0000059595404,3.938203e-7,0.0047425376,0.000007384407,0.0003454461,0.9781271,0.00012375324,0.014614363],"study_design_scores_gemma":[0.0029119535,0.00016786323,0.057122793,0.000016803499,0.000014702063,0.000039547864,0.0053426926,0.0020704977,0.016196907,0.9129575,0.0027430635,0.00041565983],"about_ca_topic_score_codex":0.00054917875,"about_ca_topic_score_gemma":0.0006835008,"teacher_disagreement_score":0.58479977,"about_ca_system_score_codex":0.000022370827,"about_ca_system_score_gemma":0.000027046528,"threshold_uncertainty_score":0.2317236},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Hash function; Computer science; Mathematics; Computer security","score_opus":0.06384997702380152,"score_gpt":0.3182864825069628,"score_spread":0.25443650548316127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549228503","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021045598,0.00013355644,0.99575555,0.00038936394,0.0015599536,0.00095446955,0.000012930698,0.00015463469,0.0010184867],"genre_scores_gemma":[0.0119096525,0.000015267615,0.98619515,0.0010661519,0.00033927773,0.000045106968,0.000013630928,0.000026366033,0.00038940134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695796,0.000020524554,0.0004981021,0.0011826806,0.00066286745,0.00067785115],"domain_scores_gemma":[0.99746954,0.0007623684,0.00021409869,0.0010667222,0.0003311717,0.00015607812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015337073,0.0003743195,0.0003394175,0.0011210801,0.00052331865,0.00050057564,0.00194803,0.00021721689,0.000032816995],"category_scores_gemma":[0.00006192852,0.00035768258,0.00016305788,0.0007781311,0.00039596407,0.0004305596,0.0006052939,0.0004222629,0.000019290383],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012352213,0.00005656954,0.000026087737,0.000034397675,0.000020865798,0.000021922318,0.00088936253,0.012793155,0.00008172824,0.21919851,0.00013760754,0.76672745],"study_design_scores_gemma":[0.000655267,0.0004569765,0.00009877747,0.00012999876,0.000017806464,0.000060583643,3.682826e-7,0.602838,0.00072172977,0.3602792,0.033899315,0.0008420072],"about_ca_topic_score_codex":0.000013775246,"about_ca_topic_score_gemma":0.00016305316,"teacher_disagreement_score":0.7658854,"about_ca_system_score_codex":0.0001976921,"about_ca_system_score_gemma":0.00055473356,"threshold_uncertainty_score":0.9998875},"labels":[],"label_agreement":null},{"id":"W1561524127","doi":"10.1007/3-540-44983-3_3","title":"Cryptanalysis of the “Augmented Family of Cryptographic Parity Circuits” Proposed at ISW’97","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Computer science; Cryptanalysis; Parity (physics); Theoretical computer science; Computer network; Computer security; Physics; Atomic physics","score_opus":0.02339848208814529,"score_gpt":0.2542922281309676,"score_spread":0.23089374604282228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561524127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009975121,0.0005296849,0.9855671,0.00037198394,0.00074559834,0.00066384743,0.000027747694,0.000055939243,0.0020629817],"genre_scores_gemma":[0.95235604,0.0001804872,0.046732903,0.00052583136,0.00008391934,0.000009084174,0.000008653056,0.000025136902,0.00007792997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99524176,0.000105694926,0.0011077364,0.0012223846,0.0017243078,0.00059810013],"domain_scores_gemma":[0.9957301,0.00034561363,0.00095101714,0.0022508206,0.00059243676,0.0001299868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001111598,0.000502902,0.00079279684,0.001306989,0.0004005255,0.00014993636,0.004178682,0.0002636132,0.00007138008],"category_scores_gemma":[0.000068064,0.00038167273,0.0005522901,0.0033326822,0.0016669515,0.00032213598,0.001817171,0.0005849971,0.000004171954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032328153,0.0005483375,0.01939313,0.00039124492,0.00040823617,0.00005775318,0.0048555587,0.010273909,0.010453243,0.22718875,0.00010510689,0.72629243],"study_design_scores_gemma":[0.0026358624,0.00089175283,0.03937276,0.0014735983,0.00035314925,0.00011443981,0.000008655327,0.29259834,0.019715643,0.63489586,0.005247168,0.002692763],"about_ca_topic_score_codex":0.0002174038,"about_ca_topic_score_gemma":0.0006917294,"teacher_disagreement_score":0.9423809,"about_ca_system_score_codex":0.00018786895,"about_ca_system_score_gemma":0.00047853647,"threshold_uncertainty_score":0.9998635},"labels":[],"label_agreement":null},{"id":"W1568460842","doi":"10.1002/9781118468654.ch13","title":"Advanced Encryption Standard (AES) Implementation in Embedded Systems","year":2012,"lang":"en","type":"other","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Advanced Encryption Standard; AES implementations; Encryption; Computer science; Encryption software; Embedded system; Operating system; Computer security; Disk encryption; Multiple encryption","score_opus":0.011404823486183619,"score_gpt":0.31275219438371243,"score_spread":0.30134737089752883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568460842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002630989,0.0012364073,0.7635444,0.00010405854,0.0017335068,0.0014102068,0.000105710176,0.0005230402,0.23107961],"genre_scores_gemma":[0.41022426,0.0029361083,0.36602816,0.00076045626,0.0018311421,0.0021192245,0.0021625373,0.001211865,0.21272624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983495,0.00012223888,0.00039452998,0.00037606602,0.00037435407,0.00038329524],"domain_scores_gemma":[0.9991284,0.000028739038,0.0002374336,0.0004863577,0.000039331164,0.00007971785],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043704736,0.00022491052,0.00027329155,0.0006619251,0.000047086964,0.00014543023,0.00038969633,0.00012783606,0.002414829],"category_scores_gemma":[0.0000042750207,0.00021399283,0.00006371735,0.0005330279,0.000018519066,0.00035510014,0.0001043127,0.00012491336,0.00006561949],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088482,0.00008852823,0.0015649693,0.00014583649,0.00005431932,0.0000061872724,0.0015060105,0.000012642033,0.00012328358,0.62223494,0.24126618,0.13298829],"study_design_scores_gemma":[0.0018104267,0.000101958714,0.0007763058,0.00011283739,0.000016937885,0.0000070906112,0.0016975843,0.0009637409,0.000089173096,0.001343468,0.9924591,0.00062134664],"about_ca_topic_score_codex":0.0011247637,"about_ca_topic_score_gemma":0.0027479106,"teacher_disagreement_score":0.7511929,"about_ca_system_score_codex":0.000102456266,"about_ca_system_score_gemma":0.0000663198,"threshold_uncertainty_score":0.9984971},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03831357667032488,"score_gpt":0.3279951763168643,"score_spread":0.28968159964653944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568642505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025851394,0.00015010186,0.99195915,0.0033139593,0.0017483719,0.0021934635,0.00003288951,0.000105986655,0.00047023047],"genre_scores_gemma":[0.0019640382,0.00002000853,0.9954736,0.0014298633,0.000775131,0.000079365826,0.000015863923,0.000029447074,0.0002126665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637216,0.000050562838,0.00061326777,0.001494822,0.0006508113,0.0008184023],"domain_scores_gemma":[0.996016,0.0017738062,0.0002886253,0.001423424,0.00032814103,0.00016995163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025436422,0.0004723647,0.00047250447,0.0004837743,0.0008538004,0.0007864781,0.00304513,0.00022964433,0.000037380512],"category_scores_gemma":[0.0001796398,0.00035425072,0.00037498475,0.000683318,0.0003171403,0.00044974513,0.0007589692,0.0005022859,0.000004091449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014243081,0.00002777479,0.000051555686,0.000060097354,0.000020477535,0.000003771363,0.0016107567,0.0061563295,0.00003293976,0.25009587,0.00019028736,0.7417359],"study_design_scores_gemma":[0.00034461563,0.00015487616,0.000023590472,0.000057431807,0.00001225201,0.000025738602,5.0014233e-7,0.32930416,0.00019670729,0.62547266,0.044075552,0.0003318983],"about_ca_topic_score_codex":0.00008714689,"about_ca_topic_score_gemma":0.0004245716,"teacher_disagreement_score":0.741404,"about_ca_system_score_codex":0.00021800831,"about_ca_system_score_gemma":0.0007096256,"threshold_uncertainty_score":0.9998909},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01465318112726333,"score_gpt":0.24424403187736862,"score_spread":0.2295908507501053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571203384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041708534,0.00019051351,0.99571025,0.0003185721,0.00039720882,0.00022644277,0.000009581827,0.000042864594,0.0026874675],"genre_scores_gemma":[0.7180071,0.00026889076,0.2804633,0.0010958299,0.00008994039,0.0000054894344,0.000014085891,0.000012156976,0.000043217195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982769,0.000016975973,0.00046069841,0.00042654658,0.0005584658,0.00026041342],"domain_scores_gemma":[0.9986195,0.0002722946,0.00027987402,0.0005817712,0.00016570884,0.00008085973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038629162,0.00022989298,0.0002823954,0.0008339043,0.00016173594,0.00024350938,0.0010230463,0.00013414309,0.000037528564],"category_scores_gemma":[0.000036681315,0.00020571597,0.000058866317,0.00039002034,0.00045192768,0.0013849968,0.0007461569,0.00031848016,0.000007352443],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027080341,0.000017038083,0.00008890251,0.000059473183,0.000005864063,0.0000053009244,0.0024545307,0.0011323642,0.0000543973,0.15323755,0.000049122737,0.84289277],"study_design_scores_gemma":[0.0007585267,0.00033004157,0.0013842746,0.0005744911,0.000010741481,0.00007998313,0.000001518103,0.81782883,0.001207467,0.16229887,0.014781933,0.0007433196],"about_ca_topic_score_codex":0.000025758185,"about_ca_topic_score_gemma":0.000022772592,"teacher_disagreement_score":0.84214944,"about_ca_system_score_codex":0.000048721904,"about_ca_system_score_gemma":0.00007516873,"threshold_uncertainty_score":0.83888537},"labels":[],"label_agreement":null},{"id":"W1575067034","doi":"10.1109/ccece.2015.7129359","title":"Hardware implementation of a high speed self-synchronizing cipher mode","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Block cipher mode of operation; Computer science; Cipher; Block cipher; Encryption; Synchronization (alternating current); Synchronizing; Stream cipher; Throughput; Triple DES; Embedded system; Advanced Encryption Standard; Block size; Parallel computing; Computer hardware; Transmission (telecommunications); Computer network; Channel (broadcasting); Key (lock); Wireless; Computer security; Operating system","score_opus":0.03350570467483266,"score_gpt":0.321343222419344,"score_spread":0.28783751774451133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575067034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5323276,0.00002272473,0.46538836,0.00046932293,0.00017007125,0.00018044224,0.000009534917,0.0001425807,0.0012893373],"genre_scores_gemma":[0.8823523,0.000003952139,0.11746396,0.00011099024,0.000025821291,0.000005617339,0.000012575205,0.0000043817486,0.000020376268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990409,0.000038497143,0.00025538134,0.00019786201,0.0002836693,0.00018370227],"domain_scores_gemma":[0.9993303,0.00001940421,0.00008956945,0.00030082866,0.00017409815,0.00008578821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021894682,0.000083914914,0.000113528484,0.00010972687,0.000053907224,0.00006795467,0.0003058037,0.000022713992,0.00016203994],"category_scores_gemma":[0.0000048944626,0.00007705176,0.00004570605,0.00039676193,0.000014495383,0.0004493509,0.00013788058,0.000040625047,0.000011520674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072204293,0.00019944139,0.014508919,0.000036139118,0.000105577885,0.000006547998,0.018333087,0.00021306079,0.0012465329,0.9164597,0.012171973,0.03671181],"study_design_scores_gemma":[0.021029288,0.0021649345,0.08477863,0.000070294,0.00020786059,0.00009184846,0.04392941,0.44018427,0.13075666,0.23489925,0.039241757,0.0026458],"about_ca_topic_score_codex":0.002722033,"about_ca_topic_score_gemma":0.00069777766,"teacher_disagreement_score":0.68156046,"about_ca_system_score_codex":0.000047806745,"about_ca_system_score_gemma":0.00012747533,"threshold_uncertainty_score":0.41149178},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012792181382167284,"score_gpt":0.2376381325575098,"score_spread":0.2248459511753425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579585272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003780961,0.00016450736,0.99366844,0.00016634843,0.00038791168,0.00031715058,0.00008601994,0.00009290712,0.001335756],"genre_scores_gemma":[0.78421617,0.000014488094,0.21517411,0.00018418011,0.00011155939,0.000016177708,0.000117041825,0.000025250623,0.00014105307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964007,0.00003791477,0.0006405385,0.0012286598,0.0011405555,0.000551636],"domain_scores_gemma":[0.99699277,0.00016740256,0.00046541067,0.0019258171,0.0003305637,0.000118024785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055775116,0.00043682999,0.0007233518,0.0028168587,0.00035854208,0.00040939942,0.0025421544,0.00020014415,0.00006174642],"category_scores_gemma":[0.000026286438,0.00037592603,0.00026636716,0.0034811918,0.00055189733,0.00051722326,0.0010546368,0.00052623777,0.0000020628736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057101443,0.00088689197,0.046639457,0.0003976209,0.0025130066,0.00018487654,0.009320081,0.29139274,0.0003187578,0.32588276,0.0010292269,0.3213775],"study_design_scores_gemma":[0.0011367664,0.0005517443,0.008629722,0.00040117503,0.00086474704,0.000034137942,0.0000030475062,0.7411015,0.0005307321,0.24263473,0.002535988,0.0015757114],"about_ca_topic_score_codex":0.00031562144,"about_ca_topic_score_gemma":0.0030414748,"teacher_disagreement_score":0.7804352,"about_ca_system_score_codex":0.00014277022,"about_ca_system_score_gemma":0.00027336305,"threshold_uncertainty_score":0.9998693},"labels":[],"label_agreement":null},{"id":"W1580114946","doi":"10.1007/978-3-642-05445-7_13","title":"Differential Fault Analysis of Rabbit","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Stream cipher; Initialization; Parallel computing; Cipher; Algorithm; Byte; Fault (geology); Cryptography; Computer hardware; Computer network; Programming language; Encryption","score_opus":0.01620402093800464,"score_gpt":0.27131964388447216,"score_spread":0.2551156229464675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580114946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014256343,0.00013165838,0.99615735,0.0002671565,0.0005073084,0.00020194391,0.000017451048,0.0000612425,0.0012302559],"genre_scores_gemma":[0.81579405,0.000062310726,0.1833265,0.00053547363,0.00014191045,0.0000036951087,0.00003033076,0.000012796636,0.000092960996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687594,0.000027694641,0.0006303215,0.0010409183,0.0009816326,0.00044346196],"domain_scores_gemma":[0.9978023,0.00023445263,0.0003519817,0.0012445765,0.00025091667,0.00011575456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003717123,0.00035876484,0.0006937284,0.0027099487,0.00016462045,0.00027707484,0.0024614416,0.00018781365,0.00011903557],"category_scores_gemma":[0.000024573446,0.00032558365,0.00037063198,0.002432494,0.0004329221,0.00030841265,0.0006224411,0.00040711908,0.00000393225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038501466,0.000058789294,0.00019939076,0.000013863311,0.00014790086,0.000019410298,0.0009839059,0.010640549,0.00020146264,0.112883545,0.00001048694,0.87483686],"study_design_scores_gemma":[0.0003936087,0.00024950432,0.0046538385,0.00010289187,0.00024703,0.000010332272,3.100216e-7,0.8218479,0.0013445015,0.16925175,0.0011536705,0.00074464956],"about_ca_topic_score_codex":0.00005320608,"about_ca_topic_score_gemma":0.00032191307,"teacher_disagreement_score":0.8740922,"about_ca_system_score_codex":0.00009209726,"about_ca_system_score_gemma":0.00021354434,"threshold_uncertainty_score":0.9999196},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01569831564602385,"score_gpt":0.2671285648309102,"score_spread":0.2514302491848863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583090871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009864604,0.0001402542,0.9885509,0.00042495882,0.0002659247,0.0002284539,0.00002677474,0.000051844247,0.00044630733],"genre_scores_gemma":[0.8623996,0.000033701308,0.13610336,0.0013146531,0.00009023525,0.000005821864,0.000013808519,0.0000139282865,0.000024898003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706376,0.00003409175,0.0005279209,0.0011136857,0.0008592238,0.00040131042],"domain_scores_gemma":[0.9978011,0.0004662651,0.0003180276,0.001082937,0.00020104107,0.00013059982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006528401,0.00036800903,0.0006128229,0.002537012,0.00018908498,0.00030031617,0.001519109,0.00016973312,0.00003811389],"category_scores_gemma":[0.000021891596,0.00033439262,0.0002112394,0.001972022,0.00052188267,0.00023721825,0.00044260672,0.0003887193,0.0000029452226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103551865,0.00008635669,0.00075570826,0.000034002074,0.000124198,0.000022797036,0.0016155867,0.027758414,0.000074662035,0.06662798,0.000013168002,0.9028768],"study_design_scores_gemma":[0.00041625096,0.00025933023,0.0035828387,0.00014668811,0.00011004167,0.000005621028,5.9496483e-7,0.9754753,0.00069045613,0.018154342,0.00062201807,0.0005364873],"about_ca_topic_score_codex":0.00005234537,"about_ca_topic_score_gemma":0.0008968869,"teacher_disagreement_score":0.9477169,"about_ca_system_score_codex":0.000099615216,"about_ca_system_score_gemma":0.0002686609,"threshold_uncertainty_score":0.99991083},"labels":[],"label_agreement":null},{"id":"W1588631881","doi":"10.1109/isscs.2015.7203972","title":"Mixed-signal low-noise adder with constant power for side-channel attack immunity","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Adder; Computer science; Side channel attack; CMOS; Rendering (computer graphics); Noise immunity; Power consumption; Computer hardware; Channel (broadcasting); Electronic engineering; Embedded system; Power (physics); Cryptography; Telecommunications; Engineering; Computer security","score_opus":0.06047192993178569,"score_gpt":0.29315507435757565,"score_spread":0.23268314442578997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588631881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10740265,0.00004697362,0.8853521,0.00061853987,0.0002060586,0.00040430005,0.000028206108,0.00012062498,0.0058205444],"genre_scores_gemma":[0.96014816,0.0000022559905,0.039095752,0.000526354,0.000021287047,0.000047922105,0.00001617304,0.000008738396,0.00013337152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988392,0.000051688905,0.00022576097,0.0002769594,0.00027593973,0.0003304635],"domain_scores_gemma":[0.99880016,0.000119666925,0.00007184248,0.00045062084,0.00036407725,0.00019360783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043402583,0.0001480331,0.00015472817,0.00010755794,0.00017960285,0.00016960151,0.00043876717,0.00004014298,0.000109369736],"category_scores_gemma":[0.000019124487,0.00011061938,0.00007014029,0.0003528089,0.00009470115,0.00040783023,0.00014944068,0.00009237299,0.000019472875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024559372,0.0008934941,0.0017515069,0.000046669255,0.00022102184,0.00003557777,0.009553093,0.00034636442,0.00046615564,0.866289,0.11291337,0.0072381343],"study_design_scores_gemma":[0.04905482,0.012746429,0.017006565,0.00036057056,0.000286655,0.0006791123,0.061380014,0.35134783,0.02772172,0.2671898,0.20494014,0.007286359],"about_ca_topic_score_codex":0.0001258165,"about_ca_topic_score_gemma":0.00034951756,"teacher_disagreement_score":0.8527455,"about_ca_system_score_codex":0.000026154765,"about_ca_system_score_gemma":0.00019716607,"threshold_uncertainty_score":0.45109275},"labels":[],"label_agreement":null},{"id":"W1589435896","doi":"10.1002/9780470050118.ecse152","title":"Algorithm‐Based Fault‐Tolerant Cryptography","year":2009,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Computer Science and Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Checksum; Hash function; Fault tolerance; Cryptosystem; Algorithm; Redundancy (engineering); Cryptography; Overhead (engineering); Encryption; Error detection and correction; Parallel computing; Distributed computing; Computer network","score_opus":0.005453195885895181,"score_gpt":0.2179481397252952,"score_spread":0.2124949438394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589435896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010603678,0.0009124843,0.9868158,0.00008674896,0.0009069383,0.00024364535,0.000015100344,0.00033516088,0.010578091],"genre_scores_gemma":[0.0008538642,0.0012042377,0.99703115,0.00022109204,0.00035432653,0.000018430685,0.000009561287,0.00007677295,0.00023057159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773055,0.000014784122,0.00035108,0.00065484375,0.0007568275,0.0004919008],"domain_scores_gemma":[0.9988058,0.000044092594,0.00016661608,0.000644787,0.00012707937,0.00021162597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003974445,0.00033888768,0.00039260797,0.0015309112,0.00010538352,0.00019211623,0.001214255,0.00011571603,0.000022509443],"category_scores_gemma":[0.000011040262,0.0003271172,0.00010525956,0.001883018,0.00020476614,0.0003418385,0.00023399104,0.0001917714,0.0000030626586],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010110787,0.000105922016,0.00008660781,0.00014033471,0.000034266603,0.000020960182,0.00049270183,0.00084422546,0.00006878673,0.009535259,0.035697766,0.9529722],"study_design_scores_gemma":[0.00043223856,0.00017229846,0.0010161845,0.00039677272,0.000017142784,0.00001302272,0.0000049868527,0.5683421,0.00005369624,0.00039028443,0.42854235,0.0006189435],"about_ca_topic_score_codex":0.000071842675,"about_ca_topic_score_gemma":0.0000067920737,"teacher_disagreement_score":0.95235324,"about_ca_system_score_codex":0.000020459594,"about_ca_system_score_gemma":0.00019297439,"threshold_uncertainty_score":0.9999181},"labels":[],"label_agreement":null},{"id":"W1592516903","doi":"10.1109/ccece.2015.7129369","title":"Side channel power analysis of an AES-256 bootloader","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Advanced Encryption Standard; Side channel attack; Power analysis; Computer science; Initialization; Firmware; Cryptography; Byte; AES implementations; Encryption; Computer security; Code (set theory); Embedded system; Operating system; Programming language","score_opus":0.044410977064140995,"score_gpt":0.3156951412778902,"score_spread":0.27128416421374923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592516903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4635837,0.000034928857,0.5284776,0.0005118347,0.0001178566,0.00007608263,0.000007584447,0.000078237324,0.0071121454],"genre_scores_gemma":[0.98519176,0.0000014582741,0.014435007,0.00029320625,0.000007814221,0.0000035266198,0.000010108473,0.000002357113,0.000054779954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991684,0.000040459316,0.0001941559,0.00020077765,0.00024699335,0.00014920953],"domain_scores_gemma":[0.9991974,0.000021384412,0.000057096157,0.00045998496,0.00013913692,0.00012495165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030738735,0.00006766232,0.00014809977,0.00039755745,0.00003696732,0.000056544355,0.00037685837,0.000024208017,0.00010392986],"category_scores_gemma":[0.000011639313,0.00005642752,0.000099844285,0.0015590012,0.000026804631,0.0003778652,0.00009711087,0.00003519816,0.0000063733046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027777249,0.0012157273,0.015898915,0.000010969739,0.0018881914,0.000029084062,0.037986774,0.002722149,0.00095315115,0.9083842,0.0094283875,0.021454688],"study_design_scores_gemma":[0.00216644,0.0009941832,0.1512608,0.0000065813024,0.00057955243,0.000013197851,0.008152243,0.77409047,0.005524273,0.04413805,0.01214198,0.0009322696],"about_ca_topic_score_codex":0.00050070626,"about_ca_topic_score_gemma":0.0006083011,"teacher_disagreement_score":0.86424613,"about_ca_system_score_codex":0.000009501513,"about_ca_system_score_gemma":0.00003736563,"threshold_uncertainty_score":0.23010474},"labels":[],"label_agreement":null},{"id":"W1593464237","doi":"10.1007/3-540-45311-3_4","title":"A Parallel Algorithm for Extending Cryptographic Hash Functions","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Cryptographic hash function; Secure Hash Algorithm; SHA-2; Cryptography; Algorithm; Theoretical computer science; Domain (mathematical analysis); Double hashing; Function (biology); Parallel computing; Mathematics; Programming language","score_opus":0.027292006795435312,"score_gpt":0.2818817744945382,"score_spread":0.2545897676991029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593464237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018594461,0.00049689243,0.99416685,0.0006190828,0.0020688847,0.0008534675,0.00003700666,0.00022907599,0.0015101696],"genre_scores_gemma":[0.005621487,0.00017409911,0.992295,0.00091829407,0.0005747658,0.00010152211,0.000033788696,0.000041243195,0.00023978815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595535,0.000026777156,0.0006437993,0.0016464901,0.000815682,0.00091191876],"domain_scores_gemma":[0.99736774,0.0005082213,0.00029702153,0.0012593993,0.00034788996,0.00021974789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008927792,0.00055490405,0.0005116998,0.0018595164,0.0008304101,0.000831404,0.0023590736,0.0002754989,0.0000612073],"category_scores_gemma":[0.00003751478,0.00054302515,0.0003519132,0.0014509199,0.00060156046,0.00068590505,0.00071046635,0.00060514547,0.000016725584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002627615,0.000042171312,0.000032844247,0.00001611906,0.000021659615,0.00002349259,0.00031310206,0.0017658441,0.000014677839,0.079971805,0.00009846149,0.9176972],"study_design_scores_gemma":[0.0006416435,0.00025831378,0.00012815798,0.00014613535,0.000021230398,0.00010136106,8.877722e-7,0.56618196,0.00002534814,0.40757903,0.024154902,0.00076101924],"about_ca_topic_score_codex":0.000040154217,"about_ca_topic_score_gemma":0.00022027906,"teacher_disagreement_score":0.91693616,"about_ca_system_score_codex":0.00016544167,"about_ca_system_score_gemma":0.000371377,"threshold_uncertainty_score":0.99970216},"labels":[],"label_agreement":null},{"id":"W1602165982","doi":"10.1007/978-3-540-24631-2_2","title":"The Key Establishment Problem","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical proof; Presentation (obstetrics); Key (lock); Variety (cybernetics); Simple (philosophy); Cryptography; Subject (documents); Software engineering; Computer security; Artificial intelligence; World Wide Web; Epistemology; Mathematics; Philosophy","score_opus":0.015418231642717065,"score_gpt":0.25408909726074824,"score_spread":0.2386708656180312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602165982","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035068624,0.0004777516,0.9893013,0.0031048926,0.00124617,0.00053796946,0.000004630815,0.000119117816,0.0051730983],"genre_scores_gemma":[0.15569948,0.00040359926,0.8404846,0.0024204776,0.0005392666,0.00005783819,0.00001159194,0.000047359197,0.00033580215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996535,0.000026827533,0.0005232129,0.0011026681,0.0010969928,0.00071528176],"domain_scores_gemma":[0.9975684,0.00038096713,0.00024570388,0.0014262449,0.0002349768,0.00014368232],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011620264,0.0003957962,0.00028312765,0.00048735936,0.0008629159,0.0015737,0.0037739421,0.00015265452,0.000024888092],"category_scores_gemma":[0.000031679672,0.00028342876,0.00013662936,0.0007908613,0.00076669577,0.00054141285,0.0013372662,0.0006519643,0.000023616965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015446385,0.00001816066,0.000020503205,0.0000114270815,0.000007859654,0.000021873631,0.0011733621,0.0035341263,0.000008704597,0.5253786,0.000037861304,0.46978596],"study_design_scores_gemma":[0.0003039038,0.00014943036,0.000111370384,0.00016072764,0.0000059177796,0.00003786514,4.8920214e-7,0.030116566,0.00020227759,0.94585425,0.022562595,0.0004946338],"about_ca_topic_score_codex":0.000076282646,"about_ca_topic_score_gemma":0.00047873746,"teacher_disagreement_score":0.46929133,"about_ca_system_score_codex":0.0003484697,"about_ca_system_score_gemma":0.0008391508,"threshold_uncertainty_score":0.9999618},"labels":[],"label_agreement":null},{"id":"W1602957389","doi":"10.1007/11693383_6","title":"An Attack on CFB Mode Encryption as Used by OpenPGP","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Entrust (Canada)","funders":"","keywords":"Computer science; Encryption; Mode (computer interface); Computer security; Operating system","score_opus":0.029212092405749367,"score_gpt":0.3191329677446313,"score_spread":0.28992087533888194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602957389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030561564,0.000088188164,0.99064404,0.0005884178,0.00090672204,0.0005004704,0.000031749827,0.00017879301,0.0040054535],"genre_scores_gemma":[0.81983656,0.000036528734,0.17599992,0.0030699968,0.00046319544,0.00002818805,0.00015043851,0.000055789802,0.00035937107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573493,0.000060489027,0.0005514932,0.0017186408,0.0012624966,0.00067192444],"domain_scores_gemma":[0.99746853,0.00023666534,0.00026962676,0.001648023,0.0001701899,0.00020695545],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00064845185,0.00054251775,0.00043198164,0.0008536647,0.00042696696,0.0010508844,0.00319283,0.00028817836,0.00006412042],"category_scores_gemma":[0.000018174846,0.0005157566,0.00014072923,0.00070916774,0.0004329588,0.0009864507,0.0004937818,0.0006650765,0.00007007778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023306826,0.00040842767,0.00022693154,0.00004409772,0.000027926082,0.00011548748,0.003300656,0.1005142,0.0020031268,0.177685,0.0025705462,0.7130803],"study_design_scores_gemma":[0.00072687515,0.0009605867,0.00019626794,0.00019043041,0.000012169391,0.00004435633,8.0883297e-7,0.7843464,0.002331777,0.19958404,0.010313926,0.0012923494],"about_ca_topic_score_codex":0.0004754526,"about_ca_topic_score_gemma":0.0005252103,"teacher_disagreement_score":0.8167804,"about_ca_system_score_codex":0.00024993217,"about_ca_system_score_gemma":0.0003354992,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W1725695101","doi":"10.1007/978-3-319-22174-8_11","title":"Meet-in-the-Middle Attacks on Reduced-Round Hierocrypt-3","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Key (lock); Differential (mechanical device); Arithmetic; Slide attack; State (computer science); Enumeration; Collision attack; Computer security; Algorithm; Theoretical computer science; Differential cryptanalysis; Cryptography; Mathematics; Discrete mathematics; Engineering; Cryptographic hash function","score_opus":0.06975665820757174,"score_gpt":0.30629984052344605,"score_spread":0.23654318231587432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1725695101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018598405,0.00036821511,0.9843492,0.0023925335,0.0018273045,0.00061697274,0.000009831445,0.00010085641,0.008475238],"genre_scores_gemma":[0.84057856,0.000058815134,0.15258408,0.0055754944,0.0008716886,0.00004645727,0.000021290296,0.000052339252,0.00021126123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99544114,0.00008765308,0.0006110958,0.0014494617,0.001629763,0.00078091415],"domain_scores_gemma":[0.9969614,0.00055769586,0.00025258266,0.0018275054,0.0002348254,0.00016594738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019757217,0.0005233671,0.00046051154,0.001137361,0.00034148432,0.0008212976,0.004467439,0.00024998692,0.000028325061],"category_scores_gemma":[0.000076463424,0.0004106432,0.0001486152,0.0012854981,0.00060119136,0.0005351318,0.00076427707,0.0008992109,0.000045616332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015144048,0.00017214699,0.000079502424,0.00003951906,0.000017302555,0.0002555244,0.010817066,0.0064919693,0.000041887393,0.6555722,0.0012342294,0.3252635],"study_design_scores_gemma":[0.0008473905,0.00068498583,0.00031759334,0.00042264257,0.000013056274,0.00015119778,0.0000063054486,0.0768572,0.00018308336,0.8948593,0.024458535,0.0011986746],"about_ca_topic_score_codex":0.00007155983,"about_ca_topic_score_gemma":0.0006348989,"teacher_disagreement_score":0.8387187,"about_ca_system_score_codex":0.0003432199,"about_ca_system_score_gemma":0.00054638303,"threshold_uncertainty_score":0.99983454},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019285931225202845,"score_gpt":0.28284249286338087,"score_spread":0.26355656163817803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181112729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11425268,0.00027907593,0.87450856,0.0025981495,0.0019522728,0.0007355288,0.00014688789,0.00043996464,0.005086882],"genre_scores_gemma":[0.16778126,0.000376574,0.8292869,0.0012614382,0.00059471367,0.0004039917,0.0002397744,0.000047023193,0.000008314174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953406,0.0004780314,0.00093790307,0.0017673468,0.0004765684,0.0009995376],"domain_scores_gemma":[0.9962844,0.0003093331,0.00049306237,0.0023920652,0.00017643713,0.00034469896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047508604,0.0006994384,0.0008132813,0.0006845743,0.000378718,0.00032556496,0.0028228662,0.00038010292,0.00028705838],"category_scores_gemma":[0.000054090935,0.00072408834,0.00054694747,0.00036820752,0.00040226022,0.0002073933,0.0055174306,0.0015670706,0.0003317408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016024558,0.00024357969,0.0032765162,0.000047072903,0.00023156323,0.00010633815,0.003932498,0.0005179621,0.00030669651,0.9603016,0.005295608,0.025724582],"study_design_scores_gemma":[0.00087032723,0.0001229236,0.013550513,0.000065010936,0.00007279713,0.00017030853,0.00014195222,0.016869603,0.0006189088,0.9113793,0.055034924,0.0011034299],"about_ca_topic_score_codex":0.000249328,"about_ca_topic_score_gemma":0.0008094603,"teacher_disagreement_score":0.053528592,"about_ca_system_score_codex":0.00012226294,"about_ca_system_score_gemma":0.0005154807,"threshold_uncertainty_score":0.999521},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03536184863177191,"score_gpt":0.2667073088965999,"score_spread":0.23134546026482797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857035554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074566883,0.00023991009,0.9943787,0.0006414467,0.0008887664,0.0003003212,0.000008168512,0.00007861359,0.0027183965],"genre_scores_gemma":[0.74937034,0.00011900189,0.24977583,0.0003713587,0.0001976224,0.000008665606,0.000015715035,0.000022179533,0.00011928488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693286,0.00004269417,0.0006158466,0.0009507218,0.0009763816,0.00048147954],"domain_scores_gemma":[0.9976449,0.0003097213,0.0003846308,0.0011732822,0.0003627654,0.00012468093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008175501,0.0003353328,0.0003932037,0.001247151,0.00019348047,0.0004186048,0.002332757,0.000184746,0.00013488275],"category_scores_gemma":[0.00006418849,0.0003208321,0.00014845926,0.0010889362,0.00052529573,0.0007353223,0.00070573704,0.00042452436,0.000026502124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017866759,0.00010055324,0.0006231249,0.000072614625,0.000024658148,0.00002409632,0.0021455688,0.0035414898,0.0001745087,0.38868698,0.000063292755,0.6045413],"study_design_scores_gemma":[0.0006230977,0.0003930544,0.00055936555,0.00028438363,0.000020662706,0.000066396606,7.4760766e-7,0.5105755,0.0052317334,0.476024,0.0050719753,0.0011491505],"about_ca_topic_score_codex":0.000026216183,"about_ca_topic_score_gemma":0.000032733144,"teacher_disagreement_score":0.7486247,"about_ca_system_score_codex":0.0001250584,"about_ca_system_score_gemma":0.00024298656,"threshold_uncertainty_score":0.99992436},"labels":[],"label_agreement":null},{"id":"W1875601660","doi":"10.1007/3-540-45537-x_9","title":"Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Bounding overwatch; Advanced Encryption Standard; Linear cryptanalysis; Computer science; Cryptanalysis; Hull; Cryptography; Mathematics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.028921129306277712,"score_gpt":0.2675139365779389,"score_spread":0.2385928072716612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875601660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088448613,0.000097703596,0.99001896,0.0049820896,0.0012281141,0.0015832965,0.000021763966,0.00008929111,0.0010943118],"genre_scores_gemma":[0.3902333,0.00008963144,0.58981353,0.016772298,0.0021488296,0.00033037414,0.000030333553,0.00011090859,0.00047081689],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649256,0.00006757719,0.0005216072,0.0013277018,0.0008674243,0.00072310993],"domain_scores_gemma":[0.99576086,0.0015763629,0.00028847612,0.0019952662,0.00028344203,0.00009559319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022735712,0.00046394797,0.00033124382,0.00031470074,0.0012429167,0.00096063147,0.0037822567,0.0001859641,0.000044076136],"category_scores_gemma":[0.00018485452,0.00027053215,0.00026084273,0.00064031273,0.00093359355,0.0003324021,0.0009931638,0.0008451291,0.000013757764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017978684,0.000081931095,0.00012062431,0.000051432722,0.00002329069,0.000012914268,0.0021185917,0.006333174,0.000059274622,0.41136608,0.00012598408,0.5796887],"study_design_scores_gemma":[0.0002492555,0.00022998599,0.00012298331,0.00007337293,0.000008861501,0.000025214185,9.619088e-7,0.36066207,0.00025232078,0.6258361,0.0121351825,0.00040375214],"about_ca_topic_score_codex":0.0000763438,"about_ca_topic_score_gemma":0.00026799313,"teacher_disagreement_score":0.57928497,"about_ca_system_score_codex":0.00019831811,"about_ca_system_score_gemma":0.00042009808,"threshold_uncertainty_score":0.99997467},"labels":[],"label_agreement":null},{"id":"W1877793656","doi":"10.1007/3-540-36563-x_12","title":"Hardware Performance Characterization of Block Cipher Structures","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Block cipher; Computer science; Parameterized complexity; Differential cryptanalysis; Cipher; Linear cryptanalysis; Permutation (music); Advanced Encryption Standard; Theoretical computer science; Arithmetic; Cryptography; Algorithm; Mathematics; Encryption; Computer network","score_opus":0.01515064140990828,"score_gpt":0.24349314790596333,"score_spread":0.22834250649605503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1877793656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011298628,0.00008495679,0.98598766,0.00021542981,0.0011261305,0.0003282772,0.000017575974,0.000058759295,0.00088257977],"genre_scores_gemma":[0.8171192,0.00014497679,0.18105744,0.0012258437,0.0002145766,0.000010526294,0.00003398925,0.00003486428,0.00015861979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973519,0.000027883838,0.0005519438,0.00087338616,0.00077431515,0.00042058123],"domain_scores_gemma":[0.99815357,0.00008150112,0.00038221024,0.0009816797,0.0003082602,0.000092799164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041280268,0.00036608096,0.00040183857,0.000724655,0.00021081745,0.00022632016,0.0016748059,0.00019425493,0.000059753245],"category_scores_gemma":[0.000020634743,0.00033875203,0.000109626286,0.0007253763,0.00041098983,0.0005520181,0.000448518,0.00039833173,0.0000046658274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011400145,0.000073890034,0.0014954298,0.00024267404,0.000043106233,0.000025223528,0.003067895,0.0062180837,0.005219009,0.11003752,0.000037675876,0.87352806],"study_design_scores_gemma":[0.0022553138,0.0013377613,0.030920796,0.0013818071,0.00007943011,0.00035578667,0.0000018325346,0.5484049,0.06454558,0.31777444,0.02858229,0.0043600495],"about_ca_topic_score_codex":0.000008433921,"about_ca_topic_score_gemma":0.000020977646,"teacher_disagreement_score":0.86916804,"about_ca_system_score_codex":0.00008973701,"about_ca_system_score_gemma":0.00025137534,"threshold_uncertainty_score":0.9999064},"labels":[],"label_agreement":null},{"id":"W1910095387","doi":"10.5555/2830865.2830883","title":"Exp-HE: a family of fast exponentiation algorithms resistant to SPA, fault, and combined attacks","year":2015,"lang":"en","type":"article","venue":"Embedded Software","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalar multiplication; Modular exponentiation; Side channel attack; Cryptography; Power analysis; Exponentiation; Algorithm; Elliptic curve cryptography; Timing attack; Modular arithmetic; Cryptosystem; Vulnerability (computing); Public-key cryptography; Theoretical computer science; Computer engineering; Embedded system; Elliptic curve; Computer security; Encryption; Mathematics","score_opus":0.034860267514023206,"score_gpt":0.29420589845327355,"score_spread":0.25934563093925034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1910095387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43063548,0.0001287549,0.5681904,0.00030979028,0.00022280027,0.00026112434,0.000037200833,0.00011667235,0.00009777666],"genre_scores_gemma":[0.82276344,0.000010476625,0.17680304,0.00023396894,0.00003378799,0.00003587173,0.000035686753,0.00001092802,0.000072800125],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99859846,0.00007089499,0.00033688184,0.00034405154,0.00041031573,0.00023939954],"domain_scores_gemma":[0.99887526,0.000071226576,0.00011924521,0.00044998844,0.00027061306,0.000213638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032744967,0.00014646884,0.00020826186,0.00019836085,0.00010969905,0.000110911744,0.00034537874,0.00005237442,0.00001144833],"category_scores_gemma":[0.00009780861,0.0001400951,0.000053660046,0.0005744136,0.00004169945,0.00032806784,0.00023010626,0.00007900042,0.000008963458],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008258891,0.001910711,0.045528483,0.00045852206,0.0005717436,0.00016592155,0.2641462,0.0006805402,0.020140983,0.074666515,0.16814817,0.4227563],"study_design_scores_gemma":[0.032373756,0.009793516,0.6087879,0.0008243961,0.000337897,0.00011794551,0.06465177,0.07699643,0.021917488,0.09908305,0.07918009,0.0059357416],"about_ca_topic_score_codex":0.00013679083,"about_ca_topic_score_gemma":0.00006473798,"teacher_disagreement_score":0.5632594,"about_ca_system_score_codex":0.000031006006,"about_ca_system_score_gemma":0.000073959825,"threshold_uncertainty_score":0.57129127},"labels":[],"label_agreement":null},{"id":"W1921331994","doi":"10.1007/3-540-48071-4_18","title":"On the Design of SP Networks from an Information Theoretic Point of View","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Information leakage; Invariant (physics); Cryptography; Leakage (economics); Discrete mathematics; Theoretical computer science; Computer science; Equivalence (formal languages); Mathematics; Combinatorics; Computer network; Algorithm","score_opus":0.02569431493111165,"score_gpt":0.27050025381020937,"score_spread":0.2448059388790977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921331994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003177097,0.00012201565,0.9979132,0.00023611251,0.00043400304,0.00043821428,0.000008665744,0.000025253255,0.00050481944],"genre_scores_gemma":[0.73740935,0.000087800945,0.2603939,0.0019903376,0.00008758939,0.0000054364423,0.00001422171,0.000010006618,0.0000013671747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793494,0.00007659952,0.00062256586,0.00038937945,0.00070069963,0.00027584445],"domain_scores_gemma":[0.99682134,0.0013540114,0.0004639293,0.001061646,0.00023761013,0.00006145658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018551064,0.00024429616,0.00030994954,0.0005113796,0.00013052269,0.00015951245,0.002048372,0.00014000367,0.000046546727],"category_scores_gemma":[0.000059644986,0.00016810224,0.00008945815,0.0006010014,0.0006412763,0.00056251045,0.00036245392,0.00037992888,0.000002963036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009353764,0.00002224589,0.000012496401,0.000012358811,0.0000082497945,0.000001863341,0.00194254,0.061495524,0.000009185704,0.59136736,0.000008575508,0.34511027],"study_design_scores_gemma":[0.000108124856,0.00023105559,0.00015273174,0.00016890407,0.0000056669633,0.0000030346446,9.374007e-7,0.5588484,0.00039133697,0.4398741,0.000062444306,0.00015328944],"about_ca_topic_score_codex":0.000062261155,"about_ca_topic_score_gemma":0.000040416086,"teacher_disagreement_score":0.7375193,"about_ca_system_score_codex":0.00005010149,"about_ca_system_score_gemma":0.00016326625,"threshold_uncertainty_score":0.68550104},"labels":[],"label_agreement":null},{"id":"W1951487773","doi":"10.1109/ccece.2000.849666","title":"Provable security of substitution-permutation encryption networks against linear cryptanalysis","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear cryptanalysis; Block cipher; Differential cryptanalysis; Higher-order differential cryptanalysis; CBC-MAC; Computer science; Cryptanalysis; Impossible differential cryptanalysis; Theoretical computer science; Cryptography; Mathematics; Algorithm","score_opus":0.01838951590754237,"score_gpt":0.2473826509999124,"score_spread":0.22899313509237004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1951487773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18314372,0.00013709026,0.81395054,0.0001836482,0.00011399757,0.00017169521,0.0000030543536,0.00010404887,0.002192199],"genre_scores_gemma":[0.97380036,0.00017869128,0.025775941,0.000120431774,0.00004235954,0.00001706539,0.000026479081,0.0000040700193,0.000034624016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873114,0.0000650823,0.00040286183,0.00028732786,0.00029327194,0.00022033385],"domain_scores_gemma":[0.99910927,0.000051110597,0.00015304123,0.0003993705,0.00022057006,0.00006663881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002910268,0.00012032122,0.00017009175,0.00022778692,0.00018231853,0.00006901444,0.0003210124,0.00006045851,0.00029037948],"category_scores_gemma":[0.00002670113,0.0001080503,0.0001324704,0.0013178155,0.000058053527,0.00064479257,0.00006361814,0.000099623314,0.000017695169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068115046,0.00057987217,0.006964424,0.000045501085,0.0001401623,0.000007666451,0.0027578305,0.020121897,0.0012549714,0.93779093,0.0013838956,0.028946023],"study_design_scores_gemma":[0.0002866288,0.000041117255,0.001042497,0.000006983333,0.000018498762,0.0000023168625,0.00007418335,0.9929859,0.0007739372,0.0033858998,0.0012441406,0.00013788785],"about_ca_topic_score_codex":0.00008001275,"about_ca_topic_score_gemma":0.000082021725,"teacher_disagreement_score":0.97286403,"about_ca_system_score_codex":0.000031825017,"about_ca_system_score_gemma":0.000017063097,"threshold_uncertainty_score":0.44061634},"labels":[],"label_agreement":null},{"id":"W1964201351","doi":"10.1007/s13389-011-0008-9","title":"SPA-resistant binary exponentiation with optimal execution time","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Exponentiation; Modular exponentiation; Cryptosystem; Computer science; Power analysis; Overhead (engineering); Binary number; Cryptography; Side channel attack; Algorithm; Parallel computing; Theoretical computer science; Public-key cryptography; Arithmetic; Mathematics; Encryption; Computer network","score_opus":0.0106181311011038,"score_gpt":0.19225939295764752,"score_spread":0.18164126185654372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964201351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41140383,0.000147518,0.5880858,0.000038929415,0.00013664186,0.000056798097,8.39718e-7,0.00004483136,0.00008487595],"genre_scores_gemma":[0.79575455,0.00004526547,0.20411865,0.000013926981,0.00005080169,0.00000325952,0.0000012224035,0.000010545152,0.000001763432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987646,0.000028867596,0.0004371059,0.00014822451,0.00038194057,0.00023931003],"domain_scores_gemma":[0.9991113,0.000034279037,0.00029107148,0.0002326399,0.00020812,0.00012261796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000428931,0.00015265278,0.00019601028,0.00081972335,0.00008433623,0.00007802799,0.0004010184,0.00004777847,0.00004856939],"category_scores_gemma":[0.000013315212,0.00012716718,0.00014982326,0.0009383777,0.000029119896,0.00093470246,0.00004775841,0.00019772469,0.0000027894812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095605303,0.0017780247,0.012820687,0.00031109012,0.0016870865,0.0012251756,0.018139912,0.031218143,0.37150526,0.5470077,0.001245358,0.012105525],"study_design_scores_gemma":[0.01010076,0.01076412,0.5429198,0.0013296496,0.0006202591,0.002646953,0.0012431567,0.3737925,0.034175597,0.010405332,0.008772899,0.0032289473],"about_ca_topic_score_codex":0.000011465454,"about_ca_topic_score_gemma":0.0000017160247,"teacher_disagreement_score":0.5366024,"about_ca_system_score_codex":0.000023993636,"about_ca_system_score_gemma":0.00004395484,"threshold_uncertainty_score":0.5185727},"labels":[],"label_agreement":null},{"id":"W1964941344","doi":"10.1109/fdtc.2011.11","title":"A High-Performance Fault Diagnosis Approach for the AES SubBytes Utilizing Mixed Bases","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Division of Chemistry; Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Byte; Advanced Encryption Standard; Computer science; Application-specific integrated circuit; Encryption; Transformation (genetics); Parallel computing; Embedded system; Cryptography; Computer engineering; Algorithm; Computer hardware; Operating system","score_opus":0.07591891011617301,"score_gpt":0.269249788821996,"score_spread":0.193330878705823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964941344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2655498,0.00012503976,0.73248833,0.00025844973,0.0001906438,0.00038436186,0.00000798705,0.000121418445,0.0008739922],"genre_scores_gemma":[0.7948018,0.00010849203,0.2043872,0.00023928752,0.000025891148,0.00040954317,0.000005014804,0.000004543764,0.000018284602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991578,0.000024843961,0.0001809946,0.0002454244,0.00014065347,0.00025032277],"domain_scores_gemma":[0.9991388,0.00029499887,0.000052638963,0.00040250842,0.00007197785,0.00003909795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029938295,0.00010654768,0.00009894575,0.000071873845,0.00033441331,0.000110510344,0.00065136986,0.000024678866,0.00007261207],"category_scores_gemma":[0.000025201129,0.0000661458,0.00007053746,0.00034018615,0.000059371854,0.00038660495,0.00013234463,0.00005202648,0.0000034085162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001692544,0.0003840885,0.040114094,0.00005797075,0.00008068765,7.2617155e-7,0.0053879926,0.000051713672,0.00005181476,0.76316434,0.0065576592,0.184132],"study_design_scores_gemma":[0.0020220405,0.0006847737,0.19653858,0.00003141683,0.00010586613,0.000016107144,0.0063895755,0.67707586,0.08363875,0.009740827,0.022749484,0.0010067289],"about_ca_topic_score_codex":0.00048431076,"about_ca_topic_score_gemma":0.00009875165,"teacher_disagreement_score":0.7534235,"about_ca_system_score_codex":0.000007133936,"about_ca_system_score_gemma":0.000018996048,"threshold_uncertainty_score":0.26973477},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07017081495506261,"score_gpt":0.2858916068990096,"score_spread":0.215720791943947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965792738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15339515,0.00020874308,0.7739873,0.003337346,0.0012019359,0.0018686864,0.00009231598,0.0004325241,0.06547602],"genre_scores_gemma":[0.95975727,0.000013327833,0.037312828,0.0020071433,0.00007363284,0.00014650043,0.000015800993,0.000010116751,0.0006633811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886525,0.000014455105,0.00022340765,0.00032447273,0.00023772975,0.000334699],"domain_scores_gemma":[0.99884576,0.00029931962,0.00007136298,0.0006422303,0.000077532575,0.00006378039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038895072,0.0001500016,0.000118728836,0.000099234916,0.0005819156,0.00019804909,0.00089866744,0.000042571184,0.00034850225],"category_scores_gemma":[0.00003404863,0.00009154581,0.00013608634,0.0002866818,0.000068565976,0.00012798037,0.00015233367,0.000133224,0.000013742122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085504566,0.00015870995,0.0011520097,0.000024544832,0.00006360334,0.0000042396964,0.0055857208,0.000044422923,0.000023211034,0.93422043,0.035186887,0.023450688],"study_design_scores_gemma":[0.0027995529,0.0017778829,0.117744125,0.000062891864,0.00007719109,0.00005394022,0.0017752143,0.04765997,0.0055560237,0.55985045,0.26151282,0.0011299265],"about_ca_topic_score_codex":0.00088697404,"about_ca_topic_score_gemma":0.0011373347,"teacher_disagreement_score":0.80636215,"about_ca_system_score_codex":0.0000145089625,"about_ca_system_score_gemma":0.000041834886,"threshold_uncertainty_score":0.4475683},"labels":[],"label_agreement":null},{"id":"W1966437603","doi":"10.1109/glocom.2011.6133864","title":"Differential Cryptanalysis of Two Joint Encryption and Error Correction Schemes","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encryption; Computer science; Cryptography; Plaintext; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Computer security","score_opus":0.05457723928546058,"score_gpt":0.2834055379109607,"score_spread":0.2288282986255001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966437603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45494652,0.000008212313,0.5441806,0.000021752669,0.00013776055,0.000039745937,5.5607296e-7,0.000028279406,0.00063656503],"genre_scores_gemma":[0.9577237,0.000015131791,0.04219321,0.000017333681,0.000011807946,0.000005223409,0.0000023867985,0.0000019722002,0.000029244993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99935985,0.000030079895,0.0002071385,0.00017494711,0.0001292842,0.00009873324],"domain_scores_gemma":[0.9995997,0.000012800923,0.00008374893,0.00019390816,0.0000700106,0.000039836803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091603244,0.00006667693,0.00010982254,0.00018172391,0.00007336199,0.000030418469,0.00011178707,0.000019636496,0.000503625],"category_scores_gemma":[0.0000078026205,0.000056222518,0.00006189762,0.00029979937,0.0000410144,0.00024796315,0.000084478066,0.000041145136,0.0000024063677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017448529,0.00036860185,0.038295966,0.00002456251,0.00015723528,0.000001921325,0.0072765797,0.0000026109597,0.030989563,0.8092214,0.00049903616,0.1131451],"study_design_scores_gemma":[0.0023120334,0.00052875077,0.4097083,0.00003195297,0.00019865239,0.0000313117,0.0020184556,0.33339062,0.18751103,0.06314007,0.00047616017,0.0006526763],"about_ca_topic_score_codex":0.00055846147,"about_ca_topic_score_gemma":0.00021955652,"teacher_disagreement_score":0.7460813,"about_ca_system_score_codex":0.0000068014415,"about_ca_system_score_gemma":0.0000105890485,"threshold_uncertainty_score":0.5514341},"labels":[],"label_agreement":null},{"id":"W1966506618","doi":"10.1109/iscas.2012.6271522","title":"Current mode multiple-valued adder for cryptography processors","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Adder; Carry-save adder; Computer science; Cryptography; Serial binary adder; Power (physics); Arithmetic; Algorithm; Mathematics; Telecommunications","score_opus":0.04052830137585565,"score_gpt":0.3466520392691782,"score_spread":0.30612373789332253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966506618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038589943,0.0004021323,0.95923245,0.0001978103,0.0005270225,0.00049226516,0.000016152711,0.00018612688,0.00035612177],"genre_scores_gemma":[0.80878836,0.00001941414,0.19066449,0.00017355142,0.00010790053,0.00021460404,0.000016947077,0.0000075891394,0.000007137167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988081,0.000025184861,0.00022611083,0.00024785026,0.00021481453,0.00047793295],"domain_scores_gemma":[0.9992365,0.00009185459,0.00006423838,0.00032352755,0.00012704008,0.0001568027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025301127,0.00013493418,0.00011797208,0.00020101188,0.0002054658,0.0001006592,0.00042009007,0.00003204253,0.00004830178],"category_scores_gemma":[0.00003243186,0.00011246914,0.00014904041,0.00055387407,0.000031753665,0.0007296414,0.000096242315,0.000070396185,0.000011020497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009479194,0.00045375797,0.033526104,0.000053577478,0.00003394171,8.1915374e-8,0.0030625996,0.000012076632,0.00012966953,0.9001152,0.008595046,0.05400848],"study_design_scores_gemma":[0.0059518665,0.00033786,0.05369557,0.000050430423,0.00008779069,0.000012775466,0.0010963097,0.40957808,0.006243956,0.093071476,0.42803735,0.0018365451],"about_ca_topic_score_codex":0.000029077371,"about_ca_topic_score_gemma":0.000040503615,"teacher_disagreement_score":0.80704373,"about_ca_system_score_codex":0.000010413087,"about_ca_system_score_gemma":0.00002978247,"threshold_uncertainty_score":0.45863584},"labels":[],"label_agreement":null},{"id":"W1966844574","doi":"10.1049/ip-cdt:20050192","title":"Applying the Handel-C design flow in designing an HMAC-hash unit on FPGAs","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Computers and Digital Techniques","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash-based message authentication code; Computer science; Hash function; MD5; Field-programmable gate array; Flexibility (engineering); Embedded system; Parallel computing; Computer architecture; Computer hardware; Message authentication code; Cryptography; Programming language; Algorithm; Mathematics","score_opus":0.029480125407466494,"score_gpt":0.26287971366047574,"score_spread":0.23339958825300924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966844574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064832516,0.000044679393,0.9313563,0.00025338237,0.000046953402,0.0009555836,0.0000032934774,0.0005196179,0.0019876426],"genre_scores_gemma":[0.83169353,0.000012038607,0.16766676,0.0002912131,0.000057385492,0.00025528576,0.0000049276664,0.000012204303,0.0000066489165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986572,0.000016597993,0.00029511424,0.0004400466,0.0002576701,0.00033331968],"domain_scores_gemma":[0.99946946,0.000110341585,0.000098276185,0.00016766791,0.00008530449,0.00006892822],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004509635,0.0002153456,0.00017308418,0.00029780474,0.00029793795,0.0018356084,0.0005591698,0.000061183724,8.6564575e-7],"category_scores_gemma":[0.000009547558,0.00016823519,0.000046409205,0.00058901927,0.00009032191,0.0014417307,0.00018860231,0.00017866539,8.969621e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004111275,0.00039437332,0.0066912165,0.000047552225,0.000019559715,0.00002537619,0.0021097874,0.0002326775,0.0018865765,0.23644507,0.0036374691,0.74846923],"study_design_scores_gemma":[0.0017299332,0.0025264993,0.0054521468,0.000593609,0.00002221882,0.0002194388,0.00090354367,0.48614547,0.04410311,0.42539868,0.03105205,0.0018532857],"about_ca_topic_score_codex":0.0000639812,"about_ca_topic_score_gemma":0.0000062676745,"teacher_disagreement_score":0.766861,"about_ca_system_score_codex":0.000026376812,"about_ca_system_score_gemma":0.000022422782,"threshold_uncertainty_score":0.9992006},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015764890411144823,"score_gpt":0.29038368516258395,"score_spread":0.27461879475143913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970866180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5589858,0.0034408208,0.4347195,0.0009087332,0.0006727046,0.0010180349,0.00021212746,0.000028688537,0.000013554286],"genre_scores_gemma":[0.9941958,0.00003840864,0.0051897047,0.00027609465,0.000111173365,0.00011726527,0.000016064647,0.0000114282675,0.000044062697],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988645,0.000059397473,0.00034794008,0.00022509438,0.0001792968,0.00032377243],"domain_scores_gemma":[0.9990556,0.00011904857,0.00027454432,0.00031772302,0.0001841966,0.000048850794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057596894,0.00015529092,0.00016528313,0.00006939183,0.0004619431,0.0001985978,0.00055443577,0.000042837622,0.000010216818],"category_scores_gemma":[0.000009068134,0.00008884515,0.00010564283,0.00036413083,0.00010499757,0.00033844003,0.00013138838,0.00008197071,8.7067036e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058177182,0.0007659347,0.05542529,0.0018596564,0.0005739255,0.0000012127906,0.06613948,0.000056290435,0.34996912,0.04255152,0.012981404,0.469618],"study_design_scores_gemma":[0.0055625797,0.00027877916,0.020733226,0.00023878018,0.00019643201,0.00007349078,0.014715881,0.021848302,0.7752453,0.0014263351,0.15876584,0.00091506826],"about_ca_topic_score_codex":0.00038599983,"about_ca_topic_score_gemma":0.00020048581,"teacher_disagreement_score":0.4687029,"about_ca_system_score_codex":0.000020071793,"about_ca_system_score_gemma":0.000059678856,"threshold_uncertainty_score":0.3623},"labels":[],"label_agreement":null},{"id":"W1975649745","doi":"10.1007/s11265-013-0788-5","title":"Performance Characterization of AES Datapath Architectures in 90-nm Standard Cell CMOS Technology","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Datapath; Advanced Encryption Standard; Computer science; Standard cell; Parameterized complexity; CMOS; Throughput; Computer architecture; Efficient energy use; Embedded system; Parallel computing; Computer hardware; Cryptography; Integrated circuit; Algorithm; Electronic engineering; Engineering; Electrical engineering","score_opus":0.009626717723937602,"score_gpt":0.23430842318767114,"score_spread":0.22468170546373353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975649745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83511597,0.0002634614,0.16418095,0.00014300687,0.000100093705,0.00013870496,0.00000439554,0.000012549282,0.000040869352],"genre_scores_gemma":[0.99660283,0.000025357973,0.0032848967,0.000013999947,0.000052893723,0.0000070921287,0.0000019069386,0.000005505347,0.000005536793],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859715,0.000052432286,0.00069798157,0.00012397731,0.00035638554,0.00017209197],"domain_scores_gemma":[0.9986297,0.000022698274,0.0007929545,0.0001349264,0.0003786796,0.000041034593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941789,0.000097782315,0.00026005955,0.0006303406,0.000076961165,0.00015865738,0.00049782987,0.00005423217,0.0000079053025],"category_scores_gemma":[0.000008495904,0.000075949894,0.00003544034,0.0007006423,0.000052941843,0.0006877858,0.000056805675,0.00019595007,9.98918e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006772042,0.0003242219,0.10675322,0.0017621858,0.000038342994,0.000023293494,0.0071557807,0.0018074077,0.58344346,0.0010718924,0.00011498504,0.2974375],"study_design_scores_gemma":[0.0062637143,0.004539488,0.16542216,0.005765369,0.00008696174,0.0013304974,0.005738281,0.6218604,0.17902696,0.004754264,0.0038038979,0.001408015],"about_ca_topic_score_codex":0.000023712173,"about_ca_topic_score_gemma":0.0000022699576,"teacher_disagreement_score":0.620053,"about_ca_system_score_codex":0.00003087084,"about_ca_system_score_gemma":0.00015682625,"threshold_uncertainty_score":0.30971467},"labels":[],"label_agreement":null},{"id":"W1976362254","doi":"10.1142/s0218126613500291","title":"LOW POWER CONSUMPTION SECURITY PLATFORM FOR INDUSTRIAL COMMUNICATIONS USING AN MPSOC","year":2013,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Ministerio de Economía y Competitividad; British Columbia Institute of Technology","keywords":"MicroBlaze; MPSoC; Computer science; Power consumption; Embedded system; Encryption; Advanced Encryption Standard; Cryptography; Power (physics); Field-programmable gate array; System on a chip; Computer network; Computer security","score_opus":0.10365276610337175,"score_gpt":0.3139997778995961,"score_spread":0.21034701179622434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976362254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55411744,0.00020576987,0.44433787,0.00012565404,0.00085347675,0.00032302365,0.000006537211,0.000013955133,0.000016284179],"genre_scores_gemma":[0.99482477,0.000036447705,0.004889664,0.000080012316,0.00014978492,0.000008550673,0.0000036585343,0.0000060556554,0.00000108524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998776,0.00009121634,0.0005830578,0.00013909303,0.00022124602,0.00018939757],"domain_scores_gemma":[0.9983903,0.00020389269,0.0005053547,0.0003779257,0.00035892098,0.00016360138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060620334,0.00011284228,0.00024746294,0.00021463787,0.00028150695,0.0005736445,0.0006144939,0.000077655764,0.000004656408],"category_scores_gemma":[0.000015544898,0.00010042174,0.00009200571,0.00016154328,0.00006232839,0.001385209,0.00009940016,0.00017299895,8.486595e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043117427,0.0021276243,0.023463715,0.0004576559,0.0009886965,0.000022208684,0.036549103,0.0017638797,0.006188314,0.67052203,0.011874992,0.24599864],"study_design_scores_gemma":[0.0075338064,0.0018973408,0.010695167,0.0008654113,0.00011376635,0.0015749957,0.0038621328,0.94642925,0.00017763955,0.016582042,0.009351919,0.00091651885],"about_ca_topic_score_codex":0.000097180906,"about_ca_topic_score_gemma":0.0000085850215,"teacher_disagreement_score":0.9446654,"about_ca_system_score_codex":0.000047811216,"about_ca_system_score_gemma":0.000086232496,"threshold_uncertainty_score":0.5531667},"labels":[],"label_agreement":null},{"id":"W1977011330","doi":"10.1016/j.camwa.2011.01.006","title":"Cryptanalysis of a quadratic knapsack cryptosystem","year":2011,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Knapsack problem; Cryptosystem; Cryptanalysis; Quadratic equation; Hybrid cryptosystem; Discrete mathematics; Algebra over a field; Cryptography; Pure mathematics; Algorithm","score_opus":0.028340982583930977,"score_gpt":0.24299191961124852,"score_spread":0.21465093702731755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977011330","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007969889,0.000039534832,0.9888918,0.00007115575,0.000025545223,0.00058828853,0.0000063391044,0.00012953908,0.0022779175],"genre_scores_gemma":[0.4225441,0.0000064223386,0.5771973,0.000030088633,0.000009852665,0.00019233808,0.0000046549435,0.0000082711185,0.0000069638445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986097,0.000032994074,0.0005380567,0.00031295675,0.00029138452,0.00021488851],"domain_scores_gemma":[0.9980274,0.00012913508,0.0003616905,0.0011518799,0.00022460676,0.00010528738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021637205,0.00016817795,0.00030532415,0.00025493716,0.00015033728,0.00006562602,0.00094894576,0.00003772326,0.00003640327],"category_scores_gemma":[0.000004995598,0.0001388944,0.000110442736,0.0012670008,0.000095880634,0.00020548039,0.00014170512,0.00007650746,0.000027214588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018134918,0.000413593,0.00035686302,0.00015019199,0.00013172906,0.0000014477291,0.00631766,0.000025507017,0.00009609752,0.98751515,0.00016134302,0.0048285862],"study_design_scores_gemma":[0.0027095696,0.0008227813,0.005422301,0.00045025905,0.00072095176,0.00020949318,0.0051191645,0.4728241,0.005209749,0.4990081,0.005640906,0.0018626195],"about_ca_topic_score_codex":0.000025619653,"about_ca_topic_score_gemma":0.000025203983,"teacher_disagreement_score":0.48850706,"about_ca_system_score_codex":0.000020894275,"about_ca_system_score_gemma":0.00006363527,"threshold_uncertainty_score":0.56639487},"labels":[],"label_agreement":null},{"id":"W1979334839","doi":"10.1109/fdtc.2007.15","title":"A Structure-independent Approach for Fault Detection Hardware Implementations of the Advanced Encryption Standard","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Encryption; Computer science; Cryptography; Overhead (engineering); Probabilistic encryption; Advanced Encryption Standard; Computer engineering; 40-bit encryption; Multiple encryption; Theoretical computer science; Algorithm; Embedded system; Computer network; Operating system","score_opus":0.014344266959835298,"score_gpt":0.29780051173008937,"score_spread":0.28345624477025405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979334839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14120486,0.000009040917,0.85749525,0.00006923111,0.000194922,0.00068365736,0.000075211465,0.000041326985,0.00022648514],"genre_scores_gemma":[0.82368356,0.0000019587992,0.17617233,0.000055235294,0.000019421417,0.000032229163,0.000018919945,0.000004151815,0.00001219111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988662,0.000027530567,0.00032663342,0.00023234743,0.00033114228,0.00021616215],"domain_scores_gemma":[0.9991954,0.000058957845,0.00015219917,0.0003341772,0.00021950231,0.000039762977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039533022,0.000093571056,0.00009911736,0.000118584976,0.00030416858,0.00005265845,0.00035168364,0.000036692396,0.000028756427],"category_scores_gemma":[0.00002243109,0.00006750434,0.00011284365,0.0004981226,0.000029882738,0.00028015347,0.00008579635,0.00007036781,1.5583598e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013578899,0.00015640457,0.0039339247,0.00009575797,0.00009960555,3.6143297e-7,0.005288218,0.0015076834,0.1015728,0.4489294,0.0002746818,0.43800536],"study_design_scores_gemma":[0.005802659,0.0007641219,0.08192764,0.000016671376,0.00007859056,0.000030538857,0.010887202,0.0430747,0.79331064,0.055065744,0.00840464,0.0006368407],"about_ca_topic_score_codex":0.00006180048,"about_ca_topic_score_gemma":0.0013212338,"teacher_disagreement_score":0.69173783,"about_ca_system_score_codex":0.0000627272,"about_ca_system_score_gemma":0.000045289406,"threshold_uncertainty_score":0.27527472},"labels":[],"label_agreement":null},{"id":"W1979429135","doi":"10.1016/j.ipl.2014.03.005","title":"Integral distinguishers for reduced-round Stribog","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; GOST (hash function); Permutation (music); Mathematics; Cryptographic hash function; Function (biology); Cryptography; Computer science; Algorithm; Statistics; Computer security","score_opus":0.012487966435994436,"score_gpt":0.2607166727354172,"score_spread":0.24822870629942279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979429135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06702804,0.000003449625,0.9277705,0.0039941943,0.00026959076,0.00015849576,0.000004731499,0.00015345457,0.0006175468],"genre_scores_gemma":[0.9178117,2.9201976e-7,0.07720334,0.004802583,0.000069371505,0.00004451856,0.000060342594,0.0000037507175,0.000004109259],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915266,0.00001681761,0.00031255776,0.00011589072,0.00018450634,0.00021754022],"domain_scores_gemma":[0.9993939,0.0000572396,0.00018372023,0.00017697523,0.00013913208,0.00004904713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036320018,0.00009675124,0.00008512073,0.00015677276,0.00031139178,0.00076708425,0.00035562695,0.000027503515,0.0000037623745],"category_scores_gemma":[0.00013452428,0.00009039866,0.000051371866,0.00031795664,0.000039908708,0.0026593453,0.000041604966,0.0000758849,0.000007242492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112306,0.00002482768,0.0005119817,0.00017995416,0.000014265439,2.0468526e-7,0.009974773,0.00014857802,0.0007466664,0.11809841,0.018137228,0.8521519],"study_design_scores_gemma":[0.002361857,0.00018026598,0.0045669773,0.00012889446,0.000025710438,0.000024095469,0.0010151283,0.44117418,0.002007555,0.020812785,0.52683663,0.0008659622],"about_ca_topic_score_codex":0.000021230524,"about_ca_topic_score_gemma":0.0000032918276,"teacher_disagreement_score":0.85128593,"about_ca_system_score_codex":0.000036976428,"about_ca_system_score_gemma":0.000038891743,"threshold_uncertainty_score":0.7397011},"labels":[],"label_agreement":null},{"id":"W1979952204","doi":"10.1109/itict.2006.358283","title":"Design Space Exploration of a Reconfigurable HMAC-Hash Unit","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash-based message authentication code; Hash function; MD5; Computer science; Throughput; Key (lock); Reuse; Message authentication code; Cryptography; Algorithm; Engineering; Operating system; Programming language","score_opus":0.06920047564522289,"score_gpt":0.2858915142985818,"score_spread":0.2166910386533589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979952204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008805617,0.000020368992,0.9765821,0.00073226454,0.00006336384,0.00013866568,9.838539e-7,0.0000655151,0.0135910995],"genre_scores_gemma":[0.82696223,0.000010197334,0.17251283,0.00005034456,0.000014984376,0.000013031756,0.0000059118397,0.000002882594,0.00042761068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993792,0.00005004373,0.00018103041,0.00013854806,0.0001296491,0.00012153656],"domain_scores_gemma":[0.9995259,0.000057715035,0.00006652553,0.00023849228,0.00008982315,0.000021541924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023726813,0.00005752435,0.00007428938,0.00011388825,0.00006931797,0.000064909626,0.00020942342,0.00002016804,0.00014957057],"category_scores_gemma":[0.000005073191,0.00005283552,0.0000285061,0.00048555134,0.000018683948,0.0006536222,0.000019837571,0.000031396015,0.0000138153555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030412998,0.00007653373,0.00033985524,0.0000057518237,0.0000056701097,0.0000012233927,0.00047877512,0.00056815374,0.005779625,0.9828446,0.004814346,0.0050824573],"study_design_scores_gemma":[0.0016167554,0.0004298693,0.00424633,0.000026124946,0.000017246612,0.000011971001,0.0009340195,0.10944482,0.31126356,0.54567134,0.025795212,0.00054277916],"about_ca_topic_score_codex":0.00059372897,"about_ca_topic_score_gemma":0.00020215444,"teacher_disagreement_score":0.8181566,"about_ca_system_score_codex":0.000006408308,"about_ca_system_score_gemma":0.00003634612,"threshold_uncertainty_score":0.21545699},"labels":[],"label_agreement":null},{"id":"W1980111226","doi":"10.1007/s13389-013-0061-7","title":"Strengthening hardware implementations of NTRUEncrypt against fault analysis attacks","year":2013,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Checksum; Implementation; Cryptosystem; Parameterized complexity; Error detection and correction; Public-key cryptography; Ciphertext; Cipher; Computer engineering; Key (lock); Cryptography; Cryptanalysis; Embedded system; Computer security; Algorithm; Encryption; Programming language; Operating system","score_opus":0.008622625722298683,"score_gpt":0.24901739414567142,"score_spread":0.24039476842337273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980111226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45808485,0.00017755103,0.5412412,0.00014791262,0.0001566683,0.00009591329,0.0000075687294,0.000030463674,0.00005783104],"genre_scores_gemma":[0.8664321,0.0001346695,0.1333097,0.000039163388,0.000054907447,0.000010422096,0.000006507077,0.0000111434865,0.0000013984462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9976706,0.00004717443,0.0011785579,0.00019307694,0.0005652471,0.00034535356],"domain_scores_gemma":[0.9979394,0.00019747483,0.00066283456,0.00039385373,0.00062073435,0.00018571244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004931209,0.0002052791,0.00046219837,0.0022526623,0.00010917536,0.00017475527,0.0007521677,0.000059191396,0.00012801393],"category_scores_gemma":[0.0000721936,0.00018892609,0.00063258776,0.0036263745,0.000040115476,0.0010289832,0.000100921294,0.00028008473,0.0000016988098],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024855162,0.00082623796,0.2934915,0.0004174278,0.01302724,0.00007789003,0.015344867,0.294689,0.08583487,0.20982116,0.0029855517,0.083459355],"study_design_scores_gemma":[0.0045900433,0.00090504746,0.516145,0.00037242318,0.0018189341,0.00012654033,0.0047765463,0.44621933,0.008554019,0.007743982,0.006973415,0.001774712],"about_ca_topic_score_codex":0.000054592834,"about_ca_topic_score_gemma":0.00001952488,"teacher_disagreement_score":0.40834722,"about_ca_system_score_codex":0.000027067694,"about_ca_system_score_gemma":0.00005626106,"threshold_uncertainty_score":0.7704182},"labels":[],"label_agreement":null},{"id":"W1982525829","doi":"10.1145/1376804.1376812","title":"EM analysis of a wireless Java-based PDA","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless; Cryptography; Cache; Wireless security; Embedded system; Key (lock); Computer network; Computer security; Wireless network; Telecommunications","score_opus":0.03196447139216319,"score_gpt":0.2819453097444205,"score_spread":0.24998083835225732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982525829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37740391,0.000027538976,0.6218298,0.00005238375,0.00030700827,0.00015757896,0.000017432703,0.00014755678,0.00005677577],"genre_scores_gemma":[0.9818396,0.0000063887182,0.017986622,0.00008540247,0.000022598708,0.000017643973,0.00001253644,0.000011396423,0.00001780029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978092,0.00019563828,0.0006756973,0.00047443397,0.00052190525,0.0003231461],"domain_scores_gemma":[0.9976407,0.00042317464,0.00027225076,0.001338881,0.00022075935,0.00010419901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003984275,0.00020416826,0.00048413387,0.0010968682,0.00048623836,0.000087474975,0.0009982456,0.000079060796,0.000019306855],"category_scores_gemma":[0.000012388477,0.00020480693,0.0003952552,0.003820701,0.00006891226,0.000154002,0.000016697119,0.00018463742,0.000007495882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069737616,0.002045038,0.0062991395,0.0002486511,0.0043943403,0.0000796058,0.035196587,0.87118274,0.0016548131,0.019742418,0.0004179677,0.05866895],"study_design_scores_gemma":[0.0007265932,0.00014625699,0.0036245624,0.000051156443,0.0002373734,0.000022566073,0.0008656259,0.9928313,0.0010140522,0.00006535359,0.00013353647,0.00028161998],"about_ca_topic_score_codex":0.0003745119,"about_ca_topic_score_gemma":0.00008307172,"teacher_disagreement_score":0.6044357,"about_ca_system_score_codex":0.000056406185,"about_ca_system_score_gemma":0.00010528345,"threshold_uncertainty_score":0.83517843},"labels":[],"label_agreement":null},{"id":"W1983153670","doi":"10.1109/ccece.2013.6567847","title":"Theoretical simple power analysis of the grain stream cipher","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Stream cipher; Stream cipher attack; Computer science; Block cipher; Correlation attack; Transposition cipher; Power analysis; Cipher; Cryptography; Affine cipher; Hamming distance; Two-square cipher; Running key cipher; Theoretical computer science; Algorithm; CBC-MAC; Computer security; Encryption","score_opus":0.006856404317459762,"score_gpt":0.25484982979905907,"score_spread":0.2479934254815993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983153670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.750134,0.0000075882067,0.23107813,0.0023510922,0.00007177041,0.00017541712,0.0000071547593,0.000038055772,0.016136779],"genre_scores_gemma":[0.99598515,8.259698e-7,0.0034760616,0.0004837721,0.0000030525289,0.000008261186,0.0000020154903,0.0000016350693,0.000039236733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999321,0.00005497861,0.00016636588,0.00013764105,0.00018612457,0.00013393018],"domain_scores_gemma":[0.9992574,0.0000717127,0.00004039036,0.00051939476,0.00007418149,0.000036928108],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014400446,0.000055088713,0.00010019942,0.00010062041,0.00006533034,0.00006424925,0.00049127976,0.000019620922,0.007833871],"category_scores_gemma":[0.000016863289,0.000030802126,0.00016907108,0.0014035138,0.0001182128,0.00012002845,0.00017525128,0.000041220952,0.0000092372975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.8355888e-7,0.000035028737,0.010470742,4.34613e-7,0.00009110307,6.852848e-8,0.00039405935,0.000007241615,0.00008442498,0.9852749,0.0019100017,0.0017317745],"study_design_scores_gemma":[0.00023638313,0.00005759305,0.49078768,0.0000014809345,0.00014142874,8.0689756e-7,0.00066170446,0.105912305,0.0008825117,0.39946738,0.0016823657,0.00016836799],"about_ca_topic_score_codex":0.0003136758,"about_ca_topic_score_gemma":0.00015513154,"teacher_disagreement_score":0.58580756,"about_ca_system_score_codex":0.000004764842,"about_ca_system_score_gemma":0.000013524393,"threshold_uncertainty_score":0.9930731},"labels":[],"label_agreement":null},{"id":"W1984060119","doi":"10.1007/s00779-012-0563-9","title":"SN-SEC: a secure wireless sensor platform with hardware cryptographic primitives","year":2012,"lang":"en","type":"article","venue":"Personal and Ubiquitous Computing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Dalhousie University","funders":"","keywords":"Computer science; Cryptographic primitive; Cryptography; Embedded system; Wireless; Computer network; Cryptographic protocol; Computer hardware; Computer security; Operating system","score_opus":0.01939866819038958,"score_gpt":0.25138950417764255,"score_spread":0.23199083598725298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984060119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8446441,0.00040969843,0.15358475,0.0003164802,0.00017552557,0.00018655515,0.000010488452,0.00017395699,0.0004984392],"genre_scores_gemma":[0.97636646,0.000040478677,0.022887876,0.00035516123,0.00030746372,0.0000081145745,0.000009800056,0.000015274525,0.000009374771],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982758,0.00004889665,0.00023230183,0.0004053454,0.00036796357,0.00066967343],"domain_scores_gemma":[0.9991901,0.00014695844,0.00012383948,0.00019050534,0.00010507817,0.00024352295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031758845,0.0002560393,0.00024337873,0.00019113193,0.0006700192,0.00025183556,0.0002717485,0.000066630586,0.000016380924],"category_scores_gemma":[0.000005614518,0.00020607203,0.00009031394,0.0005337265,0.00012902063,0.00059560087,0.00023966836,0.0002519401,0.000003870893],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009226816,0.00067370775,0.32421932,0.00040154913,0.00040756253,0.00006425903,0.13917215,0.000019427658,0.0017960698,0.31588247,0.000560935,0.21671025],"study_design_scores_gemma":[0.0058654854,0.0015339514,0.7020343,0.0007287378,0.0002090099,0.0023681603,0.0329125,0.22410563,0.0017355068,0.0040549533,0.020749347,0.003702446],"about_ca_topic_score_codex":0.000065965716,"about_ca_topic_score_gemma":0.000034595854,"teacher_disagreement_score":0.37781495,"about_ca_system_score_codex":0.000020324567,"about_ca_system_score_gemma":0.00004283954,"threshold_uncertainty_score":0.84033734},"labels":[],"label_agreement":null},{"id":"W1986968979","doi":"10.1007/s12095-011-0061-3","title":"Fault analysis of the NTRUSign digital signature scheme","year":2012,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Signature (topology); Digital signature; Discrete mathematics; NTRU; Transpose; Computer science; Combinatorics; Polynomial; Lattice (music); Mathematics; Algorithm; Physics; Cryptography; Computer security; Quantum mechanics; Mathematical analysis; Geometry","score_opus":0.021450423385992394,"score_gpt":0.2749272250956457,"score_spread":0.2534768017096533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986968979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51094216,0.01284183,0.4604293,0.005114133,0.00027557762,0.00063916715,0.00042391743,0.00020222766,0.009131655],"genre_scores_gemma":[0.97927046,0.00021520411,0.020288896,0.00016039581,0.000007678602,0.000020487507,0.000030207828,0.000002867357,0.0000037753866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999261,0.00007928976,0.00021427135,0.00011573356,0.00015504143,0.00017464306],"domain_scores_gemma":[0.9978467,0.00016809479,0.000119213,0.0017065582,0.00008921194,0.00007022607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018395648,0.00008913522,0.00013614364,0.0003203759,0.0004396761,0.000113163296,0.0013505043,0.00004648161,0.000013139724],"category_scores_gemma":[0.000019222358,0.00006607879,0.00024864264,0.003731756,0.00028935468,0.0005168011,0.0006153169,0.00015747514,7.052554e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.2756486e-7,0.00016238025,0.15574482,0.0000033042827,0.000349498,1.6901648e-8,0.0026644063,0.0000026327557,0.0002587589,0.83174586,0.00014151783,0.008925977],"study_design_scores_gemma":[0.00036537557,0.00003436795,0.9262744,0.000017184451,0.00054116786,0.00000379818,0.0017897844,0.0075108395,0.00024076749,0.025160603,0.037712704,0.00034898636],"about_ca_topic_score_codex":0.000019077264,"about_ca_topic_score_gemma":0.000033313412,"teacher_disagreement_score":0.80658525,"about_ca_system_score_codex":0.000003891475,"about_ca_system_score_gemma":0.000015419388,"threshold_uncertainty_score":0.33816776},"labels":[],"label_agreement":null},{"id":"W1989439931","doi":"10.1016/j.disc.2006.03.055","title":"On some probabilistic approximations for AES-like s-boxes","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Queen's University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Affine transformation; Block cipher; S-box; Algebraic number; Discrete mathematics; Simple (philosophy); Block size; Key schedule; Transformation (genetics); Cryptanalysis; Combinatorics; Cryptography; Differential cryptanalysis; Algorithm; Pure mathematics; Computer science; Key (lock)","score_opus":0.01881262860321052,"score_gpt":0.2796773462501362,"score_spread":0.26086471764692565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989439931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027646087,0.00001763972,0.9685295,0.00065242714,0.00013715445,0.0007388646,0.00006412837,0.00015470413,0.0020594704],"genre_scores_gemma":[0.5908604,0.0000023171438,0.40816277,0.00019228137,0.000060029113,0.00034511447,0.00007660031,0.000018922767,0.0002815026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989832,0.000016703989,0.00031746685,0.00023562675,0.00020682378,0.00024017159],"domain_scores_gemma":[0.9990233,0.00027751434,0.00011311912,0.00048055104,0.00006564425,0.000039850358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022027819,0.00013449318,0.00015097875,0.00010929386,0.00023045333,0.00019679773,0.00037826883,0.000034289806,0.000018702041],"category_scores_gemma":[0.00005509709,0.00011221127,0.00011243165,0.00024683494,0.00004592814,0.00023590874,0.00006207097,0.000054770142,0.000016443506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.557008e-7,0.00015813984,0.000005579391,0.000095038835,0.000007121538,4.1915615e-7,0.000492005,0.00015086583,0.00004601493,0.9966815,0.0019968888,0.00036547316],"study_design_scores_gemma":[0.00023850349,0.00007167774,0.00004801463,0.000017306209,0.000010243604,0.0000025229344,0.00007668963,0.16783561,0.00009554223,0.83049476,0.0009778575,0.00013126378],"about_ca_topic_score_codex":0.000009216784,"about_ca_topic_score_gemma":0.000017531755,"teacher_disagreement_score":0.56321436,"about_ca_system_score_codex":0.000023325458,"about_ca_system_score_gemma":0.000026570058,"threshold_uncertainty_score":0.4575843},"labels":[],"label_agreement":null},{"id":"W1996503705","doi":"10.1007/s11227-007-0107-7","title":"A Parallel Algorithm for determining the inverse of a matrix for use in blockcipher encryption/decryption","year":2007,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Encryption; 56-bit encryption; Probabilistic encryption; On-the-fly encryption; Algorithm; Multiple encryption; Cryptography; Computer security; 40-bit encryption; Key (lock); Theoretical computer science","score_opus":0.04553439668611031,"score_gpt":0.32438283499808607,"score_spread":0.27884843831197575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996503705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4602589,0.000028251858,0.5392929,0.000105735155,0.00011130324,0.00019552761,0.0000021010978,0.0000037872987,0.0000015288734],"genre_scores_gemma":[0.51399857,0.000013578407,0.48578003,0.000088725414,0.00010831298,0.0000022915524,0.0000010947102,0.0000054185507,0.0000019647614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868506,0.00008465803,0.00067643967,0.00009162963,0.0002120471,0.00025013785],"domain_scores_gemma":[0.9977298,0.0014223946,0.00032539835,0.00017681919,0.00030899464,0.000036613194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040189954,0.00009259779,0.00017086996,0.00016458961,0.00021305641,0.000065982866,0.0005228297,0.00003613976,0.0000023071552],"category_scores_gemma":[0.000100004676,0.000056890054,0.00015423122,0.00035313438,0.00005152813,0.0004074956,0.000081741695,0.00014438272,1.9003673e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040287254,0.0006908031,0.04387683,0.00015564013,0.00025807234,0.000014434356,0.069713615,0.01226351,0.006288125,0.019314662,0.0015329906,0.8454884],"study_design_scores_gemma":[0.003364278,0.0004560708,0.027727406,0.00010954309,0.000060167353,0.000099025296,0.0038546969,0.9561685,0.00043915244,0.006562422,0.0009825886,0.0001762012],"about_ca_topic_score_codex":0.000061293125,"about_ca_topic_score_gemma":0.00018036655,"teacher_disagreement_score":0.94390494,"about_ca_system_score_codex":0.000036547553,"about_ca_system_score_gemma":0.00005082009,"threshold_uncertainty_score":0.23199092},"labels":[],"label_agreement":null},{"id":"W2001593096","doi":"10.1109/isvlsi.2010.14","title":"Differential Power Analysis of CAST-128","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Power analysis; Differential (mechanical device); Computer science; Power (physics); Physics; Engineering; Algorithm; Aerospace engineering; Cryptography","score_opus":0.008387314775804495,"score_gpt":0.27201281755414014,"score_spread":0.26362550277833563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001593096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6467471,8.7706974e-7,0.35130075,0.0001012816,0.00014573293,0.000022698554,0.0000037473599,0.000019259105,0.0016585521],"genre_scores_gemma":[0.98768693,7.2516787e-7,0.012216348,0.000044934026,0.0000064557194,0.0000016385254,0.0000042571537,0.0000011009793,0.00003760283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994942,0.000009928425,0.00013720257,0.00012764194,0.00013566768,0.00009536756],"domain_scores_gemma":[0.99950266,0.00002800197,0.00003843915,0.00033905843,0.000054799842,0.000037039958],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000058514,0.000044190274,0.00010087628,0.00028409433,0.000039623894,0.000041175703,0.0002858015,0.00002070339,0.0023699186],"category_scores_gemma":[0.000005413854,0.00003531421,0.00011833714,0.00096100784,0.000026483023,0.00010245608,0.00008745633,0.00005661647,0.0000036393983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014983584,0.00013387523,0.028698586,0.0000015782481,0.0003178729,0.0000014104029,0.0011049738,0.0000033980011,0.01712217,0.9457181,0.00042268969,0.0064738323],"study_design_scores_gemma":[0.0006100726,0.000104266815,0.89137065,0.0000011170255,0.00033406832,0.0000041093895,0.00020679839,0.085745096,0.010923841,0.00523593,0.005150708,0.00031336083],"about_ca_topic_score_codex":0.00017927741,"about_ca_topic_score_gemma":0.0012033104,"teacher_disagreement_score":0.9404822,"about_ca_system_score_codex":0.0000014518449,"about_ca_system_score_gemma":0.00001129134,"threshold_uncertainty_score":0.9985421},"labels":[],"label_agreement":null},{"id":"W2003234729","doi":"10.1007/s13389-014-0087-5","title":"Synchronous sampling and clock recovery of internal oscillators for side channel analysis and fault injection","year":2014,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clock domain crossing; CPU multiplier; Digital clock manager; Computer science; Oscilloscope; Clock drift; Glitch; Synchronous circuit; Microcontroller; Fault (geology); Sampling (signal processing); Crystal oscillator; Real-time computing; Clock gating; Embedded system; Clock signal; Jitter; Detector; Telecommunications","score_opus":0.008588975450393664,"score_gpt":0.24319232048916056,"score_spread":0.2346033450387669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003234729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4509082,0.00022576506,0.5486363,0.000025185116,0.00014909197,0.00004090218,0.0000017543332,0.000009053348,0.0000036948938],"genre_scores_gemma":[0.9200881,0.00017905951,0.079625316,0.000018543622,0.00007856521,0.0000026312134,5.574934e-7,0.0000069425973,2.8514984e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896926,0.000022727852,0.0005037745,0.0001537125,0.00018282801,0.00016767567],"domain_scores_gemma":[0.9989969,0.0002627498,0.00032961808,0.00013288326,0.00018006074,0.000097788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072866096,0.00012202108,0.00032259483,0.0014010636,0.00007073518,0.00008970051,0.00016825774,0.000051003237,9.286022e-7],"category_scores_gemma":[0.00010912709,0.00011410102,0.00021973168,0.00091180287,0.00003001902,0.00035151615,0.000054752985,0.00013488636,1.9338334e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029173505,0.00034875842,0.21022885,0.0013852628,0.007661215,0.0000116433275,0.008225788,0.37576008,0.038475003,0.14105953,0.00006559923,0.21648654],"study_design_scores_gemma":[0.0020295156,0.0018676653,0.20546412,0.00027165096,0.00070467725,0.0003046664,0.0003618234,0.77205294,0.0019386135,0.013398596,0.0010570261,0.0005486869],"about_ca_topic_score_codex":0.00004112524,"about_ca_topic_score_gemma":0.000029729552,"teacher_disagreement_score":0.4691799,"about_ca_system_score_codex":0.000013858773,"about_ca_system_score_gemma":0.00001484155,"threshold_uncertainty_score":0.46529046},"labels":[],"label_agreement":null},{"id":"W2003555324","doi":"10.1007/s13389-011-0013-z","title":"High performance GHASH and impacts of a class of unconventional bases","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Element (criminal law); Function (biology); Field (mathematics); Discrete mathematics; Mathematics; Polynomial; Block cipher; Multiplication (music); String (physics); Set (abstract data type); Class (philosophy); Finite field; Binary number; Arithmetic; Computer science; Combinatorics; Algorithm; Cryptography; Pure mathematics","score_opus":0.014036748155026387,"score_gpt":0.21552691618314104,"score_spread":0.20149016802811465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003555324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86316675,0.0002706377,0.13626967,0.000025697167,0.00018634062,0.000039985338,0.0000031114846,0.000009059435,0.000028725173],"genre_scores_gemma":[0.93523705,0.00029838015,0.06442289,0.000009298815,0.000025427466,0.0000010175067,3.775772e-7,0.0000052542537,3.2290984e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989042,0.000017177546,0.00056315545,0.000085320586,0.00028244886,0.00014769186],"domain_scores_gemma":[0.9990633,0.000068538,0.00039452987,0.0001505892,0.00023403158,0.000089015615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044194993,0.0001021094,0.00024504118,0.00063795946,0.000028553522,0.000015424177,0.0002763349,0.000035831243,0.000023973067],"category_scores_gemma":[0.000030039473,0.00009012477,0.00013258393,0.00060695404,0.000059608043,0.00048390927,0.000056893285,0.00013274218,9.209197e-8],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011697165,0.0006012105,0.27174953,0.00086508313,0.00067722815,0.000033113676,0.00447944,0.0013820656,0.044567134,0.662415,0.00010927374,0.013003911],"study_design_scores_gemma":[0.0019379266,0.0013356808,0.9421248,0.00053860457,0.00008344527,0.00026682895,0.00018485366,0.015924368,0.03162705,0.005399825,0.00026756493,0.00030905052],"about_ca_topic_score_codex":0.000026718722,"about_ca_topic_score_gemma":0.0000039579995,"teacher_disagreement_score":0.6703753,"about_ca_system_score_codex":0.0000065287777,"about_ca_system_score_gemma":0.000047277525,"threshold_uncertainty_score":0.36751816},"labels":[],"label_agreement":null},{"id":"W2006014260","doi":"10.1504/ijcnds.2009.027595","title":"A mesh check-sum ABFT scheme for stream ciphers","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Checksum; RC4; Stream cipher; Scheme (mathematics); Overhead (engineering); Error detection and correction; Algorithm; Parallel computing; Cryptography; Mathematics","score_opus":0.018645262220896675,"score_gpt":0.3038732293090233,"score_spread":0.2852279670881266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006014260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012183311,0.0024102533,0.98077834,0.0036702405,0.0005214939,0.00018224932,0.00004529873,0.000024004617,0.0001848252],"genre_scores_gemma":[0.99184346,0.00074201403,0.0069417837,0.0001735427,0.00016224156,0.000009073465,0.000115688636,0.000003518677,0.000008677078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987429,0.000088354165,0.0006106407,0.000110978515,0.00030500704,0.00014215503],"domain_scores_gemma":[0.9979666,0.0001866324,0.00056743354,0.00031457108,0.00086960616,0.00009517313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006823644,0.000102550526,0.0001845301,0.00011868634,0.00014485528,0.00043566353,0.0010936842,0.000058547805,0.0000041689564],"category_scores_gemma":[0.000049454287,0.00009188029,0.000111963294,0.00018613134,0.00003458193,0.0004757331,0.00008457425,0.00015078907,2.9451604e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014489354,0.00041800144,0.0044572097,0.0000120263685,0.00044458968,0.000009358731,0.0006125611,0.015288885,0.00012238002,0.9129095,0.030480543,0.035100035],"study_design_scores_gemma":[0.0036152783,0.000443514,0.01607412,0.00029392683,0.00004521514,0.00030815508,0.0011762163,0.869047,0.000030598436,0.013364396,0.095226325,0.0003752591],"about_ca_topic_score_codex":0.000020106007,"about_ca_topic_score_gemma":0.000007420939,"teacher_disagreement_score":0.97966015,"about_ca_system_score_codex":0.000055231052,"about_ca_system_score_gemma":0.000052333722,"threshold_uncertainty_score":0.42011136},"labels":[],"label_agreement":null},{"id":"W2007022373","doi":"10.1007/s11036-012-0353-7","title":"FPGA Implementation and Energy Cost Analysis of Two Light-Weight Involutional Block Ciphers Targeted to Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Field-programmable gate array; Wireless sensor network; Block cipher; Embedded system; Encryption; Cipher; Cryptography; Energy consumption; Logic block; Advanced Encryption Standard; Computer hardware; Computer network; Algorithm; Electrical engineering","score_opus":0.008951567315496328,"score_gpt":0.2774609015717936,"score_spread":0.26850933425629725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007022373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05803515,0.0011127795,0.93999696,0.00016729783,0.00006571714,0.00044778804,0.000040769,0.000044233653,0.00008933584],"genre_scores_gemma":[0.9955562,0.0004087038,0.0023342173,0.0002476312,0.0001833868,0.0010540161,0.0001951121,0.000008610807,0.000012157171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987231,0.000059154514,0.0003708979,0.00033261804,0.00016334049,0.00035090337],"domain_scores_gemma":[0.9990655,0.00010402419,0.00015095754,0.0003325209,0.00011350215,0.00023345341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023819719,0.00015035781,0.00023097731,0.00024957524,0.00032313017,0.000077446515,0.0001878387,0.00005571668,0.000034406516],"category_scores_gemma":[8.471379e-7,0.00014867073,0.00007702656,0.001983627,0.000057073812,0.00020823453,0.00015795136,0.0000753225,5.1881295e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012698361,0.00038979438,0.07036953,0.00001265194,0.00080113957,4.341154e-7,0.0007302997,0.23887199,0.00067183614,0.38717595,0.0028756594,0.29808804],"study_design_scores_gemma":[0.0011579909,0.00012682186,0.08372157,0.000012215365,0.0007228875,0.000009344146,0.0011001138,0.77577204,0.0005019198,0.00051551865,0.13565756,0.0007020073],"about_ca_topic_score_codex":0.00022722335,"about_ca_topic_score_gemma":0.00050973095,"teacher_disagreement_score":0.9376627,"about_ca_system_score_codex":0.000026922378,"about_ca_system_score_gemma":0.000017127328,"threshold_uncertainty_score":0.6062617},"labels":[],"label_agreement":null},{"id":"W2007436309","doi":"10.1109/isit.2005.1523512","title":"Comparison of boolean function design","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Finite field; Stream cipher; Boolean function; Correlation attack; Computer science; Filter (signal processing); Function (biology); Cipher; Theoretical computer science; Algebraic number; Field (mathematics); Algorithm; Cryptography; Arithmetic; Mathematics; Discrete mathematics; Pure mathematics; Encryption; Computer security","score_opus":0.07079448931353692,"score_gpt":0.35217183639883376,"score_spread":0.2813773470852968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007436309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013969967,0.000035139725,0.98328996,0.0003485962,0.000057295874,0.000060691284,2.4307434e-7,0.000051577015,0.002186508],"genre_scores_gemma":[0.8325002,0.0000015674141,0.16734083,0.000104127255,0.0000149429725,0.000002130924,7.5357997e-7,0.0000010359001,0.000034382152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955016,0.000023329001,0.0001510842,0.00009083683,0.00010627918,0.00007833531],"domain_scores_gemma":[0.99970365,0.000031492025,0.000040991836,0.0001663816,0.00003447104,0.0000230313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014083488,0.000035762663,0.00006189481,0.00006567698,0.00004562889,0.00002371147,0.00015884395,0.000012967533,0.00013430967],"category_scores_gemma":[0.0000029635462,0.000031347845,0.000026904248,0.00020134861,0.000012482857,0.00020072615,0.000032825457,0.000027863915,0.000016650343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006587601,0.00019842778,0.0069610695,0.0000038533803,0.000013858433,1.1449518e-7,0.0013464174,0.00070940173,0.0016052942,0.69053835,0.012963798,0.28565282],"study_design_scores_gemma":[0.0010076375,0.00069191284,0.04387477,0.000007822218,0.000019678744,0.0000036311112,0.0007376673,0.80270094,0.0541155,0.017582934,0.07893881,0.00031868822],"about_ca_topic_score_codex":0.000017779676,"about_ca_topic_score_gemma":0.000037370177,"teacher_disagreement_score":0.81853026,"about_ca_system_score_codex":0.00000603156,"about_ca_system_score_gemma":0.0000121357525,"threshold_uncertainty_score":0.14705966},"labels":[],"label_agreement":null},{"id":"W2010738008","doi":"10.1145/972627.972632","title":"Design of secure cryptography against the threat of power-attacks in DSP-embedded processors","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Very long instruction word; Power analysis; Cryptography; Overhead (engineering); Elliptic curve cryptography; Embedded system; Digital signal processing; Multi-core processor; Wireless; Public-key cryptography; Computer hardware; Encryption; Parallel computing; Computer network; Computer security; Telecommunications","score_opus":0.023852957896184607,"score_gpt":0.28040937679463385,"score_spread":0.25655641889844927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010738008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17406185,0.00020235774,0.8240217,0.00021040773,0.00041421465,0.0008196276,0.000011988033,0.00010947126,0.00014836251],"genre_scores_gemma":[0.964017,0.000038694074,0.035792574,0.000062228944,0.00001792349,0.000046236855,0.0000033161725,0.0000199706,0.0000020760142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971346,0.00030157698,0.0010085547,0.0005119966,0.0006005306,0.00044268873],"domain_scores_gemma":[0.99739474,0.0005111723,0.00045694236,0.001293015,0.00026560118,0.00007854765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009900783,0.00029939789,0.00048157052,0.00067719247,0.00029978083,0.000104478735,0.0015717814,0.00013232607,0.0000051082607],"category_scores_gemma":[0.00003068406,0.00024152324,0.00023097754,0.0026644613,0.00016333969,0.00027090302,0.00003463727,0.00037802462,0.000002904718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006165928,0.00091221544,0.0003546954,0.00024993654,0.00022440279,0.000010920846,0.041511387,0.9156925,0.002141126,0.031205652,0.0000367853,0.007598702],"study_design_scores_gemma":[0.027340118,0.0059300344,0.008411535,0.006822102,0.00043072845,0.00037279836,0.09765341,0.69475806,0.073093355,0.07992114,0.00047845184,0.0047882614],"about_ca_topic_score_codex":0.00021391963,"about_ca_topic_score_gemma":0.000041744242,"teacher_disagreement_score":0.78995514,"about_ca_system_score_codex":0.00006749287,"about_ca_system_score_gemma":0.00017752127,"threshold_uncertainty_score":0.9849032},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030490085285041307,"score_gpt":0.2580076248966527,"score_spread":0.2275175396116114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010870387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7138272,0.000110327856,0.28177273,0.0012864502,0.0008287278,0.00014016691,0.000006713953,0.0002012606,0.0018264421],"genre_scores_gemma":[0.9865606,0.000047744645,0.012982969,0.00019567972,0.00016575945,0.000011388398,0.000002956669,0.000004132363,0.000028799946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990213,0.00005427648,0.0001826338,0.00032769708,0.00019151218,0.00022260865],"domain_scores_gemma":[0.9993829,0.000088565685,0.000054687604,0.00035631206,0.00003843163,0.00007909047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007980512,0.00012092658,0.00015908672,0.000158293,0.00019579913,0.00013166596,0.00031388397,0.000061548126,0.0004577851],"category_scores_gemma":[0.00004330028,0.00010089641,0.000075553115,0.0003740447,0.00006845266,0.00014028337,0.00012549809,0.00012100547,0.000052443094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015769167,0.000302276,0.005565667,0.000010800898,0.00009968967,0.000035035515,0.00135674,0.000009202414,0.0008070721,0.91872525,0.007842141,0.06523034],"study_design_scores_gemma":[0.009432502,0.002650969,0.13763887,0.00005680613,0.0003048903,0.00012599319,0.00043189875,0.6123682,0.0037667346,0.10509514,0.12539324,0.0027347666],"about_ca_topic_score_codex":0.000014691406,"about_ca_topic_score_gemma":0.000009346875,"teacher_disagreement_score":0.8136301,"about_ca_system_score_codex":0.000012580708,"about_ca_system_score_gemma":0.0000053248255,"threshold_uncertainty_score":0.5012426},"labels":[],"label_agreement":null},{"id":"W2012097051","doi":"10.5539/cis.v7n1p115","title":"An Improved Guess-and-Determine Attack on the A5/1 Stream Cipher","year":2014,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stream cipher; Computer science; Stream cipher attack; Computer security; GSM; Confidentiality; Cipher; Real-time computing; Cryptography; Computer network; Encryption","score_opus":0.02584203738730777,"score_gpt":0.2952412124413298,"score_spread":0.269399175054022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012097051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34113201,0.0000033638755,0.65617347,0.00090346066,0.00021581461,0.00014058809,0.0000021100727,0.000057635625,0.0013715619],"genre_scores_gemma":[0.9837054,0.000010395801,0.013153604,0.0030734926,0.000043514363,0.0000071907216,0.0000026596651,0.0000012594307,0.000002464244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914354,0.000031749605,0.00020463322,0.00018209398,0.00025153634,0.0001864602],"domain_scores_gemma":[0.99919707,0.000082427156,0.000082077364,0.00041235043,0.00012244677,0.000103660015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082781375,0.00008937893,0.00007270014,0.00015552837,0.0005166745,0.0010093333,0.0006144338,0.000018189645,0.000007473006],"category_scores_gemma":[0.000020498523,0.000057927988,0.000016729651,0.00047210368,0.00023749124,0.0053254934,0.00022180902,0.00006940495,0.000009339656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030395431,0.000026662225,0.0006691173,0.000009065786,0.000002698273,1.04574646e-7,0.0049071554,0.00007102104,0.00016101751,0.31907883,0.0005156138,0.67455566],"study_design_scores_gemma":[0.00021564854,0.00024048238,0.029554611,0.000006006445,0.0000012079038,0.0000073925457,0.00006716744,0.9576567,0.0001967832,0.00091468316,0.0110327015,0.00010664343],"about_ca_topic_score_codex":0.000011322292,"about_ca_topic_score_gemma":0.0000029301766,"teacher_disagreement_score":0.95758563,"about_ca_system_score_codex":0.00000836519,"about_ca_system_score_gemma":0.00002914019,"threshold_uncertainty_score":0.9733024},"labels":[],"label_agreement":null},{"id":"W2012152079","doi":"10.5539/cis.v3n3p56","title":"Grid Signature: High Performance Digital Signature Through Using Alchemi Grid Computing.","year":2010,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Digital signature; Signature (topology); Cryptography; Grid; Hash function; Elliptic Curve Digital Signature Algorithm; Communication source; Grid computing; Cryptographic hash function; Distributed computing; Cryptographic primitive; Digital Signature Algorithm; Cryptographic protocol; Public-key cryptography; Algorithm; Elliptic curve cryptography; Computer security; Computer network; Encryption","score_opus":0.01053606590091772,"score_gpt":0.25423381643211507,"score_spread":0.24369775053119735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012152079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48483905,0.000015248348,0.51219994,0.00020299952,0.00197856,0.00013927296,0.000014601216,0.00011024335,0.0005000655],"genre_scores_gemma":[0.889529,0.000015924887,0.10910822,0.0010558417,0.00025915695,0.0000018075913,0.00002562456,0.0000031201391,0.0000013222487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982465,0.000009689534,0.00040053885,0.0003275031,0.0006029134,0.0004128533],"domain_scores_gemma":[0.9987978,0.000059129554,0.00019332666,0.00044078924,0.00036777207,0.00014122212],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00047429444,0.00018943215,0.00015411712,0.00028710676,0.00085956533,0.0018769789,0.0010667694,0.000083039435,0.000011220261],"category_scores_gemma":[0.000024915478,0.00016467138,0.000043519805,0.0015318258,0.00040555513,0.020981994,0.0006816802,0.0003994194,0.000013579831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017830725,0.00016017581,0.006404501,0.00015123883,0.000031840413,0.000005125167,0.021016732,0.0034184773,0.0073200497,0.36665866,0.005780487,0.5890349],"study_design_scores_gemma":[0.0005875327,0.00011010892,0.022074306,0.000027565156,0.0000046755417,0.00013913676,0.00008134422,0.942817,0.004162246,0.0010382766,0.028503383,0.00045445136],"about_ca_topic_score_codex":0.000014179153,"about_ca_topic_score_gemma":8.616676e-7,"teacher_disagreement_score":0.9393985,"about_ca_system_score_codex":0.000024157238,"about_ca_system_score_gemma":0.00015788981,"threshold_uncertainty_score":0.99915916},"labels":[],"label_agreement":null},{"id":"W2016052071","doi":"10.1109/ccece.2012.6334887","title":"Applicability of simple power analysis to stream ciphers constructed using multiple LFSRs","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Stream cipher; Shift register; Computer science; Stream cipher attack; Block size; Correlation attack; Key schedule; Block cipher; Cryptography; Parallel computing; Chip; Algorithm; Computer hardware; Arithmetic; Differential cryptanalysis; Mathematics; Key (lock); Telecommunications","score_opus":0.024789401121527745,"score_gpt":0.31023590082922203,"score_spread":0.2854464997076943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016052071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54740626,0.0000041743892,0.451989,0.000022273105,0.000030492489,0.00012002588,0.000014992096,0.000031466778,0.0003813447],"genre_scores_gemma":[0.874186,3.04471e-7,0.12571196,0.000077761884,0.000007038634,0.0000061071314,0.0000066832486,0.0000027282433,0.0000014405439],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998908,0.000047732825,0.0003042373,0.00023168039,0.00021241252,0.00029595356],"domain_scores_gemma":[0.9989626,0.00011045226,0.00008027848,0.00055842556,0.00011536362,0.0001728887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002945212,0.00009774156,0.00020429165,0.00024556855,0.00008656093,0.000035946243,0.00030308275,0.00003189785,0.00044586105],"category_scores_gemma":[0.00003328088,0.000088325905,0.00014399194,0.0022763403,0.000057632282,0.00026907612,0.00017771166,0.00004300885,0.0000033186632],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005518165,0.00021098368,0.9521053,0.0000053661447,0.000264339,1.9101964e-7,0.0019412971,0.00035567622,0.0031987452,0.035706893,0.00012414054,0.006081561],"study_design_scores_gemma":[0.001203045,0.00014126037,0.8129631,0.0000038062917,0.00038140398,0.0000057235807,0.0078037125,0.15775216,0.013872317,0.0022947679,0.0028002793,0.0007784093],"about_ca_topic_score_codex":0.0010559601,"about_ca_topic_score_gemma":0.00034465286,"teacher_disagreement_score":0.32677972,"about_ca_system_score_codex":0.000028403061,"about_ca_system_score_gemma":0.000027015494,"threshold_uncertainty_score":0.4881866},"labels":[],"label_agreement":null},{"id":"W2021418829","doi":"10.1016/j.procs.2011.08.033","title":"An evolutionary computation attack on one-round TEA","year":2011,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Byte; Ciphertext; Computation; Encryption; Key (lock); Word (group theory); Theoretical computer science; Population; Algorithm; Mathematics; Computer security; Operating system","score_opus":0.09420885618557555,"score_gpt":0.32711132055310216,"score_spread":0.2329024643675266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021418829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16346027,0.000015439942,0.8339802,0.00018373804,0.0006793579,0.00024349698,0.0000026974803,0.00028646007,0.0011483346],"genre_scores_gemma":[0.6368039,0.0000030692684,0.3626068,0.00046489618,0.000094099436,0.000015828697,0.0000038634366,0.0000050113736,0.0000025266004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748546,0.000051870837,0.00030456507,0.00086920284,0.00078889495,0.00050000293],"domain_scores_gemma":[0.99857473,0.000055351935,0.00012702214,0.00061794464,0.0003642957,0.00026067367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064062455,0.00018393918,0.00014387323,0.0004737024,0.0006604804,0.00039669446,0.001833587,0.000041355856,0.000020583642],"category_scores_gemma":[0.000016418015,0.00018122105,0.000052552976,0.0018247189,0.0003575665,0.0024800135,0.00032911668,0.00015324866,0.00007668924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033505614,0.0023104413,0.01429276,0.00005005886,0.000027479326,0.000025740508,0.021267308,0.0012393349,0.001083727,0.6526411,0.002247015,0.3047815],"study_design_scores_gemma":[0.0004344608,0.00094609946,0.18088077,0.000025935042,0.0000056644417,0.00004053908,0.00005114749,0.7906152,0.00086058525,0.02531214,0.00038699087,0.00044043],"about_ca_topic_score_codex":0.000042515647,"about_ca_topic_score_gemma":0.000010044853,"teacher_disagreement_score":0.7893759,"about_ca_system_score_codex":0.00008388828,"about_ca_system_score_gemma":0.00029586823,"threshold_uncertainty_score":0.738998},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03463365323646356,"score_gpt":0.32714692013608354,"score_spread":0.29251326689962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022521688","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5777072,0.00030167276,0.4131311,0.0063157724,0.00046189755,0.00017455652,0.0000391392,0.000038789578,0.0018299234],"genre_scores_gemma":[0.39182988,0.00088125496,0.6051953,0.0011065745,0.0007317042,0.000007181048,0.00003659432,0.000020176722,0.00019134345],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897087,0.000069025795,0.0004276187,0.00016270902,0.0001551475,0.00021461402],"domain_scores_gemma":[0.9988966,0.00021148006,0.0002267398,0.00046919548,0.0001190077,0.00007698803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046816337,0.00007906026,0.00022095718,0.0001489039,0.00010710755,0.00007020176,0.0013071537,0.000049299393,0.00063031144],"category_scores_gemma":[0.00003601786,0.00006551483,0.000085884276,0.00018362058,0.000056070945,0.00047149358,0.00010107322,0.000098219025,0.000020635583],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003137711,0.00055465376,0.0064788014,0.000046805457,0.00038281368,0.00013753535,0.0026006333,0.00010287646,0.0043039196,0.34496307,0.16621229,0.47390282],"study_design_scores_gemma":[0.003373684,0.0013596864,0.008016561,0.000027910719,0.00010200224,0.0016574006,0.00030873952,0.020347167,0.0006282642,0.15036772,0.81340593,0.00040492768],"about_ca_topic_score_codex":0.000017801314,"about_ca_topic_score_gemma":0.000019556426,"teacher_disagreement_score":0.6471937,"about_ca_system_score_codex":0.0000118250855,"about_ca_system_score_gemma":0.00008582593,"threshold_uncertainty_score":0.6901468},"labels":[],"label_agreement":null},{"id":"W2024305003","doi":"10.3934/amc.2007.1.413","title":"On the security of generalized Jacobian cryptosystems","year":2007,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"University of Waterloo; McGill University","keywords":"Mathematics; Discrete logarithm; Finite field; Elliptic curve; Jacobian matrix and determinant; Pure mathematics; Cryptosystem; Hyperelliptic curve cryptography; Multiplicative function; Cryptography; Logarithm; Elliptic curve cryptography; Algebraic number; Algebra over a field; Applied mathematics; Discrete mathematics; Mathematical analysis; Public-key cryptography; Algorithm; Encryption; Computer science","score_opus":0.02774178960676147,"score_gpt":0.340894421191333,"score_spread":0.3131526315845715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024305003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26130334,0.0028398116,0.6979144,0.0019718823,0.00014356183,0.0008407228,0.000023234712,0.000054982316,0.034908056],"genre_scores_gemma":[0.8732378,0.00060983293,0.12608357,0.0000372443,0.000003035411,0.000018831844,0.000002593397,0.0000035263652,0.0000035691535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998882,0.000096706426,0.0005868283,0.00008843329,0.00021791835,0.0001281056],"domain_scores_gemma":[0.9958817,0.0017127747,0.00033255038,0.0019353026,0.00011585508,0.000021814893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013214095,0.000075010495,0.00017242726,0.0001532131,0.000103722145,0.000014686259,0.0019033831,0.000025598278,0.000010065836],"category_scores_gemma":[0.00014256069,0.000056641977,0.00006348996,0.0006508671,0.00017944067,0.00020661998,0.00026536846,0.000120278506,0.0000016006802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013228581,0.0002273868,0.00020459322,0.000035857436,0.0000063194216,9.8512736e-8,0.0042274017,0.000030081841,0.00020664654,0.9940744,0.000024161545,0.00096172607],"study_design_scores_gemma":[0.00024682467,0.000043917364,0.00030494586,0.00010716566,0.000004903129,0.0000017482853,0.0016152692,0.012817865,0.0021170683,0.9802621,0.0023934324,0.000084747895],"about_ca_topic_score_codex":0.000033939006,"about_ca_topic_score_gemma":0.0006764716,"teacher_disagreement_score":0.6119345,"about_ca_system_score_codex":0.000014612682,"about_ca_system_score_gemma":0.000021121605,"threshold_uncertainty_score":0.3536991},"labels":[],"label_agreement":null},{"id":"W2024310614","doi":"10.1515/jmc.2008.007","title":"Improved security analysis of PMAC","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Regional Municipality of Waterloo; University of Waterloo","funders":"","keywords":"PMAC; Parallelizable manifold; Computer science; Message authentication code; Upper and lower bounds; Authentication (law); Provable security; Theoretical computer science; Algorithm; Mathematics; Cryptography; Computer security","score_opus":0.024771305483093333,"score_gpt":0.29786622476499747,"score_spread":0.27309491928190416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024310614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.439723,0.000053652147,0.5592324,0.0006067569,0.000079882724,0.00004105863,0.0000023741725,0.00000810206,0.000252754],"genre_scores_gemma":[0.90407044,0.000031180545,0.09578798,0.00007988317,0.000023462204,0.000001233406,6.169808e-7,0.000002871176,0.0000023194923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842036,0.000108789376,0.0008774534,0.000119420816,0.00028440444,0.00018958178],"domain_scores_gemma":[0.99844813,0.0002506972,0.0005700225,0.00030399684,0.00032012502,0.00010701832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005775906,0.00009667728,0.00061170704,0.00060253823,0.0000646428,0.000013289375,0.00056682964,0.00006911757,0.00011760471],"category_scores_gemma":[0.00019328945,0.000073816525,0.0004059512,0.0011207333,0.000093129136,0.00019732732,0.00010045238,0.00018236449,0.0000028821582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034538076,0.0008017264,0.004336869,0.00005810605,0.0014730869,0.00010153737,0.0056720893,0.000023559993,0.0019084075,0.983514,0.0009648676,0.0011112115],"study_design_scores_gemma":[0.0026176274,0.001526956,0.025418354,0.000038343813,0.0016040439,0.002465302,0.0013033961,0.14587168,0.004377262,0.8133079,0.00096617924,0.00050295633],"about_ca_topic_score_codex":0.0000046133528,"about_ca_topic_score_gemma":0.0000066037237,"teacher_disagreement_score":0.46434745,"about_ca_system_score_codex":0.000015688418,"about_ca_system_score_gemma":0.00007828006,"threshold_uncertainty_score":0.30101505},"labels":[],"label_agreement":null},{"id":"W2027344232","doi":"10.1109/hst.2013.6581561","title":"Hardware implementations of the WG-5 cipher for passive RFID tags","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cipher; Computer science; Algorithm; Encryption; Operating system","score_opus":0.01672603282185164,"score_gpt":0.2795345560119351,"score_spread":0.26280852319008347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027344232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09333149,0.000012157409,0.8957898,0.0074289683,0.00030199616,0.0011726152,0.00006339774,0.00005074174,0.0018488298],"genre_scores_gemma":[0.95385236,0.000002416915,0.04482228,0.0007087168,0.000021327825,0.00028353356,0.000008543069,0.0000041270196,0.0002967235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99931693,0.00002303852,0.00021048432,0.00014545703,0.0001404703,0.00016362996],"domain_scores_gemma":[0.9992271,0.000087513145,0.00008724514,0.00035999066,0.0002046191,0.000033512504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000071619455,0.00006466647,0.00007277421,0.000043685715,0.00018962151,0.000078922014,0.00047889113,0.000016445128,0.00078181614],"category_scores_gemma":[0.00001585974,0.000041832616,0.000104434985,0.0003105157,0.00003644694,0.00029269318,0.00014273493,0.000031780917,0.0000073921906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.351311e-7,0.00006242382,0.007840361,0.000014515306,0.000039223978,6.7438506e-8,0.002072831,0.000006883512,0.001000056,0.8766881,0.083882056,0.028392656],"study_design_scores_gemma":[0.0037105929,0.00040575158,0.4131631,0.000029952993,0.000072610164,0.00000914849,0.009808458,0.02427698,0.03372935,0.3169245,0.19709241,0.00077712885],"about_ca_topic_score_codex":0.0004063578,"about_ca_topic_score_gemma":0.0003324194,"teacher_disagreement_score":0.86052084,"about_ca_system_score_codex":0.000010606068,"about_ca_system_score_gemma":0.00004332204,"threshold_uncertainty_score":0.8560338},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011817747974241437,"score_gpt":0.2725081471953783,"score_spread":0.26069039922113685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027766149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72651434,0.0009871637,0.26981783,0.0022452394,0.00014443956,0.00026302598,0.0000014460913,0.000009600812,0.00001692919],"genre_scores_gemma":[0.9930493,0.000049617804,0.0066897436,0.00013871994,0.00006532521,0.0000028575355,7.515869e-8,0.0000023848572,0.000001947586],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914545,0.00007841593,0.00029871435,0.00007909222,0.00022134952,0.0001769589],"domain_scores_gemma":[0.99839383,0.0007097843,0.00049119984,0.00015306339,0.0002348062,0.000017295803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093474635,0.0000716335,0.000118256896,0.000052355383,0.00040677853,0.00007812918,0.00035706334,0.000019938596,0.0000011064876],"category_scores_gemma":[0.0004991968,0.00003239806,0.000093689996,0.0003419207,0.00008308297,0.00023419994,0.0000317123,0.00021822938,1.428919e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032178155,0.000027671455,0.00078898616,0.000019681036,0.00009653381,5.954994e-7,0.0036106624,0.0069026435,0.027280409,0.15034442,0.00012269201,0.81048393],"study_design_scores_gemma":[0.005901487,0.0025175007,0.048290443,0.00010276944,0.00019437293,0.0004206565,0.0016662193,0.16414297,0.021552473,0.75202155,0.0029527405,0.00023679271],"about_ca_topic_score_codex":0.00001711647,"about_ca_topic_score_gemma":0.00018510202,"teacher_disagreement_score":0.8102471,"about_ca_system_score_codex":0.000041572894,"about_ca_system_score_gemma":0.00011654635,"threshold_uncertainty_score":0.31286526},"labels":[],"label_agreement":null},{"id":"W2028894887","doi":"10.1145/1165780.1165783","title":"A split-mask countermeasure for low-energy secure embedded systems","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Countermeasure; Wireless; Power analysis; Embedded system; Low energy; Energy (signal processing); Computer security; Internet of Things; Cryptography; Telecommunications; Materials science","score_opus":0.014466288417639219,"score_gpt":0.2558849063214156,"score_spread":0.24141861790377636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028894887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01198145,0.00041137208,0.98145264,0.00022790568,0.0036079737,0.0010411331,0.00013144767,0.0007349197,0.0004111608],"genre_scores_gemma":[0.9837748,0.000009172321,0.014947968,0.000162496,0.0004584098,0.00027854598,0.000060516726,0.000055212437,0.00025287672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959478,0.00032513344,0.0011011495,0.0010132322,0.00075832254,0.0008544112],"domain_scores_gemma":[0.99636215,0.00084409764,0.0004150578,0.0017450099,0.00045981308,0.00017388591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001008093,0.00050049217,0.0006116768,0.00050653727,0.0010291693,0.0009839489,0.0015469196,0.00023835005,0.000007759984],"category_scores_gemma":[0.00003224945,0.00050047756,0.0003944325,0.0010898787,0.00007399663,0.00042686527,0.000034302037,0.00030655655,0.000016619204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012664503,0.0014317193,0.00014366118,0.0010910123,0.0006081419,0.000048842136,0.0060366285,0.3826734,0.0015042523,0.5745168,0.0111937,0.020625219],"study_design_scores_gemma":[0.0022113658,0.00029026836,0.00008112772,0.0004041496,0.00007670447,0.00016718508,0.0018752508,0.97673017,0.00032323823,0.002959546,0.01403671,0.0008442761],"about_ca_topic_score_codex":0.0010771023,"about_ca_topic_score_gemma":0.00014131518,"teacher_disagreement_score":0.97179335,"about_ca_system_score_codex":0.00020470317,"about_ca_system_score_gemma":0.00015316207,"threshold_uncertainty_score":0.9997447},"labels":[],"label_agreement":null},{"id":"W2030135656","doi":"10.1016/j.dam.2005.02.001","title":"Affine equivalence in the AES round function","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Concordia University","funders":"","keywords":"Mathematics; Affine transformation; Monomial; Equivalence (formal languages); Bijection; Advanced Encryption Standard; Transformation (genetics); Affine coordinate system; Combinatorics; Affine space; Pure mathematics; Discrete mathematics; Algebra over a field; Cryptography; Algorithm","score_opus":0.02214921237079641,"score_gpt":0.2764806049613431,"score_spread":0.25433139259054666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030135656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07453992,0.000044515873,0.9054144,0.0016529211,0.000055254553,0.00037603924,0.0000028598702,0.00008033808,0.017833717],"genre_scores_gemma":[0.9253273,0.000020542644,0.07409426,0.00039631064,0.000056315825,0.000071691116,0.0000058113474,0.0000054811285,0.000022262326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990415,0.00001524729,0.00025879015,0.0001829727,0.0002893096,0.00021218388],"domain_scores_gemma":[0.99925834,0.00011915874,0.000077916935,0.000502537,0.000017162303,0.000024883358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004698342,0.000107674394,0.000106628744,0.00008116663,0.000119044584,0.00017525909,0.0005947637,0.000029025732,0.00003888497],"category_scores_gemma":[0.000008977026,0.00007449858,0.00004173875,0.00046149435,0.00003650819,0.00022696728,0.000103546525,0.00010676831,0.000041872954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019152837,0.00007972822,0.00001546859,0.000018077826,0.000004658107,6.4847706e-7,0.006022175,0.000044218552,0.00034962976,0.97587246,0.0003187366,0.01727229],"study_design_scores_gemma":[0.0020806454,0.00019429585,0.0039196103,0.000057778674,0.000058029127,0.000037119018,0.011943006,0.111596696,0.0010619296,0.82745975,0.040774815,0.000816323],"about_ca_topic_score_codex":0.000007086988,"about_ca_topic_score_gemma":0.00008524448,"teacher_disagreement_score":0.8507874,"about_ca_system_score_codex":0.00001894189,"about_ca_system_score_gemma":0.000014235193,"threshold_uncertainty_score":0.30379638},"labels":[],"label_agreement":null},{"id":"W2031189409","doi":"10.1007/s10623-011-9550-9","title":"Improved distinguishers for HC-128","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Keystream; Stream cipher; Computer science; Cryptanalysis; Block cipher; Cryptography; Block (permutation group theory); Algorithm; Mathematics; Arithmetic; Combinatorics","score_opus":0.06587416371629709,"score_gpt":0.27297986656915246,"score_spread":0.20710570285285537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031189409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023835598,0.00021516885,0.9736679,0.00007233236,0.00018155696,0.0004009287,0.000023615677,0.00015018933,0.0014526938],"genre_scores_gemma":[0.70138294,0.000048724,0.29817703,0.00022132533,0.00003291566,0.00011221304,0.000009408434,0.00001002246,0.0000054118987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988812,0.000036481943,0.00023344815,0.00039230497,0.00010668027,0.0003498488],"domain_scores_gemma":[0.9992366,0.00009632021,0.00008729322,0.00033780013,0.000108092274,0.0001339199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002976846,0.0001686711,0.00016853877,0.00022231984,0.000334428,0.00017648737,0.00038059856,0.000053983465,0.000024387513],"category_scores_gemma":[0.000020162017,0.0001528188,0.0001632204,0.000519723,0.0001147093,0.00024637903,0.0000787547,0.000068843416,7.750871e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003764681,0.00017200873,0.008071685,0.000043687258,0.000097129225,0.0000039688643,0.004057956,2.1350004e-7,0.0016135531,0.9287056,0.0014675522,0.055729043],"study_design_scores_gemma":[0.0066808346,0.0033887688,0.06580535,0.000082782506,0.00025760883,0.00006572565,0.0034563998,0.043163594,0.009373981,0.7932344,0.07175198,0.002738568],"about_ca_topic_score_codex":0.00013249654,"about_ca_topic_score_gemma":0.000059882368,"teacher_disagreement_score":0.67754734,"about_ca_system_score_codex":0.0000046125383,"about_ca_system_score_gemma":0.0000210709,"threshold_uncertainty_score":0.623177},"labels":[],"label_agreement":null},{"id":"W2033868240","doi":"10.1109/infocom.2014.6848032","title":"A new efficient physical layer OFDM encryption scheme","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Orthogonal frequency-division multiplexing; Watermarking attack; Encryption; Orthogonality; Ciphertext; Decoding methods; Physical layer; Plaintext; Scheme (mathematics); Frequency domain; Algorithm; Theoretical computer science; Probabilistic encryption; Computer security; Computer network; Channel (broadcasting); 56-bit encryption; Mathematics; Wireless; Telecommunications","score_opus":0.015382993321696322,"score_gpt":0.2785550529009385,"score_spread":0.26317205957924217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033868240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20492014,0.0000034164425,0.790249,0.0006312957,0.000099376775,0.0000614587,2.5722093e-7,0.00010712607,0.0039279186],"genre_scores_gemma":[0.8848198,6.5469277e-7,0.11469566,0.0002704028,0.000103098864,0.000004289882,0.0000016197171,0.0000026109724,0.000101838246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992696,0.000028217424,0.00010410145,0.00021639687,0.00020880571,0.00017288164],"domain_scores_gemma":[0.99949795,0.00004079939,0.00002834303,0.00030752108,0.000035011133,0.00009038703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014241398,0.0000724811,0.00007591988,0.00006884076,0.000089257315,0.00010270844,0.00028061756,0.000017959792,0.00010369792],"category_scores_gemma":[0.000011211673,0.0000597112,0.00006200923,0.0003282929,0.000013223994,0.00012168275,0.000105920466,0.000055685498,0.00012550362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.6030525e-7,0.00005848719,0.00018654883,0.000001777467,0.0000036831907,2.2964717e-7,0.0006687565,0.000034480952,0.0027941898,0.96041316,0.0021317708,0.03370606],"study_design_scores_gemma":[0.00078883604,0.0001465921,0.00834793,0.0000058297346,0.0000055872465,0.000005045633,0.000068290596,0.9101589,0.005078839,0.034723748,0.04040748,0.0002629664],"about_ca_topic_score_codex":0.00010062149,"about_ca_topic_score_gemma":0.000018600116,"teacher_disagreement_score":0.9256894,"about_ca_system_score_codex":0.000010629357,"about_ca_system_score_gemma":0.00002592059,"threshold_uncertainty_score":0.24349521},"labels":[],"label_agreement":null},{"id":"W2034321868","doi":"10.1007/s10009-002-0100-7","title":"Security by typing","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Soundness; Cryptographic protocol; Correctness; Type inference; Secrecy; Protocol (science); Cryptography; Theoretical computer science; Programming language; Theory of computation; Authentication protocol; Typing; Authentication (law); Inference; Computer security; Artificial intelligence","score_opus":0.018265491520375744,"score_gpt":0.29074346319302397,"score_spread":0.2724779716726482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034321868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062365174,0.00013231456,0.9320723,0.0037883404,0.0010020459,0.00016132767,0.000063133746,0.00022910604,0.00018624698],"genre_scores_gemma":[0.96443284,0.000113514165,0.034091994,0.0012035522,0.00005074964,0.00004881326,0.000015325239,0.000013688263,0.000029534707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882483,0.000033328928,0.00032994014,0.00025941737,0.0002780239,0.00027446044],"domain_scores_gemma":[0.99917716,0.00015873346,0.00004864978,0.00020917538,0.00034036965,0.00006593182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032100838,0.000141967,0.00013959558,0.00042772,0.00021849445,0.00032176342,0.0010104348,0.00013540065,0.00008809062],"category_scores_gemma":[0.00025325047,0.00013286549,0.00015928701,0.00030091053,0.00006299101,0.0005898609,0.000025110372,0.00035970577,0.000013014276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023311684,0.00018395031,0.0009437929,0.0000030904184,0.0001381925,0.000017827908,0.00016570665,0.000010571168,0.00043557512,0.92498755,0.0038781527,0.06921227],"study_design_scores_gemma":[0.0024498543,0.0004251291,0.00014177217,0.000042040356,0.000016630549,0.00057419896,0.0001329675,0.00020659834,0.016277889,0.32015067,0.65920633,0.00037594215],"about_ca_topic_score_codex":0.0000011880527,"about_ca_topic_score_gemma":0.0000041663848,"teacher_disagreement_score":0.90206766,"about_ca_system_score_codex":0.000076266726,"about_ca_system_score_gemma":0.000064913314,"threshold_uncertainty_score":0.54180974},"labels":[],"label_agreement":null},{"id":"W2035143295","doi":"10.1109/isemc.2014.6899042","title":"Physical layer phase encryption for combating the traffic analysis attack","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encryption; Computer science; 40-bit encryption; Bitwise operation; Watermarking attack; Multiple encryption; 56-bit encryption; Probabilistic encryption; Ciphertext; Computer network; Attribute-based encryption; On-the-fly encryption; Public-key cryptography","score_opus":0.04577068050427497,"score_gpt":0.3689911518615276,"score_spread":0.3232204713572526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035143295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45658997,0.0000016316164,0.5425406,0.0005711857,0.000029065734,0.000092801754,0.0000017085179,0.000040263007,0.0001327363],"genre_scores_gemma":[0.9831011,7.34948e-7,0.016459145,0.00029380145,0.00007200359,0.000034274264,0.000013449163,0.0000024071417,0.000023064513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993226,0.00005670399,0.00013513275,0.00018971685,0.00014153762,0.0001543298],"domain_scores_gemma":[0.9992742,0.00027740872,0.000052726715,0.000303522,0.000058767306,0.000033371223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003757924,0.00006738075,0.00010631583,0.000085981665,0.00026337066,0.00014599421,0.0003161243,0.000013814499,0.00002332145],"category_scores_gemma":[0.000019975216,0.000042833577,0.00018032991,0.0007455205,0.000024856248,0.0001598983,0.000042137443,0.000043863703,0.000005586141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009250839,0.0006189988,0.00030091705,0.000011710833,0.00031860272,2.2066685e-7,0.006712898,0.010647581,0.0010481591,0.6409354,0.0033925015,0.33600372],"study_design_scores_gemma":[0.0004991493,0.00009568797,0.000416448,6.058906e-7,0.00006993839,3.2000762e-7,0.00011807934,0.9936623,0.00018035836,0.0010851736,0.0038020574,0.00006989311],"about_ca_topic_score_codex":0.00001071868,"about_ca_topic_score_gemma":0.00011466333,"teacher_disagreement_score":0.9830147,"about_ca_system_score_codex":0.000006588055,"about_ca_system_score_gemma":0.000007899782,"threshold_uncertainty_score":0.20256607},"labels":[],"label_agreement":null},{"id":"W2035522326","doi":"10.1007/s12095-014-0102-9","title":"Multidimensional meet-in-the-middle attack and its applications to KATAN32/48/64","year":2014,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block cipher; Computer science; Key schedule; Key (lock); Block size; Cipher; Block (permutation group theory); Cryptography; Theoretical computer science; Computer security; Differential cryptanalysis; Arithmetic; Mathematics; Encryption","score_opus":0.06520715281484786,"score_gpt":0.3169153443027311,"score_spread":0.25170819148788326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035522326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2562012,0.006053728,0.6967719,0.031076608,0.00012303145,0.0022624407,0.000063658656,0.0002488933,0.0071985023],"genre_scores_gemma":[0.92487705,0.000523322,0.072731376,0.0013535919,0.00001743681,0.00046453302,0.000021852049,0.0000058986425,0.0000049134724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881095,0.00021037948,0.00027356436,0.00030539176,0.00017442188,0.00022529611],"domain_scores_gemma":[0.9977747,0.00051781896,0.00006344104,0.0014269293,0.00009481905,0.0001222776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005499418,0.00013473295,0.00013210569,0.00030100622,0.00082103076,0.00015794109,0.0011816702,0.000044845507,0.000006381851],"category_scores_gemma":[0.000028864632,0.00011726004,0.000057466357,0.0012725219,0.00014920063,0.00024394499,0.0005226277,0.0001600747,0.000012291157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000153136,0.00012892764,0.0013245629,0.000008604221,0.0000101145715,1.3624448e-7,0.003138278,0.0000041271105,0.000108856155,0.9827823,0.00053367595,0.01195891],"study_design_scores_gemma":[0.0015991605,0.00021110667,0.07478236,0.00008269303,0.0000599024,0.00004632809,0.0040900204,0.029583538,0.00012946081,0.11666534,0.77186733,0.00088276085],"about_ca_topic_score_codex":0.00003849045,"about_ca_topic_score_gemma":0.00042783385,"teacher_disagreement_score":0.86611694,"about_ca_system_score_codex":0.000005637557,"about_ca_system_score_gemma":0.00001752728,"threshold_uncertainty_score":0.6314788},"labels":[],"label_agreement":null},{"id":"W2036726339","doi":"10.1109/milcom.2008.4753074","title":"Reducing the probability of detection, improving jamming resistance and security for broadband wireless systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Eavesdropping; Jamming; Computer science; Wireless; Computer network; Guard (computer science); Orthogonal frequency-division multiplexing; Wireless broadband; Base station; Telecommunications; Electronic engineering; Engineering; Wireless network; Channel (broadcasting)","score_opus":0.0196373399718909,"score_gpt":0.24106043383382106,"score_spread":0.22142309386193015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036726339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.616547,0.00017277432,0.38258845,0.00008543728,0.00009606246,0.0003991709,0.0000033516587,0.000031307798,0.00007647291],"genre_scores_gemma":[0.9924684,0.000017953857,0.0073834388,0.000013111826,0.000026512578,0.00006143249,5.4485207e-7,0.0000033222484,0.000025291421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908245,0.000058429796,0.00028867894,0.00026677764,0.00014123773,0.00016242555],"domain_scores_gemma":[0.9991158,0.00020001114,0.00013031767,0.0003466018,0.00017362177,0.00003364146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064433477,0.00007813731,0.00012546823,0.00004702943,0.0005340694,0.00006770829,0.00022404008,0.000028869797,8.422321e-7],"category_scores_gemma":[0.00005063866,0.000056435758,0.000043592627,0.00028534548,0.000116346484,0.000251465,0.00007778553,0.00006256349,5.9453946e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018006902,0.00045283604,0.020839175,0.0031372344,0.00018244794,0.00000592674,0.085936286,0.00019580605,0.039819174,0.7488843,0.0015340236,0.0988327],"study_design_scores_gemma":[0.005396297,0.0009510751,0.06366364,0.0003161977,0.00010798221,0.00033723607,0.010020316,0.698073,0.11809924,0.09238937,0.008918111,0.0017275324],"about_ca_topic_score_codex":0.0005986247,"about_ca_topic_score_gemma":0.00047342508,"teacher_disagreement_score":0.69787717,"about_ca_system_score_codex":0.000020320022,"about_ca_system_score_gemma":0.000044745862,"threshold_uncertainty_score":0.4107684},"labels":[],"label_agreement":null},{"id":"W2037181904","doi":"10.1109/iccet.2010.5486127","title":"An RC4-based hash function for ultra-low power devices","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"MDC-2; Hash function; SHA-2; Double hashing; Hash chain; Cryptographic hash function; Computer science; Collision resistance; Collision attack; Secure Hash Algorithm; Rolling hash; Hash tree; Theoretical computer science; Computer security","score_opus":0.011784312382428554,"score_gpt":0.2857298331326678,"score_spread":0.27394552075023926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037181904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25591183,0.0000020715872,0.7421074,0.00047759357,0.0004887957,0.00016308174,0.000005233611,0.0001245314,0.0007194905],"genre_scores_gemma":[0.9265331,1.73441e-7,0.0722333,0.0011224366,0.000038601935,0.00003276915,0.000017976676,0.0000039955244,0.000017615084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993412,0.000013953175,0.00012626554,0.00022925716,0.00012094795,0.00016837046],"domain_scores_gemma":[0.9993621,0.000067086345,0.000037971608,0.00035916106,0.00010160514,0.00007208847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022758951,0.0000732725,0.00006006806,0.000090000656,0.00018707028,0.00021678046,0.0003093995,0.000038967533,0.00028181716],"category_scores_gemma":[0.000008855951,0.00006194333,0.000055869932,0.00021039738,0.000022665474,0.0004554768,0.000009642553,0.00006512895,0.000009402333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002714954,0.0005069716,0.014515034,0.000026347825,0.00002465684,9.371694e-7,0.0007852739,0.000030839703,0.07125517,0.85793155,0.0046715816,0.05022449],"study_design_scores_gemma":[0.0058542336,0.0028077248,0.2500331,0.00001925193,0.000059640744,0.000013003118,0.0010035074,0.29112792,0.08665228,0.055134974,0.3056998,0.001594564],"about_ca_topic_score_codex":0.000051820076,"about_ca_topic_score_gemma":0.0013599969,"teacher_disagreement_score":0.8027966,"about_ca_system_score_codex":0.0000036396073,"about_ca_system_score_gemma":0.00004183745,"threshold_uncertainty_score":0.30857003},"labels":[],"label_agreement":null},{"id":"W2037962327","doi":"10.1145/2699026.2699125","title":"Pleco and Plectron -- Two Provably Secure Password Hashing Algorithms","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Password; Hash function; Password cracking; Cryptosystem; Cryptography; Theoretical computer science; Computation; Algorithm; Password strength; Parallel computing; One-time password; Computer security","score_opus":0.03764669799143773,"score_gpt":0.3018249023848115,"score_spread":0.2641782043933738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037962327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16720814,0.00015952374,0.8247489,0.0030965197,0.000263213,0.00027121528,0.0000036188042,0.000244728,0.0040042014],"genre_scores_gemma":[0.8395873,0.000010775643,0.15971987,0.0004832715,0.000066421075,0.000017750981,0.000004835806,0.000006016079,0.00010378666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990019,0.000040060142,0.00016026663,0.0002932567,0.00022684978,0.00027762784],"domain_scores_gemma":[0.99942094,0.00004181953,0.000042062635,0.00026178197,0.000080329766,0.00015307483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034838842,0.000105654966,0.00010382229,0.000103046084,0.00013125576,0.00034032855,0.0002920151,0.000027355,0.000018824356],"category_scores_gemma":[0.000020827067,0.0000903046,0.000028395596,0.00037152873,0.000029382445,0.00055766763,0.00019052047,0.000108636625,0.000008412726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008777126,0.00012610799,0.0051417043,0.000014653131,0.00004575766,0.000024114968,0.009933558,0.000018525652,0.00032926546,0.6922367,0.016546302,0.27557454],"study_design_scores_gemma":[0.007066978,0.0011989613,0.007729352,0.000031894946,0.000039311955,0.00032355785,0.0034376448,0.49293208,0.002891179,0.32716274,0.15570134,0.0014849452],"about_ca_topic_score_codex":0.00024490847,"about_ca_topic_score_gemma":0.000572182,"teacher_disagreement_score":0.67237914,"about_ca_system_score_codex":0.000024709752,"about_ca_system_score_gemma":0.00007751767,"threshold_uncertainty_score":0.3682515},"labels":[],"label_agreement":null},{"id":"W2045192830","doi":"10.1007/s10836-011-5237-4","title":"A Fault Detection Scheme for the FPGA Implementation of SHA-1 and SHA-512 Round Computations","year":2011,"lang":"en","type":"article","venue":"Journal of Electronic Testing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Hash function; Redundancy (engineering); Cryptographic hash function; Field-programmable gate array; Secure Hash Algorithm; Computation; Cryptography; Overhead (engineering); Parallel computing; SHA-2; Fault injection; Checksum; Embedded system; Algorithm; Software","score_opus":0.060921887296104676,"score_gpt":0.3200257502180179,"score_spread":0.25910386292191323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045192830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4038935,0.00024265822,0.59549874,0.00013411752,0.000058378584,0.00014528492,0.000001692098,0.000009277475,0.0000163386],"genre_scores_gemma":[0.9413392,0.00001020838,0.05855054,0.00003685121,0.00004791664,0.00000877367,6.3769323e-7,0.0000046987516,0.0000011755046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990456,0.000036283014,0.0004365662,0.00010177829,0.00016154085,0.00021819938],"domain_scores_gemma":[0.9985246,0.00043810907,0.00053582515,0.00010187647,0.00036545377,0.00003413187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535046,0.00007433523,0.00011538138,0.00013991912,0.0002561102,0.00006461398,0.00023112443,0.000019824629,0.000007849904],"category_scores_gemma":[0.00009859218,0.00005717366,0.000066197565,0.00039638378,0.000031218715,0.0004115802,0.000041826315,0.00014481288,1.12713096e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055930876,0.00020949652,0.016170762,0.000084038766,0.0003699704,0.0000031523057,0.011946834,0.00055248843,0.014748334,0.079953074,0.00012911868,0.8757768],"study_design_scores_gemma":[0.0054253936,0.0057930425,0.26684982,0.00012109731,0.00034256905,0.0010340409,0.007634403,0.5444006,0.023486177,0.14298177,0.0013802536,0.00055084965],"about_ca_topic_score_codex":0.00017549552,"about_ca_topic_score_gemma":0.00035414824,"teacher_disagreement_score":0.87522596,"about_ca_system_score_codex":0.000048031838,"about_ca_system_score_gemma":0.00016661151,"threshold_uncertainty_score":0.23314743},"labels":[],"label_agreement":null},{"id":"W2046148580","doi":"10.1109/ccece.2008.4564848","title":"On the nonlinearity profile of cryptographic Boolean functions","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Boolean function; Cryptography; Computer science; Nonlinear system; Cryptographic primitive; Theoretical computer science; Cryptographic protocol; Algorithm; Physics","score_opus":0.02299078087847608,"score_gpt":0.20699523833862582,"score_spread":0.18400445746014973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046148580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6521211,0.000052188163,0.34110624,0.0031306592,0.0002445189,0.0005775456,0.000034375134,0.0001854725,0.0025478934],"genre_scores_gemma":[0.99603057,0.000057435394,0.0033829927,0.00038605198,0.000058051584,0.0000469299,0.0000053556605,0.000010029118,0.000022572483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845165,0.000013059191,0.00028722224,0.00044930464,0.00028715865,0.00051158946],"domain_scores_gemma":[0.99890745,0.00010883307,0.000080930164,0.00022370851,0.0003254731,0.0003535851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016242503,0.00024896808,0.0002450456,0.0005055416,0.0003844357,0.00019671807,0.000606779,0.000089803856,0.000057491397],"category_scores_gemma":[0.000043101954,0.0001997503,0.00007947704,0.0010319048,0.00011108581,0.00021275262,0.00007439205,0.00045295767,0.000008628708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059062204,0.00005663822,0.0014066288,0.000017303144,0.00002883379,0.0000062173062,0.0005924505,0.000027870337,0.00019133516,0.98723346,0.00094894023,0.009484397],"study_design_scores_gemma":[0.0003164314,0.00065731397,0.021781886,0.00007786173,0.000010387798,0.000055519686,0.00004763811,0.9697063,0.0003052217,0.0052607427,0.001381185,0.00039953412],"about_ca_topic_score_codex":0.0013863599,"about_ca_topic_score_gemma":0.00047365774,"teacher_disagreement_score":0.98197275,"about_ca_system_score_codex":0.000043413424,"about_ca_system_score_gemma":0.00033927214,"threshold_uncertainty_score":0.8145581},"labels":[],"label_agreement":null},{"id":"W2047239861","doi":"10.1145/2783441","title":"A Sliding Window Phase-Only Correlation Method for Side-Channel Alignment in a Smartphone","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Side channel attack; Vulnerability (computing); Embedded system; Chip; Cache; Channel (broadcasting); Code (set theory); Wireless; Implementation; Computer hardware; Cryptography; Telecommunications; Computer network; Computer security","score_opus":0.06131733814156028,"score_gpt":0.3543190952452798,"score_spread":0.29300175710371956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047239861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023588125,0.000081907485,0.97252774,0.00041192115,0.0019108298,0.0011175743,0.0000217557,0.00023312382,0.00010700374],"genre_scores_gemma":[0.83720493,0.0000026918121,0.16242394,0.000105549414,0.00008015636,0.00011808936,0.000016573988,0.000019177905,0.000028895829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974116,0.00031807303,0.0007444401,0.0006039299,0.0004468594,0.000475099],"domain_scores_gemma":[0.9978723,0.0007637252,0.00024351501,0.0007542855,0.0001921858,0.00017396758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018826307,0.0002521915,0.00036734474,0.0005510124,0.00033439675,0.00025993722,0.00063064543,0.000108739485,0.0000020232449],"category_scores_gemma":[0.00007323843,0.00026580674,0.00015699571,0.0010151875,0.000016533406,0.0003601015,0.00002536758,0.00022114845,0.000009842695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022225163,0.0017545187,0.0001951693,0.0001760532,0.00026489538,0.000024760307,0.061123252,0.7177219,0.0012186641,0.03994464,0.000708814,0.17664512],"study_design_scores_gemma":[0.0048771002,0.00046282425,0.000055655597,0.00013436479,0.000027461267,0.000082924686,0.004396489,0.98516554,0.00044408016,0.0034857611,0.00054562435,0.0003221538],"about_ca_topic_score_codex":0.0004349474,"about_ca_topic_score_gemma":0.00009751569,"teacher_disagreement_score":0.8136168,"about_ca_system_score_codex":0.00025730865,"about_ca_system_score_gemma":0.00016466907,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"id":"W2049372097","doi":"10.1109/ccece.2013.6567809","title":"A pipelined implementation of the gr&amp;#x00D8;stl hash algorithm and the advanced encryption standard","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Hash function; Computer science; Block cipher; MDC-2; Cryptographic hash function; Secure Hash Algorithm; Algorithm; Encryption; Cryptography; Field-programmable gate array; Advanced Encryption Standard; Block (permutation group theory); SHA-2; Parallel computing; Embedded system; Double hashing; Computer network; Mathematics; Computer security","score_opus":0.008229505713717052,"score_gpt":0.2734641498792331,"score_spread":0.26523464416551606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049372097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19264296,0.000054527045,0.80208284,0.0040787924,0.00015594944,0.0007474569,0.000013958519,0.00003730379,0.0001862247],"genre_scores_gemma":[0.86885947,0.0000737395,0.13045497,0.0004229718,0.00002349245,0.00009879326,0.0000073843735,0.0000046600735,0.00005453365],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889135,0.00011609958,0.00031950802,0.00019451279,0.0003077089,0.00017082115],"domain_scores_gemma":[0.99911517,0.00010837051,0.00014939335,0.0004047385,0.00018648694,0.00003582294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043563213,0.00009717124,0.00012485268,0.00005676873,0.00025201656,0.00014975545,0.00036948264,0.000022150818,0.0002480612],"category_scores_gemma":[0.000017281149,0.000051702933,0.00007161068,0.00039240805,0.00013929697,0.0004514681,0.00020150549,0.00007113418,0.0000049075716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011236393,0.000025840265,0.0015951078,0.000010097245,0.000028572953,7.3749376e-8,0.0040873108,0.0000062306835,0.0013278514,0.22139232,0.0014479206,0.77006745],"study_design_scores_gemma":[0.02898765,0.0006389629,0.32694936,0.000072304785,0.00015133481,0.000050961957,0.023173083,0.071159594,0.019718211,0.48418188,0.04371704,0.0011996166],"about_ca_topic_score_codex":0.0010025237,"about_ca_topic_score_gemma":0.0006452922,"teacher_disagreement_score":0.7688678,"about_ca_system_score_codex":0.000016757922,"about_ca_system_score_gemma":0.000045007688,"threshold_uncertainty_score":0.2716096},"labels":[],"label_agreement":null},{"id":"W2049775163","doi":"10.1109/taes.2013.6558003","title":"A Quantitative Analysis of a Novel SEU-Resistant SHA-2 and HMAC Architecture for Space Missions Security","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash-based message authentication code; Hash function; Computer science; Embedded system; Redundancy (engineering); Cryptography; Triple modular redundancy; Field-programmable gate array; Message authentication code; Cryptographic hash function; Computer hardware; Computer security; Operating system","score_opus":0.017166611140515268,"score_gpt":0.2758406932516588,"score_spread":0.2586740821111435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049775163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27427167,0.00048187553,0.7235858,0.00085761474,0.00006888076,0.00059414585,0.00009073379,0.000031838143,0.000017457236],"genre_scores_gemma":[0.99506396,0.00016248216,0.0044249417,0.000041387368,0.000007647134,0.00022346989,0.000004391451,0.000009586294,0.00006211071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986269,0.00006505726,0.00029170275,0.00041975896,0.00020106125,0.0003955541],"domain_scores_gemma":[0.99895394,0.0003140928,0.0001398359,0.00032254247,0.00013928313,0.00013029372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025298187,0.0001915267,0.0003815309,0.0004350584,0.00031483307,0.0001514279,0.000173308,0.00007674471,0.000009351762],"category_scores_gemma":[0.0000061604487,0.0001644838,0.00016950477,0.0011161547,0.00008080693,0.00016248673,0.000003762652,0.00018591863,5.9016793e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053904206,0.0023262084,0.00046215186,0.0009407645,0.008509989,0.0000027744818,0.04376723,0.028737701,0.2167107,0.6858631,0.0012557958,0.010884592],"study_design_scores_gemma":[0.0028817866,0.0022862768,0.0011728217,0.0001349235,0.0010694955,0.000027815304,0.0048953453,0.97832274,0.0035003896,0.0026996497,0.0022945404,0.000714182],"about_ca_topic_score_codex":0.0017886617,"about_ca_topic_score_gemma":0.0027274936,"teacher_disagreement_score":0.9495851,"about_ca_system_score_codex":0.00004334598,"about_ca_system_score_gemma":0.00008303586,"threshold_uncertainty_score":0.6707455},"labels":[],"label_agreement":null},{"id":"W2055602530","doi":"10.1049/iet-ifs.2014.0540","title":"Watch your constants: malicious Streebog","year":2015,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; SHA-2; Collision attack; Computer science; Cryptographic hash function; Checksum; Theoretical computer science; Hash chain; Context (archaeology); Collision resistance; MDC-2; Function (biology); Computer security; Cryptography; Collision; GOST (hash function); Double hashing; Operating system","score_opus":0.03660453717168044,"score_gpt":0.29192701355943573,"score_spread":0.2553224763877553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055602530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35783374,0.000077323166,0.5851319,0.0070739356,0.0016419259,0.00075610424,0.00022403656,0.00084375194,0.04641731],"genre_scores_gemma":[0.9932159,0.0000149452035,0.0054184925,0.0011944758,0.000040225124,0.000019521318,0.000078791556,0.0000031083794,0.000014547689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985677,0.000054285665,0.00046012324,0.00013755646,0.0004959411,0.0002844056],"domain_scores_gemma":[0.99874675,0.00003200538,0.00017281776,0.00046006264,0.00038352687,0.0002048096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000584854,0.00013553741,0.0001383451,0.00013670613,0.0001425484,0.00038936245,0.0005276758,0.00006847919,0.000051004256],"category_scores_gemma":[0.00006656841,0.00012902278,0.00006285892,0.0005777208,0.000051790066,0.0035919135,0.00019184574,0.00014730047,0.00023943887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001464045,0.00009174881,0.0028993401,0.000025577221,0.00002669853,0.000005039083,0.04004716,0.000034359386,0.0000065181534,0.8815463,0.057051215,0.018251395],"study_design_scores_gemma":[0.0033934817,0.000271742,0.0028232855,0.00002322299,0.000017000406,0.000113351,0.008134263,0.04623086,0.0007887217,0.135599,0.8018355,0.0007695734],"about_ca_topic_score_codex":0.00021230684,"about_ca_topic_score_gemma":0.00006363461,"teacher_disagreement_score":0.7459473,"about_ca_system_score_codex":0.0000594092,"about_ca_system_score_gemma":0.00014801604,"threshold_uncertainty_score":0.5261396},"labels":[],"label_agreement":null},{"id":"W2056144094","doi":"10.1109/tetc.2014.2303934","title":"On-Chip Nanoscale Capacitor Decoupling Architectures for Hardware Security","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"NMOS logic; Computer science; Decoupling capacitor; Decoupling (probability); Hardware security module; Capacitor; Embedded system; Cryptography; CMOS; Encryption; Chip; Robustness (evolution); Computer hardware; Electronic engineering; Electrical engineering; Engineering; Transistor; Computer network; Computer security; Telecommunications","score_opus":0.019682848826847423,"score_gpt":0.2913938504338667,"score_spread":0.2717110016070193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056144094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31776786,0.0000071113777,0.68006206,0.000489757,0.0012414615,0.00019768033,0.000007092061,0.00011795592,0.000109030894],"genre_scores_gemma":[0.958475,0.0000022450647,0.040911753,0.00036778057,0.00018753087,0.00002668328,0.0000016518927,0.000014393881,0.000012997986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984213,0.000079518555,0.00037290592,0.00047594839,0.00024083987,0.00040949215],"domain_scores_gemma":[0.99870753,0.00063861447,0.0000869552,0.0004297561,0.00006103336,0.0000760852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050575484,0.00019447794,0.00020654536,0.00036643547,0.00058553653,0.000113910966,0.0004706836,0.00007350705,0.000009373857],"category_scores_gemma":[0.000030074474,0.00020522629,0.00015983878,0.00042082457,0.000038573417,0.00005799073,0.000006907468,0.0003778391,0.0000025476431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043145803,0.0005365483,0.0007179581,0.0001659347,0.00006887702,0.000004791362,0.012951187,0.4345027,0.00024657726,0.08240928,0.00023023137,0.46812278],"study_design_scores_gemma":[0.00075884967,0.00017097825,0.0003310111,0.000097701944,0.00000813963,0.000004641389,0.00010281323,0.9604198,0.0037608366,0.032708336,0.0013411957,0.00029574204],"about_ca_topic_score_codex":0.000072681214,"about_ca_topic_score_gemma":0.00030447775,"teacher_disagreement_score":0.6407071,"about_ca_system_score_codex":0.00005955289,"about_ca_system_score_gemma":0.000028457045,"threshold_uncertainty_score":0.8368885},"labels":[],"label_agreement":null},{"id":"W2058559153","doi":"10.1049/iet-ifs.2011.0033","title":"On the sliding property of SNOW 3G and SNOW 2.0","year":2011,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Stream cipher; Snow; Key (lock); Computer science; Cipher; Property (philosophy); Mathematical proof; Set (abstract data type); Theoretical computer science; Cryptography; Algorithm; Mathematics; Computer security; Meteorology; Programming language; Geography","score_opus":0.035369336050500855,"score_gpt":0.2419125381930435,"score_spread":0.20654320214254265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058559153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7902042,0.00002058781,0.16637073,0.0017646933,0.00035791725,0.00076135993,0.0000408081,0.00014806387,0.040331624],"genre_scores_gemma":[0.9978175,0.000013936298,0.0016504056,0.00048374216,0.0000072398025,0.00001560813,0.0000056630834,0.0000015898597,0.0000042822776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992323,0.00004683534,0.00028815473,0.00008448511,0.00021804903,0.00013017842],"domain_scores_gemma":[0.9992624,0.00011491319,0.00015551063,0.00030750054,0.00011890133,0.00004075537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005116233,0.00008178917,0.00008699393,0.00010343794,0.00017316612,0.000090740454,0.0003202817,0.000033509474,0.00008072751],"category_scores_gemma":[0.00009708823,0.000046424386,0.000039175527,0.0002948729,0.00004727142,0.0013464813,0.00012508109,0.00010277124,0.00001675796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008242407,0.000037617625,0.00090545486,0.00001979639,0.000010407018,2.1821839e-7,0.03750214,7.294708e-7,0.000008711371,0.94535404,0.0020549987,0.014097655],"study_design_scores_gemma":[0.0036278875,0.0015721795,0.1348335,0.00037367662,0.000057566212,0.00011073638,0.018403765,0.11465612,0.045104194,0.6041934,0.07551683,0.0015501773],"about_ca_topic_score_codex":0.00018785965,"about_ca_topic_score_gemma":0.000021496055,"teacher_disagreement_score":0.34116066,"about_ca_system_score_codex":0.000009300175,"about_ca_system_score_gemma":0.000028132803,"threshold_uncertainty_score":0.18931314},"labels":[],"label_agreement":null},{"id":"W2058969342","doi":"10.1109/isspit.2007.4458043","title":"AES-128 Implementation on a Virtex-4 FPGA","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Field-programmable gate array; Computer science; Virtex; VHDL; Advanced Encryption Standard; Embedded system; Computer hardware; Verilog; Hardware description language; Encryption; Block (permutation group theory); Operating system","score_opus":0.017878490547516963,"score_gpt":0.33736609187228195,"score_spread":0.319487601324765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058969342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1660757,0.000008286998,0.8207312,0.0007359191,0.00021667712,0.00018436718,0.000002632934,0.00014705458,0.01189814],"genre_scores_gemma":[0.97355443,0.000004166739,0.024915537,0.0014030958,0.000038785816,0.000007720135,0.000009421755,0.0000039588904,0.00006287293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99901,0.0000201776,0.00022254078,0.00023176947,0.0002500706,0.00026544466],"domain_scores_gemma":[0.99946535,0.000066719454,0.000048404287,0.0003021243,0.000043516797,0.000073893025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005015294,0.000085340565,0.000065467335,0.00019447895,0.00015341284,0.0001082097,0.00029316326,0.000022164162,0.00038653638],"category_scores_gemma":[0.0000043719433,0.00007521928,0.000053309494,0.00047732794,0.000015504698,0.00027452223,0.00006817731,0.00006123925,0.00008142694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044677327,0.00006258327,0.0019355121,0.0000017140787,0.000010589981,0.0000062088957,0.00064514845,0.0000015988878,0.00042289807,0.6945612,0.003425599,0.29892248],"study_design_scores_gemma":[0.0063875467,0.0021914213,0.47515985,0.000021953843,0.000038166596,0.000067541754,0.0063303253,0.005932565,0.09863813,0.10385747,0.29975584,0.0016191863],"about_ca_topic_score_codex":0.00018173522,"about_ca_topic_score_gemma":0.00083029206,"teacher_disagreement_score":0.8074787,"about_ca_system_score_codex":0.000029573746,"about_ca_system_score_gemma":0.000022304497,"threshold_uncertainty_score":0.42323023},"labels":[],"label_agreement":null},{"id":"W2059205812","doi":"10.1007/s11235-009-9264-8","title":"Security analysis of pure DDP-based cipher proper for multimedia and ubiquitous device","year":2010,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Block cipher; Key (lock); Cipher; Stream cipher; Block (permutation group theory); Computer security; Cryptography; Encryption; Theoretical computer science","score_opus":0.025108699165250638,"score_gpt":0.30916497456235037,"score_spread":0.2840562753970997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059205812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8160915,0.00041922712,0.18110931,0.0006009707,0.00023387147,0.0010922984,0.00006225377,0.0001110588,0.00027953857],"genre_scores_gemma":[0.9724214,0.00001414436,0.027214559,0.000062396946,0.000020046138,0.0001830811,0.000069361355,0.000006589237,0.000008406048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998901,0.00013518553,0.0004114782,0.00022484266,0.00017355965,0.00015394825],"domain_scores_gemma":[0.99778086,0.00031923057,0.00025843288,0.001216947,0.00035995405,0.000064558095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085027266,0.00010392705,0.00026100196,0.000298443,0.00016839016,0.00011259016,0.00076442835,0.00007862855,0.000014380603],"category_scores_gemma":[0.00005785303,0.00009255179,0.00009778016,0.0009811547,0.000068018446,0.00019103914,0.00012050521,0.00013985958,0.0000013113875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015199084,0.003095228,0.23312154,0.0018505248,0.0047401357,0.0000026029386,0.06295992,0.002610672,0.09676004,0.4523742,0.004501336,0.13783182],"study_design_scores_gemma":[0.00083746953,0.000078040706,0.02030895,0.000017767747,0.00023481595,0.0000028029658,0.00054282043,0.9580352,0.0012055205,0.00031558843,0.018172255,0.0002488214],"about_ca_topic_score_codex":0.00040284358,"about_ca_topic_score_gemma":0.0020240399,"teacher_disagreement_score":0.9554245,"about_ca_system_score_codex":0.000011733767,"about_ca_system_score_gemma":0.000056691468,"threshold_uncertainty_score":0.37741524},"labels":[],"label_agreement":null},{"id":"W2061914999","doi":"10.2197/ipsjdc.3.600","title":"The Security of RC6 against Asymmetric Chi-square Test Attack","year":2007,"lang":"en","type":"article","venue":"IPSJ Digital Courier","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nuclear Waste Management Organization","funders":"","keywords":"Computer science; Key (lock); Computer security; Theoretical computer science","score_opus":0.014342344501915695,"score_gpt":0.2789746081064298,"score_spread":0.26463226360451414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061914999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69943327,0.0018719495,0.12898238,0.0019977249,0.0010579097,0.0010162552,0.0004284862,0.0003674437,0.16484456],"genre_scores_gemma":[0.99894047,0.00002987064,0.0006729188,0.00017773904,0.00006244471,0.0000048868,0.000015335958,0.000008837723,0.00008751272],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841034,0.000017572625,0.00040213147,0.00026982863,0.0004950479,0.0004050676],"domain_scores_gemma":[0.9982327,0.000605375,0.00015466021,0.00060853275,0.000275446,0.00012328703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005629136,0.0001470707,0.00016434993,0.00018314255,0.0002856379,0.00043785892,0.0007687938,0.000051904517,0.0000069793978],"category_scores_gemma":[0.00023432662,0.00010946594,0.00016749396,0.001744352,0.00015232005,0.00067317166,0.00024177534,0.00015439792,0.000021498485],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004905159,0.0015489771,0.09644744,0.00008623776,0.00073481235,0.00009811407,0.005581983,0.00001766746,0.00007319464,0.41821283,0.035998832,0.44115084],"study_design_scores_gemma":[0.0021926349,0.0008955041,0.12124094,0.000044488526,0.00014961702,0.00006022704,0.0022914365,0.006342771,0.0023800922,0.03758316,0.82544374,0.0013753525],"about_ca_topic_score_codex":0.0000106619045,"about_ca_topic_score_gemma":0.00008026503,"teacher_disagreement_score":0.7894449,"about_ca_system_score_codex":0.000025289139,"about_ca_system_score_gemma":0.00007125383,"threshold_uncertainty_score":0.44638914},"labels":[],"label_agreement":null},{"id":"W2062181586","doi":"10.1007/s11416-014-0218-7","title":"Reversing the operating system of a Java based smart card","year":2014,"lang":"en","type":"article","venue":"Journal of Computer Virology and Hacking Techniques","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Computer science; Java Card; Operating system; Code (set theory); Smart card; Java; OpenPGP card; Embedded system; Programming language; Smart card application protocol data unit; Java applet; Set (abstract data type)","score_opus":0.011399858733177929,"score_gpt":0.2524353208183007,"score_spread":0.2410354620851228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062181586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10135551,0.00006636756,0.89715564,0.0010466663,0.0001339285,0.00006568207,3.595351e-7,0.0000367196,0.00013915387],"genre_scores_gemma":[0.75365514,0.0000068109744,0.24585491,0.00041012213,0.00006925397,9.792801e-7,1.5143718e-7,0.0000023996247,2.424245e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900055,0.00026574562,0.00038702865,0.00010187773,0.00013017167,0.00011462465],"domain_scores_gemma":[0.99905264,0.00023532289,0.00033774626,0.00019846969,0.0001457228,0.000030079924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001582828,0.00007734613,0.00022097006,0.0001652609,0.00021358796,0.00007109186,0.00039800725,0.00005182732,8.9203195e-7],"category_scores_gemma":[0.000014043094,0.000052705924,0.00007993357,0.00012775626,0.000086220236,0.00017326597,0.00012330788,0.00018273055,8.3020005e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006557322,0.00016702194,0.0362998,0.00031607554,0.0002425087,0.00005154292,0.0054867202,0.00027949244,0.008944894,0.60159945,0.0025651362,0.3439818],"study_design_scores_gemma":[0.0025649162,0.004820356,0.07201074,0.0015322668,0.00021409873,0.0023844452,0.00033507554,0.81608224,0.033335153,0.016153691,0.049825203,0.0007417985],"about_ca_topic_score_codex":0.00001931802,"about_ca_topic_score_gemma":0.0000043670343,"teacher_disagreement_score":0.81580275,"about_ca_system_score_codex":0.000011754287,"about_ca_system_score_gemma":0.000025496574,"threshold_uncertainty_score":0.21492851},"labels":[],"label_agreement":null},{"id":"W2063797848","doi":"10.1007/s10623-008-9252-0","title":"On orthogonal generalized equitable rectangles","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Orthogonal array; Discrete mathematics; Statistics","score_opus":0.029300659011295752,"score_gpt":0.2815478909078108,"score_spread":0.25224723189651505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063797848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29157692,0.00065631594,0.70378745,0.0007844735,0.00011730035,0.00021635542,0.000014469262,0.0002057944,0.002640929],"genre_scores_gemma":[0.9232642,0.00025627922,0.07471038,0.0016865574,0.00003668585,0.000017875964,0.000013804141,0.0000063002053,0.000007902431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985785,0.00008713056,0.00023015491,0.00041063828,0.00026489838,0.0004286624],"domain_scores_gemma":[0.9992654,0.00010283813,0.00006792349,0.0003629826,0.00006105265,0.00013980675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003347292,0.00019021252,0.00019490489,0.0003594466,0.00040664195,0.00030620024,0.00034120167,0.000057810896,0.000051727347],"category_scores_gemma":[0.000008629346,0.00016586536,0.00014106759,0.0008835077,0.000061095394,0.0002658675,0.000053410076,0.00010931669,0.000004493356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019348183,0.00010237775,0.00064197386,0.0000031374577,0.000021079226,0.000009006544,0.0002450074,0.000009243225,0.0016942234,0.9554916,0.002339543,0.039423473],"study_design_scores_gemma":[0.0016099246,0.0014778116,0.022080598,0.00003683468,0.000030967996,0.00004051093,0.00012249012,0.004776951,0.0014896555,0.9585662,0.009079223,0.0006888716],"about_ca_topic_score_codex":0.000016652157,"about_ca_topic_score_gemma":0.000015782034,"teacher_disagreement_score":0.6316873,"about_ca_system_score_codex":0.000008057107,"about_ca_system_score_gemma":0.000025301995,"threshold_uncertainty_score":0.6763793},"labels":[],"label_agreement":null},{"id":"W2064190686","doi":"10.1515/jmc-2013-5004","title":"Another look at HMAC","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash-based message authentication code; Hash function; Computer science; Message authentication code; Computer security; Cryptography; Authentication (law); Code (set theory); Cryptographic hash function; Cryptographic primitive; Theoretical computer science; Cryptographic protocol; Programming language","score_opus":0.019730090165529124,"score_gpt":0.27596826765672267,"score_spread":0.25623817749119354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064190686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28963366,0.00009828333,0.7002338,0.0073301787,0.00022106407,0.00012143868,4.9298643e-7,0.000021200309,0.0023398753],"genre_scores_gemma":[0.8400448,0.000012136776,0.15893704,0.00084628526,0.000077713456,0.000006667432,2.1566333e-7,0.000007293085,0.000067827845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882406,0.00007897557,0.0005283281,0.00010536726,0.00023836023,0.0002249024],"domain_scores_gemma":[0.99907225,0.00016359873,0.00026188855,0.00022420671,0.00017853959,0.000099488105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000327276,0.00009265921,0.00026287534,0.00014727967,0.000068213965,0.000057041696,0.0005180656,0.00006068463,0.0013860232],"category_scores_gemma":[0.000086852844,0.000065356624,0.0001347067,0.00016872094,0.000038014517,0.00031175688,0.00014677121,0.00014339873,0.00038511597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005823323,0.00020583575,0.0005707502,0.000025869067,0.000053095704,0.000032017044,0.0008347355,0.0000018575187,0.002012798,0.970737,0.021921864,0.0035984002],"study_design_scores_gemma":[0.00077311316,0.0003141097,0.0020189125,0.000021431808,0.000019250756,0.0014561618,0.00024745165,0.0036843512,0.0011406498,0.98453176,0.0056313076,0.00016151612],"about_ca_topic_score_codex":0.000002103319,"about_ca_topic_score_gemma":0.00000201211,"teacher_disagreement_score":0.55041116,"about_ca_system_score_codex":0.000029199851,"about_ca_system_score_gemma":0.00003301764,"threshold_uncertainty_score":0.99952686},"labels":[],"label_agreement":null},{"id":"W2066677590","doi":"10.1142/s0218126609005332","title":"ON-CHIP POWER-EFFICIENT CURRENT FLATTENING CIRCUIT","year":2009,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Microcontroller; Electrical engineering; CMOS; Application-specific integrated circuit; Computer science; Chip; Dissipation; Power (physics); Integrated circuit; Circuit design; Electronic circuit; Electronic engineering; Constant power circuit; Voltage; Embedded system; Engineering; Power factor","score_opus":0.02355008766558158,"score_gpt":0.2668083672103429,"score_spread":0.2432582795447613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066677590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3146912,0.0013439758,0.68090326,0.00028192365,0.0022636845,0.00012748501,0.0000015710566,0.000026495962,0.00036040804],"genre_scores_gemma":[0.9992177,0.000031788008,0.00036393426,0.00022300196,0.00015494884,9.687573e-7,4.0324176e-7,0.000004768387,0.0000025051834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824166,0.000093532595,0.00063693407,0.00022557317,0.0005273307,0.0002749925],"domain_scores_gemma":[0.99877274,0.00012553264,0.0004593097,0.0002537101,0.00018486334,0.00020382683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062742305,0.00016511323,0.00031807143,0.00039987836,0.00018482457,0.00041731566,0.0004975673,0.000037185102,0.000002481484],"category_scores_gemma":[0.000013447901,0.00013648406,0.0001460072,0.00035998502,0.000025059044,0.0002280328,0.000041549956,0.0002502621,0.0000027367648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005946025,0.00029870274,0.00052347657,0.000037901664,0.00006845437,0.00008639902,0.0037908913,0.0047856607,0.0003675869,0.7292753,0.0025241554,0.25823554],"study_design_scores_gemma":[0.017365633,0.015004771,0.29469118,0.0061557493,0.0002627583,0.0119749,0.0033795238,0.49217135,0.00029780227,0.09084989,0.06353356,0.004312878],"about_ca_topic_score_codex":0.0000037404075,"about_ca_topic_score_gemma":2.3762757e-7,"teacher_disagreement_score":0.6845265,"about_ca_system_score_codex":0.000045992045,"about_ca_system_score_gemma":0.00006646257,"threshold_uncertainty_score":0.5565658},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022951904982746477,"score_gpt":0.24683313219251812,"score_spread":0.22388122720977166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071271835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025670292,0.00028161006,0.993445,0.001495169,0.0003547668,0.0010043344,0.00012217787,0.000075045245,0.0029652172],"genre_scores_gemma":[0.010140236,0.000045040033,0.98912656,0.00029499986,0.00012992896,0.00008871791,0.00007813054,0.000015904876,0.00008046304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986136,0.000009881109,0.00067386037,0.00019150275,0.0002320263,0.0002791044],"domain_scores_gemma":[0.99819076,0.00043295027,0.00047988957,0.00062168343,0.00021544514,0.00005925381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035542864,0.00028928014,0.00035664532,0.00024413771,0.0011112443,0.0003909149,0.0019546743,0.00018565,0.0000038707367],"category_scores_gemma":[0.00003519689,0.00022740674,0.00027276145,0.00024166418,0.00037293695,0.00043341613,0.0006029883,0.00026041616,6.358259e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028812728,0.000040030765,0.000011778798,0.0004581764,0.0002666905,8.083827e-8,0.004650492,0.09168477,0.000011904167,0.82417667,0.0011156485,0.07758087],"study_design_scores_gemma":[0.0004350255,0.00012873253,0.000058268633,0.00020457868,0.000074438336,0.000009876415,0.00001600553,0.66884047,0.00007155276,0.006859674,0.3228326,0.00046874443],"about_ca_topic_score_codex":0.0000400817,"about_ca_topic_score_gemma":0.00017584671,"teacher_disagreement_score":0.817317,"about_ca_system_score_codex":0.000040376395,"about_ca_system_score_gemma":0.00015903848,"threshold_uncertainty_score":0.92733777},"labels":[],"label_agreement":null},{"id":"W2073411533","doi":"10.1007/s12095-014-0101-x","title":"Revisiting iterated attacks in the context of decorrelation theory","year":2014,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Imperial Bank of Commerce (Canada)","funders":"","keywords":"Decorrelation; Iterated function; Stream cipher; Ciphertext; Computer science; Cipher; Plaintext; Mathematics; Theoretical computer science; Block cipher; Algorithm; Context (archaeology); Generalization; Discrete mathematics; Cryptography; Encryption; Computer security","score_opus":0.02313353761003308,"score_gpt":0.29160466073669583,"score_spread":0.26847112312666277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073411533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26241553,0.0019303198,0.7260624,0.003482185,0.000050662486,0.0003343865,0.000008816037,0.000054241802,0.0056614396],"genre_scores_gemma":[0.9852753,0.00032827532,0.013898723,0.00043457584,0.000007435898,0.000031811964,0.000020735753,0.0000024159604,6.8301233e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988286,0.00057890895,0.0002762576,0.00011950909,0.0000928457,0.0001039169],"domain_scores_gemma":[0.99784005,0.0009031706,0.00011626509,0.0010395988,0.00007962171,0.000021324133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011722527,0.000068831774,0.00009890058,0.0002026316,0.0002947389,0.000089225,0.0009094594,0.000030378495,0.000005060235],"category_scores_gemma":[0.00005561173,0.000054192107,0.00005748246,0.0009706773,0.00017242691,0.0002194701,0.00015367828,0.00014474546,0.0000010679179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001504664,0.00003375007,0.017414268,0.000005188128,0.000006443944,4.470581e-8,0.00653451,0.0000010221777,0.000033909964,0.8797396,0.000024519557,0.09620528],"study_design_scores_gemma":[0.0014071809,0.00015270767,0.4485294,0.00017225186,0.00004767867,0.000017291739,0.015689366,0.038388226,0.00011973758,0.46889478,0.026175076,0.00040630682],"about_ca_topic_score_codex":0.00004698776,"about_ca_topic_score_gemma":0.00008897278,"teacher_disagreement_score":0.7228598,"about_ca_system_score_codex":0.0000027131696,"about_ca_system_score_gemma":0.000009954582,"threshold_uncertainty_score":0.2266923},"labels":[],"label_agreement":null},{"id":"W2077999320","doi":"10.1145/2527317.2527325","title":"Design space exploration of the lightweight stream cipher WG-8 for FPGAs and ASICs","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Field-programmable gate array; Computer science; Tower; Field (mathematics); Finite field; Cipher; Cryptography; Embedded system; Arithmetic; Algorithm; Engineering; Mathematics; Encryption; Discrete mathematics; Computer network","score_opus":0.04545562368783777,"score_gpt":0.2687471547398935,"score_spread":0.22329153105205574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077999320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023882004,0.000020615518,0.9719439,0.0030313116,0.00007617985,0.0004964239,0.000001001229,0.000020173378,0.0005283561],"genre_scores_gemma":[0.8108394,0.000013376612,0.18879461,0.00011969725,0.000014958119,0.00007193425,9.976627e-7,0.0000029754858,0.00014203832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954754,0.00003196675,0.000114171155,0.0001183403,0.000095534764,0.0000924415],"domain_scores_gemma":[0.9995171,0.00008671904,0.00005299276,0.00022012033,0.00009858343,0.000024500105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012548182,0.00005253242,0.00005623599,0.00002818423,0.00009753887,0.0000841132,0.00018084384,0.000019708028,0.00004567806],"category_scores_gemma":[0.000010207421,0.000032427924,0.00002805859,0.00017858521,0.000026380558,0.0005617628,0.00006409427,0.000022422308,0.0000018335269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025477286,0.000073291456,0.0011501025,0.000016842057,0.000019137731,6.8941006e-8,0.0040137214,0.000049912724,0.0017658839,0.94432443,0.011632372,0.0369517],"study_design_scores_gemma":[0.001682335,0.00047059447,0.017236045,0.000031777294,0.00003631293,0.0000044748126,0.001577573,0.22708204,0.13102143,0.60891265,0.011487511,0.0004572458],"about_ca_topic_score_codex":0.00006535329,"about_ca_topic_score_gemma":0.000043867018,"teacher_disagreement_score":0.7869574,"about_ca_system_score_codex":0.000004367316,"about_ca_system_score_gemma":0.00001937438,"threshold_uncertainty_score":0.13223723},"labels":[],"label_agreement":null},{"id":"W2081845190","doi":"10.1109/aero.2009.4839503","title":"Efficient fault tolerant SHA-2 hash functions for space applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Fault tolerance; Computer science; Cryptography; Security of cryptographic hash functions; Cryptographic primitive; Embedded system; Power consumption; Distributed computing; Power (physics); Computer security; Cryptographic protocol","score_opus":0.017355730859952356,"score_gpt":0.2873664672913721,"score_spread":0.27001073643141976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081845190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047209207,0.000034804027,0.9840387,0.006273628,0.000100014804,0.0006580607,0.00001667438,0.00019993947,0.003957275],"genre_scores_gemma":[0.863256,0.000002589545,0.1350904,0.00085910637,0.00006156493,0.00025358662,0.000020032707,0.0000035872629,0.0004531662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991621,0.000010152984,0.00017606815,0.00028598006,0.0001422773,0.00022343648],"domain_scores_gemma":[0.9992949,0.0000576224,0.00004032034,0.00041485234,0.0001150877,0.00007721449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013488095,0.000087559805,0.00008434942,0.00011319165,0.00037505187,0.00014250723,0.0003131434,0.000026845639,0.000049275826],"category_scores_gemma":[0.0000060063967,0.0000776999,0.00009199209,0.0005187743,0.00001878541,0.000072194496,0.00003572716,0.000048362424,0.00003251466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002081443,0.00020199965,0.000030341238,0.0000029894625,0.000006639579,2.0604945e-7,0.0002829771,0.0012155627,0.00037162993,0.94612783,0.0072961883,0.044461537],"study_design_scores_gemma":[0.0010344125,0.00026384284,0.0039032928,0.0000056830418,0.000020489586,0.0000118576645,0.00037443565,0.6039535,0.00050319626,0.030666616,0.3588982,0.00036449448],"about_ca_topic_score_codex":0.000021636684,"about_ca_topic_score_gemma":0.000043932047,"teacher_disagreement_score":0.91546124,"about_ca_system_score_codex":0.00001923528,"about_ca_system_score_gemma":0.00003931105,"threshold_uncertainty_score":0.316851},"labels":[],"label_agreement":null},{"id":"W2084686792","doi":"10.1109/ccece.2006.277573","title":"The Impact of the Implementation Style on Power Consumption and Security in Embedded Cryptosystems","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Operand; Computer science; Cryptosystem; ARM architecture; Embedded system; Power consumption; Power analysis; Software; Power (physics); Timing attack; Computer hardware; Cryptography; Side channel attack; Computer security; Operating system","score_opus":0.010404958090126502,"score_gpt":0.31150209838388787,"score_spread":0.3010971402937614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084686792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960215,0.000046907408,0.0026825725,0.00020700283,0.00007723421,0.0003602561,0.000012692903,0.00001632343,0.00057547557],"genre_scores_gemma":[0.9997917,0.000012916233,0.00013988765,0.00002289087,0.0000067647716,0.000013650913,0.000003549778,0.0000023705522,0.000006289309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990985,0.00012801038,0.00027515332,0.00015000498,0.00018784717,0.00016047769],"domain_scores_gemma":[0.99939716,0.00012530923,0.000115788236,0.00029995595,0.00004325475,0.000018561555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041563626,0.000080263606,0.00008054646,0.00006976024,0.00017828087,0.000113483366,0.00023004928,0.000022535445,0.000037891376],"category_scores_gemma":[0.0000060005536,0.000041981642,0.00006419143,0.00029582035,0.00005533359,0.00016279849,0.00007868778,0.0000671074,0.000001403565],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000185378,0.00014951928,0.321298,0.00000982605,0.000023594941,6.855477e-7,0.0040636198,0.000050946786,0.0016821293,0.6666301,0.0032468755,0.002826173],"study_design_scores_gemma":[0.00076853536,0.00011624303,0.97677803,0.000008878746,0.0000025132983,0.000004074599,0.0007590532,0.00406045,0.0012388537,0.016016744,0.00016014541,0.000086498105],"about_ca_topic_score_codex":0.0030065717,"about_ca_topic_score_gemma":0.0039502997,"teacher_disagreement_score":0.65548,"about_ca_system_score_codex":0.000038070215,"about_ca_system_score_gemma":0.00003147105,"threshold_uncertainty_score":0.45450568},"labels":[],"label_agreement":null},{"id":"W2086536346","doi":"10.1109/cjece.2008.4721627","title":"A new compact dual-core architecture for AES encryption and decryption","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Encryption; Datapath; Computer science; AES implementations; Advanced Encryption Standard; Encryption software; Key (lock); Embedded system; Multiple encryption; Cryptography; 56-bit encryption; Computer hardware; Computer architecture; Computer network; Operating system; Algorithm","score_opus":0.016038685437087766,"score_gpt":0.21649436421334678,"score_spread":0.20045567877625903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086536346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2270661,0.00086791563,0.77152056,0.00036883578,0.00010703231,0.00005723,0.000001142797,0.00000924038,0.0000019557285],"genre_scores_gemma":[0.90452915,0.000078521705,0.0950586,0.00011121856,0.00021295637,7.6376114e-7,0.000001282892,0.0000048906472,0.0000026167038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994186,0.000007730707,0.00017998845,0.000108590044,0.00007283775,0.00021221626],"domain_scores_gemma":[0.9993151,0.00008489924,0.000050925937,0.000060353294,0.000057250436,0.0004314735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008117187,0.000090045556,0.00013622167,0.00031335905,0.00012930644,0.000080663965,0.00010423929,0.00003388703,0.0000020477544],"category_scores_gemma":[0.00001596715,0.00008073035,0.0000518049,0.00024463356,0.000014080986,0.00015667031,0.000008951145,0.00013290413,1.1117611e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046695208,0.000054460455,0.018349607,0.000107620515,0.00025313188,0.0004097216,0.007993842,0.017189374,0.0023216726,0.34908655,0.015651295,0.588536],"study_design_scores_gemma":[0.0019155787,0.0013600243,0.15645869,0.000086122716,0.000033111115,0.005355833,0.000010318803,0.7888788,0.00021573235,0.019752163,0.025429597,0.00050403684],"about_ca_topic_score_codex":0.00026103837,"about_ca_topic_score_gemma":0.0002293395,"teacher_disagreement_score":0.7716894,"about_ca_system_score_codex":0.000027212503,"about_ca_system_score_gemma":0.00017675819,"threshold_uncertainty_score":0.32920882},"labels":[],"label_agreement":null},{"id":"W2087179113","doi":"10.1049/ip-cds:20050296","title":"Efficient and flexible architecture for AES","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Circuits Devices and Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; University of Lethbridge","keywords":"Advanced Encryption Standard; Computer science; Application-specific integrated circuit; Verilog; Encryption; Key (lock); Field-programmable gate array; Embedded system; Block cipher; Block (permutation group theory); Computer architecture; Architecture; AES implementations; Block cipher mode of operation; Cryptography; Computer hardware; Algorithm; Computer network; Operating system; Mathematics","score_opus":0.017903458619466742,"score_gpt":0.2523909229615868,"score_spread":0.2344874643421201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087179113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85625327,0.0031619903,0.1374708,0.00039679112,0.00030764894,0.000791589,0.000019955503,0.00016656691,0.0014314106],"genre_scores_gemma":[0.99866396,0.00001169107,0.00094394805,0.000072762996,0.00015734076,0.000091722024,0.0000031511408,0.000008687789,0.00004670764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884754,0.0000064797646,0.0002699824,0.00040613173,0.00017989177,0.0002899654],"domain_scores_gemma":[0.99950606,0.000056470948,0.00012726011,0.00009030479,0.0001431103,0.00007677607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003423544,0.00014918314,0.00019270113,0.00015258354,0.00032208586,0.0007562209,0.0002052884,0.000054412267,8.32931e-7],"category_scores_gemma":[0.000007562049,0.00012476454,0.00004068943,0.00028575532,0.000045051045,0.00013979031,0.000061710125,0.00006265104,7.1446647e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004401331,0.000074876574,0.02178428,0.0011230047,0.00003523593,0.0000014444868,0.0035910453,0.0002565329,0.0021304055,0.9507032,0.0012017728,0.019093806],"study_design_scores_gemma":[0.0041382527,0.00086233584,0.07396529,0.00063350325,0.00013176698,0.000680324,0.0052803154,0.6807895,0.0010505145,0.041585114,0.18894269,0.0019404035],"about_ca_topic_score_codex":0.00021568894,"about_ca_topic_score_gemma":0.00003527986,"teacher_disagreement_score":0.90911806,"about_ca_system_score_codex":0.00001106817,"about_ca_system_score_gemma":0.000014823795,"threshold_uncertainty_score":0.7292255},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016408762641418113,"score_gpt":0.27930684060435035,"score_spread":0.26289807796293224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087866481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29755768,0.000028494784,0.7000208,0.000052781303,0.0015692622,0.0004950963,0.000055443623,0.000082504775,0.00013792056],"genre_scores_gemma":[0.99894214,0.00001899042,0.0007564495,0.000046576704,0.000042558844,0.00011524296,0.00001418042,0.000013869359,0.000049977974],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976577,0.00020345642,0.00085762166,0.0004677095,0.00047767395,0.00033583972],"domain_scores_gemma":[0.99868464,0.00026776094,0.00026298608,0.00048032138,0.00020281623,0.000101465266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010654862,0.00022386218,0.00027162125,0.0009358138,0.00023227706,0.00009340329,0.0002940505,0.00015961993,0.000025045294],"category_scores_gemma":[0.000014691022,0.00021790167,0.00018393454,0.0011189679,0.00005688842,0.0005213526,0.0000027499498,0.00032916624,0.000024209203],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012250384,0.009203581,0.0017977338,0.00039724066,0.00034066587,0.000023765855,0.032342352,0.050522737,0.21518986,0.04707886,0.0012618272,0.64061636],"study_design_scores_gemma":[0.004643961,0.0010671663,0.0076217544,0.00048623822,0.000052363685,0.00003368695,0.0057235253,0.42284563,0.55449855,0.00026915577,0.0018970636,0.0008608657],"about_ca_topic_score_codex":0.0007922189,"about_ca_topic_score_gemma":0.007065519,"teacher_disagreement_score":0.7013845,"about_ca_system_score_codex":0.00030957334,"about_ca_system_score_gemma":0.000058588448,"threshold_uncertainty_score":0.8885772},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007919695672281091,"score_gpt":0.2374502852952359,"score_spread":0.2295305896229548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088326678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62675554,0.000012002099,0.36963418,0.00092410494,0.0017642326,0.00038420525,0.0000058265146,0.00039125726,0.00012866803],"genre_scores_gemma":[0.96571755,0.0000012793041,0.033281922,0.00057005597,0.0003167627,0.00007248999,0.000004861634,0.00002031556,0.000014770782],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797195,0.000119622375,0.0003941469,0.000512046,0.00053864595,0.00046360109],"domain_scores_gemma":[0.9986272,0.00010786395,0.0001976472,0.00082383177,0.000111170986,0.00013232077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064357324,0.00024756143,0.00027328587,0.00032267332,0.00028453112,0.00042608086,0.000768121,0.00007276503,0.00001550377],"category_scores_gemma":[0.000011825212,0.0001987294,0.000083057246,0.000608198,0.00010486925,0.00028412,0.00006482062,0.00031836226,0.000022037875],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001198238,0.00010202526,0.00046009032,0.000060289425,0.00007603885,0.00007010291,0.003423235,0.0015986683,0.9259685,0.058074646,0.008005609,0.0021487852],"study_design_scores_gemma":[0.0065705036,0.0010334642,0.0039545293,0.0008156632,0.00021320552,0.0011057506,0.003939847,0.2671049,0.63704187,0.000742755,0.0712086,0.0062688896],"about_ca_topic_score_codex":0.00046643184,"about_ca_topic_score_gemma":0.00006858295,"teacher_disagreement_score":0.33896202,"about_ca_system_score_codex":0.00003638779,"about_ca_system_score_gemma":0.000044187924,"threshold_uncertainty_score":0.81039494},"labels":[],"label_agreement":null},{"id":"W2091406027","doi":"10.1109/ccece.2008.4564908","title":"Improved current flattening circuit using current injection, voltage regulation, and frequency switching","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Flattening; Electrical engineering; Voltage; Overhead (engineering); Current (fluid); Electronic engineering; Power (physics); Engineering; Physics","score_opus":0.03272997820867587,"score_gpt":0.2358882553107775,"score_spread":0.20315827710210163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091406027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26662084,0.00035897066,0.73207426,0.00013642994,0.0003200174,0.00025648484,0.0000037500602,0.00014924651,0.00008002381],"genre_scores_gemma":[0.9942186,0.00018484436,0.005299981,0.00007464817,0.00017058224,0.000025760042,0.0000051654997,0.000017159135,0.0000032769706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978787,0.000012073277,0.00040860195,0.0007366956,0.00025615038,0.0007077832],"domain_scores_gemma":[0.9986723,0.00004157855,0.000121264704,0.00016760621,0.00039542041,0.00060183863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017844801,0.0003565722,0.0003104816,0.000712701,0.00060680375,0.0005735212,0.0003888039,0.000095070376,0.000010101955],"category_scores_gemma":[0.000034688434,0.00037658092,0.000053229436,0.0008170254,0.000054653196,0.0007351356,0.000110365894,0.0005685573,0.000001523243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000516971,0.00005622274,0.0167582,0.00012089925,0.000044156557,0.000012282776,0.0041427747,0.00007942201,0.005184941,0.6612431,0.00013234418,0.3122205],"study_design_scores_gemma":[0.00032513295,0.00016445098,0.019653533,0.00013510502,0.000012387036,0.0001812984,0.000020853608,0.9729638,0.0000972946,0.00559909,0.0003545454,0.00049247296],"about_ca_topic_score_codex":0.0022993092,"about_ca_topic_score_gemma":0.00049046014,"teacher_disagreement_score":0.9728844,"about_ca_system_score_codex":0.00016624008,"about_ca_system_score_gemma":0.00047713626,"threshold_uncertainty_score":0.99986863},"labels":[],"label_agreement":null},{"id":"W2092392296","doi":"10.1109/mines.2010.91","title":"Multiple Dimensional Fault Tolerant Schemes for Crypto Stream Ciphers","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Stream cipher; RC4; Cryptography; Overhead (engineering); Algorithm; Parallel computing; Theoretical computer science; Operating system","score_opus":0.015783968604459065,"score_gpt":0.28069691070122393,"score_spread":0.26491294209676486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092392296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5281808,0.000008275474,0.46936965,0.0009630638,0.00049117254,0.00026878263,0.000016647526,0.00012650593,0.0005751005],"genre_scores_gemma":[0.7175356,6.253146e-7,0.28195602,0.00034341018,0.000044520086,0.000042290518,0.000014121422,0.0000043667455,0.000059050326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990907,0.000009437904,0.00018235487,0.00028336584,0.00018473223,0.0002494613],"domain_scores_gemma":[0.99923295,0.00016506201,0.000041110146,0.00034378213,0.00012192274,0.00009515799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015603506,0.0001044233,0.00009831481,0.000072699986,0.00021658014,0.000118159754,0.00035861696,0.00004530037,0.00021598657],"category_scores_gemma":[0.00004067436,0.00008601154,0.000096157455,0.00018892405,0.00004051252,0.00027386047,0.00010711636,0.000100169695,0.000012216799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015163521,0.000256547,0.00573717,0.000011386609,0.000037770224,0.0000021679866,0.000593687,0.0000348258,0.0217311,0.9037884,0.010610755,0.05718105],"study_design_scores_gemma":[0.0037842563,0.00026051162,0.009624753,0.000009597473,0.000016653488,0.000019357716,0.00043766046,0.55094343,0.028327923,0.027988957,0.37785238,0.00073450565],"about_ca_topic_score_codex":0.000102448146,"about_ca_topic_score_gemma":0.0006828709,"teacher_disagreement_score":0.8757994,"about_ca_system_score_codex":0.0000059232166,"about_ca_system_score_gemma":0.00004730572,"threshold_uncertainty_score":0.35074487},"labels":[],"label_agreement":null},{"id":"W2094456430","doi":"10.1109/mwscas.2013.6674904","title":"On-chip decoupling architecture with variable nMOS gate capacitance for security protection","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"NMOS logic; Decoupling capacitor; Decoupling (probability); Capacitor; CMOS; Capacitance; Electrical engineering; Electronic engineering; Power analysis; Computer science; Engineering; Voltage; Cryptography; Transistor; Computer security; Physics","score_opus":0.013591222736878216,"score_gpt":0.23214270124020456,"score_spread":0.21855147850332635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094456430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15224424,0.000005915148,0.8447704,0.00070674805,0.000089341214,0.0010845078,0.000004701799,0.00013625513,0.00095793407],"genre_scores_gemma":[0.8182602,9.933693e-7,0.1807472,0.00036131585,0.000034451296,0.0005369911,0.0000035431212,0.0000076043552,0.000047737678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999011,0.000020422685,0.00015583863,0.00034408184,0.00017270911,0.0002959767],"domain_scores_gemma":[0.9992716,0.000096925156,0.000066203305,0.0003501314,0.00014110029,0.00007407758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019275809,0.00013154888,0.000108044325,0.00009985564,0.00030350388,0.000229783,0.00027400427,0.000040792605,0.0001014487],"category_scores_gemma":[0.000021947812,0.000096407464,0.000041201973,0.0004153893,0.000029021703,0.00033328708,0.000018154104,0.00014289704,0.000012863689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035839512,0.00015950513,0.000225393,0.000064691674,0.00004786758,9.2087896e-7,0.0023483962,0.003653289,0.0026224696,0.9778575,0.0011882038,0.011795977],"study_design_scores_gemma":[0.0011294477,0.0006428925,0.0006265424,0.000042999713,0.000008907962,0.0000227001,0.00016657765,0.27256444,0.005509307,0.716476,0.002414081,0.00039609667],"about_ca_topic_score_codex":0.0004009857,"about_ca_topic_score_gemma":0.00025008738,"teacher_disagreement_score":0.6660159,"about_ca_system_score_codex":0.00002334794,"about_ca_system_score_gemma":0.000040681458,"threshold_uncertainty_score":0.39313823},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05756185944754254,"score_gpt":0.3443666921591025,"score_spread":0.28680483271155993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095155522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51490027,0.000016448343,0.48421195,0.00012819817,0.00024013522,0.0002496241,0.0000115086405,0.00012831035,0.00011357088],"genre_scores_gemma":[0.98668194,0.000013896519,0.013102823,0.000049628008,0.00002067305,0.00008428133,0.000028462966,0.000009840491,0.000008475578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970602,0.0004376685,0.0006133245,0.0008225196,0.0005664702,0.00049982767],"domain_scores_gemma":[0.9979905,0.00017343192,0.0001188592,0.0011622201,0.00023890327,0.0003161111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008657939,0.00026566308,0.00036351496,0.0009089193,0.00021281037,0.00015715272,0.00059372507,0.000091107264,0.00018402736],"category_scores_gemma":[0.000016364904,0.00028229415,0.00021721142,0.0036980405,0.00009709481,0.00069380674,0.000004326082,0.00034779956,0.00002474479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054950966,0.045200393,0.0094380155,0.00012716404,0.0017212472,0.000086430875,0.035177223,0.075032234,0.049520306,0.028554216,0.00050294795,0.74914473],"study_design_scores_gemma":[0.016610675,0.0142757,0.05349645,0.000013699869,0.00060048566,0.000015091207,0.00075439905,0.8890708,0.010077439,0.013684319,0.00021809073,0.00118283],"about_ca_topic_score_codex":0.0011470664,"about_ca_topic_score_gemma":0.01187863,"teacher_disagreement_score":0.8140386,"about_ca_system_score_codex":0.00029633832,"about_ca_system_score_gemma":0.00021928658,"threshold_uncertainty_score":0.9999629},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018863244168844696,"score_gpt":0.2817870051206014,"score_spread":0.2629237609517567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095880256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042383015,0.000005292586,0.95315707,0.0002994385,0.0018577294,0.0003530585,0.000057614965,0.00030516938,0.0015816278],"genre_scores_gemma":[0.990929,0.00002046668,0.0066328337,0.0020604779,0.00005240042,0.000054339485,0.000033367025,0.000009108394,0.00020802591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838215,0.000099504425,0.0005554946,0.00019622159,0.00044035562,0.000326254],"domain_scores_gemma":[0.99883777,0.00023539529,0.00014828298,0.0005020255,0.0001418147,0.00013469464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009733601,0.00018727603,0.00013561957,0.00076144666,0.00074159686,0.0002403607,0.0003377709,0.0001061312,0.00027742435],"category_scores_gemma":[0.0000089554,0.00017734701,0.00017849615,0.0006218786,0.000067211884,0.0024759206,0.000003942518,0.00027027586,0.00048613912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035389335,0.0004434486,0.000007147315,0.00002287636,0.000100629084,0.0000035169498,0.00481094,0.024706328,0.0008253813,0.6806677,0.0018476598,0.2862105],"study_design_scores_gemma":[0.026886411,0.0038438719,0.0038520016,0.00029572274,0.00037335916,0.00020857081,0.008079047,0.30024233,0.26986924,0.16086696,0.22081167,0.0046707923],"about_ca_topic_score_codex":0.00002722546,"about_ca_topic_score_gemma":0.000026265447,"teacher_disagreement_score":0.948546,"about_ca_system_score_codex":0.00011411178,"about_ca_system_score_gemma":0.00005832786,"threshold_uncertainty_score":0.72320014},"labels":[],"label_agreement":null},{"id":"W2096263836","doi":"10.1109/ipdpsw.2010.5470742","title":"Implementation of the compression function for selected SHA-3 candidates on FPGA","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Skein; Computer science; Field-programmable gate array; Function (biology); Software; Rest (music); Compression (physics); Data compression; Embedded system; Block (permutation group theory); Computer hardware; Computer architecture; Programming language; Algorithm; Mathematics; Computer security","score_opus":0.011150949205695598,"score_gpt":0.2950310110270726,"score_spread":0.283880061821377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096263836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77781624,0.0000024327508,0.2202355,0.00069848157,0.00052471226,0.00043352038,0.000016624846,0.00004642421,0.00022608701],"genre_scores_gemma":[0.9946445,8.2211506e-7,0.0050779665,0.00017335145,0.000024211648,0.000035351688,0.000017729291,0.0000027862368,0.000023241615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994261,0.00002146856,0.00015623854,0.00013967018,0.00014533933,0.000111139554],"domain_scores_gemma":[0.9994361,0.000070230846,0.00008491737,0.0002518697,0.00013549345,0.00002143615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011859617,0.000057509766,0.00005793929,0.00006079141,0.00018115994,0.000041386167,0.00025039038,0.000023536015,0.00012444974],"category_scores_gemma":[0.000010181551,0.000036436602,0.00004421746,0.00034988543,0.000018773397,0.00013536113,0.000052408563,0.00006500568,0.0000012739453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044702625,0.00016667938,0.04411549,0.000024794595,0.00004113106,6.909699e-8,0.001301093,0.000021915312,0.1748509,0.6685618,0.017177096,0.0936943],"study_design_scores_gemma":[0.0018445745,0.00046772123,0.56567436,0.0000100136685,0.000023506895,0.0000022936213,0.0004366047,0.023464847,0.3761531,0.017062495,0.014662378,0.00019806297],"about_ca_topic_score_codex":0.00030666936,"about_ca_topic_score_gemma":0.0026008,"teacher_disagreement_score":0.65149933,"about_ca_system_score_codex":0.000005859274,"about_ca_system_score_gemma":0.00003928114,"threshold_uncertainty_score":0.14858414},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Architecture; Inverse; Computer science; Embedded system; Computer hardware; Computer architecture; Parallel computing; Mathematics","score_opus":0.015314320365000118,"score_gpt":0.2979433297169912,"score_spread":0.2826290093519911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096644499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052319672,0.00003193664,0.93894094,0.008029398,0.00008800398,0.00033176888,0.0000048211573,0.000060768234,0.00019269995],"genre_scores_gemma":[0.87131095,0.0000025289023,0.12733218,0.0011741142,0.000076489545,0.000052435727,0.0000057585457,0.0000023061684,0.00004323165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949366,0.000021252254,0.00009930727,0.0001509412,0.00010742363,0.00012741027],"domain_scores_gemma":[0.9995423,0.00007790168,0.000018089979,0.000287482,0.000042079584,0.0000321704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020686597,0.000050503175,0.000039031598,0.000037548645,0.000339324,0.00023347029,0.00035597314,0.000014705575,0.000045554378],"category_scores_gemma":[0.0000051415927,0.000031565218,0.00003802682,0.00013760716,0.00002095715,0.00010375765,0.000032110962,0.00003636638,0.0000047484846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000530627,0.00017634983,0.00013127564,0.0000034267453,0.00001337387,1.757032e-7,0.0057878667,0.055646792,0.00095876673,0.655255,0.0062390873,0.27578256],"study_design_scores_gemma":[0.00026022203,0.000089402456,0.0015954487,7.293387e-7,0.000004046702,0.000003211131,0.00020188128,0.91814905,0.0009792735,0.0009536149,0.07768643,0.000076671604],"about_ca_topic_score_codex":0.000057610738,"about_ca_topic_score_gemma":0.0012103723,"teacher_disagreement_score":0.8625023,"about_ca_system_score_codex":0.000008868785,"about_ca_system_score_gemma":0.000021283578,"threshold_uncertainty_score":0.26098403},"labels":[],"label_agreement":null},{"id":"W2099735369","doi":"10.1109/mwscas.2005.1594462","title":"Coprocessor architecture with scaled dynamic switching activity for embedded cryptosystems","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Side channel attack; Cryptosystem; Computer science; Coprocessor; Cryptography; Embedded system; Spice; Channel (broadcasting); Architecture; Electronic engineering; Computer security; Engineering; Computer network","score_opus":0.008106729312115422,"score_gpt":0.2726610887138064,"score_spread":0.264554359401691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099735369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2798657,0.000012806907,0.7171341,0.0019374983,0.000039044673,0.00037847634,0.000004557141,0.00015383391,0.00047393143],"genre_scores_gemma":[0.8021461,0.0000014483796,0.19735643,0.0003249479,0.000026555379,0.000081707316,0.0000035531998,0.000008122971,0.000051139043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998959,0.00003735052,0.00015907815,0.00034785416,0.00021341158,0.00028329148],"domain_scores_gemma":[0.9992929,0.00012020896,0.00008663582,0.000338538,0.000085396925,0.000076303375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000278098,0.00014405284,0.00015968921,0.00012593938,0.0002198988,0.00021966506,0.00037923025,0.000036060417,0.000015126833],"category_scores_gemma":[0.000010753589,0.000104142775,0.00006635611,0.0003485589,0.00001659986,0.00046737777,0.00006340203,0.00011628166,0.0000034215288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023329584,0.0006712693,0.00095461484,0.0002477839,0.00019718014,0.0000058873165,0.01411213,0.0036752722,0.031120764,0.30221286,0.0006399592,0.645929],"study_design_scores_gemma":[0.004447831,0.0005641009,0.0041383244,0.00007620155,0.000033838478,0.000106772546,0.0005798143,0.95613974,0.0088220425,0.012955698,0.011251789,0.0008838239],"about_ca_topic_score_codex":0.00004156579,"about_ca_topic_score_gemma":0.002428561,"teacher_disagreement_score":0.9524645,"about_ca_system_score_codex":0.000030710966,"about_ca_system_score_gemma":0.00007364755,"threshold_uncertainty_score":0.4246819},"labels":[],"label_agreement":null},{"id":"W2100546736","doi":"10.1109/isscs.2009.5206179","title":"An area-optimized implementation for AES with hybrid countermeasures against power analysis","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Advanced Encryption Standard; AES implementations; Power analysis; Countermeasure; Computer science; Field-programmable gate array; Encryption; NIST; Cryptography; Side channel attack; Throughput; Embedded system; Virtex; Shuffling; Computer security; Operating system; Engineering; Wireless","score_opus":0.014116442848468028,"score_gpt":0.30765745828483243,"score_spread":0.2935410154363644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100546736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2602203,0.000007413036,0.7386479,0.00036221123,0.000023492756,0.00026844186,0.000026353617,0.00009918522,0.00034472477],"genre_scores_gemma":[0.89554596,0.0000057597113,0.10315222,0.0010939979,0.000009954959,0.000031317402,0.00014934182,0.0000035666997,0.000007877454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989031,0.000032801643,0.00023897816,0.0003379742,0.00024066833,0.00024645697],"domain_scores_gemma":[0.999168,0.000032855256,0.00009542178,0.0004227249,0.00019831657,0.000082701576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002887589,0.00012902243,0.00017715275,0.00029332566,0.00020384212,0.00032286267,0.00033763523,0.0000148625595,0.00011531594],"category_scores_gemma":[0.000003313905,0.000099194105,0.00012186138,0.00065167825,0.000018866818,0.00064943347,0.000013600726,0.000033374967,9.3021947e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007205015,0.0023823197,0.047832407,0.000029297296,0.0037815326,0.00005057678,0.015233881,0.023696728,0.0074555245,0.46409494,0.022326147,0.41239616],"study_design_scores_gemma":[0.011684093,0.004253452,0.14093934,0.00001469072,0.00086633716,0.000019654986,0.0058055515,0.80432314,0.009885931,0.015591154,0.0048951064,0.001721585],"about_ca_topic_score_codex":0.000048312777,"about_ca_topic_score_gemma":0.0005197762,"teacher_disagreement_score":0.78062636,"about_ca_system_score_codex":0.000022626386,"about_ca_system_score_gemma":0.00004239077,"threshold_uncertainty_score":0.40450183},"labels":[],"label_agreement":null},{"id":"W2101511734","doi":"10.1504/ijaacs.2011.043480","title":"Securing RDS broadcast messages for smart grid applications","year":2011,"lang":"en","type":"article","venue":"International Journal of Autonomous and Adaptive Communications Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Elliptic Curve Digital Signature Algorithm; Computer science; Computer network; Overhead (engineering); Digital signature; Authentication (law); Bandwidth (computing); Cryptography; Wireless; Message authentication code; Bootstrapping (finance); Public-key cryptography; Elliptic curve cryptography; Computer security; Hash function; Telecommunications; Encryption","score_opus":0.07550344590572314,"score_gpt":0.3097827743282302,"score_spread":0.23427932842250707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101511734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021027308,0.002698061,0.9909419,0.0008163555,0.0006488681,0.0004015963,0.0000746227,0.000032193635,0.0022837047],"genre_scores_gemma":[0.90181786,0.0006486348,0.09715419,0.00005597968,0.0001433629,0.000120141834,0.000011163929,0.000008131168,0.000040542996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882376,0.00008335526,0.00060362055,0.00014429534,0.00021451776,0.00013043468],"domain_scores_gemma":[0.9976636,0.0002099829,0.0005494178,0.0005139059,0.0009784411,0.00008466434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005566926,0.000111485126,0.00018279786,0.00030022804,0.00025609438,0.0001996014,0.0018467706,0.000037934402,0.0000061767296],"category_scores_gemma":[0.000021181779,0.00010281263,0.00011520817,0.00015492892,0.000106270876,0.0005536003,0.0003439371,0.00014234909,0.0000019441563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021748301,0.00025817376,0.0011771488,0.00001293799,0.00031144288,0.0000029949929,0.003913501,0.000030296165,0.00014308593,0.94676584,0.0004145957,0.046948254],"study_design_scores_gemma":[0.0035112863,0.0009370183,0.013881737,0.00038079082,0.00015908605,0.0012369744,0.009393909,0.07519205,0.0005421409,0.042729314,0.85117066,0.00086504524],"about_ca_topic_score_codex":0.0001433473,"about_ca_topic_score_gemma":0.000030815194,"teacher_disagreement_score":0.9040365,"about_ca_system_score_codex":0.0000683386,"about_ca_system_score_gemma":0.00011208644,"threshold_uncertainty_score":0.41925773},"labels":[],"label_agreement":null},{"id":"W2102984158","doi":"10.1007/978-3-642-12678-9_16","title":"Differential Fault Analysis of HC-128","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Differential (mechanical device); Fault (geology); Geology; Physics; Seismology; Thermodynamics","score_opus":0.014926078705883555,"score_gpt":0.2713883217053996,"score_spread":0.25646224299951603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102984158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004074334,0.000059932187,0.99343604,0.00022122244,0.0011752732,0.00020871902,0.00002825032,0.00006156465,0.00073468173],"genre_scores_gemma":[0.7580864,0.000029036848,0.24134131,0.0002865774,0.00016087604,0.0000053667486,0.000026863298,0.000014590862,0.000048974383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678904,0.000024744813,0.0006285519,0.0010967175,0.0009999605,0.0004609661],"domain_scores_gemma":[0.9974108,0.00030956164,0.00037803873,0.0014683391,0.0003002044,0.00013309068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041899388,0.0003731128,0.0006756866,0.002601819,0.000214153,0.00031523977,0.0028313156,0.00027914456,0.00020640668],"category_scores_gemma":[0.000035903875,0.00033381797,0.00037051114,0.0021529645,0.0007314592,0.0003150429,0.0010211841,0.00071805046,0.000005333057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086804675,0.00015916451,0.0011509294,0.000050044076,0.00041785013,0.000040340143,0.0032367534,0.0068654157,0.003114135,0.19564947,0.000013137351,0.78929406],"study_design_scores_gemma":[0.00053539686,0.00021733998,0.004983193,0.00009984154,0.0003280751,0.000016120071,5.083845e-7,0.80733055,0.005612831,0.17806001,0.001765116,0.0010510528],"about_ca_topic_score_codex":0.000094113464,"about_ca_topic_score_gemma":0.0010295685,"teacher_disagreement_score":0.8004651,"about_ca_system_score_codex":0.00006137871,"about_ca_system_score_gemma":0.00025154062,"threshold_uncertainty_score":0.99991137},"labels":[],"label_agreement":null},{"id":"W2104108368","doi":"10.1109/ccece.2006.277491","title":"Parity Prediction of S-Box for AES","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"S-box; Computer science; Advanced Encryption Standard; Cryptography; Computer security; Block cipher","score_opus":0.019404089346559544,"score_gpt":0.2702482564018178,"score_spread":0.25084416705525825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104108368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064489946,0.000013666261,0.93332773,0.00022972607,0.00008686874,0.00011013619,0.000018557457,0.00004743918,0.0016759319],"genre_scores_gemma":[0.9261657,0.0000018376592,0.07371205,0.000027491556,0.000023541006,0.0000128811835,0.000010727928,9.780867e-7,0.000044780183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996433,0.0000065321033,0.00012387139,0.00008963169,0.000064926986,0.000071701026],"domain_scores_gemma":[0.99974746,0.000029927407,0.00003063074,0.00012809687,0.000053344167,0.0000105459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010962411,0.00002861445,0.000043314343,0.00004095944,0.000049519094,0.000020708885,0.00011293939,0.00001368515,0.000017127264],"category_scores_gemma":[0.0000036589236,0.000024913652,0.000037566766,0.00013624049,0.000014076083,0.0001348172,0.000023147633,0.000012658982,5.423023e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010846508,0.000052329804,0.007800686,0.0000067328033,0.0000027526046,4.5831044e-8,0.00005751079,0.000010398361,0.00047082233,0.98203415,0.0052806204,0.004282871],"study_design_scores_gemma":[0.0014245933,0.0003323716,0.24120265,0.0000074591208,0.000015583868,0.0000041997123,0.00012234249,0.13084769,0.028627252,0.5505457,0.04668514,0.00018503098],"about_ca_topic_score_codex":0.00028917677,"about_ca_topic_score_gemma":0.00015694763,"teacher_disagreement_score":0.86167574,"about_ca_system_score_codex":0.0000038043618,"about_ca_system_score_gemma":0.000010548552,"threshold_uncertainty_score":0.101594925},"labels":[],"label_agreement":null},{"id":"W2104451994","doi":"10.1007/s10617-008-9016-0","title":"EM alignment using phase for secure embedded systems","year":2008,"lang":"en","type":"article","venue":"Design Automation for Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Robustness (evolution); Computation; Cryptography; Fourier transform; Key (lock); Embedded system; Wireless; Algorithm; Computer engineering; Distributed computing; Computer security; Operating system","score_opus":0.11833756057921734,"score_gpt":0.35224543743506337,"score_spread":0.23390787685584602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104451994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019513479,0.00027350077,0.9729677,0.000055510227,0.0016939464,0.004788687,0.00013821427,0.0005199677,0.00004900764],"genre_scores_gemma":[0.8587397,0.000007973648,0.1392282,0.00008634986,0.00017990782,0.0014620374,0.00015072469,0.000040202453,0.000104937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968906,0.0004929588,0.00096584973,0.0005813079,0.00055109675,0.00051817374],"domain_scores_gemma":[0.99765986,0.00052848266,0.0005575591,0.00064553204,0.00044821418,0.0001603602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002278507,0.00031305786,0.0004602533,0.00037103795,0.00071159063,0.0005309918,0.0005342433,0.00014099684,0.000005757629],"category_scores_gemma":[0.00008888195,0.00030650725,0.0002290126,0.0005534544,0.000034253215,0.00084694626,0.000051222327,0.000075941025,0.000011006253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019190571,0.0012068158,0.000048797076,0.0015241927,0.00061452476,0.000025201749,0.058813203,0.109562464,0.02465963,0.74256665,0.057150178,0.0036364635],"study_design_scores_gemma":[0.003054055,0.00029821284,0.0000075754647,0.00008080405,0.00003662853,0.0001495816,0.0018335992,0.98770005,0.0010568155,0.0007983078,0.004613129,0.00037123245],"about_ca_topic_score_codex":0.00004310075,"about_ca_topic_score_gemma":0.0000032136545,"teacher_disagreement_score":0.8781376,"about_ca_system_score_codex":0.00017868147,"about_ca_system_score_gemma":0.00023227153,"threshold_uncertainty_score":0.9999387},"labels":[],"label_agreement":null},{"id":"W2104879560","doi":"10.1109/newcas.2010.5603723","title":"FPGA implementation of CubeHash, Gr&amp;#x2298;stel, JH, and SHAvite-3 hash functions","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Implementation; Hash function; Computer science; Cryptographic hash function; Embedded system; Computer architecture; Programming language","score_opus":0.01907354584417731,"score_gpt":0.3149690272386636,"score_spread":0.2958954813944863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104879560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73749673,0.000017129583,0.26024887,0.0006400875,0.00038198644,0.00022179936,0.000034839013,0.00008026098,0.0008782866],"genre_scores_gemma":[0.96348035,0.000010723696,0.03613289,0.00015967236,0.00003766845,0.000025219479,0.000042618347,0.0000058120563,0.00010505526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998949,0.000026866146,0.00031781403,0.0002883718,0.00020857243,0.00020937754],"domain_scores_gemma":[0.9991962,0.000067840374,0.000098809316,0.00042359746,0.00011920591,0.00009434759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026598465,0.00011242362,0.00012385596,0.00020775397,0.00020867528,0.0001376554,0.00026209478,0.000045660414,0.0007998676],"category_scores_gemma":[0.0000100956595,0.00010342656,0.00005884183,0.0004384506,0.00008095142,0.0005238532,0.00016441499,0.00012815106,0.0000134335405],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081999515,0.00029577996,0.0858114,0.00003846905,0.00007294743,0.0000015704379,0.0047994093,0.000004040228,0.036222525,0.44993573,0.010622843,0.4121871],"study_design_scores_gemma":[0.00682444,0.0011384182,0.6730179,0.00003063984,0.00018186089,0.00017907277,0.007312311,0.0037182372,0.027581027,0.042813923,0.23546036,0.0017418081],"about_ca_topic_score_codex":0.0009870145,"about_ca_topic_score_gemma":0.00808122,"teacher_disagreement_score":0.5872065,"about_ca_system_score_codex":0.000007186375,"about_ca_system_score_gemma":0.000052987096,"threshold_uncertainty_score":0.87579894},"labels":[],"label_agreement":null},{"id":"W2106142373","doi":"10.1109/ccece.2005.1557299","title":"An efficient and reconfigurable architecture for RC5","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Block cipher; Field-programmable gate array; Verilog; Block size; Architecture; Key (lock); Cipher; Block (permutation group theory); Computer architecture; Embedded system; Variable (mathematics); Triple DES; Parallel computing; Cryptography; Algorithm; Operating system; Encryption; Mathematics","score_opus":0.009764380944818843,"score_gpt":0.2603761852040208,"score_spread":0.25061180425920193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106142373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17296863,0.000027882805,0.8221382,0.0006356237,0.000052003877,0.00015611615,0.000004867484,0.00006392187,0.003952783],"genre_scores_gemma":[0.91037947,9.2985834e-7,0.089349516,0.00016108678,0.000025813857,0.00001669374,0.000006985353,0.0000021995509,0.000057327532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953574,0.000011137372,0.00008725748,0.00017616004,0.00005704701,0.00013264122],"domain_scores_gemma":[0.9997101,0.000036482914,0.000017742357,0.00017497166,0.00002709309,0.000033645592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121258934,0.00004896107,0.000048698206,0.00006038501,0.00012660008,0.00012428482,0.00013770256,0.000015402791,0.000021272328],"category_scores_gemma":[0.0000020508749,0.00003965145,0.000021358246,0.00011727954,0.000016554193,0.00006388148,0.000008664757,0.000024377227,8.773665e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025644722,0.0000707777,0.0002940027,0.000006994561,0.0000027135495,4.780025e-7,0.00030299285,0.00065123464,0.0018019788,0.9576766,0.0013437101,0.037845984],"study_design_scores_gemma":[0.0020172584,0.0006116723,0.024778334,0.000009341736,0.000012995704,0.000046985584,0.0003023584,0.54758817,0.017286541,0.28279382,0.12395127,0.00060124433],"about_ca_topic_score_codex":0.00018373936,"about_ca_topic_score_gemma":0.0002870382,"teacher_disagreement_score":0.73741084,"about_ca_system_score_codex":0.0000035243008,"about_ca_system_score_gemma":0.000010045376,"threshold_uncertainty_score":0.16169393},"labels":[],"label_agreement":null},{"id":"W2107630259","doi":"10.1109/securware.2008.51","title":"A Related-Key Attack on TREYFER","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Key (lock); Plaintext; Cipher; Theoretical computer science; Block cipher; Watermarking attack; Encryption; Set (abstract data type); Cryptography; Symmetric-key algorithm; Computer security; Public-key cryptography; Deterministic encryption; Programming language","score_opus":0.06288142934980333,"score_gpt":0.306810751163044,"score_spread":0.24392932181324067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107630259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7628862,0.000025161647,0.112109855,0.0029430152,0.00027863216,0.00013975074,0.0000015527291,0.00032682612,0.121288955],"genre_scores_gemma":[0.9861237,0.00001904131,0.011883059,0.0008160867,0.000012347302,0.0000052510245,0.0000018201627,0.0000028487186,0.0011358659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993819,0.000019997577,0.00012495968,0.0001792284,0.00015144666,0.00014249473],"domain_scores_gemma":[0.99956775,0.000032973407,0.000020486854,0.00030591365,0.000023755967,0.000049093574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007034347,0.000060474213,0.00005854992,0.0000878286,0.00015758934,0.000029019235,0.00024816405,0.000023684875,0.00028204639],"category_scores_gemma":[0.0000054402017,0.000048575024,0.00005106817,0.00034226762,0.000026152391,0.00016099331,0.000052173826,0.00006494628,0.00024490204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020851194,0.000110543966,0.0029818018,0.0000012697199,0.00001258837,0.00003359922,0.0024946202,0.000019131397,0.000036660193,0.94812703,0.03894261,0.007238039],"study_design_scores_gemma":[0.004314505,0.0012094353,0.24401659,0.000025570595,0.0000148362415,0.000535704,0.00036131157,0.062263522,0.0025142014,0.048935466,0.6344532,0.0013556681],"about_ca_topic_score_codex":0.000034751363,"about_ca_topic_score_gemma":0.000020599544,"teacher_disagreement_score":0.89919156,"about_ca_system_score_codex":0.000010747223,"about_ca_system_score_gemma":0.000022118456,"threshold_uncertainty_score":0.3147802},"labels":[],"label_agreement":null},{"id":"W2107699024","doi":"10.1007/978-3-642-05445-7_18","title":"New Results on Impossible Differential Cryptanalysis of Reduced–Round Camellia–128","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Impossible differential cryptanalysis; Boomerang attack; Block cipher; Computer science; Differential cryptanalysis; Key schedule; Camellia; Slide attack; Arithmetic; Cryptography; Cryptanalysis; Cipher; Redundancy (engineering); Algorithm; Computer security; Mathematics; Encryption; Operating system","score_opus":0.020844210974065136,"score_gpt":0.27856124265477655,"score_spread":0.2577170316807114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107699024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014898756,0.00014213342,0.99359727,0.00089706655,0.0009876712,0.0003094962,0.000024784831,0.00007947189,0.0024722337],"genre_scores_gemma":[0.58689904,0.00012861376,0.41090894,0.0007025244,0.0006849082,0.000004242535,0.000035842357,0.000032624022,0.0006032631],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954227,0.000045302942,0.0009815741,0.0015502269,0.0013692797,0.00063087186],"domain_scores_gemma":[0.99673456,0.00036949027,0.00058295403,0.0018181301,0.0002527521,0.00024211776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059146323,0.00053586846,0.0007043184,0.0016126424,0.0002680684,0.00052766065,0.0029173195,0.00026687034,0.00006064342],"category_scores_gemma":[0.000060843115,0.00047901506,0.00032907026,0.001413261,0.00036320693,0.0003987366,0.00057365745,0.00065652735,0.0000125201395],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003768892,0.000082025734,0.000016656417,0.000019087774,0.000042497726,0.000032635897,0.0013644436,0.004056903,0.00063675107,0.07542301,0.00021205025,0.9180763],"study_design_scores_gemma":[0.00224488,0.0018514938,0.001737954,0.0007942716,0.000109756686,0.00005245266,0.0000012389438,0.19632122,0.013612462,0.77693415,0.004397838,0.0019423113],"about_ca_topic_score_codex":0.00025807426,"about_ca_topic_score_gemma":0.0003166171,"teacher_disagreement_score":0.91613394,"about_ca_system_score_codex":0.00019577713,"about_ca_system_score_gemma":0.0006817646,"threshold_uncertainty_score":0.9997662},"labels":[],"label_agreement":null},{"id":"W2108830258","doi":"10.1109/itcc.2005.6","title":"A countermeasure for EM attack of a wireless PDA","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Countermeasure; Computer science; Wireless; Power analysis; Energy (signal processing); Computer security; Embedded system; Computer network; Cryptography; Telecommunications; Engineering","score_opus":0.03449844218759949,"score_gpt":0.3132258952344567,"score_spread":0.2787274530468572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108830258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30572265,0.000019294144,0.6927977,0.0005900404,0.000051777948,0.00015157537,0.0000088469815,0.000035829293,0.00062226824],"genre_scores_gemma":[0.9472423,0.0000033921838,0.05235188,0.00027859095,0.000027712202,0.000018257308,0.000002208928,0.0000023145312,0.00007333599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994716,0.000008728235,0.00015055324,0.00012507041,0.00012415262,0.00011989382],"domain_scores_gemma":[0.9995742,0.000036260077,0.000043132088,0.00021078643,0.00010726307,0.00002837407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000153093,0.000049047507,0.00007925011,0.000052477604,0.000048278333,0.000040491006,0.00027342536,0.000017836617,0.000044219643],"category_scores_gemma":[0.0000043313016,0.000042115917,0.00006100596,0.00016970893,0.000015579299,0.00018387937,0.00004013429,0.00002241234,0.0000037174807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015447678,0.00027905067,0.0022094366,0.00005903186,0.000048379676,6.7789404e-7,0.0055292207,0.000042120955,0.0018412471,0.70705837,0.026209362,0.25670767],"study_design_scores_gemma":[0.005123968,0.0006292822,0.01684465,0.00005321451,0.000034343422,0.0000271907,0.0017570397,0.6203595,0.015755558,0.009416656,0.32924047,0.00075812277],"about_ca_topic_score_codex":0.000013967762,"about_ca_topic_score_gemma":0.0004448092,"teacher_disagreement_score":0.6976417,"about_ca_system_score_codex":0.00000875971,"about_ca_system_score_gemma":0.000028053464,"threshold_uncertainty_score":0.17174374},"labels":[],"label_agreement":null},{"id":"W2110453585","doi":"10.1049/iet-ifs.2012.0186","title":"Simple power analysis applied to nonlinear feedback shift registers","year":2014,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Stream cipher; Shift register; Computer science; Power analysis; CMOS; Linear feedback shift register; Digital electronics; Bitstream; Computer hardware; Algorithm; Cryptography; Arithmetic; Electronic circuit; Electronic engineering; Mathematics; Chip; Engineering; Electrical engineering","score_opus":0.00738755192662981,"score_gpt":0.25158646497453424,"score_spread":0.24419891304790442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110453585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1091543,0.0000019251816,0.8767376,0.0012011682,0.00015400304,0.00030093055,0.000049186772,0.00020610924,0.012194798],"genre_scores_gemma":[0.9828273,0.0000013423803,0.01331497,0.0036508692,0.000029174887,0.000028229604,0.00014099832,0.0000038305043,0.0000032837602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984202,0.000045953217,0.0005337011,0.00022769049,0.00045419316,0.00031825755],"domain_scores_gemma":[0.9986055,0.00007012611,0.00019627518,0.0007874542,0.00014441262,0.0001962503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006676969,0.00016314232,0.00023260101,0.0005724206,0.00022633547,0.00047308905,0.0006574523,0.000066855544,0.00013111168],"category_scores_gemma":[0.00004596078,0.00016184215,0.00016002072,0.0021686193,0.000031367286,0.0014453613,0.00022434776,0.00012868742,0.00030611872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048070327,0.00016921248,0.005088793,0.000057259407,0.00034268768,8.339861e-7,0.058600117,0.0034247811,0.000022794087,0.894945,0.02178413,0.0155163165],"study_design_scores_gemma":[0.0015816875,0.00026582522,0.07966461,0.0000075631756,0.00012612806,0.0000035192618,0.0013732364,0.16426808,0.0003314197,0.025873447,0.7255152,0.000989302],"about_ca_topic_score_codex":0.000120079705,"about_ca_topic_score_gemma":0.00015841416,"teacher_disagreement_score":0.873673,"about_ca_system_score_codex":0.00003793832,"about_ca_system_score_gemma":0.000031526735,"threshold_uncertainty_score":0.65997314},"labels":[],"label_agreement":null},{"id":"W2111522250","doi":"10.1109/cse.2009.364","title":"A Lightweight Architecture for Secure Two-Party Mobile Payment","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Computer security; Mobile payment; Authentication (law); Database transaction; Cryptography; Public-key cryptography; Computer network; Mobile computing; Mobile device; Operating system; Encryption; Database","score_opus":0.011392575186292548,"score_gpt":0.28799643169441,"score_spread":0.2766038565081175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111522250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020064505,0.00010079533,0.9720592,0.0043141046,0.00015389346,0.0006630526,0.000012691836,0.00018389485,0.0024478969],"genre_scores_gemma":[0.8092603,0.000009442176,0.18787837,0.002406996,0.00009901438,0.00013760387,0.000018285817,0.0000045484376,0.0001854303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999054,0.000020511032,0.00018110748,0.00029836848,0.00016611091,0.0002799107],"domain_scores_gemma":[0.999393,0.000046944875,0.000041622014,0.00037622816,0.000054586057,0.000087618624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014394707,0.00011735606,0.00011317018,0.00009647834,0.00017223378,0.00013131506,0.0003998826,0.000028910352,0.000091655704],"category_scores_gemma":[0.000003666245,0.000086468615,0.00011262312,0.00030348988,0.000013890534,0.00015116589,0.00004924494,0.000071635586,0.000007588865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008098942,0.00019214943,0.000075364725,0.0000071034906,0.000016393655,0.0000030072795,0.0023051507,0.00007922994,0.00089158677,0.82408357,0.017531939,0.1548064],"study_design_scores_gemma":[0.0017399377,0.00092159264,0.0008645931,0.000009538806,0.00001397832,0.000022348326,0.0001418075,0.013506059,0.008232468,0.25205982,0.7220707,0.0004171763],"about_ca_topic_score_codex":0.000011107542,"about_ca_topic_score_gemma":0.000078624726,"teacher_disagreement_score":0.78919584,"about_ca_system_score_codex":0.000014548766,"about_ca_system_score_gemma":0.000029208297,"threshold_uncertainty_score":0.3526088},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0078681142327356,"score_gpt":0.2572721615832338,"score_spread":0.2494040473504982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112800903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2744436,0.000017038334,0.72462726,0.00025837132,0.00006781864,0.00028276307,0.00001558794,0.00008186914,0.00020570296],"genre_scores_gemma":[0.8675539,0.0000018855256,0.13226587,0.000044920867,0.00004032394,0.0000740415,0.000008864908,0.000005371196,0.0000048218894],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991531,0.0000041027633,0.00021976349,0.00023213643,0.00020876068,0.00018213961],"domain_scores_gemma":[0.9994207,0.000030068555,0.00013933008,0.00008424928,0.00029703006,0.00002864188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021177606,0.00009326112,0.000117688374,0.00016300853,0.00013931163,0.0000696153,0.00019286155,0.0000431996,0.000004129654],"category_scores_gemma":[0.000028570452,0.000089776986,0.00007974889,0.00041862455,0.000032252632,0.0002445976,0.000025853555,0.000070149144,4.1347337e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003078367,0.00022140297,0.00461918,0.00049957604,0.000023408982,4.8286245e-7,0.0015335889,0.0004964554,0.35782,0.28497458,0.0007137211,0.34878975],"study_design_scores_gemma":[0.003005981,0.00092863396,0.005557334,0.000055160985,0.000028000417,0.000006222914,0.00016632493,0.028477384,0.7383743,0.18855105,0.034446795,0.00040281788],"about_ca_topic_score_codex":0.000036753936,"about_ca_topic_score_gemma":0.00004335335,"teacher_disagreement_score":0.5931103,"about_ca_system_score_codex":0.000029297658,"about_ca_system_score_gemma":0.000027171793,"threshold_uncertainty_score":0.36609992},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Key (lock); Computer science; Schedule; Key schedule; Algorithm; Cryptography; Operating system; Cryptanalysis","score_opus":0.009254499961853806,"score_gpt":0.2679426126451594,"score_spread":0.2586881126833056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115175687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25752667,0.000013132876,0.73857677,0.00094684795,0.00015464996,0.0002114432,0.000046733658,0.00007200611,0.0024517472],"genre_scores_gemma":[0.62394685,0.000007006394,0.37565663,0.00025014122,0.000029950124,0.000042130338,0.00001536496,0.0000036297718,0.000048273003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915683,0.000015832324,0.0002176042,0.00027378165,0.00017244906,0.00016352374],"domain_scores_gemma":[0.9990078,0.000113382266,0.00006138643,0.0006045538,0.000112265196,0.00010056852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014621507,0.00008576258,0.00011055556,0.00015136454,0.00011398371,0.00010563604,0.00057595596,0.000039433813,0.00031883095],"category_scores_gemma":[0.00002032933,0.00007979326,0.00007074954,0.0004968633,0.00004441149,0.00030603656,0.00018682865,0.00009605312,0.00006478122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017336113,0.00042818286,0.013153039,0.000015398098,0.000107674794,0.0000016233786,0.0034807848,0.000030570212,0.2459126,0.5461742,0.021894012,0.16878457],"study_design_scores_gemma":[0.0021778345,0.00040914654,0.10069963,0.000027438653,0.000073711286,0.000008633794,0.0022864041,0.00591885,0.43540645,0.18073757,0.27086395,0.0013903828],"about_ca_topic_score_codex":0.00087306264,"about_ca_topic_score_gemma":0.0018218702,"teacher_disagreement_score":0.3664202,"about_ca_system_score_codex":0.000007413628,"about_ca_system_score_gemma":0.000052854444,"threshold_uncertainty_score":0.34909752},"labels":[],"label_agreement":null},{"id":"W2115383232","doi":"10.1109/ccece.1997.614858","title":"The SHADE cipher: an efficient hash-function-based Feistel network","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Entrust (Canada)","funders":"","keywords":"Hash function; Computer science; MDC-2; Cryptographic hash function; Key schedule; Schedule; Function (biology); Double hashing; Block cipher; Mathematics; Algorithm; Cryptography; Differential cryptanalysis; Computer security","score_opus":0.025248554995838415,"score_gpt":0.24306862162674017,"score_spread":0.21782006663090175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115383232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020058362,0.00019828728,0.9691829,0.0026342,0.0006849141,0.00020274511,0.0000013713064,0.00024149689,0.006795717],"genre_scores_gemma":[0.98621476,0.000007993565,0.011931169,0.001453549,0.00011587879,0.000024540625,0.0000032786375,0.0000057095535,0.00024313902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988834,0.00007300785,0.0001960647,0.00026219396,0.00025410173,0.00033120607],"domain_scores_gemma":[0.9990253,0.00015547326,0.000049688017,0.00061657385,0.000059440787,0.000093534654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033914158,0.0000987249,0.00006894068,0.000036529953,0.0008915936,0.0003883051,0.0005543106,0.000028219503,0.00041625256],"category_scores_gemma":[0.00000828455,0.00006613596,0.00007115633,0.00059042533,0.000057624133,0.00011288598,0.00006415898,0.00008766425,0.000058144626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007916836,0.00030817685,0.0024713033,0.000003578062,0.000025581985,0.0000036388828,0.00067105424,0.031032683,0.000016812439,0.83739287,0.04007123,0.08799517],"study_design_scores_gemma":[0.00027949913,0.00010751156,0.00405156,0.000002188056,0.000004763118,0.0000017522555,0.00007742519,0.92824227,0.000013383685,0.001961981,0.06513966,0.000118036594],"about_ca_topic_score_codex":0.00006302089,"about_ca_topic_score_gemma":0.00033271374,"teacher_disagreement_score":0.96615636,"about_ca_system_score_codex":0.00001797309,"about_ca_system_score_gemma":0.000017402785,"threshold_uncertainty_score":0.6857507},"labels":[],"label_agreement":null},{"id":"W2116517406","doi":"","title":"Techniques of Side Channel Cryptanalysis","year":2001,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Side channel attack; Cryptanalysis; Computer science; Boomerang attack; Linear cryptanalysis; Computer security; Cryptography","score_opus":0.011610758847090062,"score_gpt":0.22839228350772117,"score_spread":0.2167815246606311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116517406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9790684,0.00016845256,0.016701616,0.0009715167,0.00020220074,0.0003600669,0.0000548812,0.00016567508,0.0023071866],"genre_scores_gemma":[0.5363996,0.002567263,0.15134409,0.00008648742,0.00009794704,0.0000040825166,0.0015139346,0.00006681146,0.30791977],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9988553,0.00004610916,0.00019205202,0.00034466016,0.00035253007,0.00020936377],"domain_scores_gemma":[0.99864674,0.000028413442,0.00041541684,0.0005320162,0.0003131031,0.0000643045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016156491,0.00018275283,0.00041691493,0.00077072927,0.00014663317,0.00002260859,0.0009052221,0.00017636763,0.00010623898],"category_scores_gemma":[0.000006232188,0.00021612285,0.00030854513,0.0008534875,0.00007215903,0.00031762678,0.000112167894,0.00014365459,0.000004487765],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002139943,0.0008612614,0.0011944207,0.001210355,0.0014793894,0.00019241366,0.8154999,0.000052483134,0.01644045,0.043799218,0.006296733,0.1127594],"study_design_scores_gemma":[0.002237402,0.001003449,0.019711545,0.00092772965,0.0014954999,0.000020311412,0.8462579,0.00727063,0.08348475,0.026498256,0.008554001,0.0025385334],"about_ca_topic_score_codex":0.033417895,"about_ca_topic_score_gemma":0.039337255,"teacher_disagreement_score":0.4426688,"about_ca_system_score_codex":0.00003260937,"about_ca_system_score_gemma":0.000070747854,"threshold_uncertainty_score":0.9781923},"labels":[],"label_agreement":null},{"id":"W2116863464","doi":"10.1109/isvlsi.2009.46","title":"Leakage Power and Side Channel Security of Nanoscale Cryptosystem-on-Chip (CoC)","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Side channel attack; Cryptosystem; Leakage (economics); CMOS; Information leakage; Chip; Computer science; Cryptography; Channel (broadcasting); Electrical engineering; Embedded system; Electronic engineering; Engineering; Computer security; Telecommunications","score_opus":0.013355065924838351,"score_gpt":0.2570718477056469,"score_spread":0.24371678178080855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116863464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8838619,0.00013688243,0.08686787,0.001986812,0.0002107008,0.00031784075,0.000014104109,0.00013815629,0.026465712],"genre_scores_gemma":[0.99691707,0.000016261736,0.0023282857,0.0006757501,0.000016668233,0.0000039009583,0.0000018008344,0.0000034261589,0.000036865713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989116,0.000051498257,0.00027119298,0.00029985348,0.00023620472,0.00022964987],"domain_scores_gemma":[0.9992842,0.00006799404,0.000080851314,0.00040824988,0.00006448316,0.000094216666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002459357,0.00012705474,0.00018336369,0.00015201184,0.00011459392,0.00007353747,0.00030960396,0.000047956848,0.00003084636],"category_scores_gemma":[0.000015764957,0.0001075215,0.00007080802,0.00034403906,0.00004104405,0.00024161885,0.000081737715,0.000085453175,0.000006646593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012696449,0.0002910355,0.0006402565,0.000026527627,0.000018588822,0.000009084029,0.0043058284,0.000004741225,0.0025647494,0.98621815,0.0014662457,0.0044420874],"study_design_scores_gemma":[0.006346301,0.005444573,0.24211311,0.00026288064,0.00005026144,0.00016006111,0.0042612064,0.02764229,0.07479543,0.62512696,0.011599033,0.0021978936],"about_ca_topic_score_codex":0.00006568714,"about_ca_topic_score_gemma":0.000062600266,"teacher_disagreement_score":0.3610912,"about_ca_system_score_codex":0.000009005328,"about_ca_system_score_gemma":0.000019883615,"threshold_uncertainty_score":0.43845993},"labels":[],"label_agreement":null},{"id":"W2117179505","doi":"10.1109/ccece.2004.1345316","title":"A differential attack on the CIKS-1 block cipher","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Block cipher; Cipher; Two-square cipher; Differential cryptanalysis; Computer science; Transposition cipher; Cryptography; Running key cipher; Triple DES; Slide attack; Computer security; Stream cipher; Arithmetic; Theoretical computer science; Mathematics; Encryption","score_opus":0.045527001696072184,"score_gpt":0.2979285740029774,"score_spread":0.2524015723069052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117179505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7511204,0.0000043933924,0.23008277,0.009675225,0.00022295359,0.0001512243,0.0000015330259,0.00010189547,0.008639618],"genre_scores_gemma":[0.9960691,0.0000028139452,0.0023895015,0.0013541415,0.00004133607,0.000012018137,8.3208414e-7,0.0000027654971,0.00012750046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993677,0.000020589037,0.00010160158,0.00016590799,0.00018395968,0.00016020442],"domain_scores_gemma":[0.99950665,0.00004175057,0.000022128745,0.00036999118,0.00002303858,0.000036450467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059698297,0.00007094981,0.000051210933,0.00003790933,0.00017735864,0.00014004913,0.00042728143,0.00001787867,0.0004486693],"category_scores_gemma":[0.0000054130032,0.00004097596,0.00005952691,0.00024386491,0.000028094215,0.00007969918,0.000102547805,0.00007321467,0.0000936474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014064768,0.000086436754,0.00014614608,8.52704e-7,0.000010477963,0.000001911389,0.00059023243,0.00003687852,0.00014806293,0.9943778,0.0032015026,0.0013983093],"study_design_scores_gemma":[0.012099945,0.0022841957,0.18568423,0.00011450113,0.00008409207,0.00012860147,0.0022826924,0.03620225,0.041897897,0.50275534,0.21357058,0.0028956535],"about_ca_topic_score_codex":0.000051262312,"about_ca_topic_score_gemma":0.00014846218,"teacher_disagreement_score":0.49162242,"about_ca_system_score_codex":0.000012988663,"about_ca_system_score_gemma":0.000021047683,"threshold_uncertainty_score":0.49126142},"labels":[],"label_agreement":null},{"id":"W2118096928","doi":"10.1109/iscas.2012.6271520","title":"Integrated capacitor switchbox for security protection","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Capacitor; Decoupling capacitor; Computer science; CMOS; Decorrelation; Decoupling (probability); Cadence; Embedded system; Electronic engineering; Chip; Power analysis; Voltage; Electrical engineering; Engineering; Cryptography; Telecommunications; Computer security","score_opus":0.03831726535410079,"score_gpt":0.28133323625335965,"score_spread":0.24301597089925886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118096928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07373052,0.00002091016,0.92394686,0.00043307792,0.00057663483,0.0004698017,0.000006548764,0.00016677208,0.0006488926],"genre_scores_gemma":[0.95420307,0.0000015368618,0.045310505,0.00013568984,0.00012644903,0.00016713762,0.000006727752,0.0000037388652,0.00004514673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933505,0.000027138216,0.00013675887,0.00013992035,0.000103726125,0.0002573894],"domain_scores_gemma":[0.9995501,0.000028844275,0.0000375109,0.00020833692,0.000096027885,0.00007917017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031713455,0.00007639121,0.00006984896,0.00008591624,0.00015700515,0.00007934867,0.00018900304,0.000037161943,0.000058458838],"category_scores_gemma":[0.000025890706,0.000061851875,0.000059288835,0.00033920057,0.000015687581,0.0006077319,0.000038488557,0.00006700176,0.000012951941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010124456,0.00023583208,0.0018111046,0.000025605073,0.000025431067,1.52704e-7,0.004691943,4.6523633e-7,0.0034348983,0.91711736,0.0064011165,0.06624596],"study_design_scores_gemma":[0.0024184403,0.00057802466,0.009180535,0.000021764281,0.000032900534,0.00004974017,0.002602384,0.14024149,0.04851807,0.12926948,0.6660205,0.0010666463],"about_ca_topic_score_codex":0.00022052044,"about_ca_topic_score_gemma":0.00008580402,"teacher_disagreement_score":0.88047254,"about_ca_system_score_codex":0.00002649118,"about_ca_system_score_gemma":0.00002141954,"threshold_uncertainty_score":0.25222462},"labels":[],"label_agreement":null},{"id":"W2118220486","doi":"10.1109/asap.2002.1030728","title":"A novel pipelined threads architecture for AES encryption algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Field-programmable gate array; Parallel computing; Scalability; Encryption; Thread (computing); Advanced Encryption Standard; Throughput; AES implementations; Architecture; Clock rate; Embedded system; Chip; Operating system; Wireless","score_opus":0.023219252236999076,"score_gpt":0.2837836643177523,"score_spread":0.26056441208075326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118220486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013154071,0.000028617593,0.9964281,0.0006628186,0.00019657233,0.00028142845,0.000012947334,0.000112639325,0.00096150837],"genre_scores_gemma":[0.07913609,0.0000055094547,0.92019176,0.0004523983,0.000037723807,0.00005737077,0.000012690823,0.0000050330814,0.000101417434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992154,0.000018377823,0.00016458717,0.00025265742,0.00013170452,0.00021727716],"domain_scores_gemma":[0.9994789,0.00007482186,0.000039317718,0.0002653263,0.00008575851,0.000055873534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025549962,0.00009546555,0.0000876384,0.00011282102,0.0001508885,0.00010454507,0.00023077127,0.000035645437,0.00005074941],"category_scores_gemma":[0.000028836868,0.00007848525,0.00008325234,0.00034647252,0.00002065646,0.00015825256,0.000029527035,0.00005447423,0.0000045205707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015273991,0.00008420485,0.00004677429,0.0000053005606,0.000009531015,3.1070545e-7,0.00048933475,0.000026197533,0.0015706118,0.83850676,0.0008699585,0.15838951],"study_design_scores_gemma":[0.0037488893,0.00044921084,0.0014718093,0.000014501941,0.000026251588,0.00010195769,0.00044816415,0.2489928,0.010552585,0.55124956,0.18218997,0.00075429946],"about_ca_topic_score_codex":0.000038412036,"about_ca_topic_score_gemma":0.00009949818,"teacher_disagreement_score":0.2872572,"about_ca_system_score_codex":0.000010501378,"about_ca_system_score_gemma":0.000041258725,"threshold_uncertainty_score":0.32005358},"labels":[],"label_agreement":null},{"id":"W2119451687","doi":"10.1109/ccece.2004.1345109","title":"Design of a flexible cryptographic hardware module","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Block cipher; Cryptography; Field-programmable gate array; Embedded system; Application-specific integrated circuit; VHDL; Key (lock); Implementation; Block (permutation group theory); Cryptographic primitive; Hardware architecture; Software; Computer architecture; Cryptographic protocol; Operating system; Algorithm; Software engineering","score_opus":0.03532551685140094,"score_gpt":0.276888586139772,"score_spread":0.24156306928837107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119451687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013706434,0.00008763776,0.9844945,0.00030654506,0.00010113358,0.0001712408,0.0000017488709,0.00014075919,0.0009899827],"genre_scores_gemma":[0.6672003,0.000015109803,0.33262694,0.00010699112,0.000007150721,0.000016134027,0.0000011303916,0.0000032592322,0.000022961432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991675,0.000025476442,0.00020135772,0.00021016132,0.00020109865,0.0001943743],"domain_scores_gemma":[0.99935764,0.000027783388,0.000054169173,0.00041309555,0.00008909766,0.000058209072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018307372,0.00008356281,0.000107418375,0.00022616787,0.00008559333,0.000051686613,0.000446929,0.00002826286,0.000119398035],"category_scores_gemma":[0.0000055683945,0.00007419164,0.00007128074,0.0009275418,0.00004514232,0.0002985704,0.00009078419,0.000049443966,0.000012903024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030443307,0.00012261404,0.00034239804,0.000006652444,0.000020382862,0.0000029709681,0.0009290051,0.0016979838,0.0010145239,0.99129933,0.00020597495,0.004355109],"study_design_scores_gemma":[0.004129735,0.001041536,0.020901896,0.000060447466,0.00003217536,0.000050268904,0.0007996938,0.02105664,0.060923763,0.88752466,0.002597262,0.0008819385],"about_ca_topic_score_codex":0.00018241501,"about_ca_topic_score_gemma":0.00001327333,"teacher_disagreement_score":0.6534939,"about_ca_system_score_codex":0.000010327173,"about_ca_system_score_gemma":0.00006319211,"threshold_uncertainty_score":0.3025447},"labels":[],"label_agreement":null},{"id":"W2119747188","doi":"10.1109/iscas.2006.1693574","title":"On-Chip Current Flattening Circuit with Dynamic Voltage Scaling","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Flattening; Electrical engineering; Constant power circuit; CMOS; Chip; Voltage; Power (physics); Computer science; Switched-mode power supply; Volt-ampere; Electronic engineering; Current (fluid); Switched-mode power supply applications; Low-power electronics; Engineering; Power consumption; Physics","score_opus":0.01372961973067016,"score_gpt":0.2592790343856053,"score_spread":0.24554941465493513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119747188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24219635,0.00003912743,0.7549752,0.000108311935,0.00011488259,0.00008803406,0.0000018238883,0.00012630103,0.0023499508],"genre_scores_gemma":[0.99207133,0.0000020686343,0.0077282214,0.000104466904,0.000024856696,0.00000962628,0.000009728825,0.00000604684,0.00004363468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902457,0.00001568769,0.00016816781,0.00029038163,0.00025059914,0.00025058645],"domain_scores_gemma":[0.999504,0.000058509457,0.000048480204,0.0003041539,0.000039873164,0.00004496242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001307126,0.00010977248,0.00008931201,0.00014939359,0.0001946273,0.00018133008,0.0002969439,0.000016614506,0.00004732719],"category_scores_gemma":[0.0000028015638,0.00008534854,0.000044852317,0.0004286619,0.00002711901,0.00020026824,0.00005769754,0.00011229885,0.00002235588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002209672,0.00009136485,0.0041243033,0.000008653883,0.0000074759982,0.000008067514,0.00024158123,0.00032826202,0.0002690826,0.9396841,0.0004279571,0.05480697],"study_design_scores_gemma":[0.002814542,0.00041834684,0.14181063,0.00016630732,0.00003303494,0.00006830515,0.00030529697,0.49007142,0.0009487491,0.35558608,0.006441791,0.0013355049],"about_ca_topic_score_codex":0.0001617042,"about_ca_topic_score_gemma":0.00033033898,"teacher_disagreement_score":0.749875,"about_ca_system_score_codex":0.000025760619,"about_ca_system_score_gemma":0.0000270041,"threshold_uncertainty_score":0.34804124},"labels":[],"label_agreement":null},{"id":"W2119857951","doi":"10.1109/reconfig.2009.40","title":"Tailoring a Reconfigurable Platform to SHA-256 and HMAC through Custom Instructions and Peripherals","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash-based message authentication code; Computer science; Hash function; Message authentication code; Cryptography; Computation; Embedded system; Authentication (law); Software; Footprint; Parallel computing; Operating system; Algorithm; Programming language","score_opus":0.03115845879145226,"score_gpt":0.2887756248334267,"score_spread":0.2576171660419745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119857951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8787656,0.0000968986,0.09757697,0.003543418,0.0001625072,0.00023679351,0.0000039406586,0.00013445396,0.019479463],"genre_scores_gemma":[0.9094112,0.00008617136,0.08915375,0.0011459547,0.000027869175,0.000010728511,0.0000013718004,0.0000027603016,0.00016020391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926347,0.000007825958,0.00016124472,0.00026731665,0.00009614611,0.00020399835],"domain_scores_gemma":[0.9996238,0.000020906566,0.00002595004,0.00019925533,0.000035083765,0.00009501712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101368256,0.00009310197,0.000104764826,0.00008577679,0.00029962262,0.00028968943,0.00014041907,0.00002698702,0.00009336466],"category_scores_gemma":[0.0000074463774,0.00008381086,0.00002156229,0.00035233007,0.000023542825,0.00090442516,0.000047492325,0.00006675662,0.000004105291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045659135,0.000027973643,0.00090499624,0.0000058014066,0.00001141285,0.0000025678291,0.0057018744,0.000009805063,0.00107414,0.777478,0.0014015452,0.21337733],"study_design_scores_gemma":[0.0038023812,0.0016807199,0.12607336,0.00010477243,0.00004266601,0.00065819104,0.009252317,0.02074331,0.007805017,0.43000165,0.397898,0.001937615],"about_ca_topic_score_codex":0.00022333206,"about_ca_topic_score_gemma":0.00017124109,"teacher_disagreement_score":0.39649644,"about_ca_system_score_codex":0.000013905853,"about_ca_system_score_gemma":0.000017006969,"threshold_uncertainty_score":0.34177077},"labels":[],"label_agreement":null},{"id":"W2120152839","doi":"10.1504/ijcnds.2009.026876","title":"An algorithm based mesh check-sum fault tolerant scheme for stream ciphers","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Checksum; Algorithm; RC4; Stream cipher; Scheme (mathematics); Overhead (engineering); Error detection and correction; Parallel computing; Cryptography; Mathematics","score_opus":0.016780186940940137,"score_gpt":0.30889722808543923,"score_spread":0.2921170411444991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120152839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007692347,0.0010081606,0.9883049,0.0021821659,0.0004473801,0.00019425582,0.0000968888,0.000028239312,0.000045648907],"genre_scores_gemma":[0.9645024,0.00019826675,0.034543846,0.00024109145,0.00017453924,0.000011460865,0.00032112756,0.0000046609653,0.0000026159726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998516,0.0001427355,0.00066365354,0.0001422723,0.00037336396,0.00016192243],"domain_scores_gemma":[0.9976463,0.00016850464,0.0005722626,0.00040758128,0.0010714085,0.00013399583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007927031,0.00012456081,0.00021031914,0.00013555503,0.00017761036,0.0005433194,0.0012288196,0.00007022553,0.0000048742218],"category_scores_gemma":[0.000026739224,0.00011188669,0.000113159454,0.00019859665,0.000037382284,0.0006163425,0.000046712048,0.00016742095,1.9178802e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003475264,0.001974187,0.004028518,0.000026135685,0.00072306825,0.00003127671,0.0012770176,0.2506145,0.000482543,0.37736285,0.020776063,0.34235632],"study_design_scores_gemma":[0.0013051574,0.00022247511,0.0022914521,0.000078697914,0.00001369155,0.00004917017,0.00037989614,0.98406816,0.000017075386,0.0011921211,0.010255248,0.0001268445],"about_ca_topic_score_codex":0.000034549204,"about_ca_topic_score_gemma":0.000008939933,"teacher_disagreement_score":0.95681006,"about_ca_system_score_codex":0.000063766056,"about_ca_system_score_gemma":0.00007601222,"threshold_uncertainty_score":0.5239241},"labels":[],"label_agreement":null},{"id":"W2124620058","doi":"10.1145/500001.500032","title":"Current consumption dynamics at instruction and program level for a <i>VLIW</i> DSP processor","year":2001,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Very long instruction word; Computer science; Digital signal processing; Construct (python library); Digital signal processor; Computer architecture; Energy consumption; Multi-core processor; Instruction set; Embedded system; Parallel computing; Computer hardware; Programming language; Electrical engineering; Engineering","score_opus":0.06364031316532669,"score_gpt":0.35069299670980114,"score_spread":0.28705268354447444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124620058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45743018,0.00009902408,0.541189,0.00033523978,0.00016900575,0.0005664075,0.000014058652,0.00013056117,0.0000665034],"genre_scores_gemma":[0.8694749,0.000738537,0.1290736,0.00012633341,0.000044194676,0.00039558666,0.00007967648,0.0000075950993,0.00005960819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992514,0.00001179035,0.00017017912,0.00025983548,0.00012049559,0.00018624993],"domain_scores_gemma":[0.9996121,0.0000266031,0.00006162666,0.00014559635,0.000094959454,0.000059106216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001237847,0.000088724184,0.00007850952,0.000087759654,0.00023177,0.00013554054,0.00013062276,0.000024679259,0.000011253892],"category_scores_gemma":[0.0000084190815,0.00007969542,0.000034247365,0.00023108066,0.000045322882,0.0003417585,0.0000905959,0.00004474595,0.0000025935085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012632472,0.00011172021,0.0251137,0.00005730362,0.0000069774355,3.111146e-7,0.00024235285,0.0000011818062,0.00003085975,0.13610514,0.0002988183,0.838019],"study_design_scores_gemma":[0.005192325,0.000668208,0.09264733,0.00006248097,0.000044541637,0.00028255433,0.00023797214,0.73443514,0.00052345986,0.046494886,0.11865683,0.0007542864],"about_ca_topic_score_codex":0.000019993116,"about_ca_topic_score_gemma":0.00094730646,"teacher_disagreement_score":0.8372647,"about_ca_system_score_codex":0.000048938364,"about_ca_system_score_gemma":0.000022282053,"threshold_uncertainty_score":0.32498848},"labels":[],"label_agreement":null},{"id":"W2124630084","doi":"10.1109/date.2005.323","title":"Uniformly-Switching Logic for Cryptographic Hardware","year":2005,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cryptography; Logic gate; Encryption; Hardware security module; Register-transfer level; Cryptographic primitive; Digital electronics; Power analysis; Logic synthesis; Dissipation; Logic family; Embedded system; Computer hardware; Cryptographic protocol; Computer security; Electrical engineering; Electronic circuit; Engineering; Algorithm","score_opus":0.029297913405740294,"score_gpt":0.2764007914911334,"score_spread":0.2471028780853931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124630084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031004125,0.00017010182,0.9667253,0.0009958686,0.00008129813,0.00044619417,0.000009205378,0.00023768083,0.0003302316],"genre_scores_gemma":[0.76260436,0.00011986989,0.23663376,0.0004916043,0.000054660755,0.000049719893,0.000012801031,0.0000110802275,0.000022140406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988747,0.00007656628,0.0003380684,0.00030636776,0.00014531636,0.00025894266],"domain_scores_gemma":[0.9989326,0.00047311152,0.00010034623,0.00025411992,0.00017435872,0.00006549008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061518286,0.0001409594,0.00013578263,0.00034353355,0.0002780883,0.00024914608,0.00031093537,0.000039099952,0.000012699481],"category_scores_gemma":[0.000216744,0.0001303786,0.00003663087,0.0010392467,0.00002936698,0.0006807866,0.000056680397,0.000082288185,0.000007505811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009284198,0.0003605244,0.027042823,0.00008276953,0.000022807775,0.000009408981,0.0052151885,0.0005679575,0.00129684,0.81786853,0.0018664054,0.14565748],"study_design_scores_gemma":[0.0022656082,0.00045551994,0.2031934,0.00007360552,0.000021554939,0.000058675185,0.00018972313,0.6790887,0.00054739334,0.05636148,0.057048857,0.00069546246],"about_ca_topic_score_codex":0.000013063937,"about_ca_topic_score_gemma":0.000093154864,"teacher_disagreement_score":0.76150703,"about_ca_system_score_codex":0.000014585982,"about_ca_system_score_gemma":0.000056758112,"threshold_uncertainty_score":0.5316685},"labels":[],"label_agreement":null},{"id":"W2126638006","doi":"10.1109/ccece.2003.1226021","title":"A VLSI implementation of a cryptographic processor","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Encryption; Cryptography; Embedded system; Throughput; Cryptographic primitive; Advanced Encryption Standard; Very-large-scale integration; Cryptographic protocol; Processor design; Computer network; Operating system; Computer security; Wireless","score_opus":0.01084361986003539,"score_gpt":0.29678499076859743,"score_spread":0.28594137090856203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126638006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37321192,0.000026083622,0.6251663,0.00073209143,0.000046304263,0.00017584,0.0000029121313,0.00007665156,0.000561905],"genre_scores_gemma":[0.91328305,0.000013672074,0.086503625,0.00015555769,0.000008601416,0.00002652591,0.0000033838255,0.000003010382,0.0000025886186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991646,0.000012811717,0.00025466032,0.0001859449,0.00021479971,0.00016719659],"domain_scores_gemma":[0.9995013,0.000013119043,0.000088934146,0.00024295569,0.00010820945,0.00004547023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014737548,0.00007503534,0.00009097763,0.00022707514,0.00007390474,0.000048244696,0.00032470273,0.000019602812,0.000092605034],"category_scores_gemma":[0.0000038873623,0.000066518034,0.00006782446,0.00097642926,0.000033388278,0.00038471443,0.00006890697,0.000038428032,0.0000046338355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012843738,0.000077887926,0.0036391038,0.000021285325,0.000015589738,0.0000010665977,0.0018916148,0.0000100783645,0.0017323627,0.9782421,0.00005322632,0.014314423],"study_design_scores_gemma":[0.0068952576,0.0009638087,0.1881566,0.00004159092,0.00005100977,0.000042930023,0.00604417,0.0006288317,0.10913797,0.68417686,0.0031107494,0.000750199],"about_ca_topic_score_codex":0.0005027053,"about_ca_topic_score_gemma":0.0006661001,"teacher_disagreement_score":0.5400711,"about_ca_system_score_codex":0.000011756659,"about_ca_system_score_gemma":0.000094295814,"threshold_uncertainty_score":0.27125266},"labels":[],"label_agreement":null},{"id":"W2127851647","doi":"10.1109/ccece.2005.1556916","title":"A timing attack on the CIKS-1 block cipher","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Block cipher; Computer science; Hamming weight; Plaintext; Cipher; Hamming code; Cryptography; Embedded system; Hamming distance; Software; Block (permutation group theory); Encryption; Computer security; Algorithm; Mathematics; Operating system; Block code","score_opus":0.08151271759998802,"score_gpt":0.3284349652952064,"score_spread":0.24692224769521837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127851647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.612395,0.000042468193,0.19998966,0.06335882,0.00024394538,0.00034937612,0.0000020968853,0.00029751007,0.12332113],"genre_scores_gemma":[0.9797972,0.0000034964341,0.015117224,0.0044338917,0.000065017404,0.0000098239925,3.8468076e-7,0.0000026892317,0.0005703082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942535,0.00002464839,0.00010112093,0.00014589405,0.00015128257,0.00015173119],"domain_scores_gemma":[0.99949247,0.00008703808,0.000022040718,0.00034473994,0.000022975568,0.000030750587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001725449,0.000058537928,0.00004193964,0.000038283277,0.00017314854,0.000117072115,0.00038160218,0.000014293488,0.0005031287],"category_scores_gemma":[0.000007464655,0.000035503403,0.000042755793,0.00024497288,0.000017828519,0.0001246417,0.00008676623,0.0000649493,0.00018679115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013476681,0.00008351888,0.000415015,0.0000012694389,0.000014014276,0.000001536166,0.0017384666,0.00016206577,0.000098326636,0.88608634,0.072971255,0.03842684],"study_design_scores_gemma":[0.00056731096,0.00013667146,0.007151246,0.00001229586,0.000007779613,0.000018226796,0.00045612978,0.17029196,0.0023026217,0.004433284,0.81425864,0.00036386776],"about_ca_topic_score_codex":0.000014632525,"about_ca_topic_score_gemma":0.00013235098,"teacher_disagreement_score":0.8816531,"about_ca_system_score_codex":0.000010645698,"about_ca_system_score_gemma":0.000012373826,"threshold_uncertainty_score":0.5508907},"labels":[],"label_agreement":null},{"id":"W2128461337","doi":"10.1142/s0218126614500364","title":"PERFORMANCE CHARACTERIZATION OF PIPELINED S-BOX IMPLEMENTATIONS FOR THE ADVANCED ENCRYPTION STANDARD","year":2014,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Pipeline (software); AES implementations; Advanced Encryption Standard; Computer science; Application-specific integrated circuit; Implementation; Standard cell; Embedded system; Throughput; Encryption; S-box; Parallel computing; Computer engineering; Computer architecture; Computer hardware; Block cipher; Integrated circuit; Operating system","score_opus":0.01450573450547194,"score_gpt":0.26168464747142234,"score_spread":0.2471789129659504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128461337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35060984,0.000047258698,0.64834976,0.00019444963,0.0005844946,0.00019210261,0.000008394334,0.000005568142,0.0000081145345],"genre_scores_gemma":[0.9958875,0.00012312127,0.0037752022,0.00005736116,0.00013378188,0.0000106440775,0.0000050165545,0.0000041751846,0.0000031604604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891186,0.000059205955,0.0005705295,0.00009846904,0.00024013912,0.00011980854],"domain_scores_gemma":[0.9985692,0.00019651216,0.00064001593,0.0001515942,0.00039742037,0.000045248456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081031205,0.00007977304,0.0001958396,0.00013652831,0.00018752448,0.00011553784,0.0002659474,0.000020623378,0.000001263749],"category_scores_gemma":[0.000014852363,0.00005660091,0.00007231597,0.00019722202,0.000027291064,0.0004650276,0.000028515791,0.00005349832,1.0828051e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005056953,0.00007538238,0.0049255034,0.00033266598,0.00016723464,5.832367e-7,0.004889157,0.0025071152,0.04741096,0.12940872,0.00031956265,0.80991256],"study_design_scores_gemma":[0.006953138,0.0033078925,0.14970654,0.0004990593,0.00015549756,0.00022194418,0.00162382,0.79468083,0.0035798394,0.0016202428,0.037165593,0.00048559453],"about_ca_topic_score_codex":0.0000053403187,"about_ca_topic_score_gemma":0.0000019843071,"teacher_disagreement_score":0.80942696,"about_ca_system_score_codex":0.00001843737,"about_ca_system_score_gemma":0.00004514543,"threshold_uncertainty_score":0.2308118},"labels":[],"label_agreement":null},{"id":"W2128670147","doi":"10.1145/1366110.1366127","title":"Reconfigurable solutions for very-long arithmetic with applications in cryptography","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Field-programmable gate array; Computer science; Cryptography; Adder; Virtex; Integer (computer science); Subtraction; Latency (audio); Parallel computing; Reconfigurable computing; Flexibility (engineering); Reduction (mathematics); Carry (investment); Computer engineering; Embedded system; Arithmetic; Algorithm; Mathematics; Telecommunications","score_opus":0.03400935241477896,"score_gpt":0.2651918455430854,"score_spread":0.23118249312830644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128670147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019772595,0.00006707548,0.97557753,0.00050111493,0.000032505155,0.00065312453,0.000008084331,0.000105728235,0.0032822632],"genre_scores_gemma":[0.7951827,0.000047633162,0.20370987,0.00015434196,0.00001656911,0.0007880374,0.000022866006,0.0000068661793,0.00007108817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990276,0.000017873885,0.0001988947,0.00028609336,0.00012139317,0.00034811813],"domain_scores_gemma":[0.9993205,0.00011710017,0.000043739183,0.00036031476,0.00009403204,0.00006432832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016851976,0.00009733083,0.00011312478,0.00033867726,0.00048653918,0.00005793325,0.0003200751,0.00003001114,0.00004200896],"category_scores_gemma":[0.0000051793827,0.00008259668,0.00006704945,0.0013083539,0.00007573323,0.0003191502,0.000028758837,0.00006983674,0.000004523895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050486815,0.0002475868,0.022955885,0.000012317485,0.000021602527,0.0000025415031,0.000679963,0.00010056018,0.000060218426,0.969431,0.00090367603,0.0055796257],"study_design_scores_gemma":[0.008732771,0.001277638,0.5825493,0.000074950454,0.00007474231,0.00031888075,0.0022606442,0.0655571,0.0025639455,0.195472,0.13883579,0.0022822497],"about_ca_topic_score_codex":0.00019823865,"about_ca_topic_score_gemma":0.0011319699,"teacher_disagreement_score":0.7754101,"about_ca_system_score_codex":0.000017919054,"about_ca_system_score_gemma":0.00007494159,"threshold_uncertainty_score":0.37421152},"labels":[],"label_agreement":null},{"id":"W2130959496","doi":"10.1007/s12095-009-0013-3","title":"On the structural weakness of the GGHN stream cipher","year":2009,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Keystream; Stream cipher; RC4; Computer science; State (computer science); Stream cipher attack; Cryptanalysis; Computation; Arithmetic; Algorithm; Cryptography; Theoretical computer science; Parallel computing; Mathematics","score_opus":0.019974549228413296,"score_gpt":0.2722364008669581,"score_spread":0.2522618516385448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130959496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9364769,0.0010710412,0.021135006,0.031807773,0.00015264911,0.0005313568,0.000027844824,0.00008554261,0.008711875],"genre_scores_gemma":[0.9952583,0.00013217104,0.003819214,0.0007589376,0.0000061725177,0.000016410631,0.0000028048032,0.0000021501185,0.00000387063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926394,0.0001545053,0.0001830552,0.00012577225,0.00014841797,0.00012429956],"domain_scores_gemma":[0.9975206,0.0002632338,0.00010015289,0.0020159807,0.000068849455,0.00003114354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016150052,0.00008956523,0.000083147934,0.00007534614,0.00080545375,0.00008947016,0.0018644619,0.000027948205,0.000016800488],"category_scores_gemma":[0.000017044104,0.00005031433,0.00011628748,0.0009019069,0.0003199947,0.00012097021,0.00025968644,0.00017171846,6.0041464e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013425239,0.000042645053,0.001503234,0.0000011234866,0.000012724774,2.7147093e-8,0.0011611506,0.000002275366,0.00007526367,0.9811587,0.00027063137,0.015770912],"study_design_scores_gemma":[0.00026779284,0.000100165176,0.3038108,0.000027046544,0.000020259262,0.000004499108,0.00084303593,0.0016898522,0.00035202608,0.6896492,0.0030916221,0.00014365351],"about_ca_topic_score_codex":0.00003655048,"about_ca_topic_score_gemma":0.00007098668,"teacher_disagreement_score":0.30230758,"about_ca_system_score_codex":0.0000033481997,"about_ca_system_score_gemma":0.000019215482,"threshold_uncertainty_score":0.6194981},"labels":[],"label_agreement":null},{"id":"W2131658256","doi":"10.1145/1084834.1084883","title":"Power-smart system-on-chip architecture for embedded cryptosystems","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Embedded system; Computer science; Power (physics); Microcontroller; Overhead (engineering); System on a chip; Electric power system; Low-power electronics; Computer hardware; Electronic engineering; Engineering; Electrical engineering; Power consumption","score_opus":0.014497845499140167,"score_gpt":0.2709797945477233,"score_spread":0.2564819490485831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131658256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022318643,0.000030663297,0.95167273,0.0030063132,0.00037714886,0.0006264152,0.000017624245,0.00035939098,0.021591064],"genre_scores_gemma":[0.9073448,8.785898e-7,0.09113231,0.0011731968,0.00008927094,0.000106189225,0.000006952579,0.00000973885,0.00013666978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998722,0.00006760647,0.00029151468,0.00035780817,0.00024776105,0.0003133107],"domain_scores_gemma":[0.9990188,0.00018641209,0.00007432753,0.000544403,0.00007531615,0.00010073801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041636004,0.00015319407,0.00016799048,0.00018132343,0.00019415114,0.00021598715,0.00050705887,0.000047579244,0.00004139571],"category_scores_gemma":[0.000016663627,0.00012161311,0.00014296369,0.00028667398,0.00001692146,0.0001909875,0.000071401686,0.00009487435,0.000048863218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008390062,0.00005682204,0.0000614124,0.0000318229,0.00001975152,0.0000010577735,0.0013803157,0.00012949984,0.00028113177,0.9864558,0.0058088414,0.005765168],"study_design_scores_gemma":[0.0053164186,0.0014014342,0.0022014598,0.00018787033,0.000028357284,0.0001892648,0.0030735277,0.12214612,0.006946907,0.016237492,0.84082323,0.001447883],"about_ca_topic_score_codex":0.00002165844,"about_ca_topic_score_gemma":0.00013410936,"teacher_disagreement_score":0.9702183,"about_ca_system_score_codex":0.000037005186,"about_ca_system_score_gemma":0.000044892702,"threshold_uncertainty_score":0.49592388},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03693312533703984,"score_gpt":0.2647202868880352,"score_spread":0.22778716155099532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132451830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121358514,0.0000044816647,0.87621456,0.00019291912,0.001398716,0.0005132588,0.000043300413,0.00021447771,0.000059794],"genre_scores_gemma":[0.9901597,0.000013630639,0.009332636,0.00022281017,0.000040439863,0.000170495,0.000012495957,0.000012382819,0.000035415676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984532,0.00006839837,0.00031997054,0.00050815044,0.00032423926,0.00032607085],"domain_scores_gemma":[0.9990657,0.00008296525,0.000086055006,0.0005133583,0.00013309573,0.000118805205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011491461,0.00020428047,0.00026106596,0.000702637,0.00072821596,0.00011864252,0.00040273825,0.00007779298,0.000031898726],"category_scores_gemma":[0.0000013000274,0.00021059274,0.00055692275,0.0013462611,0.00006460789,0.0002916643,0.0000036315632,0.00018058132,0.000008843189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036016433,0.004990178,0.0014988006,0.00014889486,0.010642158,0.00009524673,0.023480946,0.30027324,0.008595368,0.010955006,0.0068020285,0.632158],"study_design_scores_gemma":[0.0036236073,0.0010355486,0.012391881,0.000031766507,0.0005247583,0.00005519,0.00012683492,0.96722096,0.008134481,0.0005684361,0.0050833663,0.0012031804],"about_ca_topic_score_codex":0.000084643536,"about_ca_topic_score_gemma":0.00009965655,"teacher_disagreement_score":0.8688012,"about_ca_system_score_codex":0.00008120628,"about_ca_system_score_gemma":0.00005734929,"threshold_uncertainty_score":0.8587723},"labels":[],"label_agreement":null},{"id":"W2132982295","doi":"10.1109/iscas.2008.4542069","title":"Compact ASIC Implementation of the ICEBERG Block Cipher with Concurrent Error Detection","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Application-specific integrated circuit; Block cipher; Computer science; Embedded system; Field-programmable gate array; Error detection and correction; Overhead (engineering); Fault detection and isolation; Cipher; CMOS; Throughput; Block (permutation group theory); Computer hardware; Encryption; Engineering; Computer network; Operating system; Algorithm; Electronic engineering","score_opus":0.028081459179320825,"score_gpt":0.29575154257414715,"score_spread":0.26767008339482634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132982295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8992873,0.000013332508,0.09936661,0.00036735047,0.00017192644,0.00026219033,0.000004058558,0.00004299559,0.00048425538],"genre_scores_gemma":[0.9988815,0.0000044210383,0.00096645264,0.00009475255,0.000014063865,0.0000080928785,0.0000016626652,0.000003525716,0.00002552457],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991761,0.000052110787,0.00019937103,0.00015915559,0.00026882527,0.00014448134],"domain_scores_gemma":[0.99944174,0.00002696601,0.0001241641,0.0002797526,0.00009287173,0.00003452624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009437619,0.000083553154,0.0000877601,0.000058685135,0.00022319876,0.000023019,0.0002648378,0.000015256012,0.00009881486],"category_scores_gemma":[0.000002007222,0.000051139967,0.00005906801,0.0005287702,0.000068878006,0.00020650442,0.000049388167,0.00006204164,0.0000028539087],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004618547,0.0009143058,0.6640985,0.000084635336,0.00041483695,0.000011359035,0.02518981,0.00065282255,0.021519685,0.15116884,0.008910787,0.12698825],"study_design_scores_gemma":[0.0019938797,0.00043339643,0.91056585,0.000012427906,0.000029607887,0.00011520854,0.001753154,0.0056584086,0.07443181,0.00033309613,0.004403916,0.00026925496],"about_ca_topic_score_codex":0.0006787083,"about_ca_topic_score_gemma":0.0030138788,"teacher_disagreement_score":0.24646735,"about_ca_system_score_codex":0.000023233948,"about_ca_system_score_gemma":0.00006330063,"threshold_uncertainty_score":0.20854272},"labels":[],"label_agreement":null},{"id":"W2133809426","doi":"10.1109/ccece.2007.286","title":"Hardware Implementation of the Salsa20 and Phelix Stream Ciphers","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Stream cipher; Parallel computing; Computer architecture; Cryptography; Embedded system; Computer hardware; Algorithm","score_opus":0.012274110375412452,"score_gpt":0.30274299433407664,"score_spread":0.2904688839586642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133809426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8066214,0.000030088004,0.1906336,0.000618246,0.000117930475,0.00016936961,0.000006444536,0.000029826908,0.0017731118],"genre_scores_gemma":[0.99044865,0.000007617474,0.009320625,0.00018828503,0.00001004082,0.0000020361658,0.0000016530055,0.0000018158288,0.000019247715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994178,0.000016936036,0.00017382485,0.00011716797,0.00015183626,0.00012248098],"domain_scores_gemma":[0.99961305,0.000039629223,0.00006330497,0.00020770666,0.00004543683,0.00003090174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002689653,0.00004912893,0.00005135317,0.000044902103,0.00009384669,0.00003547849,0.0002048333,0.0000136035815,0.000100420584],"category_scores_gemma":[0.000004166696,0.00003354183,0.00003309345,0.00029162504,0.00003515097,0.00015815749,0.00011417551,0.000030822615,7.3622874e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029736004,0.000045748573,0.19539951,0.000016238317,0.000030168489,0.0000011267078,0.0049392353,0.0000022041959,0.0031286704,0.5405145,0.0020053275,0.2539143],"study_design_scores_gemma":[0.00085974677,0.000082432176,0.9316788,0.000007712579,0.000013655746,0.0000090806925,0.011258023,0.00040836178,0.042999834,0.006656322,0.0058619026,0.00016418115],"about_ca_topic_score_codex":0.00050013553,"about_ca_topic_score_gemma":0.0021275105,"teacher_disagreement_score":0.73627925,"about_ca_system_score_codex":0.000008150286,"about_ca_system_score_gemma":0.00002200717,"threshold_uncertainty_score":0.1367796},"labels":[],"label_agreement":null},{"id":"W2133990218","doi":"10.1109/isqed.2009.4810299","title":"Side channel aware leakage management in nanoscale Cryptosystem-on-Chip (CoC)","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Side channel attack; Cryptosystem; Leakage (economics); Chip; Transistor; Electrical engineering; Quantum tunnelling; Computer science; Channel (broadcasting); Voltage; Electronic engineering; Cryptography; Engineering; Computer security; Materials science; Optoelectronics","score_opus":0.021624283679509967,"score_gpt":0.27539781443232225,"score_spread":0.2537735307528123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133990218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16263871,0.00007799772,0.7517035,0.006756308,0.00056668365,0.0010925952,0.000007926762,0.00046488896,0.076691374],"genre_scores_gemma":[0.9931353,0.000022170694,0.0047158836,0.0017758221,0.000028713604,0.00002746756,0.0000048644906,0.000004906149,0.0002848926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985804,0.00005478931,0.00030125896,0.0004078313,0.000289936,0.00036576277],"domain_scores_gemma":[0.9992723,0.00003413064,0.00005023739,0.0005358866,0.000026400345,0.00008107332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025088742,0.00015249696,0.00015296308,0.00034435984,0.00012754789,0.00014047233,0.00057131244,0.00003968204,0.00004196871],"category_scores_gemma":[0.0000036285849,0.00013624561,0.0000748938,0.00072498305,0.000013822559,0.00025936446,0.00010907135,0.00010061819,0.00006529859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010836816,0.00045305968,0.00048442872,0.000032511438,0.000021715483,0.00012578463,0.0014177652,0.00023896225,0.00012219102,0.9483663,0.0041725826,0.044553902],"study_design_scores_gemma":[0.010944629,0.0025006242,0.42253637,0.00049683126,0.00004641149,0.00008612135,0.007670123,0.16439807,0.008378321,0.33888692,0.040593076,0.003462505],"about_ca_topic_score_codex":0.00007995637,"about_ca_topic_score_gemma":0.00026655948,"teacher_disagreement_score":0.83049655,"about_ca_system_score_codex":0.000041810057,"about_ca_system_score_gemma":0.000012403409,"threshold_uncertainty_score":0.5555935},"labels":[],"label_agreement":null},{"id":"W2135980655","doi":"10.1109/reconfig.2009.52","title":"Efficient Technique for the FPGA Implementation of the AES MixColumns Transformation","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Field-programmable gate array; Advanced Encryption Standard; Computer science; Block cipher; Embedded system; Encryption; Block (permutation group theory); Transformation (genetics); Cryptography; AES implementations; Authentication (law); Computer hardware; Computer architecture; Computer network; Computer security","score_opus":0.014942545246182777,"score_gpt":0.3072541126812447,"score_spread":0.2923115674350619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135980655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026944136,0.00001403655,0.96530193,0.006080799,0.000077417666,0.0012873664,0.000009614312,0.000027486141,0.0002572138],"genre_scores_gemma":[0.98773134,0.0000043001432,0.011794715,0.0003368462,0.000009336592,0.00011401455,0.0000024225565,0.0000014071602,0.000005626268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993775,0.000026235159,0.00022241128,0.00009172481,0.00016402586,0.00011812685],"domain_scores_gemma":[0.99951315,0.00006691324,0.00007549256,0.0002572279,0.00007440704,0.0000127962985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038019393,0.000054044533,0.000051866657,0.000046462766,0.00025520942,0.00004783111,0.00040004772,0.000017083034,0.0000201715],"category_scores_gemma":[0.0000040855316,0.000029434674,0.0000932766,0.0003234632,0.00002319877,0.000086436965,0.000020046447,0.000034950197,3.182219e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039630972,0.00007691784,0.00009801324,0.00001107798,0.000012119989,2.7498599e-8,0.005600093,0.00038424289,0.009201239,0.80761623,0.0010134684,0.17598261],"study_design_scores_gemma":[0.0018769308,0.00061206793,0.10072774,0.000021943511,0.000061371895,0.00001226529,0.0060170176,0.09444624,0.72139597,0.062800966,0.011683333,0.00034414415],"about_ca_topic_score_codex":0.00010105176,"about_ca_topic_score_gemma":0.00017603979,"teacher_disagreement_score":0.9607872,"about_ca_system_score_codex":0.00001350714,"about_ca_system_score_gemma":0.000033543874,"threshold_uncertainty_score":0.19628903},"labels":[],"label_agreement":null},{"id":"W2136090606","doi":"10.1109/fdtc.2007.2","title":"A Structure-independent Approach for Fault Detection Hardware Implementations of the Advanced Encryption Standard","year":2007,"lang":"en","type":"article","venue":"Workshop on Fault Diagnosis and Tolerance in Cryptography","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Encryption; Computer science; Cryptography; Probabilistic encryption; Overhead (engineering); Advanced Encryption Standard; Computer engineering; 40-bit encryption; Multiple encryption; Theoretical computer science; Algorithm; Embedded system; Computer network; Operating system","score_opus":0.018193091685571684,"score_gpt":0.30682384989887,"score_spread":0.2886307582132983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136090606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5177519,0.0002277842,0.4803836,0.00019342803,0.00025840686,0.0009854223,0.00010821787,0.00003193463,0.000059304755],"genre_scores_gemma":[0.95671576,0.00030780956,0.04223115,0.00023414692,0.000042518954,0.00043175236,0.000022962296,0.000013019458,8.8614854e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99785423,0.00007131242,0.0006143972,0.00055780774,0.00047471983,0.00042753082],"domain_scores_gemma":[0.9985881,0.00039528203,0.00027765875,0.00047280843,0.00018189508,0.00008426042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005490618,0.00024311924,0.000288167,0.00048562483,0.0003954291,0.00012338572,0.0004387127,0.00011428405,0.000010923505],"category_scores_gemma":[0.000055998556,0.0001965425,0.00023510505,0.0017021105,0.000109059416,0.0003489338,0.00008646807,0.0002505832,1.16469295e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036354148,0.00062559,0.12207157,0.0001585741,0.000098752214,0.0000020355008,0.005044837,0.0095419325,0.0022049139,0.07275142,0.0002660257,0.78687084],"study_design_scores_gemma":[0.013711705,0.0014201872,0.79535145,0.0007023655,0.00013689733,0.000018800569,0.010932478,0.029984195,0.07370828,0.054473262,0.017712127,0.0018482682],"about_ca_topic_score_codex":0.000056703255,"about_ca_topic_score_gemma":0.0016905674,"teacher_disagreement_score":0.78502256,"about_ca_system_score_codex":0.000053182663,"about_ca_system_score_gemma":0.000027485783,"threshold_uncertainty_score":0.801477},"labels":[],"label_agreement":null},{"id":"W2137153043","doi":"10.1109/iscas.2011.5937667","title":"Counteracting power analysis attack using Static Single-ended Logic","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Power analysis; Logic gate; Computer science; Static analysis; Pull-up resistor; Power (physics); Chip; Process (computing); Logic synthesis; Logic family; Battery (electricity); Differential (mechanical device); Electronic engineering; Reliability engineering; Engineering; Telecommunications; Computer security; Cryptography; Algorithm; Programming language","score_opus":0.17443173238521534,"score_gpt":0.3465002777736773,"score_spread":0.17206854538846197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137153043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3577383,0.000006327899,0.6360134,0.00004363532,0.000074575684,0.00005428957,0.0000017201952,0.0000682436,0.0059995595],"genre_scores_gemma":[0.8084546,7.845724e-7,0.1911693,0.00034238343,0.0000051452434,0.0000016565433,0.0000028305044,0.00000297645,0.000020337615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989643,0.00005422296,0.00026074453,0.00027377368,0.00020056983,0.0002463564],"domain_scores_gemma":[0.999279,0.00006813057,0.000114148905,0.00037449974,0.000101689424,0.000062506624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022474294,0.000102248756,0.0001455266,0.00031890764,0.00015809809,0.00016824472,0.00032998045,0.000023090717,0.0008915499],"category_scores_gemma":[0.000015715297,0.00008864959,0.00011887193,0.001356189,0.000026111447,0.00056535803,0.0001158264,0.00006614609,0.000015239285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005028106,0.0028838078,0.1577417,0.000067245455,0.003850902,0.00024295274,0.09578137,0.0020128363,0.008449467,0.7132556,0.0025949017,0.01306896],"study_design_scores_gemma":[0.0008849115,0.00032714172,0.032869082,0.000020718335,0.00044652884,0.000043508673,0.005711169,0.94136137,0.001896982,0.01420738,0.001301388,0.0009298208],"about_ca_topic_score_codex":0.00025259485,"about_ca_topic_score_gemma":0.00020371989,"teacher_disagreement_score":0.9393485,"about_ca_system_score_codex":0.000033167922,"about_ca_system_score_gemma":0.000023421266,"threshold_uncertainty_score":0.97618467},"labels":[],"label_agreement":null},{"id":"W2137764797","doi":"10.1109/ccece.1997.614856","title":"Construction of highly nonlinear injective S-boxes with application to CAST-like encryption algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Injective function; Encryption; Nonlinear system; Algorithm; Exponential function; Cryptanalysis; Computer science; Mathematics; Cryptography; Discrete mathematics; Mathematical analysis; Physics; Operating system","score_opus":0.011593046907241531,"score_gpt":0.24775150861456877,"score_spread":0.23615846170732724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137764797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13014366,0.00000944258,0.8680976,0.000397667,0.000071711234,0.00029090306,0.000008461843,0.00007468471,0.00090588874],"genre_scores_gemma":[0.6349194,0.000009303519,0.36488125,0.00010031367,0.000026576527,0.00003498323,0.000006156757,0.0000036154686,0.00001841398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991512,0.000024134446,0.00020005947,0.00026712773,0.00022219891,0.00013531248],"domain_scores_gemma":[0.9993404,0.000029016706,0.000088446766,0.00028753237,0.00019488874,0.000059710244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092876675,0.000089787,0.00010463492,0.00020047557,0.00009187574,0.000041415344,0.00019081018,0.000030808365,0.00004830365],"category_scores_gemma":[0.0000040968607,0.00007567112,0.00002955396,0.0008516034,0.000052595682,0.00031420612,0.000049722003,0.000052661548,0.000020335718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023487857,0.00036280666,0.0053247698,0.000024779038,0.00006442624,0.000002635233,0.006630741,0.0003050889,0.006638787,0.43770805,0.00053862954,0.5423758],"study_design_scores_gemma":[0.0032926179,0.0031253807,0.032587014,0.000059365713,0.00007462406,0.0002855409,0.0044323164,0.86064225,0.057107,0.015322524,0.021767702,0.001303648],"about_ca_topic_score_codex":0.00036625128,"about_ca_topic_score_gemma":0.00020251877,"teacher_disagreement_score":0.8603372,"about_ca_system_score_codex":0.000026405278,"about_ca_system_score_gemma":0.000014188598,"threshold_uncertainty_score":0.30857787},"labels":[],"label_agreement":null},{"id":"W2138047078","doi":"","title":"Design and Analysis of RC4-like Stream Ciphers","year":2005,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; University of Regina","keywords":"RC4; Computer science; Stream cipher; Cipher; S-box; Stream cipher attack; Simplicity; Cryptography; Arithmetic; Theoretical computer science; Block cipher; Computer engineering; Algorithm; Encryption; Computer security; Mathematics","score_opus":0.013185498797536508,"score_gpt":0.22742906314942493,"score_spread":0.21424356435188843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138047078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827075,0.00009076469,0.01650573,0.00016211416,0.00008655324,0.00018533095,0.000032097636,0.000032363798,0.00019756872],"genre_scores_gemma":[0.7843888,0.00083277345,0.1737571,0.000030645373,0.000017715969,9.791206e-7,0.0009187045,0.000021120833,0.04003219],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99901634,0.000070216665,0.00014559964,0.00033630128,0.0002601212,0.00017142532],"domain_scores_gemma":[0.99905705,0.000055509,0.0002929478,0.0003667916,0.00015636992,0.00007134602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017258302,0.0001558662,0.00040250688,0.0008910338,0.00013131117,0.00002826192,0.0004954705,0.00011333462,0.00010810329],"category_scores_gemma":[0.000002606584,0.00018420028,0.00019462299,0.0010548136,0.000069683054,0.00028761933,0.000076317774,0.00009953262,0.0000016697368],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025006317,0.00051069574,0.0066620824,0.0004160184,0.0064082425,0.000045998866,0.86780334,0.0023470006,0.003715888,0.019463792,0.0025217277,0.08985516],"study_design_scores_gemma":[0.0032381858,0.00093768205,0.28218248,0.00023692241,0.00872379,0.0000043793257,0.56751317,0.12910776,0.0033620098,0.0014294268,0.0013927068,0.001871493],"about_ca_topic_score_codex":0.012415318,"about_ca_topic_score_gemma":0.040778432,"teacher_disagreement_score":0.30029017,"about_ca_system_score_codex":0.000025029105,"about_ca_system_score_gemma":0.00006263928,"threshold_uncertainty_score":0.99416107},"labels":[],"label_agreement":null},{"id":"W2138068493","doi":"10.1109/iscas.2007.378275","title":"A New Compact Architecture for AES with Optimized ShiftRows Operation","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Architecture; Computer science; Computer architecture; Embedded system","score_opus":0.017006890225045132,"score_gpt":0.29210206082583845,"score_spread":0.2750951706007933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138068493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009112552,0.000014052794,0.98710585,0.002076046,0.00005254643,0.00036190145,0.000002064603,0.00009505632,0.0011799302],"genre_scores_gemma":[0.35389224,8.745828e-7,0.64561754,0.00035682306,0.00003709684,0.0000040427503,0.000008578961,0.0000033950043,0.00007941761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934846,0.0000110826195,0.00013612755,0.00018486982,0.00012101189,0.00019844522],"domain_scores_gemma":[0.9995471,0.00008585157,0.000032338656,0.00020420691,0.00004156128,0.000088937515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024221906,0.00008226818,0.000090909794,0.00010037776,0.00013211966,0.00017167715,0.00022533741,0.000020675081,0.000064248794],"category_scores_gemma":[0.0000051454167,0.000056406865,0.000044476878,0.0002316227,0.000012822719,0.00019836977,0.000019934332,0.000047512152,0.0000019368433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021058663,0.0000906407,0.0008064854,0.000011595403,0.000056502897,0.0000041278304,0.004222033,0.004137126,0.00078735384,0.8629234,0.009889421,0.116860755],"study_design_scores_gemma":[0.03928741,0.0056269765,0.050847758,0.000090301255,0.00013872112,0.00025452746,0.0025667923,0.4907706,0.041220777,0.13501644,0.23113902,0.003040682],"about_ca_topic_score_codex":0.00022369949,"about_ca_topic_score_gemma":0.0013661198,"teacher_disagreement_score":0.72790694,"about_ca_system_score_codex":0.000010642792,"about_ca_system_score_gemma":0.00005841682,"threshold_uncertainty_score":0.23002052},"labels":[],"label_agreement":null},{"id":"W2138306690","doi":"10.1109/newcas.2005.1496725","title":"The Rapid Prototyping SoC Co-design of a-Proprietary Key Agreement Protocol","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Institute of Standards and Technology; CMC Microsystems","keywords":"Key (lock); Flexibility (engineering); Computer science; Embedded system; Protocol (science); Key-agreement protocol; Architecture; Computer architecture; Rapid prototyping; Computer network; Operating system; Engineering; Public-key cryptography; Key distribution; Encryption","score_opus":0.039669661717723084,"score_gpt":0.32301463436073874,"score_spread":0.28334497264301567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138306690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023665739,0.00002634238,0.8987849,0.0026439207,0.000035042576,0.09351481,0.0000012544133,0.00007932335,0.0046778023],"genre_scores_gemma":[0.13061075,0.000047791444,0.5590853,0.0011660561,0.00018476175,0.30856156,0.0000044055814,0.000019141884,0.00032019976],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987661,0.00010837008,0.000353402,0.00020333736,0.00033027335,0.00023846573],"domain_scores_gemma":[0.9991796,0.00008701299,0.000117772004,0.00047507207,0.00009560198,0.000044957753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086826144,0.00009865943,0.00009495742,0.00005892396,0.00031657907,0.00011114237,0.0006305657,0.000024951389,0.00028425816],"category_scores_gemma":[0.000009892261,0.00006204466,0.00006434042,0.00026553372,0.0000736427,0.00027007688,0.00011401045,0.00008169553,0.000021735863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004563801,0.00024677522,0.00030375886,0.000043845295,0.00005707306,0.0000011649448,0.002320373,0.00008354236,0.0015443146,0.16489537,0.008692125,0.821766],"study_design_scores_gemma":[0.0026188549,0.00096057815,0.0031868503,0.000039377763,0.000011360411,0.000011008253,0.0005868518,0.11829772,0.057531185,0.0118630845,0.8044,0.00049310346],"about_ca_topic_score_codex":0.000021902571,"about_ca_topic_score_gemma":0.000018182578,"teacher_disagreement_score":0.8212729,"about_ca_system_score_codex":0.00001954181,"about_ca_system_score_gemma":0.000090473004,"threshold_uncertainty_score":0.31124276},"labels":[],"label_agreement":null},{"id":"W2138967433","doi":"10.1007/978-3-319-10683-0_4","title":"Another Look at Security Theorems for 1-Key Nested MACs","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Hash-based message authentication code; Hash function; Key (lock); Class (philosophy); Collision resistance; Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Computer security; Message authentication code; Cryptographic hash function; Cryptography; Perfect hash function","score_opus":0.02086627591059465,"score_gpt":0.255499653065209,"score_spread":0.23463337715461435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138967433","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052131956,0.0000976477,0.55191517,0.0005394765,0.0003984126,0.0007023533,0.00007264452,0.00021364084,0.4460085],"genre_scores_gemma":[0.021740241,0.00018784548,0.046234354,0.006527076,0.0007514753,0.00017420002,0.00041661182,0.00018379351,0.9237844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982433,0.000024567096,0.00040470497,0.00065187435,0.0003227836,0.0003528231],"domain_scores_gemma":[0.99832386,0.00020793432,0.00022235147,0.0009770021,0.00017186826,0.000096959186],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003743012,0.00036481235,0.0003680511,0.00020496732,0.0002473847,0.00017568063,0.00085274293,0.00025658903,0.0016956257],"category_scores_gemma":[0.000008837048,0.0003129687,0.00032473254,0.0000602012,0.000116672316,0.000116901065,0.0003620771,0.00016340073,0.00014198749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000768951,0.000011461086,0.000015067243,0.000030637344,0.000043827367,0.0000018657332,0.00036881026,4.0706945e-7,0.000010165013,0.9697937,0.024314456,0.0054019275],"study_design_scores_gemma":[0.00036851573,0.00007686207,0.000010085552,0.000017355354,0.000020167732,0.0000091838765,0.0000054569496,0.001674454,0.000058231795,0.3704204,0.6270172,0.00032209678],"about_ca_topic_score_codex":0.000034891153,"about_ca_topic_score_gemma":0.00052990345,"teacher_disagreement_score":0.60270274,"about_ca_system_score_codex":0.00006497425,"about_ca_system_score_gemma":0.00005799413,"threshold_uncertainty_score":0.9999322},"labels":[],"label_agreement":null},{"id":"W2139068744","doi":"10.1109/iccd.2007.4601926","title":"Detecting errors in a polynomial basis multiplier using multiple parity bits for both inputs","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parity bit; Multiplier (economics); Parity (physics); Binary number; Computer science; Arithmetic; Error detection and correction; Algorithm; Mathematics; Discrete mathematics","score_opus":0.04576338761217491,"score_gpt":0.32316854958422014,"score_spread":0.27740516197204523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139068744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49220476,0.000006736084,0.50720745,0.00006437378,0.00014604274,0.00023520328,0.0000031568538,0.000049721744,0.000082555365],"genre_scores_gemma":[0.7259466,7.0412585e-7,0.27379063,0.00019655691,0.00004204636,0.00001060779,0.0000017185081,0.000006551024,0.000004546801],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985505,0.000031841555,0.00038956627,0.0003698264,0.00016301591,0.0004952715],"domain_scores_gemma":[0.9991371,0.00035367705,0.00009038812,0.00026983162,0.000054918837,0.00009408655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029225,0.00013361181,0.00015524197,0.00037919855,0.0002522449,0.000099663375,0.00031335285,0.00007077192,0.000014198225],"category_scores_gemma":[0.00012790553,0.00013223437,0.00009483654,0.0007482294,0.00002870543,0.00037774275,0.00015774104,0.000118238706,0.0000012933355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015179058,0.00061993214,0.62742454,0.00007125429,0.00005986227,0.000025104457,0.010836106,0.0006438552,0.030385397,0.0064600967,0.00028677104,0.3230353],"study_design_scores_gemma":[0.0035263482,0.0001036285,0.10408427,0.00002361091,0.000009924527,0.000014247861,0.0007190051,0.8612164,0.027140953,0.0005523284,0.0020904872,0.000518787],"about_ca_topic_score_codex":0.001726323,"about_ca_topic_score_gemma":0.014789741,"teacher_disagreement_score":0.8605726,"about_ca_system_score_codex":0.00007755777,"about_ca_system_score_gemma":0.00005370131,"threshold_uncertainty_score":0.82530224},"labels":[],"label_agreement":null},{"id":"W2139378575","doi":"10.1109/tcsi.2007.910539","title":"Design and Performance Analysis of a Unified, Reconfigurable HMAC-Hash Unit","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash-based message authentication code; Hash function; SHA-2; MD5; Cryptographic hash function; Computer science; Secure Hash Algorithm; Hash chain; Message authentication code; Double hashing; MDC-2; Theoretical computer science; Algorithm; Cryptography; Programming language","score_opus":0.033555437594296585,"score_gpt":0.25324066615596286,"score_spread":0.21968522856166628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139378575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25441745,0.00015696204,0.74423665,0.00003109845,0.00016385349,0.00023264199,0.000008639104,0.000035446308,0.0007172786],"genre_scores_gemma":[0.9988964,0.0002799504,0.00060222956,0.000037264657,0.0000069295925,0.000014128008,0.0000019737336,0.000007012461,0.00015409393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868447,0.00010295634,0.00039055455,0.0003278531,0.00024828734,0.0002458995],"domain_scores_gemma":[0.99909276,0.00018324009,0.00011926736,0.0003630407,0.00009147234,0.0001502138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010166644,0.00014562879,0.00029976212,0.0006688917,0.00030385563,0.000103756756,0.00017912005,0.00007574485,0.000019391473],"category_scores_gemma":[0.000002407727,0.00013486689,0.000085849264,0.0013626516,0.00008897224,0.00021294325,0.000001253354,0.00010920514,8.1637927e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106400075,0.0005295652,0.0033937192,0.0005632315,0.0043388074,0.000036733167,0.013263174,0.0661271,0.0552613,0.038771205,0.000072633906,0.8175361],"study_design_scores_gemma":[0.005238953,0.00258787,0.053979144,0.0004934932,0.0027633507,0.0003564845,0.008782212,0.8676187,0.047655635,0.0003523862,0.007914179,0.002257634],"about_ca_topic_score_codex":0.00015867494,"about_ca_topic_score_gemma":0.00009362175,"teacher_disagreement_score":0.8152785,"about_ca_system_score_codex":0.000018979135,"about_ca_system_score_gemma":0.000041929754,"threshold_uncertainty_score":0.5499712},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025847684352063357,"score_gpt":0.29469360843677334,"score_spread":0.26884592408471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140223745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016990852,0.000047038746,0.9788578,0.000719919,0.00012500239,0.0001281193,0.0000091627,0.000067599656,0.0030545206],"genre_scores_gemma":[0.8218063,0.000033030366,0.17783213,0.00020311738,0.000019095456,0.000009961506,0.000005169373,0.0000028413035,0.00008831555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993053,0.00002030541,0.00021090097,0.00014539831,0.00017954787,0.00013854261],"domain_scores_gemma":[0.999584,0.000022736742,0.00006020343,0.0002374668,0.000058879483,0.000036669073],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010756668,0.000057062673,0.000072473755,0.00010693757,0.000065133645,0.0000451567,0.00025539318,0.000015095023,0.0017226785],"category_scores_gemma":[0.0000017695484,0.000052460455,0.000047437617,0.0003827308,0.000019966,0.00028873127,0.000072899784,0.000030059387,0.000024998144],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.11705745e-7,0.000051013572,0.0008792975,0.0000033605745,0.000011053128,0.0000010285446,0.0012151267,7.94854e-7,0.00014239529,0.07256804,0.006217981,0.9189098],"study_design_scores_gemma":[0.009345123,0.0016587008,0.14943683,0.000032299893,0.000081818696,0.00009845828,0.010862956,0.41290107,0.16584249,0.08383875,0.16393365,0.0019678439],"about_ca_topic_score_codex":0.0002597746,"about_ca_topic_score_gemma":0.000114686896,"teacher_disagreement_score":0.91694194,"about_ca_system_score_codex":0.000008577125,"about_ca_system_score_gemma":0.0000080328655,"threshold_uncertainty_score":0.99918985},"labels":[],"label_agreement":null},{"id":"W2140361451","doi":"10.1109/ccece.2007.287","title":"Compact Hardware Implementation of the Block Cipher Camellia with Concurrent Error Detection","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Embedded system; Field-programmable gate array; Datapath; Encryption; Block cipher; Computer hardware; Cryptography; Virtex; Application-specific integrated circuit; Hardware architecture; Cipher; Error detection and correction; Software; Computer network; Algorithm","score_opus":0.019414336869355654,"score_gpt":0.31164421296543593,"score_spread":0.29222987609608025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140361451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58034897,0.000012328199,0.41854212,0.0002192743,0.00019567212,0.0002506038,0.000005163601,0.000036158628,0.000389737],"genre_scores_gemma":[0.99837416,0.0000015575596,0.0014795428,0.000095662224,0.000016552052,0.000003305404,0.0000021960466,0.0000037390932,0.000023295619],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991054,0.000032710268,0.00023658236,0.00016234403,0.00027824595,0.0001847509],"domain_scores_gemma":[0.9993923,0.000035316807,0.00013445439,0.00027688706,0.000117471354,0.00004362585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002610202,0.000086240005,0.00008463928,0.00006991801,0.00014602116,0.000041621384,0.00027272076,0.000018621002,0.00009522843],"category_scores_gemma":[0.0000023552304,0.00005309847,0.000057467918,0.00053818064,0.00004709979,0.0001698138,0.000048452057,0.00006916915,0.0000022699278],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053656706,0.00048481917,0.44626507,0.00009182166,0.00026721446,0.000006786273,0.013782542,0.00029196328,0.020524321,0.17144342,0.003737913,0.34305048],"study_design_scores_gemma":[0.0016401946,0.00038161685,0.81044865,0.000019332352,0.000034975186,0.000027407546,0.004944572,0.0030560486,0.16985722,0.00039800166,0.0089147575,0.00027721096],"about_ca_topic_score_codex":0.00072139956,"about_ca_topic_score_gemma":0.009548432,"teacher_disagreement_score":0.4180252,"about_ca_system_score_codex":0.000031921667,"about_ca_system_score_gemma":0.00004070569,"threshold_uncertainty_score":0.53282493},"labels":[],"label_agreement":null},{"id":"W2141133316","doi":"10.1109/ccece.2005.1557214","title":"Single-chip FPGA implementation of a pipelined, memory-based AES Rijndael encryption design","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Advanced Encryption Standard; Computer science; Encryption; AES implementations; Field-programmable gate array; Datapath; Embedded system; Byte; Lookup table; Pipeline (software); Cryptography; Computer hardware; Parallel computing; Algorithm; Operating system","score_opus":0.031715772680205936,"score_gpt":0.2824841343408843,"score_spread":0.2507683616606784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141133316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09833731,0.000026675945,0.9000482,0.00045518292,0.00010295097,0.00032207367,0.000008760323,0.00011698724,0.0005818912],"genre_scores_gemma":[0.78461677,0.0000017265548,0.21511489,0.00015025478,0.00003580927,0.000023049253,0.00003445969,0.000005784092,0.000017226665],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998536,0.00011339629,0.00048085084,0.0002865787,0.00033890086,0.00024428774],"domain_scores_gemma":[0.9991413,0.00012309526,0.00019014883,0.00033982986,0.00016248657,0.00004314054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045492445,0.000136095,0.0001435321,0.00028235902,0.00012623478,0.0001022203,0.00031358982,0.000038687707,0.00024399367],"category_scores_gemma":[0.000008780852,0.00012758789,0.00009563053,0.0006137038,0.000045551362,0.0003780873,0.000047710324,0.000050746818,0.000009086162],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075814634,0.0015653921,0.010063275,0.00012146162,0.00006491773,0.000012723915,0.0024357322,0.004588603,0.18979181,0.34818092,0.013850619,0.42924875],"study_design_scores_gemma":[0.0043905484,0.0008434876,0.027977757,0.000025465111,0.000051377596,0.0000106155985,0.001358742,0.08177276,0.8321641,0.048870485,0.0018542061,0.0006804594],"about_ca_topic_score_codex":0.001660925,"about_ca_topic_score_gemma":0.0007927287,"teacher_disagreement_score":0.6862795,"about_ca_system_score_codex":0.00003614868,"about_ca_system_score_gemma":0.00009551774,"threshold_uncertainty_score":0.5202883},"labels":[],"label_agreement":null},{"id":"W2141418867","doi":"10.1109/mwscas.2007.4488793","title":"Analysis of current-to-data dependency in asynchronous cryptographic circuits","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Asynchronous communication; Asynchronous circuit; Computer science; Dependency (UML); Cryptography; Encryption; Spice; Waveform; CMOS; Electronic engineering; Logic gate; Electronic circuit; Embedded system; Computer engineering; Electrical engineering; Algorithm; Synchronous circuit; Clock signal; Computer network; Engineering; Telecommunications","score_opus":0.07463541377105161,"score_gpt":0.3486442241896844,"score_spread":0.2740088104186328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141418867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46933344,0.000108723405,0.52925825,0.000080650156,0.00009858068,0.00019872417,0.000018406225,0.000048960897,0.0008542688],"genre_scores_gemma":[0.9946322,0.00005926618,0.005201833,0.000050044546,0.000015196008,0.000011985685,0.000022761391,0.0000054115744,0.0000012914467],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978698,0.000009762011,0.00057460024,0.00066182663,0.00042853857,0.0004555087],"domain_scores_gemma":[0.99863136,0.000060015573,0.00019086828,0.0005300431,0.00042264815,0.00016508964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210239,0.00016516028,0.00033517712,0.00226363,0.00007576518,0.00015553017,0.0020429462,0.00005937526,0.00007194102],"category_scores_gemma":[0.00011219651,0.00017258782,0.00009073306,0.007316514,0.000063284744,0.0007653376,0.0005719783,0.00019093181,0.000005627647],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060104253,0.00023210383,0.5609167,0.00005566037,0.00013348501,0.000004828994,0.006692817,0.0000017530771,0.0015947677,0.22709085,0.000082091516,0.2031889],"study_design_scores_gemma":[0.00053139194,0.00012808685,0.9490583,0.00008371759,0.00018566406,0.000005763194,0.00090161414,0.03633255,0.00064947474,0.010748025,0.00089841086,0.00047702945],"about_ca_topic_score_codex":0.00012521836,"about_ca_topic_score_gemma":0.000764937,"teacher_disagreement_score":0.5252988,"about_ca_system_score_codex":0.000029092713,"about_ca_system_score_gemma":0.0001198747,"threshold_uncertainty_score":0.7037927},"labels":[],"label_agreement":null},{"id":"W2141775271","doi":"","title":"Countermeasures for Hardware Fault Attack in Multi-Prime RSA Cryptosystems","year":2008,"lang":"en","type":"article","venue":"International journal of network security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Cryptosystem; Prime (order theory); Field-programmable gate array; Countermeasure; Embedded system; Cryptography; Reconfigurable computing; Simple (philosophy); Prime number; Computer hardware; Computer security; Computer engineering; Mathematics","score_opus":0.06838314339513929,"score_gpt":0.3435589919501349,"score_spread":0.2751758485549956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141775271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37795454,0.00084463856,0.6159065,0.0010985145,0.0036180005,0.00032424595,0.000046611767,0.000034327473,0.00017264238],"genre_scores_gemma":[0.98105454,0.00021149337,0.017680725,0.00029119602,0.00071806053,0.000012460515,0.0000102503445,0.0000094368,0.000011845356],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978404,0.00011136254,0.0008190725,0.00022049357,0.00070844265,0.00030024126],"domain_scores_gemma":[0.9979128,0.00019934528,0.00051974226,0.000205126,0.0010582767,0.000104697094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086984603,0.00015686867,0.0002878047,0.0002716595,0.00013231508,0.0001354538,0.0012963263,0.000074105665,0.000023941078],"category_scores_gemma":[0.00010331274,0.00014646917,0.00025052912,0.00029143627,0.00005889983,0.00068199233,0.00013177308,0.000265447,0.0000036350352],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015174552,0.0045920364,0.57609224,0.00017629628,0.002271212,0.0027957475,0.04616805,0.037859958,0.0011311279,0.11606857,0.1744614,0.036865897],"study_design_scores_gemma":[0.01750297,0.0009531715,0.22067615,0.0008702602,0.000056647797,0.0037431787,0.0007494116,0.42747235,0.0005980952,0.024445698,0.30155715,0.0013749042],"about_ca_topic_score_codex":0.00006914432,"about_ca_topic_score_gemma":0.00035938574,"teacher_disagreement_score":0.6031,"about_ca_system_score_codex":0.00014263358,"about_ca_system_score_gemma":0.0001722926,"threshold_uncertainty_score":0.59728396},"labels":[],"label_agreement":null},{"id":"W2141866281","doi":"10.1109/iih-msp.2008.26","title":"A Middleware Design for Block Cipher Seamless Connected into Stream Cipher Mode","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Block cipher mode of operation; Stream cipher; Computer science; CBC-MAC; Block cipher; Triple DES; Cipher; Block size; Transposition cipher; Running key cipher; Affine cipher; Algorithm; Parallel computing; Embedded system; Cryptography; Computer network; Computer security; Key (lock); Encryption","score_opus":0.058880321668750596,"score_gpt":0.30281668377239873,"score_spread":0.24393636210364814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141866281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.126447,0.00004594926,0.8717542,0.00039674784,0.00012182012,0.00052466325,0.000009966628,0.00022393085,0.00047566745],"genre_scores_gemma":[0.7348637,0.000011926438,0.2643354,0.0003413016,0.000035678164,0.00011965898,0.000011582061,0.000010609921,0.00027018404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872947,0.000061635605,0.00025443858,0.00039784,0.00021613203,0.0003404657],"domain_scores_gemma":[0.9989589,0.00018613135,0.000060447106,0.00046014684,0.00021621493,0.0001181911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014303974,0.00016267497,0.00017081469,0.00010842223,0.00037545853,0.000085042004,0.0005128369,0.00006311871,0.000120734716],"category_scores_gemma":[0.000024737097,0.00014383551,0.00010597284,0.0004978393,0.000054618893,0.00028870537,0.00011160861,0.00006775944,0.000012742685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022423091,0.0022382094,0.008690966,0.00019803994,0.0005855373,0.000108554545,0.052418113,0.0068644853,0.0062352456,0.718235,0.15289427,0.051307358],"study_design_scores_gemma":[0.0057959636,0.0009312382,0.003361537,0.000045058903,0.00005361353,0.00011924109,0.0017763977,0.8796622,0.017845133,0.06733452,0.021565868,0.0015092203],"about_ca_topic_score_codex":0.00039611498,"about_ca_topic_score_gemma":0.0004574647,"teacher_disagreement_score":0.8727977,"about_ca_system_score_codex":0.000030835607,"about_ca_system_score_gemma":0.000115609975,"threshold_uncertainty_score":0.5865442},"labels":[],"label_agreement":null},{"id":"W2142671722","doi":"10.1109/dsd.2008.127","title":"VLSI Implementation of a Cryptography-Oriented Reconfigurable Array","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Field-programmable gate array; Cryptography; Overhead (engineering); Very-large-scale integration; Word (group theory); Application-specific integrated circuit; Embedded system; Subtraction; Path (computing); Computer hardware; Computer architecture; Parallel computing; Arithmetic; Algorithm; Computer network; Operating system; Mathematics","score_opus":0.020169605364650952,"score_gpt":0.2816030478884978,"score_spread":0.26143344252384687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142671722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35163018,0.000030831234,0.64054716,0.00027501254,0.00015284854,0.00019587338,0.0000079561305,0.000100349294,0.0070597916],"genre_scores_gemma":[0.92239076,0.0000613571,0.07732289,0.00014355178,0.000014016526,0.000022159682,0.000013571463,0.000004340036,0.000027330403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988746,0.000041237025,0.0003618485,0.00024340831,0.00025055945,0.00022834577],"domain_scores_gemma":[0.9992408,0.000038919814,0.00012669092,0.000370869,0.00015538713,0.00006729531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001729845,0.00010014497,0.00013742459,0.0002726489,0.00018260143,0.000022241024,0.00030416757,0.00002645507,0.0006033047],"category_scores_gemma":[0.0000052107034,0.00009281956,0.00011096458,0.001027339,0.00006179401,0.00043050307,0.000026147716,0.000055379725,0.00000955675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000785531,0.00021982854,0.07286028,0.000025380412,0.000083517436,0.000006730388,0.006821332,0.0000041670087,0.025268167,0.8621433,0.006617899,0.025941564],"study_design_scores_gemma":[0.0052617393,0.0010582013,0.33962014,0.000027295728,0.0000492495,0.00016904117,0.007724344,0.001011447,0.5474207,0.032743778,0.063798234,0.0011158469],"about_ca_topic_score_codex":0.00064971676,"about_ca_topic_score_gemma":0.0002158657,"teacher_disagreement_score":0.8293995,"about_ca_system_score_codex":0.000010590421,"about_ca_system_score_gemma":0.00006820557,"threshold_uncertainty_score":0.66057634},"labels":[],"label_agreement":null},{"id":"W2143587975","doi":"10.1109/ccece.2007.288","title":"Hardware Design and Analysis of Statistical Cipher Feedback Mode Using Serial Transfer","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Block cipher mode of operation; Stream cipher; Cipher; Computer science; CBC-MAC; Transposition cipher; Block cipher; Running key cipher; Triple DES; Ciphertext; Plaintext; Advanced Encryption Standard; Encryption; Embedded system; Computer hardware; Parallel computing; Algorithm; Cryptography; Computer network; Computer security","score_opus":0.04284713227784053,"score_gpt":0.32724354810445444,"score_spread":0.2843964158266139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143587975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24416903,0.0000067175265,0.755601,0.00001748864,0.00002966018,0.000067124754,0.000016237978,0.000014697067,0.00007806882],"genre_scores_gemma":[0.62482464,0.0000021519556,0.37512442,0.000032759264,0.0000057165275,5.314739e-7,0.0000046763134,0.0000017388537,0.0000033854667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992436,0.000040575513,0.0002206595,0.00017835155,0.00015890489,0.00015786967],"domain_scores_gemma":[0.9995846,0.00012313489,0.000016559281,0.00015258921,0.000058126076,0.0000650004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003522568,0.00006571236,0.00015214254,0.00020743138,0.00006141376,0.000050408205,0.000120381475,0.000027804947,0.0001875543],"category_scores_gemma":[0.0000055141045,0.0000577543,0.000048299695,0.0007846783,0.000046055222,0.00015013303,0.000029556357,0.00003368716,3.4468874e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012542144,0.00024466842,0.0140572265,0.000031459356,0.0010955227,0.00002031984,0.0067930184,0.0095940605,0.0146468105,0.9174,0.00022390677,0.035767592],"study_design_scores_gemma":[0.0004984931,0.000068008325,0.03197276,0.0000025607942,0.00026615843,0.0000027863855,0.00019316343,0.9609987,0.00281743,0.0029622475,0.00006755411,0.00015013732],"about_ca_topic_score_codex":0.00030560038,"about_ca_topic_score_gemma":0.00029529253,"teacher_disagreement_score":0.95140463,"about_ca_system_score_codex":0.000008947768,"about_ca_system_score_gemma":0.000023179431,"threshold_uncertainty_score":0.23551519},"labels":[],"label_agreement":null},{"id":"W2143935127","doi":"10.1109/iwsoc.2005.37","title":"An area-efficient high-speed AES S-box method","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"S-box; Advanced Encryption Standard; Computer science; Logic gate; Limiting; Logic synthesis; Encryption; Algorithm; Computer hardware; Arithmetic; Cryptography; Mathematics; Block cipher; Engineering; Operating system","score_opus":0.02424909070363252,"score_gpt":0.3324020872348264,"score_spread":0.3081529965311939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143935127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12242808,0.000019265002,0.8732937,0.0019282446,0.00011984364,0.00010500151,0.0000032173837,0.000204288,0.0018983854],"genre_scores_gemma":[0.5740559,0.0000024268115,0.4253129,0.00052792195,0.000039640643,0.0000034935188,0.0000041211174,0.0000028335887,0.000050734456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893874,0.00006772858,0.00019656855,0.0003174793,0.00023427072,0.00024523173],"domain_scores_gemma":[0.9991976,0.000055604614,0.000041654075,0.0005264858,0.00006726682,0.000111374764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039045335,0.00010077403,0.00010400993,0.00014466453,0.00016146038,0.00019150147,0.000544574,0.000028983131,0.00046511917],"category_scores_gemma":[0.000006062348,0.00008296401,0.000054008215,0.00044602278,0.000021092128,0.00029866438,0.000094779774,0.000064280524,0.000042313797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021650812,0.00027859132,0.00021686024,0.000001792011,0.000010852111,0.000002474864,0.0015693519,0.0029361926,0.002048727,0.84734744,0.0015864338,0.14399914],"study_design_scores_gemma":[0.00070444023,0.00016597303,0.0065591712,0.0000034147897,0.000009546388,0.00001803256,0.00036592592,0.93828213,0.014111557,0.0063091842,0.033109557,0.000361057],"about_ca_topic_score_codex":0.000243315,"about_ca_topic_score_gemma":0.00021999444,"teacher_disagreement_score":0.93534595,"about_ca_system_score_codex":0.000021906288,"about_ca_system_score_gemma":0.000027622744,"threshold_uncertainty_score":0.5092729},"labels":[],"label_agreement":null},{"id":"W2145405868","doi":"10.1109/iscas.2005.1464618","title":"An Integrated Current Flattening Module for Embedded Cryptosystems","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Cryptosystem; Flattening; Cryptography; Computer science; Embedded system; Current (fluid); Power consumption; Side channel attack; Power (physics); Power analysis; Power demand; CMOS; Chip; Computer hardware; Electrical engineering; Engineering; Computer security; Telecommunications","score_opus":0.02878085210972076,"score_gpt":0.3323697781316712,"score_spread":0.3035889260219504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145405868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05389783,0.00005267979,0.94447386,0.00052039814,0.00025300012,0.0002832118,0.000008065062,0.00022033227,0.00029060795],"genre_scores_gemma":[0.7528559,0.000004011436,0.24676782,0.00019418188,0.00006963701,0.00005694603,0.000027154956,0.000005279714,0.000019061657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907243,0.0000471217,0.00023604858,0.00027855515,0.00013900665,0.00022684789],"domain_scores_gemma":[0.9993389,0.00004296659,0.000052680167,0.0003509752,0.00012841771,0.00008606379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034001254,0.00010196513,0.000106821506,0.00012515331,0.00014175949,0.00024368775,0.00041001936,0.000023456667,0.000044062883],"category_scores_gemma":[0.000009444118,0.00008471839,0.000066237735,0.00029730826,0.000011851013,0.0007308043,0.000043125823,0.00007082189,0.0000116787405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044773865,0.00017150734,0.00041767018,0.000012975648,0.000013308486,2.8193875e-7,0.0019717703,0.0004121847,0.001116851,0.6318707,0.0032735225,0.36073476],"study_design_scores_gemma":[0.00059866696,0.00010498281,0.00048453567,0.000011496418,0.000004344967,0.0000040700443,0.0003048301,0.89007336,0.0015319926,0.0028191057,0.10386877,0.00019385066],"about_ca_topic_score_codex":0.00003802661,"about_ca_topic_score_gemma":0.00024879415,"teacher_disagreement_score":0.8896612,"about_ca_system_score_codex":0.000023557886,"about_ca_system_score_gemma":0.000045518234,"threshold_uncertainty_score":0.34547156},"labels":[],"label_agreement":null},{"id":"W2145570103","doi":"10.1007/11958239_15","title":"Discrete Logarithm Variants of VSH","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Hash function; Modular exponentiation; Computer science; Discrete logarithm; Logarithm; Exponentiation; Reduction (mathematics); Modular design; Algorithm; Arithmetic; Mathematics; Public-key cryptography; Computer network; Computer security; Mathematical analysis; Programming language","score_opus":0.014664099660678966,"score_gpt":0.26036152858252837,"score_spread":0.2456974289218494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145570103","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001222793,0.00018107748,0.9924702,0.0003398359,0.00094055606,0.00027141592,0.000025733825,0.00006864915,0.0055802343],"genre_scores_gemma":[0.40017906,0.000038931445,0.59865904,0.00054728665,0.0002864301,0.0000074887766,0.000022268552,0.000028385233,0.000231142],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969324,0.000027175613,0.0006128901,0.0010393189,0.0008829954,0.0005052274],"domain_scores_gemma":[0.9978794,0.00025524004,0.00033884693,0.0011990744,0.00022812387,0.00009933231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006561306,0.00036693664,0.00045946048,0.00091324403,0.00018676271,0.000270305,0.00246152,0.00019846899,0.0000384474],"category_scores_gemma":[0.000027476435,0.00033659287,0.00015726025,0.0007789895,0.00067960896,0.00045251037,0.0010200668,0.00044617028,0.000008306258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006151789,0.00009128959,0.00045415817,0.000082122024,0.00003080658,0.00011284468,0.001064611,0.010299351,0.00021795848,0.37024114,0.00024962658,0.61714995],"study_design_scores_gemma":[0.00063842675,0.0002983858,0.0032082878,0.00032373116,0.000019390849,0.00007761447,3.095002e-7,0.3640539,0.00093146047,0.62583095,0.0036369853,0.0009805778],"about_ca_topic_score_codex":0.0001654385,"about_ca_topic_score_gemma":0.00023441465,"teacher_disagreement_score":0.6161694,"about_ca_system_score_codex":0.00009630389,"about_ca_system_score_gemma":0.00035348808,"threshold_uncertainty_score":0.9999086},"labels":[],"label_agreement":null},{"id":"W2146675862","doi":"10.1145/1873548.1873552","title":"A new correlation frequency analysis of the side channel","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Power analysis; Side channel attack; Cryptography; Exploit; Embedded system; Frequency domain; Software; Key (lock); Computer engineering; Computer security; Operating system","score_opus":0.011934850540956981,"score_gpt":0.2590146431163151,"score_spread":0.24707979257535814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146675862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12679672,0.0000043359414,0.8700515,0.0008470216,0.00025159458,0.0000574826,0.0000017017635,0.00003365182,0.00195597],"genre_scores_gemma":[0.96448004,8.955431e-7,0.035323057,0.00010552283,0.000011724483,0.0000015482115,0.0000016767384,0.0000012726487,0.000074273165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99954945,0.0000143194175,0.00013154441,0.00010124063,0.0001325888,0.00007087679],"domain_scores_gemma":[0.9994545,0.000036536905,0.000063117615,0.00037068478,0.000046520203,0.000028641403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011371308,0.000036732217,0.00006378625,0.00014698815,0.00006511947,0.00002909436,0.0003461501,0.00002115958,0.0001154627],"category_scores_gemma":[0.000016841439,0.000023890207,0.000104200466,0.0016797686,0.00001554945,0.000139563,0.00006284294,0.00006711689,0.0000025563243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.01497e-7,0.000019212548,0.03415785,8.1980585e-7,0.000089348265,1.3278358e-7,0.0012806434,0.00015242692,0.002080508,0.95408976,0.00044040737,0.0076885712],"study_design_scores_gemma":[0.00017671903,0.00001747989,0.68701,0.0000013633636,0.00013717884,0.000001378843,0.00007891795,0.24592213,0.0011688595,0.0649742,0.0004179479,0.00009381835],"about_ca_topic_score_codex":0.0013800598,"about_ca_topic_score_gemma":0.007831405,"teacher_disagreement_score":0.8891156,"about_ca_system_score_codex":0.000002727118,"about_ca_system_score_gemma":0.000040074894,"threshold_uncertainty_score":0.4370108},"labels":[],"label_agreement":null},{"id":"W2146770903","doi":"10.1109/dftvs.2005.24","title":"Concurrent error detection of polynomial basis multiplication over extension fields using a multiple-bit parity scheme","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parity bit; Computer science; Cryptosystem; Parity (physics); Cryptography; Error detection and correction; Arithmetic; Finite field; Overhead (engineering); Normal basis; Algorithm; Theoretical computer science; Binary number; Mathematics; Discrete mathematics; Galois theory","score_opus":0.0365903058726016,"score_gpt":0.30470540075266184,"score_spread":0.26811509488006025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146770903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5072366,0.00002055785,0.4923359,0.000058136226,0.00013867325,0.00013386953,0.0000038094254,0.000042285665,0.00003015977],"genre_scores_gemma":[0.96718866,0.00000373763,0.032666724,0.000051009014,0.000058225993,0.000011384594,0.000009156513,0.0000045203883,0.0000065612116],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988924,0.000046051053,0.00035594378,0.0003073685,0.00021571753,0.00018246354],"domain_scores_gemma":[0.999238,0.00007690854,0.00015935046,0.00034742168,0.00013695327,0.000041376294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001834667,0.000110902765,0.00013593378,0.00014936994,0.00015771127,0.00005171866,0.000187806,0.00007590938,0.000032937132],"category_scores_gemma":[0.000027018874,0.00010621399,0.00010189051,0.00038872482,0.000040890136,0.00032923007,0.00011376753,0.000091056754,0.0000019779648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046816633,0.0009940313,0.09139454,0.00007664823,0.000049030252,0.0000028793447,0.000926603,0.00076809555,0.69419444,0.016935112,0.0009493719,0.19366246],"study_design_scores_gemma":[0.00094792625,0.00005187469,0.10603746,0.000010281754,0.000010500287,0.0000050728845,0.000042036612,0.82707375,0.06477564,0.00026267025,0.00061919476,0.00016357655],"about_ca_topic_score_codex":0.004921532,"about_ca_topic_score_gemma":0.0018282343,"teacher_disagreement_score":0.8263057,"about_ca_system_score_codex":0.000042330317,"about_ca_system_score_gemma":0.000030432502,"threshold_uncertainty_score":0.7439916},"labels":[],"label_agreement":null},{"id":"W2147630539","doi":"10.1109/spsc.2008.4686705","title":"SEU-resistant SHA-256 design for security in satellites","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Redundancy (engineering); Hash function; Cryptography; Triple modular redundancy; Embedded system; Field-programmable gate array; Modular design; Energy consumption; Computer security; Engineering; Operating system; Electrical engineering","score_opus":0.05779596618045723,"score_gpt":0.29151612250788667,"score_spread":0.23372015632742943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147630539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1480699,0.00011349875,0.8499317,0.00050958595,0.000084074985,0.00043473297,0.0000073353367,0.00009758632,0.0007515988],"genre_scores_gemma":[0.80396634,0.000055421926,0.19562049,0.00023713203,0.000016403752,0.000053116233,0.0000044931785,0.000004075157,0.000042539035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989956,0.00005260211,0.00024451438,0.0002796236,0.00015082672,0.00027680193],"domain_scores_gemma":[0.99932975,0.00022852235,0.000037962593,0.00028397216,0.000060302726,0.00005948188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003727204,0.00009850032,0.00012298646,0.0001551535,0.00016390128,0.00006017375,0.00037519037,0.00003496509,0.000050321396],"category_scores_gemma":[0.000025211368,0.000088007255,0.00006700336,0.00048606456,0.000039032948,0.0002809849,0.000070149086,0.000058343823,0.00000735954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006661771,0.0004493,0.009439145,0.00004129673,0.000027780121,0.000051580566,0.0110597955,0.00009604871,0.00222664,0.9560838,0.008963461,0.011494583],"study_design_scores_gemma":[0.0049888184,0.00097496976,0.074692376,0.000038172297,0.000013871594,0.000084936306,0.00091878534,0.306047,0.022007653,0.5297296,0.059096836,0.0014069652],"about_ca_topic_score_codex":0.00015550028,"about_ca_topic_score_gemma":0.0002793015,"teacher_disagreement_score":0.6558964,"about_ca_system_score_codex":0.000024232662,"about_ca_system_score_gemma":0.00006551362,"threshold_uncertainty_score":0.35888317},"labels":[],"label_agreement":null},{"id":"W2148435351","doi":"10.1145/1176254.1176279","title":"Methodology for attack on a Java-based PDA","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Java; Cryptography; Wireless; Robustness (evolution); Computer security; Key (lock); Telecommunications; Programming language","score_opus":0.18291197336741813,"score_gpt":0.4027462060238065,"score_spread":0.21983423265638838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148435351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02198851,0.0000071286477,0.97247374,0.0022269154,0.00014524159,0.0001767793,0.000005063525,0.00008646777,0.0028901722],"genre_scores_gemma":[0.36502504,2.906804e-7,0.6330831,0.0016400286,0.000042067775,0.00004465729,0.000011328989,0.0000032102894,0.00015025119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935263,0.000059416936,0.00013370486,0.0002000563,0.00008288841,0.00017128608],"domain_scores_gemma":[0.99922,0.00043308848,0.000031954503,0.00024547233,0.00004596194,0.00002348292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033754835,0.000062210886,0.000081410806,0.00010208059,0.00009244392,0.000048413192,0.00023520672,0.00002631821,0.00006651355],"category_scores_gemma":[0.00001774075,0.00005201856,0.00007051569,0.00020873903,0.000018833933,0.00006162769,0.000024136369,0.000030482304,0.000012109283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065450035,0.000068751186,0.00031968317,0.000004168456,0.0000036412732,7.978121e-7,0.000036733196,0.00009580659,0.00025985818,0.9669176,0.022139098,0.010147322],"study_design_scores_gemma":[0.004232494,0.0012127366,0.021556849,0.000009412271,0.000020088619,0.00000797726,0.00008255476,0.1863034,0.032422762,0.24966638,0.5038282,0.0006571414],"about_ca_topic_score_codex":0.0001604896,"about_ca_topic_score_gemma":0.00031174082,"teacher_disagreement_score":0.71725124,"about_ca_system_score_codex":0.000009871321,"about_ca_system_score_gemma":0.000027088056,"threshold_uncertainty_score":0.21212552},"labels":[],"label_agreement":null},{"id":"W2149558028","doi":"10.1109/iccd.2005.10","title":"A high performance sub-pipelined architecture for AES","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Verilog; Field-programmable gate array; Advanced Encryption Standard; Pipeline (software); Encryption; Throughput; Virtex; Key (lock); Embedded system; AES implementations; Architecture; Computer architecture; Parallel computing; Operating system; Wireless","score_opus":0.008900289061525289,"score_gpt":0.23478689033841196,"score_spread":0.22588660127688667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149558028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37134382,0.0000130016715,0.6270432,0.0010537956,0.0000856044,0.00012920216,0.0000043498603,0.00008397081,0.00024304655],"genre_scores_gemma":[0.85502297,0.0000033620586,0.14452142,0.00023217473,0.00007591004,0.000033385022,0.000014964792,0.0000031284194,0.000092681476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938756,0.000008470348,0.00014270052,0.00017902459,0.000095798234,0.00018647239],"domain_scores_gemma":[0.9996332,0.00004375935,0.000030721836,0.00021602516,0.000052620348,0.0000236562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010727554,0.000072484465,0.0000709476,0.00007983263,0.00013959678,0.00008297835,0.00026108886,0.000021001899,0.000018140048],"category_scores_gemma":[0.0000035527928,0.00005773828,0.00004707312,0.0002387505,0.000018194543,0.00013759451,0.000045413104,0.0000383741,0.0000050771346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092712025,0.00007577201,0.0014184605,0.000022474047,0.0000070327196,7.8095775e-7,0.00018508705,0.0006643238,0.0016696545,0.9031021,0.011191703,0.08165333],"study_design_scores_gemma":[0.0039361655,0.0006668667,0.07495337,0.000021522399,0.000024064777,0.00003942812,0.00008014487,0.36224926,0.08042435,0.34304604,0.13354188,0.001016909],"about_ca_topic_score_codex":0.00015849789,"about_ca_topic_score_gemma":0.0003073555,"teacher_disagreement_score":0.5600561,"about_ca_system_score_codex":0.000006582143,"about_ca_system_score_gemma":0.000019255644,"threshold_uncertainty_score":0.23544988},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011887130865366951,"score_gpt":0.2762625963288175,"score_spread":0.26437546546345053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149767240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06200809,0.000013997847,0.9298062,0.00045135297,0.006837851,0.0006397559,0.00007008525,0.0001670655,0.0000056454187],"genre_scores_gemma":[0.9729315,0.000019233985,0.026666375,0.00017344313,0.00008105026,0.00010832793,0.0000039338383,0.000010804162,0.0000053049066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987008,0.00003633432,0.00026150353,0.00038817222,0.00034180278,0.000271416],"domain_scores_gemma":[0.99891496,0.00028217759,0.000098732315,0.0004610413,0.0001602602,0.00008284719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019198646,0.00018292494,0.00013643308,0.00016778111,0.00073340314,0.00022674313,0.0005069165,0.00007467368,0.000031445757],"category_scores_gemma":[0.000003945656,0.00014471528,0.00017530029,0.00034039284,0.00007158236,0.00036092522,0.0000045393317,0.0003930586,0.0000036463998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024956615,0.000052724743,0.0000034655252,0.000008210656,0.000049302387,4.8699945e-7,0.0004423056,0.006938478,0.013010212,0.004176485,0.00005777806,0.9752356],"study_design_scores_gemma":[0.003351734,0.0006628874,0.00041028715,0.000025098172,0.0000717879,0.000044462617,0.00024563976,0.7306473,0.22148831,0.0022251983,0.040253505,0.00057376246],"about_ca_topic_score_codex":0.0000207056,"about_ca_topic_score_gemma":0.0005590139,"teacher_disagreement_score":0.9746618,"about_ca_system_score_codex":0.000054415574,"about_ca_system_score_gemma":0.000053724343,"threshold_uncertainty_score":0.59013176},"labels":[],"label_agreement":null},{"id":"W2150154237","doi":"10.1109/ccece.2009.5090296","title":"An ultra compact block cipher for serialized architecture implementations","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block cipher; Computer science; Cipher; CBC-MAC; Key (lock); Triple DES; Block size; Block (permutation group theory); Encryption; Architecture; Stream cipher; Cryptography; Embedded system; Computer architecture; Computer hardware; Computer network; Operating system; Algorithm; Mathematics","score_opus":0.02346696146534002,"score_gpt":0.3468225612824636,"score_spread":0.3233555998171236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150154237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07798624,0.000008938535,0.9134483,0.005027529,0.00016256576,0.0006282499,0.000055602548,0.00025265335,0.0024299193],"genre_scores_gemma":[0.9136733,0.0000021549579,0.08470224,0.001437941,0.00006772402,0.00001615694,0.000062934436,0.000004460556,0.000033119202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902475,0.00004457412,0.00023311736,0.00026978392,0.00014503692,0.000282745],"domain_scores_gemma":[0.9992991,0.000058513673,0.000055082866,0.0004001503,0.000074118114,0.00011300796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017920094,0.00011742753,0.00012359441,0.000110993096,0.00026969286,0.0002528766,0.0004391433,0.000026770238,0.0001834074],"category_scores_gemma":[0.000006915709,0.00010052245,0.00009419113,0.00033636327,0.000016525953,0.00030966703,0.0000049756645,0.000051174324,0.0000030883225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037684775,0.0004648233,0.0006564359,0.000008527345,0.00005040529,0.000001784136,0.00481805,0.00039181788,0.059820417,0.86799103,0.015318008,0.050441],"study_design_scores_gemma":[0.014581557,0.0048313304,0.07783347,0.000021798518,0.00011862566,0.000108978085,0.0026953807,0.028810516,0.08258485,0.53994066,0.24628176,0.0021910917],"about_ca_topic_score_codex":0.00008736411,"about_ca_topic_score_gemma":0.00023677078,"teacher_disagreement_score":0.83568704,"about_ca_system_score_codex":0.000013355165,"about_ca_system_score_gemma":0.00004046808,"threshold_uncertainty_score":0.40991867},"labels":[],"label_agreement":null},{"id":"W2151773324","doi":"10.1109/ccece.2005.1557161","title":"Investigation of compact hardware implementation of the advanced encryption standard","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"AES implementations; Computer science; Encryption; Advanced Encryption Standard; Embedded system; Encryption software; S-box; Scheduling (production processes); Key (lock); Disk encryption hardware; Computer hardware; Computer architecture; Parallel computing; Block cipher; 40-bit encryption; Disk encryption; Operating system; 56-bit encryption; Engineering","score_opus":0.015771688645725652,"score_gpt":0.28495537537900095,"score_spread":0.2691836867332753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151773324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8229813,0.000014527885,0.17583685,0.00048946013,0.00008082755,0.00020448554,0.000023847319,0.000022876053,0.0003458447],"genre_scores_gemma":[0.98738575,0.0000032273442,0.012535777,0.00003657404,0.000008348811,0.000003647148,0.00001667431,0.000002134759,0.000007837556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991537,0.00005272427,0.0003147128,0.00011226894,0.00027537628,0.00009123372],"domain_scores_gemma":[0.9993386,0.000029233535,0.00021636378,0.00024748148,0.00015252487,0.00001575033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018355013,0.000058349633,0.00009002796,0.00007580802,0.000074222335,0.000020481404,0.0002329316,0.000015474026,0.00005794257],"category_scores_gemma":[0.0000040882246,0.000042429645,0.00006170321,0.00047810623,0.000053263044,0.00031286266,0.000041646446,0.0000314344,4.3124624e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008214102,0.000020624902,0.23063008,0.00003582813,0.000014151599,1.1687233e-7,0.001515284,0.00024213057,0.07782102,0.6725591,0.001724597,0.015428894],"study_design_scores_gemma":[0.00063915114,0.0000888211,0.6224256,0.000012603979,0.0000074726076,9.1167635e-7,0.00065772195,0.0007694306,0.34175062,0.033066828,0.0005066023,0.00007421343],"about_ca_topic_score_codex":0.0008609825,"about_ca_topic_score_gemma":0.000763247,"teacher_disagreement_score":0.6394922,"about_ca_system_score_codex":0.000022890126,"about_ca_system_score_gemma":0.00006311363,"threshold_uncertainty_score":0.17302307},"labels":[],"label_agreement":null},{"id":"W2152249949","doi":"10.1109/ccece.2006.277763","title":"Triple-DES ASIC Module for a Power-Smart System-on-Chip Architecture","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Application-specific integrated circuit; CMOS; Embedded system; Architecture; Power consumption; Computer science; Chip; Power (physics); System on a chip; Computer architecture; Engineering; Electrical engineering; Telecommunications; Physics","score_opus":0.014387436859200207,"score_gpt":0.2555851415820335,"score_spread":0.24119770472283328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152249949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101025045,0.000036769146,0.88792115,0.00052524236,0.0002667409,0.00045930967,0.000022724775,0.00025761372,0.009485383],"genre_scores_gemma":[0.93391085,5.2876305e-7,0.06541986,0.000187917,0.00006124857,0.00008260671,0.000010645562,0.000008175579,0.00031818997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989253,0.000036766367,0.00022556657,0.00031673652,0.00019140364,0.00030419903],"domain_scores_gemma":[0.99931157,0.000111678404,0.00005306849,0.00040451673,0.00006347852,0.00005570031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022574623,0.00013020307,0.00013710445,0.00017522638,0.00027461874,0.00017394061,0.0003889667,0.000037360045,0.000024283505],"category_scores_gemma":[0.00001101629,0.00010367135,0.00013547493,0.00038126804,0.00003846025,0.00012148017,0.000055748962,0.00006676629,0.000014109465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010958123,0.00009481369,0.0005522016,0.00003722349,0.000012455287,0.000002464439,0.00025600602,0.00012014148,0.0002233427,0.9867371,0.005482158,0.006471148],"study_design_scores_gemma":[0.0106367795,0.0030166314,0.07651305,0.00021454442,0.0000688962,0.0002288592,0.0013934134,0.14237118,0.010194527,0.5994908,0.15363699,0.0022342987],"about_ca_topic_score_codex":0.00022224356,"about_ca_topic_score_gemma":0.0003020858,"teacher_disagreement_score":0.8328858,"about_ca_system_score_codex":0.00003195734,"about_ca_system_score_gemma":0.000029760571,"threshold_uncertainty_score":0.4227595},"labels":[],"label_agreement":null},{"id":"W2152948909","doi":"10.1145/581199.581218","title":"Security-driven exploration of cryptography in DSP cores","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Elliptic curve cryptography; Wireless; Cryptographic protocol; Digital signal processing; Embedded system; Power analysis; Computer security; Public-key cryptography; Computer hardware; Encryption; Telecommunications","score_opus":0.04565885727236685,"score_gpt":0.2735226476244555,"score_spread":0.22786379035208865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152948909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32910126,0.00014604304,0.65983325,0.0012434082,0.00016801318,0.00029105382,0.0000054425986,0.00011570495,0.009095793],"genre_scores_gemma":[0.9798258,0.000099020785,0.019941332,0.000097675584,0.000009869548,0.000014986203,0.000002989357,0.0000026152093,0.0000057239604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991909,0.00004347452,0.00025842554,0.00017889954,0.00018188513,0.00014639867],"domain_scores_gemma":[0.9995359,0.00004358906,0.00006299877,0.00026730227,0.0000548821,0.00003528176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112875365,0.000071447444,0.000105802814,0.0003726618,0.00004279127,0.000044085027,0.00029752648,0.000028660623,0.00022637473],"category_scores_gemma":[0.000008417521,0.000067314744,0.00006013989,0.0010470968,0.000040086805,0.00080483785,0.00006931994,0.000060999628,0.000009218874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018048463,0.00023805078,0.021784108,0.000012552703,0.000009012974,0.0000033800625,0.008176712,0.000055671397,0.0003098461,0.9597041,0.0019041533,0.007800592],"study_design_scores_gemma":[0.0033996468,0.00065433234,0.05152454,0.00006796292,0.000014912175,0.000010589344,0.0033005378,0.42611834,0.0067009283,0.49318147,0.014141461,0.0008852821],"about_ca_topic_score_codex":0.00012654722,"about_ca_topic_score_gemma":0.0005444703,"teacher_disagreement_score":0.65072453,"about_ca_system_score_codex":0.000006644335,"about_ca_system_score_gemma":0.0000059012323,"threshold_uncertainty_score":0.27450156},"labels":[],"label_agreement":null},{"id":"W2154050359","doi":"10.1109/iemc.2005.1559195","title":"Cryptographic module validation program in Japan","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer security; Computer science; Certified Information Systems Security Professional; Security service; Security information and event management; Certification; Information security; Information security audit; Common Criteria; Security through obscurity; Computer security model; Information security management system; Information security standards; Adversary; Security testing; Security convergence; Information security management; Certified Information Security Manager; Cloud computing security; Network security policy","score_opus":0.019147153033129687,"score_gpt":0.2991095415231454,"score_spread":0.2799623884900157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154050359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77430856,0.000026900923,0.21920349,0.0018109843,0.00007508797,0.00036117437,7.725119e-7,0.00031356976,0.0038994509],"genre_scores_gemma":[0.84274715,0.000012439647,0.15693189,0.00018154079,0.000027615988,0.00006821667,0.000005814553,0.000003222714,0.000022114384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990823,0.00003403938,0.00022151036,0.0002476463,0.00018017518,0.00023428092],"domain_scores_gemma":[0.99953914,0.000020650641,0.000036159243,0.00031162135,0.000039154384,0.000053287815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022736279,0.00008311581,0.000078950085,0.00032970394,0.00007120564,0.0001566856,0.0003415055,0.000032586093,0.000108527645],"category_scores_gemma":[0.0000064479987,0.00007769411,0.000051782725,0.0011056425,0.00002354981,0.0006203444,0.00007418373,0.00007702916,0.0000294469],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012445453,0.00034607964,0.029887768,0.0000037995874,0.000005417204,5.9405767e-7,0.0006817797,0.00013707545,0.00013143012,0.49881074,0.000409252,0.46958482],"study_design_scores_gemma":[0.0022407991,0.00039316685,0.623613,0.000019833446,0.00000843749,0.000014569543,0.00037505798,0.25004622,0.0042047654,0.05489992,0.063408,0.0007762396],"about_ca_topic_score_codex":0.00011451037,"about_ca_topic_score_gemma":0.00061724323,"teacher_disagreement_score":0.5937252,"about_ca_system_score_codex":0.000018113042,"about_ca_system_score_gemma":0.000018636247,"threshold_uncertainty_score":0.3168274},"labels":[],"label_agreement":null},{"id":"W2154093238","doi":"10.1109/itng.2007.16","title":"A Phase Substitution Technique for DEMA of Embedded Cryptographic Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Robustness (evolution); Wireless; Cryptographic primitive; Java; Key (lock); Smart card; Computation; Embedded system; Cryptographic protocol; Computer security; Programming language; Operating system","score_opus":0.02962897012341919,"score_gpt":0.3429452414578011,"score_spread":0.3133162713343819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154093238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054063138,0.000059598955,0.94418174,0.00003161422,0.00017555407,0.0008704394,0.000008630364,0.00009959536,0.0005097165],"genre_scores_gemma":[0.8584083,0.0000058922597,0.14141677,0.000026826576,0.000021815913,0.00010354048,0.000007287597,0.0000035238027,0.000006054476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989791,0.000021036327,0.00038786946,0.0002069834,0.00017291552,0.00023208662],"domain_scores_gemma":[0.999177,0.00011219581,0.00012256761,0.00033043275,0.00019411465,0.000063710344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010358249,0.00009010888,0.00014104322,0.00037669615,0.000109450004,0.00004620652,0.0003122293,0.00005646531,0.000007910111],"category_scores_gemma":[0.000021121275,0.00008010156,0.000109036184,0.0008295677,0.00005523458,0.00023600306,0.000037402122,0.000043283755,7.6216855e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015091352,0.00025582642,0.00017421872,0.000044094322,0.000014909835,0.0000013265608,0.00019764129,0.000004159694,0.03281466,0.96360064,0.00014483971,0.0027326278],"study_design_scores_gemma":[0.014825516,0.0037276659,0.0027352727,0.00019217255,0.00010524669,0.00017322987,0.0018831684,0.07534839,0.77002317,0.10169695,0.02787443,0.0014147825],"about_ca_topic_score_codex":0.00007554686,"about_ca_topic_score_gemma":0.000054976957,"teacher_disagreement_score":0.86190367,"about_ca_system_score_codex":0.000013060322,"about_ca_system_score_gemma":0.000037590984,"threshold_uncertainty_score":0.3266447},"labels":[],"label_agreement":null},{"id":"W2154842636","doi":"10.1109/itng.2007.89","title":"Enhanced Current-Balanced Logic (ECBL): An Area Efficient Solution to Secure Smart Cards against Differential Power Attack","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Smart card; Computer science; Power analysis; Current (fluid); Differential (mechanical device); Logic gate; Computer security; Power (physics); Electrical engineering; Embedded system; Cryptography; Engineering; Algorithm","score_opus":0.02834239847320812,"score_gpt":0.3190802956225084,"score_spread":0.29073789714930026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154842636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47237226,0.000020385616,0.5252823,0.00015653366,0.0008767761,0.00025288094,0.000010533188,0.00014951504,0.00087877805],"genre_scores_gemma":[0.9908351,0.000008110719,0.008491318,0.00046163672,0.000085888794,0.00002246803,0.00006240568,0.000010422212,0.00002267259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9975733,0.00006690969,0.00043872444,0.00067138806,0.0005441946,0.0007054879],"domain_scores_gemma":[0.9986357,0.000046983656,0.0000999843,0.00067491,0.00021206855,0.00033033048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037929422,0.00025615498,0.00023379434,0.00029254516,0.00030559787,0.00021007868,0.0006547518,0.00007973863,0.00014770064],"category_scores_gemma":[0.00002102601,0.00022420562,0.00014393976,0.0008535854,0.00004844588,0.00023501916,0.00026610738,0.00019005292,0.000045706718],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003500488,0.005059548,0.0054171146,0.000106426705,0.00020046852,0.00005520016,0.032488223,0.0031014092,0.1988582,0.3805173,0.015254852,0.3585912],"study_design_scores_gemma":[0.0127092,0.0043058326,0.41757262,0.0002967436,0.00013291332,0.000046733938,0.004345958,0.40323547,0.09703065,0.005299462,0.048362345,0.006662086],"about_ca_topic_score_codex":0.000035857905,"about_ca_topic_score_gemma":0.00047229155,"teacher_disagreement_score":0.51846284,"about_ca_system_score_codex":0.00009429246,"about_ca_system_score_gemma":0.000058762314,"threshold_uncertainty_score":0.914284},"labels":[],"label_agreement":null},{"id":"W2154968838","doi":"10.1109/ccece.1999.807226","title":"The FPGA implementation of the RC6 and CAST-256 encryption algorithms","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Advanced Encryption Standard; Block cipher; Computer science; Field-programmable gate array; Encryption; AES implementations; Cryptography; NIST; Embedded system; Disk encryption theory; Algorithm; Encryption software; Implementation; Cipher; Triple DES; 40-bit encryption; 56-bit encryption; Public-key cryptography; Attribute-based encryption; Computer security; Software engineering","score_opus":0.013341286418460978,"score_gpt":0.28684835430089556,"score_spread":0.27350706788243456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154968838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38039115,0.00041548425,0.6108266,0.0040995236,0.0006100688,0.0008000536,0.000011808779,0.000058510715,0.0027867972],"genre_scores_gemma":[0.99120384,0.00005766351,0.00853919,0.00013452728,0.000007440407,0.000013724856,8.151978e-7,0.0000020351508,0.000040771123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993107,0.000089178284,0.00017344258,0.00012592143,0.00017331455,0.00012745986],"domain_scores_gemma":[0.9995065,0.00007490578,0.00007306268,0.00026536852,0.000057293964,0.000022876156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003756181,0.00005569668,0.00005368933,0.000028609225,0.0003442782,0.00009311984,0.00022085388,0.0000142963145,0.000044054228],"category_scores_gemma":[0.000008657849,0.000030339186,0.000049655424,0.00029281143,0.000059523023,0.00017056231,0.00007139546,0.00004242774,0.0000010776592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.3809333e-7,0.000017677903,0.0035324278,0.0000037083596,0.00005695786,2.1012494e-7,0.0018318892,0.0000019842755,0.00037280214,0.9031463,0.0005491403,0.09048631],"study_design_scores_gemma":[0.0035714752,0.0005250561,0.47400394,0.000012691892,0.0003682354,0.00014751744,0.030166147,0.009029388,0.10466624,0.2828759,0.093793675,0.0008397373],"about_ca_topic_score_codex":0.00026844873,"about_ca_topic_score_gemma":0.00073286827,"teacher_disagreement_score":0.62027043,"about_ca_system_score_codex":0.000008438724,"about_ca_system_score_gemma":0.000035353398,"threshold_uncertainty_score":0.26479444},"labels":[],"label_agreement":null},{"id":"W2156908834","doi":"10.1109/ccece.1997.614855","title":"The analysis of a new class of unbalanced CAST ciphers","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Differential cryptanalysis; Block cipher; Linear cryptanalysis; Impossible differential cryptanalysis; Key schedule; Boomerang attack; S-box; Higher-order differential cryptanalysis; Computer science; Cipher; Two-square cipher; Differential (mechanical device); Arithmetic; Theoretical computer science; Cryptography; Mathematics; Algorithm; Running key cipher; Computer security; Engineering; Encryption","score_opus":0.03253329652009819,"score_gpt":0.27950363647376053,"score_spread":0.24697033995366235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156908834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44088867,0.00023527884,0.5391919,0.0027627707,0.00013128949,0.00015436756,0.0000087231965,0.000044536253,0.016582483],"genre_scores_gemma":[0.99385256,0.0000386288,0.0058124596,0.00005344288,0.000003856715,0.0000011319146,6.6799294e-7,9.0509616e-7,0.00023633004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946326,0.00001875941,0.00018603436,0.00009097246,0.00014736022,0.000093588395],"domain_scores_gemma":[0.9994368,0.000076005046,0.00007947615,0.00032811303,0.000049651968,0.000029969793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105051935,0.000037493635,0.000103675615,0.00010821952,0.00005132714,0.00002348441,0.00033263143,0.00001142062,0.00020886633],"category_scores_gemma":[0.000008469198,0.000024463214,0.00010611325,0.0017778958,0.000038520964,0.000067903646,0.000048904163,0.000023461234,0.0000013854134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044619424,0.00012235624,0.020828774,0.000006651067,0.0010371252,0.0000012866248,0.007845354,0.0005432592,0.00080757885,0.80323434,0.016042583,0.14952624],"study_design_scores_gemma":[0.0009433052,0.00015125102,0.12243497,0.0000058846927,0.000337118,0.0000019462766,0.0023115545,0.84518296,0.0019754576,0.0049789227,0.021443635,0.00023298894],"about_ca_topic_score_codex":0.0004841234,"about_ca_topic_score_gemma":0.0012531151,"teacher_disagreement_score":0.8446397,"about_ca_system_score_codex":0.0000047093595,"about_ca_system_score_gemma":0.000010917448,"threshold_uncertainty_score":0.22869399},"labels":[],"label_agreement":null},{"id":"W2157417471","doi":"10.1109/ispass.2003.1190233","title":"Accelerating private-key cryptography via multithreading on symmetric multiprocessors","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Block cipher; Encryption; Block cipher mode of operation; Plaintext; Symmetric-key algorithm; Cryptography; Block (permutation group theory); Block size; Ciphertext; CBC-MAC; Parallel computing; Key (lock); Computer network; Public-key cryptography; Computer security; Mathematics","score_opus":0.03261219466956869,"score_gpt":0.2799731942195083,"score_spread":0.2473609995499396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157417471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18955098,0.000042458298,0.7972057,0.00009890933,0.00023186063,0.00023752458,0.0000011246775,0.00025624322,0.012375232],"genre_scores_gemma":[0.70836407,0.000011456751,0.29117185,0.00039204658,0.000015868663,0.00002551124,0.0000021549547,0.000009271625,0.000007782991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824244,0.00008119515,0.00034992181,0.0005059137,0.00037101193,0.0004495051],"domain_scores_gemma":[0.9989739,0.00020074267,0.000110485395,0.00047530976,0.000103248945,0.0001363301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004198976,0.00021080165,0.00017343895,0.0007892505,0.00043825296,0.00033613265,0.00053475244,0.000060034286,0.000111768546],"category_scores_gemma":[0.00011821008,0.00018467927,0.0001228737,0.0030405156,0.000034796958,0.00056604773,0.00007865976,0.0001787043,0.000045188142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016507693,0.00013845557,0.010457584,0.000010077169,0.000019606985,0.0000044167623,0.0006154737,0.000055974742,0.0006150769,0.96837115,0.000091890004,0.019618662],"study_design_scores_gemma":[0.010916541,0.0018101766,0.0634404,0.00020123104,0.00008298771,0.00016021244,0.0021906793,0.40586147,0.16440706,0.28812376,0.057715002,0.0050904886],"about_ca_topic_score_codex":0.000049933133,"about_ca_topic_score_gemma":0.000034452565,"teacher_disagreement_score":0.68024737,"about_ca_system_score_codex":0.000027614122,"about_ca_system_score_gemma":0.000025801673,"threshold_uncertainty_score":0.7531002},"labels":[],"label_agreement":null},{"id":"W2158998608","doi":"10.1145/944645.944689","title":"Security wrappers and power analysis for SoC technologies","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; Wireless; Computer network; Computer security; Embedded system; Layer (electronics); Transport layer; Operating system","score_opus":0.014827733467654057,"score_gpt":0.2749653200093382,"score_spread":0.2601375865416842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158998608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106270745,0.00013225665,0.89015394,0.00096214376,0.00004134866,0.00014607004,0.000005021178,0.00021620048,0.0020722854],"genre_scores_gemma":[0.9494928,0.000024001074,0.050340224,0.000101024285,9.532159e-7,0.000020665522,0.0000014929685,0.0000015149612,0.000017332832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941194,0.00001458929,0.00010423965,0.0002182379,0.00007539036,0.00017558363],"domain_scores_gemma":[0.99959904,0.000055383356,0.000026093465,0.00025044743,0.0000432559,0.000025771802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022684016,0.00006397238,0.000098142875,0.00023157218,0.00013757152,0.00009443192,0.00017457915,0.000035598456,0.000033803968],"category_scores_gemma":[0.000033637436,0.000053435022,0.00008233824,0.00088525465,0.000049613165,0.0001557438,0.000051391165,0.000035673158,7.724258e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.661016e-7,0.000022226393,0.014775627,0.0000024908325,0.00009233441,3.2516098e-7,0.00046074545,0.0000016701625,0.000029669749,0.9824175,0.0005148905,0.0016819322],"study_design_scores_gemma":[0.0018474165,0.00040180175,0.025317514,0.000004227997,0.00028716915,0.000015383092,0.016145356,0.019928891,0.009573763,0.7960011,0.12951389,0.0009634947],"about_ca_topic_score_codex":0.000015259764,"about_ca_topic_score_gemma":0.0001020934,"teacher_disagreement_score":0.843222,"about_ca_system_score_codex":0.0000064117926,"about_ca_system_score_gemma":0.000014230545,"threshold_uncertainty_score":0.2179017},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0222037773679399,"score_gpt":0.2902167245142492,"score_spread":0.2680129471463093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159543798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052677937,0.0009646508,0.94452405,0.0007831325,0.0006196596,0.000109586625,0.0000028767874,0.000025026731,0.00029307557],"genre_scores_gemma":[0.6350778,0.000029912804,0.3645851,0.000085112544,0.0002172182,0.000001842788,1.1181932e-7,0.0000013070232,0.0000016029894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885815,0.000057215988,0.0004476683,0.0001679302,0.00027992815,0.00018907654],"domain_scores_gemma":[0.9990832,0.00015553672,0.0003233559,0.00010910889,0.00023156957,0.00009720091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011664364,0.00008816151,0.00022626201,0.00033054475,0.00051088224,0.00045294943,0.0004801702,0.000028549404,0.0000017270861],"category_scores_gemma":[0.0000068692893,0.00006374201,0.00016169238,0.00047912967,0.0001708596,0.0007156816,0.00006326197,0.00007336363,4.1571073e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035034084,0.000031567815,0.002268623,0.00003417031,0.000115869414,0.0000031854527,0.0011950808,0.0005020923,0.00003473495,0.9547452,0.0005803599,0.040485665],"study_design_scores_gemma":[0.0033436436,0.0027305586,0.020029765,0.00038164164,0.00047271053,0.007891953,0.0050914395,0.8979904,0.00024089402,0.023147494,0.037766755,0.0009127649],"about_ca_topic_score_codex":0.000003833012,"about_ca_topic_score_gemma":0.000005780351,"teacher_disagreement_score":0.93159765,"about_ca_system_score_codex":0.000013392672,"about_ca_system_score_gemma":0.00008221048,"threshold_uncertainty_score":0.43678018},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015164146378421542,"score_gpt":0.25708130287677694,"score_spread":0.2419171564983554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160950619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006044398,0.000616563,0.9919057,0.0009396871,0.00089200854,0.0003458022,0.000028079558,0.0001939852,0.0044737463],"genre_scores_gemma":[0.5726194,0.000178039,0.4246039,0.0016852549,0.00044408216,0.000013889962,0.0000610855,0.00003180258,0.00036257473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965974,0.00003783711,0.00052701816,0.001319099,0.0009547113,0.00056392717],"domain_scores_gemma":[0.99768215,0.00032510186,0.00026905342,0.001362545,0.0001933746,0.00016775912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000619367,0.00041761174,0.0004101205,0.00062376726,0.00035056908,0.00070434413,0.0026034778,0.00023282813,0.000085318716],"category_scores_gemma":[0.000032128744,0.0004033623,0.00013428913,0.000665563,0.0004419452,0.0004888177,0.0006090738,0.0005286356,0.000028931894],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004728343,0.000067141256,0.00016640636,0.000013921989,0.000025677256,0.00004052845,0.002297,0.0038891076,0.00037035724,0.08001727,0.00013852974,0.91296935],"study_design_scores_gemma":[0.0005167594,0.00017946986,0.0010862874,0.0002655746,0.000031711286,0.000021989003,0.000001473802,0.34292576,0.001317336,0.6433689,0.009384047,0.00090067263],"about_ca_topic_score_codex":0.00013287712,"about_ca_topic_score_gemma":0.00030666083,"teacher_disagreement_score":0.91206867,"about_ca_system_score_codex":0.00018845512,"about_ca_system_score_gemma":0.0003369593,"threshold_uncertainty_score":0.9998418},"labels":[],"label_agreement":null},{"id":"W2161300246","doi":"10.1109/ccece.1999.807231","title":"A CPLD-based RC4 cracking system","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Complex programmable logic device; Computer science; Embedded system; Cipher; Programmable logic device; Field-programmable gate array; Cryptosystem; Computer hardware; Encryption; Operating system","score_opus":0.01751046050457753,"score_gpt":0.25872753942541427,"score_spread":0.24121707892083674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161300246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01702954,0.000020766905,0.96059626,0.00017388535,0.00018844908,0.000087883185,7.104315e-7,0.00020585771,0.021696625],"genre_scores_gemma":[0.91449255,3.605235e-7,0.08516724,0.0002889971,0.000007721388,0.000009861073,8.2579277e-7,0.0000025058864,0.000029968653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993322,0.00005257104,0.00013326456,0.00017155513,0.00014558593,0.00016485396],"domain_scores_gemma":[0.99952465,0.000046419904,0.000031292584,0.00030406663,0.000044942095,0.000048609458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002513483,0.000060281116,0.000064214015,0.00009013602,0.00013682432,0.00013816378,0.0002240876,0.000017740082,0.000080158345],"category_scores_gemma":[0.00001141634,0.00005203675,0.0000463073,0.0004018592,0.00001088256,0.00015238512,0.000022155695,0.000038573657,0.00003061818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3544419e-7,0.00001805097,0.0012642178,0.0000092315295,0.0000031029472,0.00000436304,0.000121930614,0.000017226457,0.00006928877,0.99657315,0.00036809524,0.0015510874],"study_design_scores_gemma":[0.005113181,0.00040219713,0.013387541,0.00015063326,0.000041285744,0.00017897692,0.0043693287,0.627471,0.03136602,0.024938414,0.2907605,0.0018209103],"about_ca_topic_score_codex":0.000043502434,"about_ca_topic_score_gemma":0.000032384938,"teacher_disagreement_score":0.97163475,"about_ca_system_score_codex":0.000021328207,"about_ca_system_score_gemma":0.000047409103,"threshold_uncertainty_score":0.21219972},"labels":[],"label_agreement":null},{"id":"W2164014144","doi":"10.1007/11941378_23","title":"A Simple and Unified Method of Proving Indistinguishability","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Computer science; Simple (philosophy); PMAC; Function (biology); Theoretical computer science; Class (philosophy); Discrete mathematics; Mathematics; Programming language","score_opus":0.019341120802635673,"score_gpt":0.29333394727670087,"score_spread":0.2739928264740652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164014144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010448685,0.00011406507,0.9966053,0.00012447222,0.00023531636,0.00035990975,0.000014444711,0.000057756963,0.0014438757],"genre_scores_gemma":[0.37713462,0.000004420116,0.62260216,0.00014700284,0.00007528163,0.0000044937,0.0000066488847,0.000010204564,0.000015139386],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974596,0.00005048273,0.0005505082,0.0010040682,0.0005617021,0.00037364886],"domain_scores_gemma":[0.99787724,0.000619693,0.00033559382,0.0008445459,0.00023836084,0.00008459149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013912636,0.00029255502,0.00042351324,0.0006408684,0.00019722704,0.00024130433,0.0012472984,0.00015123343,0.000009371208],"category_scores_gemma":[0.00012597542,0.00027379967,0.00008422469,0.0006233922,0.0005789028,0.0002656636,0.0010301048,0.0003810952,5.4061377e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043440355,0.000053009888,0.0027955342,0.00016408609,0.000012339362,0.000020518104,0.001609785,0.002672752,0.0002170785,0.12352098,0.000024037214,0.86890554],"study_design_scores_gemma":[0.00035154657,0.00019209778,0.005515723,0.00014168915,0.000012554049,0.000040506562,6.931569e-7,0.3297795,0.0009740813,0.6614626,0.0009798121,0.0005492219],"about_ca_topic_score_codex":0.00034445294,"about_ca_topic_score_gemma":0.00042227455,"teacher_disagreement_score":0.8683563,"about_ca_system_score_codex":0.000081512924,"about_ca_system_score_gemma":0.00031744342,"threshold_uncertainty_score":0.9999714},"labels":[],"label_agreement":null},{"id":"W2164724325","doi":"10.1109/newcas.2010.5603920","title":"Using a pipelined S-box in compact AES hardware implementations","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"AES implementations; Computer science; Encryption; Advanced Encryption Standard; Pipeline (software); Application-specific integrated circuit; Throughput; Embedded system; Implementation; Computer hardware; Encryption software; Key (lock); Parallel computing; Disk encryption; 40-bit encryption; Operating system","score_opus":0.05665425102287652,"score_gpt":0.3749795442456724,"score_spread":0.3183252932227959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164724325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54358536,0.0000051775773,0.45362905,0.0010119032,0.0002473956,0.00018495276,0.0000121645935,0.00008559475,0.0012383832],"genre_scores_gemma":[0.8664322,0.0000016168093,0.13324998,0.00025245955,0.00002643328,0.0000049719297,0.000010992887,0.000003785402,0.00001753522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909824,0.000029422665,0.00026152047,0.00021263037,0.00015612987,0.00024206338],"domain_scores_gemma":[0.99944866,0.000054947533,0.000048514168,0.00031921832,0.00006103607,0.00006760977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000238218,0.00008958152,0.00009907044,0.0002518183,0.00015171485,0.0001733991,0.00035800788,0.000026130858,0.0004922352],"category_scores_gemma":[0.00001651613,0.00008278505,0.000050738752,0.0006456579,0.000027525466,0.0004488619,0.00008092092,0.00013927517,0.000010062884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045100023,0.0002721483,0.13260847,0.0000124896205,0.000020356905,0.0000142143,0.0042246785,0.000107355496,0.036066044,0.8104825,0.0029224656,0.013264784],"study_design_scores_gemma":[0.00550653,0.00017769648,0.35759798,0.000033357646,0.00003059901,0.00011495103,0.0045949104,0.5130916,0.017320184,0.06486669,0.035267618,0.0013978414],"about_ca_topic_score_codex":0.0017256018,"about_ca_topic_score_gemma":0.010419996,"teacher_disagreement_score":0.7456158,"about_ca_system_score_codex":0.000016164386,"about_ca_system_score_gemma":0.0000715972,"threshold_uncertainty_score":0.5814603},"labels":[],"label_agreement":null},{"id":"W2165908632","doi":"10.1007/978-3-319-02937-5_2","title":"Revisiting MAC Forgeries, Weak Keys and Provable Security of Galois/Counter Mode of Operation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Block cipher; Hash function; Computer security; Provable security; Block cipher mode of operation; Authentication (law); GCM transcription factors; Construct (python library); Theoretical computer science; Mode (computer interface); Block (permutation group theory); Authenticated encryption; Encryption; Algorithm; Arithmetic; Computer network; Mathematics; Operating system","score_opus":0.012198484480009163,"score_gpt":0.2581925368093427,"score_spread":0.24599405232933352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165908632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052870754,0.00036185802,0.9916505,0.00030354323,0.00029560554,0.0005042894,0.000019348821,0.000031636322,0.0015461167],"genre_scores_gemma":[0.76459813,0.00012432555,0.23488446,0.00019005501,0.000117898504,0.000012148479,0.000012038178,0.000015546873,0.00004539193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758047,0.000031941756,0.00066986564,0.00076655654,0.0006107073,0.0003404522],"domain_scores_gemma":[0.9981958,0.00018458786,0.00040808256,0.00071908237,0.00041414722,0.00007825084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006238531,0.00029306818,0.000474534,0.00052290614,0.00016518665,0.00026730707,0.0009996686,0.00015092832,0.000046980585],"category_scores_gemma":[0.000041991894,0.00026593206,0.000083918196,0.00039817856,0.00051430304,0.0008420829,0.00073058903,0.00031360128,0.000001985102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013782424,0.00007825588,0.0016171572,0.0007980539,0.000046373603,0.000008981474,0.008601231,0.0036245724,0.0028124338,0.43384045,0.00009659728,0.5484621],"study_design_scores_gemma":[0.0004430105,0.00023946367,0.0004449292,0.0006756307,0.000016514987,0.000036595888,0.000003748389,0.7633431,0.006862785,0.22606713,0.0012719311,0.00059518806],"about_ca_topic_score_codex":0.00027528693,"about_ca_topic_score_gemma":0.0001460057,"teacher_disagreement_score":0.75971854,"about_ca_system_score_codex":0.00006140856,"about_ca_system_score_gemma":0.00024925222,"threshold_uncertainty_score":0.9999793},"labels":[],"label_agreement":null},{"id":"W2166313671","doi":"10.1109/eit.2009.5189583","title":"A low-cost S-box for the Advanced Encryption Standard using normal basis","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Institute of Standards and Technology","keywords":"Advanced Encryption Standard; S-box; Application-specific integrated circuit; AES implementations; Computer science; Cryptography; Encryption; Embedded system; Standard cell; Power consumption; Computer engineering; Computer hardware; Block cipher; Power (physics); Algorithm; Integrated circuit; Operating system","score_opus":0.024928041167570192,"score_gpt":0.3201011808435576,"score_spread":0.2951731396759874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166313671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055973634,0.000024844858,0.94179237,0.0013363396,0.00014533957,0.0004064805,0.000011153135,0.00006144901,0.0002483832],"genre_scores_gemma":[0.8098965,0.000018432296,0.18922476,0.00077863113,0.00004006928,0.00002111992,0.00000382946,0.000002561682,0.000014060448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926233,0.000015961288,0.00015864227,0.00017535967,0.0001719839,0.0002157364],"domain_scores_gemma":[0.9994561,0.00008654009,0.00004801306,0.0002727981,0.000098268494,0.000038259677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025733034,0.00007704657,0.00007384658,0.00006384944,0.00036766572,0.00015844154,0.00030451998,0.000020098905,0.00004955503],"category_scores_gemma":[0.000015150252,0.00005364594,0.00007780715,0.0003366469,0.000018437271,0.00045637912,0.00003564343,0.000046277706,0.0000017375224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003803451,0.000051539813,0.00014942378,0.0000051769,0.000011682983,8.436885e-7,0.0009136488,0.0006042567,0.003052945,0.2297299,0.00054401846,0.76489854],"study_design_scores_gemma":[0.005618199,0.0010498711,0.021072416,0.00005154806,0.00007464702,0.000036992387,0.0019544933,0.78206384,0.050884653,0.058729164,0.0774589,0.0010052926],"about_ca_topic_score_codex":0.000020794934,"about_ca_topic_score_gemma":0.00006821999,"teacher_disagreement_score":0.78145957,"about_ca_system_score_codex":0.00003002097,"about_ca_system_score_gemma":0.000041285588,"threshold_uncertainty_score":0.28278247},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02385932636325061,"score_gpt":0.2450125041940351,"score_spread":0.2211531778307845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168048374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09569234,0.000014904128,0.90222996,0.00013564773,0.0012669296,0.00049359153,0.0000118419675,0.000112198126,0.000042579606],"genre_scores_gemma":[0.9464377,0.000051115967,0.05277998,0.0005600979,0.000024894143,0.00012790799,0.0000019165657,0.000008977962,0.000007379135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989387,0.00004308946,0.00023388093,0.00036192976,0.00017027071,0.00025214997],"domain_scores_gemma":[0.9992078,0.00021346207,0.00007375167,0.00035019475,0.000072427574,0.00008238857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001671968,0.00017696289,0.00014201883,0.0001600486,0.0005794093,0.00011558237,0.00039174315,0.00006141705,0.0000125760025],"category_scores_gemma":[8.553371e-7,0.00014230581,0.00009982682,0.00032659725,0.00008700627,0.00034149358,0.00000797559,0.00021106281,0.0000035286225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015451963,0.0007573702,0.00007356862,0.00009381214,0.00025983932,0.0000024572525,0.009016979,0.012512,0.0011606457,0.0033157622,0.0005132602,0.9721398],"study_design_scores_gemma":[0.0017659779,0.0010474527,0.0010803596,0.000034742396,0.000064297594,0.000033682194,0.00024613747,0.9158918,0.07837049,0.00015549808,0.000903488,0.00040606142],"about_ca_topic_score_codex":0.0001262737,"about_ca_topic_score_gemma":0.00006646025,"teacher_disagreement_score":0.97173375,"about_ca_system_score_codex":0.000027763675,"about_ca_system_score_gemma":0.000019411727,"threshold_uncertainty_score":0.58030623},"labels":[],"label_agreement":null},{"id":"W2168236595","doi":"10.1007/978-3-319-18681-8_17","title":"A Higher Order Key Partitioning Attack with Application to LBlock","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cryptanalysis; Ciphertext; Plaintext; Key (lock); Cipher; Theoretical computer science; Block cipher; Algorithm; Cryptography; Encryption; Computer security","score_opus":0.03151126186858777,"score_gpt":0.29470118633753917,"score_spread":0.2631899244689514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168236595","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018477961,0.000100242585,0.9938768,0.0021933476,0.0004519895,0.00054674956,0.0000061123546,0.00013814378,0.002501836],"genre_scores_gemma":[0.21248226,0.000007088974,0.78427756,0.0024062444,0.0003760864,0.000076098535,0.000020720787,0.000034530927,0.00031942295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696916,0.00002143296,0.00036336062,0.0011894829,0.0009523923,0.0005041694],"domain_scores_gemma":[0.99776435,0.000114057104,0.00017873912,0.0011131557,0.00058777735,0.00024192559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056683534,0.00035598155,0.00031163968,0.0006304531,0.00026903208,0.00052269094,0.0016188187,0.00013760859,0.000039926894],"category_scores_gemma":[0.000019070018,0.0003052898,0.000049402122,0.0013974028,0.0002860325,0.0004476091,0.00064855284,0.00037516587,0.000067333625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022606902,0.00009685216,0.00053750374,0.000045640547,0.0000346732,0.000051399686,0.0039069857,0.12598585,0.00008778339,0.29010046,0.0010187963,0.57811147],"study_design_scores_gemma":[0.0013779246,0.0011031742,0.001391708,0.0005382279,0.000036503585,0.00012475431,0.0000017268201,0.4778138,0.00036079573,0.31161642,0.20323016,0.0024047778],"about_ca_topic_score_codex":0.0000596641,"about_ca_topic_score_gemma":0.000518848,"teacher_disagreement_score":0.5757067,"about_ca_system_score_codex":0.00020292048,"about_ca_system_score_gemma":0.00044001013,"threshold_uncertainty_score":0.9999399},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03401584777319765,"score_gpt":0.2681295197086521,"score_spread":0.23411367193545446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169407523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37483028,0.000036309106,0.61378324,0.0007234659,0.00040678016,0.00041215532,0.000033290566,0.00032789406,0.0094466],"genre_scores_gemma":[0.9910763,0.0000014966769,0.007880188,0.00042696352,0.00004732894,0.000011495908,0.000009255353,0.0000072530197,0.000539714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987702,0.000014512318,0.00027037092,0.00031283364,0.00031083977,0.00032124313],"domain_scores_gemma":[0.99914944,0.00004652402,0.000047687285,0.0004527936,0.00011011189,0.00019344671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000874937,0.00013784233,0.00016713078,0.0001557383,0.00019904407,0.00033241784,0.00050711905,0.00003270709,0.00005728546],"category_scores_gemma":[0.000017149956,0.00011779193,0.00007925541,0.00080266705,0.000026774542,0.00048958225,0.00012497068,0.000069092304,0.000113528964],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052214906,0.0025529913,0.034490068,0.00006486578,0.00038229043,0.00018383963,0.025433024,0.004850133,0.009922753,0.50936973,0.40868768,0.0040104263],"study_design_scores_gemma":[0.0076155188,0.001486064,0.14605704,0.00009009654,0.000034455104,0.0018121996,0.0037126024,0.3957115,0.003305637,0.001338492,0.43525517,0.003581235],"about_ca_topic_score_codex":0.00021494813,"about_ca_topic_score_gemma":0.000026255757,"teacher_disagreement_score":0.61624604,"about_ca_system_score_codex":0.00002559845,"about_ca_system_score_gemma":0.00005823025,"threshold_uncertainty_score":0.48034155},"labels":[],"label_agreement":null},{"id":"W2169506191","doi":"10.1109/ahs.2008.57","title":"An Approach for Recovering Satellites and their Cryptographic Capabilities in the Presence of SEUs and Attacks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Cryptography; Brute-force attack; Power analysis; Field-programmable gate array; Key (lock); Reliability (semiconductor); Power (physics); Embedded system","score_opus":0.033929374800812435,"score_gpt":0.2705404775977653,"score_spread":0.23661110279695285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169506191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82542706,0.0002967696,0.1736633,0.00008134159,0.000011579979,0.0002599156,0.000006067526,0.000014866176,0.00023912897],"genre_scores_gemma":[0.93742,0.0002637181,0.062209938,0.00005418804,0.000006825503,0.000038526934,0.0000025396248,0.000002261204,0.0000019662846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993522,0.00006260422,0.00016169575,0.0002107832,0.000076518765,0.00013617649],"domain_scores_gemma":[0.9993357,0.00030788488,0.000034166405,0.00026426028,0.000032106804,0.000025885727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004135575,0.0000768018,0.00010434839,0.00010814062,0.00012984981,0.000057564244,0.00026380605,0.000022931652,0.0000015819157],"category_scores_gemma":[0.00001654279,0.0000482854,0.000027408169,0.00028380918,0.0001786914,0.00029299126,0.000050391463,0.000046048353,1.3435478e-8],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002824529,0.00038783147,0.3682956,0.0002532926,0.000033270684,0.0000014258883,0.14263895,0.000119659315,0.0029260605,0.44163415,0.000063248954,0.04361826],"study_design_scores_gemma":[0.0015794771,0.0009212067,0.597876,0.00002789025,0.000010247179,0.00015589078,0.036773443,0.2635243,0.004378306,0.092809096,0.0013477519,0.00059639924],"about_ca_topic_score_codex":0.00023077815,"about_ca_topic_score_gemma":0.0000969481,"teacher_disagreement_score":0.34882507,"about_ca_system_score_codex":0.0000020741236,"about_ca_system_score_gemma":0.000012528783,"threshold_uncertainty_score":0.19690216},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01719697418332224,"score_gpt":0.28286864331784795,"score_spread":0.2656716691345257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169692300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07327567,0.00048700618,0.92407006,0.000740907,0.0010405742,0.0002648435,0.00004100242,0.000025073763,0.000054888525],"genre_scores_gemma":[0.9049857,0.000003552626,0.09411946,0.00007679604,0.0006097648,0.000020078378,0.0000048538514,0.000009585107,0.00017019924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883217,0.000057380683,0.00051337964,0.0001437706,0.00024979917,0.00020350836],"domain_scores_gemma":[0.99904054,0.00008499068,0.00028646566,0.0002216976,0.00028773895,0.00007854915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035786055,0.000113855625,0.00021441268,0.00026515895,0.00022333638,0.00024452817,0.00041938538,0.000048638307,0.00000532689],"category_scores_gemma":[0.000021475456,0.00008401767,0.00019400184,0.0002792993,0.000022818966,0.00020959156,0.0000406366,0.00017877264,0.0000021062654],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002773383,0.002715851,0.020979656,0.001049296,0.0010871778,0.00021782305,0.014996676,0.30409613,0.1358441,0.22430056,0.23642445,0.058010947],"study_design_scores_gemma":[0.009525176,0.0015528438,0.019495577,0.0004262696,0.00015322548,0.0031963077,0.0014289869,0.17311253,0.001013429,0.008292889,0.7807191,0.0010836642],"about_ca_topic_score_codex":0.00013656527,"about_ca_topic_score_gemma":0.00018182311,"teacher_disagreement_score":0.83171004,"about_ca_system_score_codex":0.000033273263,"about_ca_system_score_gemma":0.00009331131,"threshold_uncertainty_score":0.34261414},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014713074715303037,"score_gpt":0.26768132027812186,"score_spread":0.2529682455628188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169957670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25753132,0.00006848671,0.73905045,0.0002938171,0.0019364913,0.0008466478,0.000075004835,0.00017165436,0.00002614126],"genre_scores_gemma":[0.9866848,0.00008398071,0.012622549,0.00017961001,0.00012812845,0.0002074704,0.000016224072,0.000014028225,0.00006323365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979777,0.0001182855,0.0005863702,0.00045915123,0.00047409732,0.0003844053],"domain_scores_gemma":[0.9986237,0.00015957105,0.00021238162,0.0005507338,0.00037069016,0.00008287091],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005158991,0.00026862763,0.00026770637,0.00030080337,0.0013153979,0.0003927873,0.00038752967,0.00016085902,0.000014572293],"category_scores_gemma":[0.0000052500154,0.00020878807,0.00019255323,0.0007510131,0.00003652619,0.0011695173,0.0000026949033,0.00033112115,0.000008889521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001309704,0.0012726525,0.000085489366,0.00022796694,0.00035772336,0.0000056322774,0.008668175,0.22823709,0.25493562,0.018445443,0.00049694825,0.48595756],"study_design_scores_gemma":[0.0012971833,0.0006648546,0.00025662498,0.00013267253,0.000047268793,0.000025652784,0.0005490607,0.8607133,0.13381715,0.00025228094,0.001933253,0.0003106922],"about_ca_topic_score_codex":0.00009323114,"about_ca_topic_score_gemma":0.00036875592,"teacher_disagreement_score":0.72915345,"about_ca_system_score_codex":0.00021394718,"about_ca_system_score_gemma":0.0000614941,"threshold_uncertainty_score":0.99998474},"labels":[],"label_agreement":null},{"id":"W2173740000","doi":"10.4108/sesa.2.3.e4","title":"WG-8: A Lightweight Stream Cipher for Resource-Constrained Smart Devices","year":2015,"lang":"en","type":"article","venue":"ICST Transactions on Security and Safety","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Computer science; Cryptography; Stream cipher attack; Embedded system; Cipher; Block cipher; Context (archaeology); Implementation; Computer network; Computer security; Encryption","score_opus":0.025656921461367756,"score_gpt":0.26896709231014443,"score_spread":0.24331017084877668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173740000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019629484,0.00017477965,0.9694407,0.0047652945,0.00033279211,0.00059171434,0.00027941584,0.00021724164,0.0045685815],"genre_scores_gemma":[0.98713684,0.000056137873,0.011853536,0.0007118495,0.00005451171,0.00007014149,0.000030478532,0.00001190794,0.00007459729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985402,0.000085692714,0.0003458093,0.00044251332,0.0002591829,0.00032659015],"domain_scores_gemma":[0.9989191,0.00021396093,0.00007441548,0.00039279077,0.00013591298,0.00026376266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005091622,0.00020085792,0.0002204023,0.00017892697,0.00051990134,0.00018867168,0.0003133528,0.00011179824,0.000054764707],"category_scores_gemma":[0.000011478741,0.00018794308,0.0001401902,0.00043394856,0.000111778514,0.0004198083,0.000013092463,0.00020153502,0.0000071800528],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009066341,0.0021572486,0.000789184,0.00022437086,0.0005145404,0.000026640437,0.052183334,0.00035660845,0.000083531675,0.61877674,0.005662397,0.31831878],"study_design_scores_gemma":[0.006033429,0.0010578627,0.001016122,0.00006500268,0.00011813216,0.000075013835,0.004412492,0.026518535,0.0010232688,0.051679574,0.9070728,0.00092780264],"about_ca_topic_score_codex":0.00009312894,"about_ca_topic_score_gemma":0.0010620193,"teacher_disagreement_score":0.96750736,"about_ca_system_score_codex":0.000045824083,"about_ca_system_score_gemma":0.000122368,"threshold_uncertainty_score":0.76640964},"labels":[],"label_agreement":null},{"id":"W2183031293","doi":"10.1007/978-3-642-34159-5_2","title":"On the Security of Hummingbird-2 against Side Channel Cube Attacks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Initialization; Hummingbird; Cipher; Side channel attack; Cryptography; Algorithm; Encryption; Theoretical computer science; Computer network","score_opus":0.025865510246706865,"score_gpt":0.2700881439843144,"score_spread":0.24422263373760755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183031293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020298662,0.00044046374,0.9903435,0.0012670236,0.0012666992,0.0004943525,0.000018352664,0.00008525483,0.0040544574],"genre_scores_gemma":[0.976714,0.00010619249,0.020323548,0.0024749157,0.0003082003,0.000014077254,0.000006757209,0.000026391841,0.000025929694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663675,0.000063686,0.0005875725,0.0009348361,0.0010953988,0.00068177714],"domain_scores_gemma":[0.9965467,0.0010220639,0.00041101858,0.0016316924,0.00024451458,0.0001440343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014454412,0.0004592698,0.00045515108,0.00069042615,0.00039429858,0.00025777935,0.0032042905,0.00021643109,0.000036569156],"category_scores_gemma":[0.000094277326,0.00033717233,0.00021379601,0.0007777723,0.00083759666,0.00039827422,0.0011467146,0.00082783494,0.00002344733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008633109,0.00014019407,0.00008165501,0.00006731294,0.000036597357,0.000024533163,0.007711027,0.004013061,0.00014005788,0.6415592,0.00020393508,0.3460138],"study_design_scores_gemma":[0.00041331752,0.00030523847,0.00030872438,0.00047111546,0.000018282422,0.000026958014,0.0000031948894,0.17125738,0.0033334908,0.8193954,0.0034914275,0.00097542594],"about_ca_topic_score_codex":0.000034523582,"about_ca_topic_score_gemma":0.00013240169,"teacher_disagreement_score":0.9746841,"about_ca_system_score_codex":0.00012132281,"about_ca_system_score_gemma":0.00024302484,"threshold_uncertainty_score":0.99990803},"labels":[],"label_agreement":null},{"id":"W2184893281","doi":"10.1109/cns.2015.7346831","title":"Hamming distance as a metric for the detection of CRC-based side-channel communications in 802.11 wireless networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamming distance; Cyclic redundancy check; Computer science; Channel (broadcasting); Polynomial; Wireless; Metric (unit); Algorithm; Hamming code; Mathematics; Computer network; Telecommunications; Block code; Decoding methods; Engineering","score_opus":0.0609674345719318,"score_gpt":0.32142327659594766,"score_spread":0.26045584202401584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184893281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011451998,0.0003809372,0.98676276,0.00078042777,0.0001167108,0.0003514817,0.0000027525543,0.000033780183,0.00011915788],"genre_scores_gemma":[0.98669934,0.000024694691,0.012983213,0.00013971653,0.00001127747,0.00012563154,0.000004446714,0.0000041122607,0.0000075424687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992332,0.00007064118,0.00025261,0.00014302255,0.00014519709,0.00015532713],"domain_scores_gemma":[0.9983077,0.0006932043,0.000106517036,0.00068728765,0.00016447023,0.00004083003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006937922,0.000068679285,0.000100423444,0.00018751714,0.0001632981,0.00006307338,0.0007154744,0.000030284094,0.0000013195087],"category_scores_gemma":[0.00007633288,0.000052944564,0.000057227247,0.0015015196,0.0000628839,0.00017566212,0.0001211316,0.00007619452,4.823452e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091305425,0.00076799747,0.010235244,0.00005135569,0.00007343894,0.0000017451762,0.0076109744,0.038492996,0.00035381154,0.6189735,0.00052216736,0.32282546],"study_design_scores_gemma":[0.00055942044,0.00006324739,0.0019016931,0.000009495694,0.0000070393176,9.0568085e-7,0.0008200252,0.9906736,0.0004765999,0.0040616416,0.001349183,0.00007716269],"about_ca_topic_score_codex":0.0017499016,"about_ca_topic_score_gemma":0.015708715,"teacher_disagreement_score":0.9752474,"about_ca_system_score_codex":0.00003771832,"about_ca_system_score_gemma":0.000060822596,"threshold_uncertainty_score":0.87658316},"labels":[],"label_agreement":null},{"id":"W218666475","doi":"10.1007/978-3-642-42045-0_24","title":"A Heuristic for Finding Compatible Differential Paths with Application to HAS-160","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Heuristic; Collision; Algorithm; Differential (mechanical device); Theoretical computer science; Artificial intelligence; Programming language; Physics","score_opus":0.023922052616810286,"score_gpt":0.27056490531882027,"score_spread":0.24664285270200997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W218666475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009205727,0.000031380834,0.99589926,0.0007115653,0.00050542474,0.0015512249,0.0000216524,0.00010566724,0.00025326732],"genre_scores_gemma":[0.5449688,0.0000030828476,0.45407376,0.0005213076,0.00018660433,0.00015655259,0.0000244726,0.000022243956,0.000043176442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712485,0.000016252805,0.00042025073,0.0012248416,0.0006451136,0.000568662],"domain_scores_gemma":[0.9979664,0.00035978135,0.00022951927,0.00096156914,0.0002961969,0.00018651725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030176152,0.0003956317,0.00040120026,0.0007858982,0.00049885054,0.0009577597,0.0018146911,0.00012808054,0.000035061476],"category_scores_gemma":[0.000025310312,0.00033458867,0.00009259697,0.0006505662,0.0002873249,0.00033939132,0.0005413003,0.00030127025,0.000026627771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018377421,0.00008386526,0.00015243678,0.00010003829,0.00002296073,0.000008397422,0.0028792494,0.008721453,0.00038638484,0.14670601,0.000194434,0.8407264],"study_design_scores_gemma":[0.0006836715,0.0006495836,0.00077798206,0.00025393447,0.000019923236,0.000022239812,0.0000010129648,0.8435241,0.0005154424,0.14829573,0.0043690833,0.0008873164],"about_ca_topic_score_codex":0.00007411787,"about_ca_topic_score_gemma":0.00032804892,"teacher_disagreement_score":0.8398391,"about_ca_system_score_codex":0.00014646747,"about_ca_system_score_gemma":0.00027001175,"threshold_uncertainty_score":0.9999106},"labels":[],"label_agreement":null},{"id":"W2188063272","doi":"10.1007/978-3-642-27901-0_3","title":"Automated Verification of Block Cipher Modes of Operation, an Improved Method","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Assertion; CBC-MAC; Block cipher; Block cipher mode of operation; Set (abstract data type); Theoretical computer science; Block (permutation group theory); Cipher; Chaining; Programming language; Encryption; Algorithm; Computer security; Mathematics","score_opus":0.025241393100882834,"score_gpt":0.3130831843726585,"score_spread":0.2878417912717756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188063272","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013281986,0.00019000418,0.997324,0.000101893485,0.00033739064,0.00035612375,0.000014086717,0.00012017861,0.00022812287],"genre_scores_gemma":[0.49444687,0.000014485164,0.5053835,0.00007268781,0.00005107625,0.00000526716,0.00001031312,0.000009356888,0.0000064749506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769676,0.0000705377,0.00066955824,0.0007035285,0.0005413709,0.0003182479],"domain_scores_gemma":[0.9976605,0.00017350727,0.00044609085,0.001136555,0.00048295018,0.00010039347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011640274,0.0002724162,0.00040190143,0.0006222696,0.00013028752,0.00012740573,0.0015813744,0.00018555913,0.00002489351],"category_scores_gemma":[0.00003073129,0.00025139964,0.00009121288,0.0005981378,0.00033705647,0.0007682895,0.00035578877,0.00023284389,0.000001686445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013692189,0.00023236846,0.000208352,0.00012798836,0.000043640717,0.0000021054286,0.0066930796,0.047979712,0.056072023,0.16305359,0.000013271846,0.7255602],"study_design_scores_gemma":[0.00020784869,0.00016024437,0.0004956233,0.000053260967,0.000012302942,0.00000975827,9.666612e-7,0.9561147,0.023654804,0.018919922,0.000102745325,0.0002678003],"about_ca_topic_score_codex":0.00011241604,"about_ca_topic_score_gemma":0.000102216545,"teacher_disagreement_score":0.908135,"about_ca_system_score_codex":0.000065422995,"about_ca_system_score_gemma":0.00032085212,"threshold_uncertainty_score":0.9999938},"labels":[],"label_agreement":null},{"id":"W2212324774","doi":"10.1007/978-1-4419-6655-1_3","title":"Efficient Key Management: Heuristics","year":2010,"lang":"en","type":"book-chapter","venue":"Advances in information security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Key management; Computer science; Key (lock); Computer security; Heuristics; Hierarchy; Cryptography; Extension (predicate logic)","score_opus":0.005830391074595615,"score_gpt":0.2484860310130281,"score_spread":0.24265563993843248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212324774","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074609234,0.0005337614,0.2008085,0.00013713074,0.0013004229,0.00057677017,0.00010315575,0.00016497541,0.79630065],"genre_scores_gemma":[0.45517758,0.033583067,0.4806951,0.00673271,0.0009742537,0.00063617766,0.0030390932,0.00020399784,0.018958014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800104,0.000013786051,0.0008127886,0.00028403063,0.0005833929,0.00030494234],"domain_scores_gemma":[0.99847543,0.00007272213,0.00045183205,0.000746465,0.00016636588,0.00008718138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037822334,0.000302064,0.0002703742,0.0006606385,0.00017705275,0.00021554901,0.0008550367,0.00021857725,0.00016480347],"category_scores_gemma":[0.000018961531,0.00031973218,0.00011372132,0.00021104631,0.000110386274,0.0013187003,0.0004031945,0.0006667804,0.0002067569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036118163,0.000017345816,0.00000914618,0.00011467052,0.000008740691,0.000006302362,0.0015505207,0.00016268581,9.86802e-8,0.9679572,0.00014927433,0.030020403],"study_design_scores_gemma":[0.00033600556,0.000019611403,0.000046225552,0.000056993205,0.000007903989,0.0000071771233,0.000044976463,0.0063323323,0.000005363955,0.24724834,0.74559504,0.00030005217],"about_ca_topic_score_codex":0.0000067571536,"about_ca_topic_score_gemma":0.000094036535,"teacher_disagreement_score":0.7773427,"about_ca_system_score_codex":0.000074898606,"about_ca_system_score_gemma":0.00003908572,"threshold_uncertainty_score":0.9999255},"labels":[],"label_agreement":null},{"id":"W2215267035","doi":"10.1109/norchip.2015.7364404","title":"Secured-by-design FPGA: look-up tables and switch-boxes","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Robustness (evolution); Field-programmable gate array; Lookup table; NMOS logic; Computer science; Multiplexer; Embedded system; Computer hardware; Logic gate; Engineering; Electrical engineering; Voltage; Multiplexing; Transistor; Operating system; Algorithm","score_opus":0.041169787148678263,"score_gpt":0.2793153861560373,"score_spread":0.23814559900735904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2215267035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01763583,0.0005066348,0.978912,0.0012424714,0.00021660265,0.00015097689,0.000008109382,0.00012735894,0.0012000462],"genre_scores_gemma":[0.9233813,0.00007045382,0.07546266,0.0005661983,0.000034520544,0.000017301028,0.000008919091,0.000006728224,0.00045189334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990977,0.000048037717,0.00015357175,0.00026922583,0.0002117984,0.0002196535],"domain_scores_gemma":[0.99939156,0.00006226939,0.0000387632,0.00026998916,0.00007896778,0.00015847076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003793404,0.00010594403,0.00010771519,0.00007907758,0.000111753056,0.00025406093,0.0002996381,0.000034294808,0.000056287554],"category_scores_gemma":[0.000018758004,0.000087659944,0.000023275072,0.00029184326,0.000047448837,0.00045842203,0.00016210866,0.00005808978,0.000015827412],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009967465,0.00009961195,0.0018317342,0.00001165011,0.000036317142,0.000007879521,0.0045751114,0.000013898598,0.0006456024,0.5216843,0.43632123,0.03476269],"study_design_scores_gemma":[0.006010822,0.0011402763,0.0025309701,0.000035256046,0.000056259123,0.00016337726,0.006610538,0.08537892,0.026547046,0.37639073,0.49334583,0.0017899787],"about_ca_topic_score_codex":0.00035798576,"about_ca_topic_score_gemma":0.0001207212,"teacher_disagreement_score":0.9057455,"about_ca_system_score_codex":0.000011930178,"about_ca_system_score_gemma":0.00005958976,"threshold_uncertainty_score":0.35746688},"labels":[],"label_agreement":null},{"id":"W2229421925","doi":"","title":"Deciding insecurity for non-atomic keys","year":2001,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Encryption; Computer science; Joint (building); Upper and lower bounds; Computer security; Order (exchange); Work (physics); Theoretical computer science; Mathematics; Engineering; Business","score_opus":0.016891233048461966,"score_gpt":0.2544011380270959,"score_spread":0.23750990497863395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2229421925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22978322,0.000097358075,0.75689673,0.0057193795,0.00011764423,0.00029164526,0.000010323409,0.00014985798,0.0069338162],"genre_scores_gemma":[0.8554571,0.00015519795,0.14364196,0.00017611696,0.00001535284,0.00006719533,0.00005004558,0.000013016732,0.00042397613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977174,0.00082443794,0.00035208676,0.00048625408,0.00025175995,0.00036808362],"domain_scores_gemma":[0.9964608,0.0010693241,0.00018061546,0.0011975693,0.0009455303,0.00014617783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003312141,0.0001630973,0.00017504525,0.00019593231,0.0005941762,0.00041509053,0.0011993967,0.00007238353,0.000058115853],"category_scores_gemma":[0.00043248324,0.00017569277,0.00015277944,0.00077337486,0.00008776322,0.0004342393,0.00036515144,0.00014302085,0.000020327125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007911469,0.0003985339,0.009203685,0.000027380489,0.000032302967,0.0000037732023,0.010594209,0.000003666331,0.0029454448,0.8835875,0.0024787148,0.09071688],"study_design_scores_gemma":[0.005111243,0.000004255652,0.044867117,0.00062808103,0.00005916128,0.00010305628,0.00068451115,0.38885123,0.103207886,0.1688873,0.28603923,0.0015569367],"about_ca_topic_score_codex":0.00043043887,"about_ca_topic_score_gemma":0.0014803911,"teacher_disagreement_score":0.71470016,"about_ca_system_score_codex":0.00005322524,"about_ca_system_score_gemma":0.00010906396,"threshold_uncertainty_score":0.7164543},"labels":[],"label_agreement":null},{"id":"W2245855709","doi":"10.1109/iscisc.2015.7387896","title":"A low-cost and flexible FPGA implementation for SPECK block Cipher","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Field-programmable gate array; Computer science; Block cipher; Embedded system; Block (permutation group theory); Flexibility (engineering); Cipher; Throughput; Logic block; Architecture; Computer hardware; Cryptography; Computer architecture; Operating system; Encryption; Computer security","score_opus":0.05723906372202919,"score_gpt":0.3525105009855113,"score_spread":0.2952714372634821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245855709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08550763,0.00003216576,0.9091058,0.00161196,0.00022303507,0.00073962123,0.000017506454,0.00012994591,0.00263238],"genre_scores_gemma":[0.9099744,0.000008964686,0.088776395,0.00071099715,0.0000749367,0.00011885135,0.000024877625,0.000007319376,0.0003032813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924797,0.00001546538,0.00016729187,0.00022146947,0.00014076006,0.0002070567],"domain_scores_gemma":[0.9995069,0.000033112683,0.00004183471,0.00019509328,0.00010539505,0.00011766064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002759302,0.000078340614,0.0000777888,0.00008114087,0.00009944981,0.00017940173,0.00016951846,0.000019692687,0.000067128254],"category_scores_gemma":[0.0000083895475,0.00007032123,0.000031486667,0.00023422127,0.000018905626,0.0003467371,0.00009409545,0.000027699376,0.000008348303],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025678553,0.00018284132,0.0069559417,0.0000373914,0.00004949049,0.0000027077463,0.0063667423,0.000021511205,0.00044435146,0.571309,0.13101111,0.28359327],"study_design_scores_gemma":[0.01523745,0.0011719527,0.024192264,0.000023268347,0.00006451199,0.00007323665,0.012074317,0.035367347,0.058201015,0.1943533,0.6578432,0.0013981736],"about_ca_topic_score_codex":0.00013724659,"about_ca_topic_score_gemma":0.00042912413,"teacher_disagreement_score":0.82446676,"about_ca_system_score_codex":0.000020621397,"about_ca_system_score_gemma":0.000055010703,"threshold_uncertainty_score":0.28676164},"labels":[],"label_agreement":null},{"id":"W2282001118","doi":"10.17485/ijst/2016/v9i3/80087","title":"Analysis of Quarter Rounds of Salsa and Chacha Core and Proposal of an Alternative Design to Maximize Diffusion","year":2016,"lang":"en","type":"article","venue":"Indian Journal of Science and Technology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Diffusion; SALSA; Algorithm; Quarter (Canadian coin); Rotation (mathematics); Core (optical fiber); S-box; Block cipher; Cryptography; Artificial intelligence","score_opus":0.019395770576400406,"score_gpt":0.2881566373297365,"score_spread":0.2687608667533361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282001118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91444415,0.000051072017,0.08417408,0.0012175153,0.000028213844,0.00007274381,0.0000059549,0.0000031197612,0.0000031249192],"genre_scores_gemma":[0.979618,0.000069736096,0.02028989,0.000015649777,0.000003880229,9.644776e-7,6.6924564e-8,0.0000012106943,5.77885e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990758,0.00002616875,0.00032636145,0.00016697116,0.00027188877,0.00013285526],"domain_scores_gemma":[0.99890935,0.000059098395,0.00036014072,0.0001636531,0.00042257542,0.00008516028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009438732,0.000062059065,0.0002517706,0.002085392,0.000077411096,0.000021527012,0.0004229252,0.000041100662,0.0000033906565],"category_scores_gemma":[0.000074334544,0.00003939379,0.00002273175,0.0019937854,0.0012572589,0.00044446412,0.00013457284,0.0000554327,2.984694e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007003953,0.00020023138,0.13389872,0.000019740479,0.00018269797,0.000037752212,0.014656764,0.0000049980167,0.3878089,0.058733154,0.000009052196,0.40437794],"study_design_scores_gemma":[0.004391018,0.014784277,0.39830115,0.00036799282,0.0003579438,0.0009292302,0.01301447,0.010558808,0.36957017,0.18713708,0.000052846917,0.0005350225],"about_ca_topic_score_codex":0.000023959721,"about_ca_topic_score_gemma":0.00003696604,"teacher_disagreement_score":0.40384293,"about_ca_system_score_codex":0.000010450163,"about_ca_system_score_gemma":0.00011261385,"threshold_uncertainty_score":0.46324226},"labels":[],"label_agreement":null},{"id":"W2289372344","doi":"10.1007/s13389-016-0121-x","title":"Implementation of a leakage-resilient ElGamal key encapsulation mechanism","year":2016,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Leakage (economics); Computer science; Cryptography; Theoretical computer science; Bounded function; Exponentiation; Mathematics; Distributed computing; Computer security","score_opus":0.007163993448245064,"score_gpt":0.246449513312325,"score_spread":0.23928551986407995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289372344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43240702,0.00007414097,0.5669565,0.00021232727,0.00024975036,0.0000678085,0.0000024506787,0.000019311772,0.000010675524],"genre_scores_gemma":[0.94582427,0.00012265862,0.05394936,0.00001645247,0.00007178715,0.0000042287634,5.1817625e-7,0.000009690372,0.000001062629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982928,0.00003965351,0.0007799065,0.00014659423,0.00050209987,0.00023891582],"domain_scores_gemma":[0.99875534,0.0001074355,0.00049885316,0.00024032577,0.0002933073,0.00010476045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067005947,0.00014109902,0.00023220204,0.00090408855,0.00004981615,0.00004478175,0.0004172531,0.000048678845,0.0000504838],"category_scores_gemma":[0.000035670826,0.000104891464,0.00023269634,0.0007616731,0.000024218227,0.0007777532,0.000065065855,0.00010559975,9.341902e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001314091,0.00007686403,0.0067762653,0.000046259083,0.00014054969,0.0000126678915,0.0012617608,0.00044012093,0.2994361,0.66264695,0.000076092656,0.029073263],"study_design_scores_gemma":[0.011425311,0.0030266978,0.4838344,0.0008998253,0.00026225613,0.00053270604,0.0017154526,0.015989656,0.37519795,0.10024849,0.005332751,0.0015345234],"about_ca_topic_score_codex":0.000016709037,"about_ca_topic_score_gemma":0.000012451651,"teacher_disagreement_score":0.56239843,"about_ca_system_score_codex":0.00003356431,"about_ca_system_score_gemma":0.000060675746,"threshold_uncertainty_score":0.42773497},"labels":[],"label_agreement":null},{"id":"W2290057273","doi":"10.1109/iscc.2015.7405614","title":"Weak keys and plaintext recovery for the Dhall-Pal Block Cipher","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Plaintext; Block cipher; Computer science; Ciphertext; Transposition cipher; Cipher; Encryption; Theoretical computer science; Computer security; Computer network; Arithmetic; Running key cipher; Mathematics","score_opus":0.04715203497774874,"score_gpt":0.29117650633444153,"score_spread":0.2440244713566928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290057273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03977142,0.00022057953,0.94594985,0.005794977,0.00045192553,0.00035127654,0.000006409624,0.00006937901,0.007384178],"genre_scores_gemma":[0.96485627,0.00003360678,0.0331541,0.0009628735,0.000084517946,0.00004535005,0.0000022580089,0.0000051622,0.00085585384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994459,0.000018986259,0.00010933376,0.0001624985,0.00011286925,0.00015037617],"domain_scores_gemma":[0.99941355,0.00019064102,0.000026596019,0.00023623751,0.00006775705,0.00006522623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033973865,0.00006244723,0.0000594147,0.000033619042,0.00013694866,0.0001666358,0.00026916855,0.000021267233,0.000033052107],"category_scores_gemma":[0.000028363478,0.00003949933,0.000038182818,0.000130409,0.00003387465,0.0001772673,0.00012585899,0.00004119795,0.000007626753],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026071162,0.00007749331,0.0018468103,0.000009591735,0.00007286028,0.0000014404734,0.0034685512,0.000049903138,0.00006930893,0.70265925,0.18505305,0.10666565],"study_design_scores_gemma":[0.002657479,0.0006402354,0.0071409135,0.000010177698,0.00003316251,0.000056521047,0.0050733034,0.12989756,0.0004337313,0.10814583,0.7454522,0.00045883787],"about_ca_topic_score_codex":0.00010276672,"about_ca_topic_score_gemma":0.00032952699,"teacher_disagreement_score":0.9250848,"about_ca_system_score_codex":0.000009287466,"about_ca_system_score_gemma":0.000035431243,"threshold_uncertainty_score":0.1610736},"labels":[],"label_agreement":null},{"id":"W2293245479","doi":"10.1007/978-3-319-24126-5_8","title":"Meet-in-the-Middle Attacks on Round-Reduced Khudra","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Block cipher; Key (lock); Block (permutation group theory); Man-in-the-middle attack; Property (philosophy); Arithmetic; Algorithm; Theoretical computer science; Computer security; Cryptography; Mathematics","score_opus":0.07174770758530592,"score_gpt":0.3082569872142587,"score_spread":0.2365092796289528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293245479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011301911,0.00036416322,0.9828592,0.0023337395,0.0017595862,0.0006084553,0.000007812472,0.00009392666,0.01084292],"genre_scores_gemma":[0.8602071,0.000054577886,0.13251294,0.006028192,0.0008210774,0.000047121524,0.000021474923,0.00004946892,0.00025807886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571544,0.00008665195,0.00057947496,0.0013560405,0.0015287654,0.0007336269],"domain_scores_gemma":[0.99711126,0.0005367029,0.00023609743,0.001738383,0.0002243766,0.00015317739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019375241,0.0004975404,0.00044828732,0.0010494879,0.00030830962,0.0008421449,0.0044118734,0.0002262338,0.000029082927],"category_scores_gemma":[0.000070038346,0.00038639418,0.00014966342,0.0012189545,0.0004935733,0.00051408587,0.0007245714,0.0008070097,0.00004471667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013499883,0.00018566517,0.00009330341,0.000041075076,0.000017886121,0.0002307998,0.011772881,0.010751225,0.000044900036,0.56805307,0.00091832015,0.4078774],"study_design_scores_gemma":[0.0010609482,0.0007888301,0.00039512824,0.0005038413,0.000015742673,0.00015791912,0.000007903383,0.14647765,0.00021746536,0.82217115,0.026763402,0.0014400315],"about_ca_topic_score_codex":0.000077205026,"about_ca_topic_score_gemma":0.0006176342,"teacher_disagreement_score":0.85907686,"about_ca_system_score_codex":0.00029741524,"about_ca_system_score_gemma":0.00054725027,"threshold_uncertainty_score":0.9998588},"labels":[],"label_agreement":null},{"id":"W2294664220","doi":"10.1007/978-3-319-24126-5_9","title":"Improved Key Recovery Attack on Round-reduced Hierocrypt-L1 in the Single-Key Setting","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Block cipher; Key (lock); Differential cryptanalysis; Cryptanalysis; Linear cryptanalysis; Key schedule; Theoretical computer science; Computer security; Algorithm; Arithmetic; Cryptography; Mathematics","score_opus":0.05472513066745953,"score_gpt":0.299097783006187,"score_spread":0.24437265233872746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294664220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005447381,0.00027890544,0.9847227,0.0028057524,0.0020588844,0.0007929836,0.000012920846,0.00011890936,0.0037616093],"genre_scores_gemma":[0.69452155,0.000038297127,0.2982548,0.0059497426,0.0009409038,0.000050187464,0.000038721642,0.00006619396,0.00013960384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520916,0.00014627271,0.0008177989,0.00159598,0.0013254223,0.0009053408],"domain_scores_gemma":[0.9964412,0.0009599847,0.00043041998,0.0017275499,0.00028440388,0.00015647085],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026352075,0.000608065,0.00052211934,0.0011193061,0.0004049312,0.001318678,0.0040663825,0.0002940087,0.000017382816],"category_scores_gemma":[0.00020017814,0.00047618293,0.00018769127,0.0013413783,0.0004612391,0.0007750382,0.00093685323,0.0012185556,0.00002159974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040649407,0.0002478799,0.00006708442,0.0000551617,0.000028817685,0.00016434936,0.0136697395,0.014460523,0.0006965658,0.043195453,0.00067190354,0.9267019],"study_design_scores_gemma":[0.0021333273,0.0023908976,0.00082676456,0.00103673,0.000033681546,0.0003171691,0.000022999679,0.50688446,0.0010154209,0.4650941,0.01743755,0.0028068854],"about_ca_topic_score_codex":0.0001053638,"about_ca_topic_score_gemma":0.0006187476,"teacher_disagreement_score":0.923895,"about_ca_system_score_codex":0.0005370775,"about_ca_system_score_gemma":0.00061196875,"threshold_uncertainty_score":0.999769},"labels":[],"label_agreement":null},{"id":"W2294665552","doi":"10.1007/978-3-319-24126-5_7","title":"Preimage Analysis of the Maelstrom-0 Hash Function","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Chaining; Cryptographic hash function; SHA-2; Collision attack; Checksum; Collision resistance; Function (biology); Hash chain; Theoretical computer science; Algorithm; Perfect hash function; Double hashing; Computer security; Operating system","score_opus":0.028741353292752597,"score_gpt":0.2728298333949039,"score_spread":0.2440884801021513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294665552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047450204,0.00019936502,0.99554586,0.00034896057,0.0010815862,0.000258954,0.000019879284,0.000045683806,0.0020251938],"genre_scores_gemma":[0.88416344,0.00001776053,0.11475172,0.0006391114,0.000167279,0.000008924693,0.000016490374,0.000017718688,0.00021757041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725705,0.000043412034,0.00047227246,0.0008107844,0.0010843285,0.000332175],"domain_scores_gemma":[0.997494,0.00016896575,0.0003619437,0.0015104696,0.00037636104,0.00008827759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091644307,0.00027246427,0.00042629903,0.0012099002,0.0001964443,0.0002464552,0.0025674207,0.00014014741,0.000049386865],"category_scores_gemma":[0.0000411204,0.00020049427,0.00028784946,0.0027171744,0.0005773089,0.0003651041,0.0011325724,0.00040998214,0.000004087792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012544407,0.00009764758,0.0024008125,0.000044426855,0.0004291607,0.000012522667,0.002541144,0.06571933,0.0002722038,0.25498846,0.0002559051,0.6732258],"study_design_scores_gemma":[0.0003643021,0.0002146573,0.010034526,0.00011104142,0.00036152688,0.000011298992,8.792173e-7,0.6721755,0.00033160055,0.31123725,0.00457679,0.0005805861],"about_ca_topic_score_codex":0.00006332154,"about_ca_topic_score_gemma":0.0005252933,"teacher_disagreement_score":0.8836889,"about_ca_system_score_codex":0.00012957108,"about_ca_system_score_gemma":0.00040267847,"threshold_uncertainty_score":0.8175919},"labels":[],"label_agreement":null},{"id":"W2295142259","doi":"","title":"Leaky Pseudo-Entropy Functions","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random oracle; Oracle; Leakage (economics); Random access; Computer science; Entropy (arrow of time); Random function; Pseudorandom number generator; Mathematics; Cryptography; Discrete mathematics; Algorithm; Random variable; Computer security; Computer network; Physics; Statistics; Encryption; Quantum mechanics; Public-key cryptography","score_opus":0.04413438673430796,"score_gpt":0.2582247373923497,"score_spread":0.21409035065804172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295142259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025349481,0.000008707621,0.9280678,0.0002722276,0.000291532,0.000063682215,0.0000013531612,0.00017930046,0.045765944],"genre_scores_gemma":[0.8991412,0.000005734866,0.09975338,0.0003597363,0.000023118162,0.0000116754745,0.0000021241801,0.0000025393326,0.00070048805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994821,0.000015188727,0.000105976025,0.00015472186,0.00009460039,0.00014743881],"domain_scores_gemma":[0.9995729,0.000011935651,0.000020899392,0.00030155532,0.000038597467,0.0000541519],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000777617,0.000052166964,0.000045277444,0.000082340885,0.0001352158,0.000049642458,0.00027772435,0.000015700169,0.001288721],"category_scores_gemma":[0.0000037465343,0.000043942677,0.00004659608,0.0003119271,0.000021483727,0.00029035402,0.0000828401,0.000044373828,0.00021343463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1175764e-7,0.000058159058,0.0032279575,7.990821e-7,0.0000077319955,0.0000017954744,0.0007650353,1.8860571e-7,0.000117664276,0.98166126,0.007131386,0.007027134],"study_design_scores_gemma":[0.0027526,0.0008551405,0.2899209,0.000011462673,0.0000533294,0.00014053396,0.003381203,0.036684673,0.0069281626,0.3373407,0.32055014,0.0013811713],"about_ca_topic_score_codex":0.00020151032,"about_ca_topic_score_gemma":0.000090357826,"teacher_disagreement_score":0.87379175,"about_ca_system_score_codex":0.000006324497,"about_ca_system_score_gemma":0.000017137228,"threshold_uncertainty_score":0.99962425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027001908834637576,"score_gpt":0.30172695956028045,"score_spread":0.27472505072564285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295169600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2693086,0.0000726622,0.7294881,0.00010664234,0.00035475215,0.0005918157,0.00002028155,0.000047159134,0.000010000955],"genre_scores_gemma":[0.87529296,0.000032383727,0.12454495,0.000029574456,0.000025891452,0.000055047505,0.0000021631404,0.000011598803,0.00000546734],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982939,0.00017956809,0.00067652576,0.00034991058,0.0002588779,0.00024121578],"domain_scores_gemma":[0.9980725,0.00079795695,0.0003271901,0.0004937433,0.0002440911,0.00006451021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006957205,0.00016936102,0.00031627662,0.00020395684,0.00021089989,0.000060714934,0.00039700672,0.000060993854,0.000009135234],"category_scores_gemma":[0.000008539111,0.00012730449,0.00010755585,0.0003808024,0.000051474955,0.00026009194,0.000015771735,0.000047338868,0.0000016732733],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052930287,0.0011777187,0.014747419,0.002073317,0.0021153071,0.000006034371,0.03432471,0.008539856,0.09534936,0.11648982,0.0016589854,0.7229882],"study_design_scores_gemma":[0.04729546,0.004136207,0.01307309,0.0022455333,0.0008825223,0.00019190618,0.016006315,0.23364337,0.651062,0.023610532,0.0044281553,0.003424921],"about_ca_topic_score_codex":0.00016165568,"about_ca_topic_score_gemma":0.00001993534,"teacher_disagreement_score":0.71956325,"about_ca_system_score_codex":0.000028003027,"about_ca_system_score_gemma":0.00006993753,"threshold_uncertainty_score":0.5191327},"labels":[],"label_agreement":null},{"id":"W2312683735","doi":"10.1145/2794093","title":"Preaveraging and Carry Propagate Approaches to Side-Channel Analysis of HMAC-SHA256","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Side channel attack; Field-programmable gate array; Hash-based message authentication code; Channel (broadcasting); Carry (investment); Implementation; Embedded system; Parallel computing; Computer engineering; Computer security; Computer network; Cryptography; Programming language; Message authentication code","score_opus":0.08258974328282559,"score_gpt":0.27166906846039257,"score_spread":0.18907932517756698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312683735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19793452,0.00004679361,0.8007682,0.00043617157,0.00023860752,0.00034486072,0.000028849077,0.000121575795,0.000080444304],"genre_scores_gemma":[0.9867065,0.000008332908,0.013139813,0.00004312533,0.000025141328,0.000032949523,0.000002786368,0.000011746404,0.000029600618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980573,0.00016919339,0.0005337476,0.00057730573,0.00033567802,0.0003267599],"domain_scores_gemma":[0.9982453,0.00040525376,0.00017869151,0.00092666043,0.00010162914,0.00014247822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058691023,0.00020031306,0.00040595184,0.00091552903,0.0002791339,0.00013471034,0.00059552555,0.00005690208,0.0000031962832],"category_scores_gemma":[0.000024341032,0.00015458374,0.00016772638,0.0017925772,0.00005000329,0.00022152619,0.00004768437,0.00009395259,0.0000032227485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011290499,0.00094999897,0.0046871044,0.0005769295,0.006540093,0.000026306996,0.074454255,0.33813462,0.009006801,0.053430572,0.00010804596,0.51197237],"study_design_scores_gemma":[0.0015950606,0.000439432,0.007709982,0.00043613146,0.0007095289,0.000050001367,0.0033399751,0.97721887,0.0056016287,0.0017986032,0.00019370108,0.000907086],"about_ca_topic_score_codex":0.00026345017,"about_ca_topic_score_gemma":0.000045427474,"teacher_disagreement_score":0.788772,"about_ca_system_score_codex":0.000049870647,"about_ca_system_score_gemma":0.00003649478,"threshold_uncertainty_score":0.6303742},"labels":[],"label_agreement":null},{"id":"W2317844489","doi":"10.1109/mwscas.2014.6908367","title":"Modeling the effect of NMOS gate capacitance in an on-chip decoupling capacitor PAA countermeasure","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"NMOS logic; Decoupling capacitor; Decoupling (probability); Capacitance; Capacitor; Electronic engineering; Countermeasure; Computer science; Chip; Electrical engineering; Engineering; Voltage; Control engineering; Transistor","score_opus":0.019186589667458082,"score_gpt":0.2734501677422255,"score_spread":0.25426357807476746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317844489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6286311,0.000010837385,0.37082922,0.00008401559,0.00012131121,0.00013401396,0.0000014435133,0.000025513255,0.0001625368],"genre_scores_gemma":[0.9971335,0.0000032336332,0.0026470385,0.00014151634,0.000042240576,0.000023257613,0.0000012575246,0.000005862473,0.000002090614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988207,0.00016675107,0.0002589567,0.0002586012,0.00026938284,0.00022556272],"domain_scores_gemma":[0.9990522,0.00024713532,0.000055509998,0.00053796935,0.000060930524,0.000046253022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013493322,0.00012134303,0.00016431484,0.000099186356,0.0001369554,0.0000881411,0.00055635936,0.000035647652,0.000007774107],"category_scores_gemma":[0.000047882124,0.00007766648,0.00005817009,0.00030338997,0.000042866403,0.00026902187,0.000028375345,0.00014907047,0.0000029670534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018281623,0.00033050755,0.14298086,0.00024267417,0.000085277454,0.000008168594,0.02135334,0.30627212,0.018682051,0.43126938,0.00017032657,0.078422464],"study_design_scores_gemma":[0.00040959968,0.00027726372,0.0012883793,0.000030321737,0.0000033208569,0.0000016077289,0.000103298065,0.9933647,0.0024076384,0.0019938366,0.000017964914,0.000102057515],"about_ca_topic_score_codex":0.00028321036,"about_ca_topic_score_gemma":0.0012446931,"teacher_disagreement_score":0.6870926,"about_ca_system_score_codex":0.000019971174,"about_ca_system_score_gemma":0.000014824577,"threshold_uncertainty_score":0.3167147},"labels":[],"label_agreement":null},{"id":"W2342284646","doi":"","title":"Design, development, and implementation of a public key cryptosystem for automated teller machines: the toronto dominion bank case study","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cryptosystem; Public-key cryptography; Computer science; Key management; Encryption; Computer security; Cryptography; Key (lock)","score_opus":0.04009995375135977,"score_gpt":0.32732665824144647,"score_spread":0.2872267044900867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342284646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4665627,0.000047612786,0.5319797,0.00012183911,0.00004486208,0.0010992562,0.0000029996206,0.00009791777,0.000043126434],"genre_scores_gemma":[0.91190535,0.0000015550828,0.08778504,0.000026280819,0.000013040694,0.00024392591,0.000010027118,0.0000059016684,0.000008877483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987137,0.00017277095,0.00048204916,0.0002513758,0.0001764651,0.00020363736],"domain_scores_gemma":[0.99920356,0.00019990918,0.00015701924,0.00025020537,0.00015300774,0.0000362839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010960215,0.00012352195,0.00013796153,0.00008056284,0.00041449378,0.00020565958,0.00022675468,0.000022713282,0.000024391196],"category_scores_gemma":[0.0000062681847,0.00008417998,0.000032085496,0.00024873615,0.000021324944,0.00047761403,0.000103565115,0.00002287929,3.5718e-7],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058893595,0.0024864515,0.09592517,0.00028281027,0.000641195,0.0001032777,0.14843167,0.00006318735,0.0029682803,0.38112178,0.009765511,0.35815176],"study_design_scores_gemma":[0.023880227,0.0021676084,0.15928808,0.00003494803,0.00015800628,0.0014547792,0.36441898,0.4200605,0.01140068,0.004187273,0.011222374,0.0017265578],"about_ca_topic_score_codex":0.012961283,"about_ca_topic_score_gemma":0.049613822,"teacher_disagreement_score":0.44534266,"about_ca_system_score_codex":0.000039313065,"about_ca_system_score_gemma":0.00012888658,"threshold_uncertainty_score":0.9936115},"labels":[],"label_agreement":null},{"id":"W2396626823","doi":"10.1007/978-3-319-43283-0_4","title":"Power Analysis Attacks Against IEEE 802.15.4 Nodes","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; IEEE 802.11b-1999; IEEE 802.1X; IEEE 802.15; Computer network; Embedded system; IEEE 802.11s; Inter-Access Point Protocol; IEEE 802.11g-2003; Advanced Encryption Standard; IEEE 802.11r-2008; IEEE 802.11w-2009; IEEE 802.11u; Encryption; NeuRFon; IEEE 802; IEEE 802.11; Wireless; Wireless network; Wireless sensor network; Wi-Fi; Wi-Fi array; Telecommunications","score_opus":0.01669764097324349,"score_gpt":0.2760203475502406,"score_spread":0.2593227065769971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396626823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007583503,0.00022487612,0.9887125,0.0007425289,0.0015454568,0.00028893503,0.000031952375,0.00016808543,0.0075273393],"genre_scores_gemma":[0.7833977,0.0001214261,0.21262495,0.0029760082,0.00038814114,0.000016498263,0.000014598771,0.000040967225,0.0004197234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995349,0.000048967584,0.00070324657,0.00182194,0.0012261417,0.00085073954],"domain_scores_gemma":[0.9965617,0.00047170382,0.000365815,0.0020043538,0.00035789903,0.00023852458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093530974,0.00059924216,0.0007036324,0.002472679,0.00042608273,0.0007620959,0.0035938956,0.00029132288,0.00017218053],"category_scores_gemma":[0.00003895992,0.00047915865,0.0004543489,0.0021761167,0.00076995,0.0007353518,0.0009524187,0.00055981486,0.00007163554],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010190834,0.000109425564,0.0015260344,0.000036930815,0.00041568273,0.00019976479,0.0027367421,0.010974616,0.00057787,0.122626506,0.00023391674,0.8605523],"study_design_scores_gemma":[0.0018878955,0.00055906776,0.005248614,0.00072306825,0.00030037906,0.000081990525,0.0000021770231,0.49709898,0.0026560286,0.46240783,0.024013927,0.0050200424],"about_ca_topic_score_codex":0.000016665588,"about_ca_topic_score_gemma":0.0002179323,"teacher_disagreement_score":0.8555323,"about_ca_system_score_codex":0.00023040983,"about_ca_system_score_gemma":0.0003818763,"threshold_uncertainty_score":0.999766},"labels":[],"label_agreement":null},{"id":"W2398989400","doi":"10.1007/978-3-319-29078-2_1","title":"Meet-in-the-Middle Attacks on Reduced Round Piccolo","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Block cipher; Arithmetic; Slide attack; Algorithm; Cryptography; Stream cipher attack; Mathematics","score_opus":0.04241792472172777,"score_gpt":0.28906257466779683,"score_spread":0.24664464994606905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398989400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002309372,0.00011923653,0.9834634,0.0036441307,0.0016175038,0.00058620167,0.000009076666,0.00008200026,0.008169086],"genre_scores_gemma":[0.92440516,0.000046493857,0.06896215,0.0056039975,0.0006507037,0.00004248594,0.0000055192886,0.00003395995,0.0002495125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613696,0.00007835056,0.0005502211,0.0013618504,0.0011403748,0.0007322278],"domain_scores_gemma":[0.99702233,0.00084668555,0.00023481103,0.0016514132,0.00013680349,0.00010793413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013658272,0.00045708654,0.00039558086,0.000990444,0.0003601394,0.00067014736,0.0040252744,0.00022168847,0.00003982768],"category_scores_gemma":[0.00005774559,0.0003125064,0.00015121124,0.0008813538,0.0005500681,0.00049014343,0.00064671534,0.0005997842,0.000045106724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010642654,0.000097229495,0.00008655755,0.000023037119,0.000012151636,0.0001396388,0.004673019,0.00075861363,0.000109515255,0.6288939,0.00019336324,0.3650023],"study_design_scores_gemma":[0.0011332313,0.00080837804,0.0009857734,0.0007960445,0.000012956698,0.00012489334,0.0000031854668,0.035975233,0.000697275,0.94408023,0.013971365,0.001411451],"about_ca_topic_score_codex":0.000029083074,"about_ca_topic_score_gemma":0.00047303754,"teacher_disagreement_score":0.9220958,"about_ca_system_score_codex":0.00025781264,"about_ca_system_score_gemma":0.00034998317,"threshold_uncertainty_score":0.9999327},"labels":[],"label_agreement":null},{"id":"W2401020796","doi":"","title":"A Cryptanalysis of HummingBird-2: The Differential Sequence Analysis.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; Computer science; Key (lock); Differential cryptanalysis; Cipher; Cryptanalysis; Theoretical computer science; Sequence (biology); Algorithm; Differential (mechanical device); Symmetric-key algorithm; Encryption; Cryptography; Computer security; Public-key cryptography","score_opus":0.04197999025954345,"score_gpt":0.3194083773701073,"score_spread":0.27742838711056383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401020796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17418116,0.00019706592,0.8230245,0.0009717714,0.0005133078,0.00039564463,0.00012324065,0.00009721635,0.00049607997],"genre_scores_gemma":[0.7896651,0.00011862817,0.20975427,0.00010337016,0.00010046355,0.00013050988,0.000112297304,0.000014542528,7.947474e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957895,0.0008174608,0.0010810358,0.001007899,0.00058064744,0.0007234497],"domain_scores_gemma":[0.9952061,0.0007121314,0.0009997755,0.0026789047,0.00022397094,0.00017910036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007641766,0.0004923293,0.0011276086,0.001060303,0.0003211158,0.00014683319,0.0033073283,0.00025357588,0.00035291276],"category_scores_gemma":[0.00009438916,0.00037365264,0.0013662362,0.0014112891,0.00076589803,0.00014366483,0.004528478,0.0011167098,0.000027469627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000141825185,0.00017845393,0.024063934,0.00004681384,0.003300223,0.000009645529,0.006775758,0.0006167133,0.00079403043,0.96015,0.00009636887,0.0039538653],"study_design_scores_gemma":[0.00035652064,0.000046754194,0.118534915,0.000029733585,0.0028599584,0.000018419585,0.00035113285,0.03700936,0.0006919673,0.83883363,0.0006280482,0.00063956593],"about_ca_topic_score_codex":0.0006188046,"about_ca_topic_score_gemma":0.0010569571,"teacher_disagreement_score":0.61548394,"about_ca_system_score_codex":0.00005505635,"about_ca_system_score_gemma":0.00020257258,"threshold_uncertainty_score":0.99987155},"labels":[],"label_agreement":null},{"id":"W2405026724","doi":"","title":"Channel Equalization for Side Channel Attacks.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Side channel attack; Computer science; Channel (broadcasting); Power analysis; Equalization (audio); Algorithm; Telecommunications; Cryptography","score_opus":0.04181677102258774,"score_gpt":0.326520209169371,"score_spread":0.2847034381467833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405026724","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008331151,0.00009770691,0.98352915,0.0029853038,0.0022339015,0.0015475012,0.0001915392,0.0003435341,0.00074019993],"genre_scores_gemma":[0.4413974,0.00017643561,0.55385315,0.0013848417,0.0006038384,0.0015414373,0.000969626,0.00006887694,0.0000043907444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961979,0.00039424445,0.00083676755,0.001429267,0.00031376604,0.0008280466],"domain_scores_gemma":[0.9964742,0.00093407894,0.00061123515,0.001490146,0.00027788721,0.00021246089],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008130304,0.0005405044,0.0007415267,0.0006230458,0.00039413985,0.00021615752,0.0018420256,0.00038351945,0.000026467233],"category_scores_gemma":[0.0002806224,0.0005721977,0.00047259932,0.00024663148,0.00024271414,0.00015943688,0.0027520123,0.00065739,0.000057717385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002745232,0.00011175204,0.000118117576,0.00017880353,0.00013669423,0.00000663551,0.00467723,0.0033134494,0.00009143789,0.9861215,0.0019722502,0.0032447176],"study_design_scores_gemma":[0.0006897921,0.00012830572,0.0012841015,0.000060294984,0.000040332703,0.000019413881,0.00011169911,0.1358642,0.0003678514,0.8559776,0.004913929,0.0005424613],"about_ca_topic_score_codex":0.00008965507,"about_ca_topic_score_gemma":0.00028510817,"teacher_disagreement_score":0.43306625,"about_ca_system_score_codex":0.00006586352,"about_ca_system_score_gemma":0.0002198683,"threshold_uncertainty_score":0.99967295},"labels":[],"label_agreement":null},{"id":"W2407686293","doi":"10.4213/mvk180","title":"Fault analysis of Kuznyechik","year":2016,"lang":"ru","type":"preprint","venue":"Математические вопросы криптографии","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Byte; Cipher; GOST (hash function); Slide attack; Fault (geology); Key (lock); Stream cipher; Attack model; Differential cryptanalysis; Computer security; Cryptography; Encryption; Computer hardware","score_opus":0.030192650122582026,"score_gpt":0.3226177342618357,"score_spread":0.29242508413925367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407686293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.199847,0.002023847,0.75983185,0.0041886573,0.0047620484,0.0021563892,0.0034954892,0.00056191155,0.023132786],"genre_scores_gemma":[0.9843164,0.0011356577,0.011512207,0.00047745847,0.0004637393,0.0001753746,0.00053200254,0.00009846753,0.001288676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9887932,0.00074903376,0.0032896518,0.0030626678,0.0023311279,0.0017742962],"domain_scores_gemma":[0.9890792,0.00086237513,0.0025242402,0.005474291,0.0013729022,0.00068702025],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0021288765,0.0014933713,0.0030617253,0.004572933,0.00058380206,0.00061623764,0.0049841586,0.0010272505,0.003300777],"category_scores_gemma":[0.00023713113,0.0013304173,0.003135818,0.007336633,0.0008112827,0.0007320336,0.004211974,0.0012453689,0.0002735049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030165247,0.003421584,0.073473305,0.0012973313,0.036254365,0.00021486287,0.018966615,0.002654563,0.006017024,0.60115194,0.014242537,0.24200425],"study_design_scores_gemma":[0.009081232,0.0016974177,0.46585056,0.002513822,0.029065493,0.000079403995,0.0023860575,0.19644022,0.009770189,0.14565559,0.12697364,0.010486342],"about_ca_topic_score_codex":0.0013546196,"about_ca_topic_score_gemma":0.0013437265,"teacher_disagreement_score":0.7844694,"about_ca_system_score_codex":0.00030719908,"about_ca_system_score_gemma":0.0009253429,"threshold_uncertainty_score":0.99978155},"labels":[],"label_agreement":null},{"id":"W2413472586","doi":"10.1007/s13389-016-0133-6","title":"An overview of hardware-level statistical power analysis attack countermeasures","year":2016,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Side channel attack; Power analysis; Computer science; Cryptography; Computer security; Encryption; Countermeasure; Variety (cybernetics); Hardware security module; Overhead (engineering); Embedded system; Artificial intelligence; Engineering; Programming language","score_opus":0.06317022046290896,"score_gpt":0.3366096217778632,"score_spread":0.27343940131495426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2413472586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1958163,0.00060314074,0.8031592,0.00010896909,0.00019421995,0.000042957276,0.000039723604,0.000022517708,0.000012993033],"genre_scores_gemma":[0.9211503,0.0003912947,0.07837729,0.000030761017,0.000036675974,0.0000018083477,0.0000012054531,0.000009789291,8.7824486e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980509,0.0000665383,0.0007818358,0.00018696886,0.0006485027,0.00026521314],"domain_scores_gemma":[0.9983212,0.00021762574,0.000367608,0.00043268985,0.00046319634,0.000197733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085344806,0.00016820784,0.00045139887,0.0012650301,0.000045127406,0.00007975126,0.00070371706,0.000055338944,0.00011184514],"category_scores_gemma":[0.00008894761,0.00011777496,0.0003795227,0.001634559,0.000060719114,0.00073567365,0.000050636416,0.00013909872,8.682372e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011810802,0.0010872647,0.1385221,0.0003287543,0.006357678,0.00020473209,0.002707105,0.011773758,0.058556676,0.7456877,0.0015584676,0.03309762],"study_design_scores_gemma":[0.0023159184,0.0012053126,0.9588713,0.0004201119,0.000766059,0.00014898342,0.00013306258,0.022937723,0.001633378,0.0038176614,0.0069885356,0.00076193706],"about_ca_topic_score_codex":0.000007833631,"about_ca_topic_score_gemma":0.000015505722,"teacher_disagreement_score":0.8203492,"about_ca_system_score_codex":0.000024073212,"about_ca_system_score_gemma":0.00006147164,"threshold_uncertainty_score":0.48027235},"labels":[],"label_agreement":null},{"id":"W2414074698","doi":"10.1002/sec.1453","title":"Two‐level security for message sequences","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Eavesdropping; Adversary; Computer security; Construct (python library); Encryption; Key (lock); Computer security model; Sequence (biology); Provable security; Information-theoretic security; Theoretical computer science; Computer network","score_opus":0.03194205530987518,"score_gpt":0.29844525940886896,"score_spread":0.26650320409899375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414074698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046714064,0.0058274656,0.934503,0.010056049,0.00022842154,0.00068854063,0.000087136636,0.00025275655,0.0016425205],"genre_scores_gemma":[0.9827367,0.002932622,0.013660534,0.0004522449,0.00005212896,0.00011758044,0.000025474861,0.0000072184944,0.000015459842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987191,0.00020645447,0.00030169616,0.000322062,0.00015198378,0.00029870402],"domain_scores_gemma":[0.9980552,0.00058110035,0.00014450261,0.0009623289,0.00015024109,0.000106622305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008283502,0.00014935603,0.00016892044,0.00007662724,0.0005737054,0.00018877028,0.00097619125,0.00008325622,0.000025210602],"category_scores_gemma":[0.00003583577,0.00011547716,0.00008143376,0.00029415736,0.00019748468,0.00066323654,0.0004174362,0.00014155336,0.0000022248248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010014795,0.00005683922,0.00060988875,0.000009148009,0.000022043614,2.9463516e-7,0.0019209473,0.0000097489365,0.000015853722,0.95423543,0.0013067368,0.041803066],"study_design_scores_gemma":[0.0025676084,0.00015436874,0.0024737914,0.00013497384,0.000030309428,0.000022680351,0.0006834322,0.08500579,0.00021946528,0.8774078,0.030691585,0.0006082089],"about_ca_topic_score_codex":0.0001108359,"about_ca_topic_score_gemma":0.00061556377,"teacher_disagreement_score":0.9360227,"about_ca_system_score_codex":0.00002312083,"about_ca_system_score_gemma":0.00003639417,"threshold_uncertainty_score":0.47090217},"labels":[],"label_agreement":null},{"id":"W2463836678","doi":"10.1007/s10207-016-0341-1","title":"HiveSec: security in resource-constrained wireless networks inspired by beehives and bee swarms","year":2016,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Boeing","keywords":"Computer science; Computer security; Security testing; Cryptography; Security through obscurity; Logical security; Computer security model; Wireless; Wireless security; Key (lock); Resource (disambiguation); Wireless network; Security convergence; Cloud computing security; Security service; Security information and event management; Software security assurance; Network security policy; Computer network; Information security; Telecommunications; Cloud computing","score_opus":0.005406614865520223,"score_gpt":0.24283989907514417,"score_spread":0.23743328420962395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2463836678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5970587,0.00017101587,0.39495763,0.0065010604,0.00046682107,0.00017137278,0.00009295643,0.00003148448,0.00054893346],"genre_scores_gemma":[0.9977088,0.0003168383,0.0012144429,0.0006411424,0.000089263296,0.0000049336336,0.000017822154,0.0000038753747,0.0000029045234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979275,0.00010473651,0.0009957999,0.00013445079,0.0006143423,0.00022321063],"domain_scores_gemma":[0.99834704,0.00023888786,0.00069266325,0.00013522386,0.00044707366,0.000139102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008350224,0.00015390551,0.00021669363,0.0005668503,0.000073951145,0.00028634997,0.00083698716,0.00008625844,0.00004230284],"category_scores_gemma":[0.00012307502,0.00011756769,0.00009899336,0.00028389296,0.00013284753,0.003976589,0.00021367407,0.00023999547,0.000003216159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005155611,0.0005966426,0.029908638,0.000051014365,0.0004254919,0.0000865624,0.04349349,0.00012993408,0.00209698,0.5296475,0.019845923,0.3732022],"study_design_scores_gemma":[0.04066984,0.0016432939,0.08344627,0.001716683,0.000081859886,0.0024452994,0.010751399,0.15901028,0.010931461,0.354161,0.33212343,0.0030191834],"about_ca_topic_score_codex":0.000037966456,"about_ca_topic_score_gemma":0.00004178538,"teacher_disagreement_score":0.40065005,"about_ca_system_score_codex":0.000097432734,"about_ca_system_score_gemma":0.00008542045,"threshold_uncertainty_score":0.47942713},"labels":[],"label_agreement":null},{"id":"W2467634029","doi":"10.20533/ijrfidsc.2046.3715.2013.0011","title":"Warbler: A Lightweight Pseudorandom Number Generator for EPC C1 Gen2 Passive RFID Tags","year":2013,"lang":"en","type":"article","venue":"International Journal of RFID Security and Cryptography","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Chemistry","keywords":"Pseudorandom number generator; Computer science; Random number generation; NIST; Randomness; Cryptanalysis; Elliptic Curve Digital Signature Algorithm; Generator (circuit theory); Pseudorandomness; Algorithm; Cryptography; Embedded system; Computer network; Public-key cryptography; Power (physics); Mathematics; Elliptic curve cryptography","score_opus":0.007038195215553784,"score_gpt":0.2578687261899595,"score_spread":0.2508305309744057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467634029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.700513,0.0010684582,0.2892945,0.0060098968,0.0020867144,0.00051074213,0.00009099326,0.00005050393,0.00037515088],"genre_scores_gemma":[0.9500134,0.0011173111,0.04687986,0.0012059042,0.0006723278,0.00007117302,0.000016656575,0.000016223365,0.0000071501113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767333,0.00009695941,0.00080539106,0.00034148997,0.0007291184,0.000353733],"domain_scores_gemma":[0.99692184,0.00023606204,0.00057698647,0.0002457781,0.0017424455,0.00027687405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040765182,0.00026225016,0.00036633576,0.0005485294,0.00024441176,0.0007199297,0.0010782144,0.000116057774,0.00028997596],"category_scores_gemma":[0.00005580982,0.00022120097,0.0004967236,0.00047067768,0.00013793765,0.0014516735,0.00017309592,0.0002850931,0.000011622617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041139234,0.001272455,0.032439426,0.00011639742,0.0025426417,0.0001493412,0.014024731,0.000016334816,0.0037682476,0.8172973,0.07010094,0.05786084],"study_design_scores_gemma":[0.013213568,0.00088067574,0.010804704,0.00019243191,0.00018104738,0.0013379662,0.0016131658,0.0064705526,0.006154291,0.7158618,0.2420492,0.0012406097],"about_ca_topic_score_codex":0.00007318692,"about_ca_topic_score_gemma":0.000028995173,"teacher_disagreement_score":0.24950036,"about_ca_system_score_codex":0.000032415785,"about_ca_system_score_gemma":0.000103782935,"threshold_uncertainty_score":0.90203136},"labels":[],"label_agreement":null},{"id":"W2483991929","doi":"10.1109/chinacom.2011.6158154","title":"FPGA implementation of two involutional block ciphers targeted to wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Block cipher; Wireless sensor network; Field-programmable gate array; Cryptography; Embedded system; Encryption; Cipher; RC4; Computer hardware; Computer network; Algorithm; Stream cipher","score_opus":0.03029263881720377,"score_gpt":0.296403879262455,"score_spread":0.2661112404452512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483991929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3874393,0.000014175851,0.6111623,0.00014929846,0.00017709425,0.00023142123,0.000009258386,0.00006620798,0.00075091346],"genre_scores_gemma":[0.91251326,0.000005030978,0.08708825,0.00030935992,0.000028996144,0.000021421576,0.000012692237,0.0000049508435,0.000016051334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99888295,0.000051836607,0.00032919733,0.00024901252,0.00022756634,0.00025943702],"domain_scores_gemma":[0.9993402,0.000029534891,0.00009285121,0.00027677545,0.00015385557,0.00010682056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002196369,0.000103490755,0.000117777,0.00015402067,0.000102172555,0.000028501683,0.0003388032,0.000026084545,0.00046312626],"category_scores_gemma":[0.000002412781,0.000099845165,0.00006550303,0.0006857353,0.00003246497,0.00022738894,0.00014335776,0.00005593973,0.0000085809925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031673666,0.00034087143,0.07089018,0.000018949873,0.00017163064,0.0000077541035,0.012533198,0.0012373999,0.0048058257,0.8186346,0.00802491,0.08330299],"study_design_scores_gemma":[0.008004278,0.0015674892,0.64510566,0.000047147696,0.00011007796,0.000054742046,0.018139347,0.17819652,0.11991456,0.021751432,0.0049454262,0.0021633275],"about_ca_topic_score_codex":0.0019508393,"about_ca_topic_score_gemma":0.001519822,"teacher_disagreement_score":0.79688317,"about_ca_system_score_codex":0.000024908291,"about_ca_system_score_gemma":0.000054333563,"threshold_uncertainty_score":0.50709075},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04848189568759899,"score_gpt":0.3120439594122597,"score_spread":0.26356206372466073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487705751","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024924998,0.0014704221,0.024158804,0.000040539322,0.0003577419,0.00042660453,0.00015130793,0.00015959928,0.97298574],"genre_scores_gemma":[0.7329994,0.0007771384,0.24950503,0.004344916,0.0008455077,0.00019915884,0.0000956404,0.0002079894,0.011025242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982102,0.000026894666,0.00050653744,0.00050654676,0.00046335303,0.00028645503],"domain_scores_gemma":[0.9980793,0.000022196946,0.00032314518,0.0011838075,0.00021404517,0.00017748823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012667854,0.00033519772,0.00042800105,0.00017935426,0.000088545574,0.0001528297,0.0011614965,0.00021738622,0.00021046547],"category_scores_gemma":[0.0000022777383,0.00032617478,0.00036419678,0.000075112,0.000121575526,0.00018374731,0.00022294073,0.00016572556,0.00006359081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016836236,0.00001805347,0.00002888755,0.00004012969,0.00005948339,0.000005376382,0.00008586957,3.408094e-7,0.000013967348,0.9748379,0.0015621079,0.023346215],"study_design_scores_gemma":[0.00021500337,0.00017992125,0.0002635614,0.00009152088,0.000033946013,0.000012725326,0.00000757064,0.000096500386,0.000025928575,0.9548373,0.043888334,0.000347664],"about_ca_topic_score_codex":0.00023807783,"about_ca_topic_score_gemma":0.00011813191,"teacher_disagreement_score":0.9619605,"about_ca_system_score_codex":0.000034577657,"about_ca_system_score_gemma":0.00011914314,"threshold_uncertainty_score":0.99991906},"labels":[],"label_agreement":null},{"id":"W2495348482","doi":"10.1109/aero.2016.7500941","title":"TPM-supported key agreement protocols for increased autonomy in constellation of spacecrafts","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Payload (computing); Spacecraft; Key (lock); Computer science; Constellation; Key management; Replay attack; Cryptography; Space exploration; Autonomy; Computer security; Protocol (science); Aerospace engineering; Authentication (law); Engineering; Physics","score_opus":0.03370981250498324,"score_gpt":0.31714974210280805,"score_spread":0.2834399295978248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495348482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061442964,0.0000019620109,0.92232513,0.0010738585,0.000034502573,0.011801899,0.00001625873,0.000041693474,0.0032617063],"genre_scores_gemma":[0.94029796,8.107616e-7,0.05787821,0.00007207944,0.000008769431,0.0016760386,0.000006194187,0.0000028778202,0.000057071935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99911624,0.00003701368,0.0003401181,0.00020191161,0.00013769728,0.0001670107],"domain_scores_gemma":[0.9993247,0.00013446432,0.00012165559,0.00028233262,0.00009187139,0.000044988803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040175827,0.00007497678,0.00012376487,0.00017197628,0.00003187049,0.000025574162,0.00021115775,0.000027924896,0.00022151577],"category_scores_gemma":[0.000018479339,0.00005249981,0.000048068854,0.00025705152,0.00003493278,0.00024019656,0.00005987008,0.000017516431,0.000003384547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007404254,0.0005303807,0.19712654,0.00009894477,0.00004765942,0.0000027645674,0.001649519,0.000008438369,0.032282274,0.6100715,0.0023529043,0.15575504],"study_design_scores_gemma":[0.031532556,0.002115234,0.3280616,0.00055302033,0.00003543522,0.000013559434,0.00064122037,0.07571207,0.24490555,0.0922664,0.22268596,0.0014773956],"about_ca_topic_score_codex":0.00013720497,"about_ca_topic_score_gemma":0.00019668191,"teacher_disagreement_score":0.878855,"about_ca_system_score_codex":0.000041834282,"about_ca_system_score_gemma":0.00017400943,"threshold_uncertainty_score":0.24254423},"labels":[],"label_agreement":null},{"id":"W2505690073","doi":"10.1007/978-3-662-52993-5_27","title":"Key Recovery Attack Against 2.5-Round $$\\pi $$ -Cipher","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Cipher; Arithmetic; Block cipher; Slide attack; Key (lock); Computer security; Theoretical computer science; Algorithm; Stream cipher attack; Cryptography; Mathematics; Encryption","score_opus":0.0273721072192478,"score_gpt":0.27795033738151653,"score_spread":0.2505782301622687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505690073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065405614,0.0003921903,0.9795407,0.0011455835,0.0027002378,0.00041230058,0.000023353374,0.00018251596,0.014949056],"genre_scores_gemma":[0.21170138,0.00067897455,0.7732748,0.008806641,0.002305659,0.000053953238,0.00003642923,0.00015303321,0.002989152],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543595,0.000049839586,0.0007269985,0.0017690052,0.001120537,0.00089763687],"domain_scores_gemma":[0.99674773,0.0005395548,0.00036882225,0.0018184708,0.00029526357,0.00023013203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009940069,0.0006067028,0.00054912525,0.0010048625,0.00042442986,0.00089498406,0.0034069149,0.00032158886,0.00012311857],"category_scores_gemma":[0.00006433256,0.00049879606,0.0002514789,0.0007709851,0.00072457496,0.0011169759,0.0014733474,0.00062538416,0.000141611],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007423199,0.00003896974,0.0000672584,0.00002798992,0.000026819913,0.00010617927,0.00079088286,0.0020903652,0.00009322549,0.06751932,0.00034361146,0.92888796],"study_design_scores_gemma":[0.0017395256,0.00072562887,0.00054260535,0.0012790379,0.00003207359,0.00019267987,0.0000012025073,0.13360152,0.00074770994,0.75496954,0.10261518,0.003553288],"about_ca_topic_score_codex":0.000017504732,"about_ca_topic_score_gemma":0.00023342326,"teacher_disagreement_score":0.9253347,"about_ca_system_score_codex":0.0003522888,"about_ca_system_score_gemma":0.00057697983,"threshold_uncertainty_score":0.9997464},"labels":[],"label_agreement":null},{"id":"W2508392497","doi":"10.1109/arith.2016.16","title":"Multi-fault Attack Detection for RNS Cryptographic Architecture","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Residue number system; Cryptography; Modular design; Computation; Reduction (mathematics); Architecture; Parallel computing; Cryptographic primitive; Embedded system; Distributed computing; Cryptographic protocol; Algorithm; Mathematics","score_opus":0.04763494983605832,"score_gpt":0.3315532200908885,"score_spread":0.2839182702548302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508392497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012421669,0.00009830221,0.9824831,0.0014048492,0.0014712053,0.0012666378,0.00012132255,0.0004800991,0.00025281744],"genre_scores_gemma":[0.5676224,0.000065927175,0.43080083,0.00035503999,0.00028476593,0.0006537459,0.000043502063,0.000031970216,0.00014178973],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763393,0.00008591505,0.00046682497,0.0009979818,0.0003083045,0.0005070495],"domain_scores_gemma":[0.99797004,0.00018348679,0.00024332215,0.0011864235,0.00026813563,0.00014856126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037720945,0.00038556018,0.0003278412,0.0006092565,0.0003085205,0.00035969744,0.00123029,0.00032372124,0.00005275107],"category_scores_gemma":[0.00004523987,0.0002941549,0.00053035736,0.0003942023,0.00008022266,0.00016949749,0.0009196289,0.00041997994,0.0000130429935],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101142694,0.00089000276,0.0014928628,0.0010082658,0.0008858923,0.000013056598,0.0050768196,0.0014554745,0.015573655,0.12320854,0.0069706077,0.8433237],"study_design_scores_gemma":[0.00766926,0.0008234971,0.013526358,0.00044990142,0.00022597703,0.00007234306,0.00025948786,0.27979627,0.010329144,0.46951964,0.21312095,0.004207154],"about_ca_topic_score_codex":0.000087854125,"about_ca_topic_score_gemma":0.0012291633,"teacher_disagreement_score":0.8391165,"about_ca_system_score_codex":0.000045209825,"about_ca_system_score_gemma":0.0001017812,"threshold_uncertainty_score":0.99995106},"labels":[],"label_agreement":null},{"id":"W2508926447","doi":"10.1007/978-3-319-45871-7_1","title":"Truncated and Multiple Differential Cryptanalysis of Reduced Round Midori128","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Linear cryptanalysis; Computer science; Algorithm; Impossible differential cryptanalysis; Cryptanalysis; Encryption; Plaintext; Differential (mechanical device); Higher-order differential cryptanalysis; Differential cryptanalysis; Binary number; Arithmetic; Theoretical computer science; Mathematics; Cryptography; Computer security","score_opus":0.017909518006136136,"score_gpt":0.25688714231808724,"score_spread":0.2389776243119511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508926447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017669784,0.000171619,0.980533,0.0003621967,0.00065717404,0.00024948883,0.000020784739,0.000054791057,0.00028115217],"genre_scores_gemma":[0.91893375,0.00006010391,0.08068597,0.000101431724,0.00013873795,0.0000036001663,0.000006376249,0.000015092044,0.000054954406],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971258,0.000037277445,0.0005961794,0.0010896713,0.000718701,0.0004323431],"domain_scores_gemma":[0.9978211,0.00045375395,0.0003521261,0.0009770074,0.00025821113,0.00013781339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040597725,0.00037340482,0.00054602453,0.001042833,0.0002125264,0.0002788743,0.0015085684,0.00018640446,0.000048921993],"category_scores_gemma":[0.00006408989,0.00029356015,0.00015863377,0.00065780367,0.0007336063,0.00040655973,0.00084185257,0.00028420275,0.0000031698119],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002322103,0.00009169099,0.0010312462,0.00007523529,0.00011484181,0.000028748727,0.0021910782,0.00034513377,0.01043636,0.115169436,0.000016131971,0.8704769],"study_design_scores_gemma":[0.0021694845,0.00048073524,0.0054096114,0.0005709945,0.000104909726,0.00006450765,0.0000012760433,0.4397228,0.012633596,0.5363829,0.00083314505,0.0016260111],"about_ca_topic_score_codex":0.000065720145,"about_ca_topic_score_gemma":0.00018044088,"teacher_disagreement_score":0.90126395,"about_ca_system_score_codex":0.00009586223,"about_ca_system_score_gemma":0.00021344789,"threshold_uncertainty_score":0.99995166},"labels":[],"label_agreement":null},{"id":"W2508931589","doi":"10.1049/iet-cds.2016.0010","title":"Implementation of a decoupling based power analysis attack countermeasure","year":2016,"lang":"en","type":"article","venue":"IET Circuits Devices & Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"CMOS; Decoupling (probability); Computer science; Electronic engineering; Power analysis; Embedded system; Engineering; Control engineering; Cryptography","score_opus":0.02579969072828072,"score_gpt":0.30918401444229254,"score_spread":0.28338432371401184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508931589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48805442,0.00021220994,0.510655,0.00015634346,0.00032502715,0.00028702925,0.00006914983,0.00007129642,0.00016953438],"genre_scores_gemma":[0.99950635,0.0000070724977,0.0002911742,0.00008805844,0.000031164484,0.00004493317,0.000012734907,0.000009216195,0.000009270736],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99793285,0.00011069936,0.0006560253,0.00041614802,0.0005714845,0.00031278204],"domain_scores_gemma":[0.9982893,0.00017421627,0.00044405434,0.0006361124,0.00036591815,0.00009042352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079394114,0.00016588914,0.00033727457,0.00047554576,0.00012608647,0.00018014156,0.00060104794,0.000054932447,0.00012265558],"category_scores_gemma":[0.000009676693,0.00012395692,0.0002157474,0.001467464,0.00003698816,0.0005469818,0.000049279595,0.000043247695,0.000015582933],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004244818,0.00012239197,0.9597141,0.00020273376,0.0010719196,0.000008862631,0.0025459058,0.0006920849,0.0035179125,0.01271135,0.0006287644,0.01877969],"study_design_scores_gemma":[0.0051729153,0.0005339752,0.8710432,0.0005286628,0.0010798165,0.000027215985,0.0056801084,0.08498681,0.0031450663,0.0002256567,0.026022796,0.0015537454],"about_ca_topic_score_codex":0.0004051654,"about_ca_topic_score_gemma":0.0015037068,"teacher_disagreement_score":0.51145196,"about_ca_system_score_codex":0.000067478155,"about_ca_system_score_gemma":0.000110658424,"threshold_uncertainty_score":0.50548166},"labels":[],"label_agreement":null},{"id":"W2509288627","doi":"10.1007/978-3-319-72308-2_8","title":"Adaptive Restart and CEGAR-Based Solver for Inverting Cryptographic Hash Functions","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Computer science; Cryptographic hash function; Boolean satisfiability problem; Theoretical computer science; Cryptanalysis; Algorithm; Cryptography; Computer security","score_opus":0.04482897644388892,"score_gpt":0.30546261371156336,"score_spread":0.2606336372676744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509288627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035682037,0.00019530866,0.95927984,0.0018908901,0.0019144051,0.00085200014,0.00003125979,0.000138337,0.000015931373],"genre_scores_gemma":[0.56907374,0.000009294407,0.43014756,0.00053531234,0.00012720888,0.000088306755,0.000008805309,0.000009502751,2.5189505e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964759,0.00008542063,0.0004777804,0.0016447573,0.00058112154,0.000735044],"domain_scores_gemma":[0.9967573,0.0006375204,0.00038801678,0.0016440536,0.0004137675,0.00015930746],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013887387,0.00041003045,0.00041447888,0.0010661418,0.0013795974,0.0017732832,0.002440571,0.00022267978,0.000003816861],"category_scores_gemma":[0.0002550775,0.0003944417,0.00018838356,0.0009767949,0.00094934617,0.0006287439,0.002206202,0.00070419174,0.0000012587012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053621956,0.00029247883,0.014265536,0.00029467646,0.00006831947,0.000025281211,0.005193508,0.09014251,0.00060315034,0.014026447,0.00021996723,0.8748145],"study_design_scores_gemma":[0.00051833596,0.0001589496,0.0047980067,0.00019076707,0.000013441116,0.0000051899983,0.0000025529878,0.8273796,0.0006999203,0.1656669,0.00013609263,0.00043027516],"about_ca_topic_score_codex":0.00028730682,"about_ca_topic_score_gemma":0.0011612676,"teacher_disagreement_score":0.8743842,"about_ca_system_score_codex":0.000100744364,"about_ca_system_score_gemma":0.0007975637,"threshold_uncertainty_score":0.9999205},"labels":[],"label_agreement":null},{"id":"W2514069346","doi":"10.1109/arith.2016.19","title":"A CRC-Based Concurrent Fault Detection Architecture for Galois/Counter Mode (GCM)","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"CMC Microsystems","keywords":"Computer science; Critical path method; Fault coverage; Cyclic redundancy check; Fault detection and isolation; Redundancy (engineering); Field-programmable gate array; Overhead (engineering); Galois theory; Embedded system; Parallel computing; Algorithm; Mathematics; Decoding methods; Engineering","score_opus":0.017617233996103196,"score_gpt":0.296791558957303,"score_spread":0.2791743249611998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514069346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029756429,0.000012186466,0.9672674,0.0019697843,0.00033634895,0.00032937925,0.000031825544,0.00014078664,0.00015589481],"genre_scores_gemma":[0.9791862,0.0000022506945,0.020002982,0.0005632047,0.00005605565,0.00012208315,0.0000041554995,0.000006180708,0.000056891215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990703,0.000028032657,0.00018195267,0.00030011105,0.0001737214,0.000245911],"domain_scores_gemma":[0.9993375,0.00013756068,0.00005314579,0.0002947047,0.00011013758,0.000066939705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013172427,0.000112998794,0.000095036805,0.00013186062,0.00013434875,0.00009210969,0.00028868983,0.00003856025,0.000065659144],"category_scores_gemma":[0.000020351401,0.000070013586,0.00011509711,0.00018020206,0.00003479514,0.00017409526,0.00004363332,0.000046657016,0.0000103294105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003487691,0.00014636575,0.0003345661,0.000033610304,0.000032747696,0.0000012662664,0.0006536361,0.00012281109,0.026165709,0.08619985,0.0029742566,0.8833003],"study_design_scores_gemma":[0.009103724,0.0011887652,0.0024131099,0.000094077826,0.000041695257,0.000024185227,0.00012076737,0.46293488,0.14170855,0.063893005,0.3173283,0.0011489427],"about_ca_topic_score_codex":0.00006188767,"about_ca_topic_score_gemma":0.00082835264,"teacher_disagreement_score":0.94942975,"about_ca_system_score_codex":0.000034003344,"about_ca_system_score_gemma":0.00004104445,"threshold_uncertainty_score":0.28550714},"labels":[],"label_agreement":null},{"id":"W2516160016","doi":"10.1007/978-3-319-45871-7_2","title":"Improved Linear Cryptanalysis of Round-Reduced ARIA","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Linear cryptanalysis; Key (lock); Cryptanalysis; Computer security; Cipher; Arithmetic; Encryption; Mathematics","score_opus":0.01852102745369421,"score_gpt":0.2740647691256091,"score_spread":0.2555437416719149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516160016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047106895,0.00017480434,0.9958939,0.00067529106,0.0009729473,0.00029903278,0.000016439539,0.00007834865,0.0014181716],"genre_scores_gemma":[0.46522543,0.000070991635,0.5335287,0.00050950865,0.00038959083,0.000011358648,0.0000075676794,0.00003101378,0.00022588445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650973,0.00003707159,0.00078516,0.001262112,0.0008410503,0.00056485296],"domain_scores_gemma":[0.99686843,0.0003861972,0.0005050002,0.0016442513,0.00044281755,0.00015328852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087157346,0.00043647876,0.0006256843,0.0012857208,0.00021294518,0.00024070192,0.0029083907,0.00023445609,0.000081198865],"category_scores_gemma":[0.00007417081,0.00034749386,0.00029035305,0.001034087,0.00065891247,0.00051755225,0.0010022529,0.0004032893,0.0000116327465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010461788,0.000070116104,0.00009469715,0.00005067775,0.00008779287,0.000023223838,0.0013265288,0.0009950917,0.005746828,0.18355884,0.000016253609,0.80801946],"study_design_scores_gemma":[0.0009022157,0.00038411247,0.0002900646,0.0003674708,0.000060244158,0.00003674692,8.206444e-7,0.5288834,0.0091598295,0.45692495,0.0017727837,0.001217339],"about_ca_topic_score_codex":0.000062913496,"about_ca_topic_score_gemma":0.00015553311,"teacher_disagreement_score":0.80680215,"about_ca_system_score_codex":0.00016389404,"about_ca_system_score_gemma":0.00055381487,"threshold_uncertainty_score":0.9998977},"labels":[],"label_agreement":null},{"id":"W2527845150","doi":"10.1002/spe.2461","title":"Regular and almost universal hashing: an efficient implementation","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Double hashing; SHA-2; Linear hashing; Merkle tree; Byte; Hash table; Hash chain","score_opus":0.015278382765730496,"score_gpt":0.3191347859469394,"score_spread":0.3038564031812089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527845150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.581349,0.000105634084,0.4164446,0.0017922996,0.00008567363,0.000106685955,0.0000043825244,0.000079891084,0.000031839343],"genre_scores_gemma":[0.9418002,0.00014504639,0.05762238,0.00037859217,0.000020541487,0.00001619072,0.0000026926236,0.0000046981904,0.000009708802],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998956,0.000085290376,0.00014963374,0.00038495418,0.00020951834,0.00021457247],"domain_scores_gemma":[0.9991502,0.00024038047,0.00009617097,0.00028850843,0.00009408233,0.00013066063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002920854,0.00010090885,0.00007666938,0.00007375127,0.0003521109,0.00023406981,0.00020811183,0.000028490711,0.00003063912],"category_scores_gemma":[0.00013635901,0.00007744069,0.000015175837,0.00020970652,0.00011988283,0.0023768903,0.00017710972,0.000047341564,0.000002763307],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056002773,0.00020125703,0.016282441,0.000015852054,0.000029014787,0.00005526622,0.109242395,0.000003637282,0.004707665,0.21158412,0.00032206567,0.65750027],"study_design_scores_gemma":[0.010640525,0.003361355,0.10689713,0.00020210563,0.00017670274,0.001589969,0.39890537,0.0072858385,0.018917177,0.020664614,0.42801708,0.0033421593],"about_ca_topic_score_codex":0.00019737755,"about_ca_topic_score_gemma":0.000038449307,"teacher_disagreement_score":0.6541581,"about_ca_system_score_codex":0.000021757722,"about_ca_system_score_gemma":0.000040926963,"threshold_uncertainty_score":0.31579393},"labels":[],"label_agreement":null},{"id":"W2534042242","doi":"10.1109/idt.2010.5724403","title":"Area efficient-high throughput sub-pipelined design of the AES in CMOS 180nm","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Advanced Encryption Standard; Application-specific integrated circuit; Throughput; Computer science; CMOS; Encryption; AES implementations; Embedded system; Key (lock); Computer hardware; Gate count; Electronic engineering; Engineering; Computer network; Wireless","score_opus":0.01837246867687346,"score_gpt":0.24794699862885256,"score_spread":0.2295745299519791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534042242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48922837,0.000006615103,0.50929123,0.000700374,0.0002887655,0.00020397833,0.0000017400145,0.0000274825,0.00025145893],"genre_scores_gemma":[0.9646316,0.000003719351,0.03510119,0.00021651467,0.000014465429,0.000011574036,9.677865e-7,0.000003308101,0.000016641145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999043,0.000065020984,0.00025881076,0.00021246345,0.00022675181,0.00019394203],"domain_scores_gemma":[0.9991152,0.00014704508,0.00007454852,0.0005586537,0.00007419865,0.000030331577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042751853,0.00008763697,0.00011017511,0.0000941426,0.00009216388,0.00005371099,0.0007201425,0.000041180676,0.00007673135],"category_scores_gemma":[0.000044924407,0.000056395493,0.000056705143,0.00075494434,0.00008244565,0.00010224118,0.00018574552,0.00014492532,0.0000050756053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012939207,0.0004917282,0.017099407,0.000011714073,0.000016138247,0.0000039001493,0.0035464363,0.0027094411,0.044270042,0.91739553,0.0025037017,0.011939029],"study_design_scores_gemma":[0.0025975502,0.00017791874,0.14456125,0.000033873748,0.000017879049,0.000020422081,0.0005580006,0.6398816,0.15254158,0.05736254,0.0016576955,0.00058967894],"about_ca_topic_score_codex":0.0003436879,"about_ca_topic_score_gemma":0.0008767662,"teacher_disagreement_score":0.860033,"about_ca_system_score_codex":0.000006763347,"about_ca_system_score_gemma":0.000066793255,"threshold_uncertainty_score":0.22997415},"labels":[],"label_agreement":null},{"id":"W2534230142","doi":"10.1109/icm.2007.4497657","title":"An FPGA implementation of AES with support for counter and feedback modes","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Field-programmable gate array; Advanced Encryption Standard; Block cipher; Computer science; AES implementations; Embedded system; Virtex; Throughput; Encryption; NIST; Key (lock); Block cipher mode of operation; Cryptography; Computer hardware; Block (permutation group theory); Implementation; Operating system; Wireless; Computer security; Mathematics","score_opus":0.015943863704837517,"score_gpt":0.33246116649797597,"score_spread":0.31651730279313844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534230142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4137448,0.000002910251,0.58581585,0.00006501942,0.0000107200285,0.00013906031,0.000008784433,0.000015024636,0.00019782137],"genre_scores_gemma":[0.8964754,0.0000031324769,0.10334654,0.00013127827,0.000008385574,0.000008072669,0.000015216792,0.0000027350243,0.00000928475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994436,0.0000059551408,0.00015796276,0.0001458524,0.000110392546,0.00013623889],"domain_scores_gemma":[0.99963534,0.0000320951,0.00005135814,0.00014341141,0.000095901334,0.000041866806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030111257,0.00005532592,0.000067221445,0.00008067244,0.00006114038,0.00005314048,0.00011520033,0.000012762475,0.000049011487],"category_scores_gemma":[6.878552e-7,0.000042563483,0.000015705018,0.00012245355,0.00003227113,0.0004104597,0.00001998084,0.000014670663,2.1743355e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090629095,0.00021262656,0.13193353,0.000077661585,0.00006826667,0.0000024013252,0.008379359,0.000013827937,0.006520451,0.57458633,0.0011549543,0.27695996],"study_design_scores_gemma":[0.007449822,0.0053833113,0.6918546,0.000018017385,0.00006491153,0.000050859497,0.031069137,0.018470721,0.21768527,0.020651648,0.00651181,0.00078987156],"about_ca_topic_score_codex":0.00018781722,"about_ca_topic_score_gemma":0.0019871711,"teacher_disagreement_score":0.5599211,"about_ca_system_score_codex":0.0000055524633,"about_ca_system_score_gemma":0.000024728515,"threshold_uncertainty_score":0.17356884},"labels":[],"label_agreement":null},{"id":"W2536224731","doi":"10.1109/itict.2005.1609674","title":"A Unified, Configurable Architecture Implementing Block Cipher Operational Modes","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Block cipher; Block cipher mode of operation; Encryption; Eavesdropping; Architecture; Plaintext; Advanced Encryption Standard; Block (permutation group theory); Throughput; Computer network; Ciphertext; Cryptography; Computer architecture; Embedded system; Wireless; Computer security; Operating system; Mathematics","score_opus":0.011156098786802482,"score_gpt":0.2512688586640793,"score_spread":0.2401127598772768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536224731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11427813,0.00004215685,0.81499624,0.002197149,0.00006887882,0.00021636327,0.000011464678,0.00018262501,0.068007],"genre_scores_gemma":[0.9326492,0.0000013018462,0.066060305,0.0004454945,0.000065997905,0.000019222894,0.00002763746,0.000004673131,0.00072619354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989491,0.00003231288,0.00023149983,0.00025601414,0.00022228337,0.0003087814],"domain_scores_gemma":[0.99954414,0.00004151885,0.00004171461,0.00025006218,0.00008296599,0.000039608378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019798364,0.00010394373,0.000085070016,0.000099078265,0.00032362549,0.0003072127,0.00031952193,0.000025470812,0.00045590795],"category_scores_gemma":[0.000003665691,0.000089207904,0.000055078308,0.0003321517,0.000024047775,0.00023543146,0.00010686059,0.000077826495,0.00001332733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014332309,0.000042560216,0.0009632875,0.0000033085953,0.000009787112,0.0000023521202,0.00015112059,0.0011255828,0.0026682306,0.98839325,0.0043444554,0.002294654],"study_design_scores_gemma":[0.0033832495,0.00024502375,0.014374983,0.000022839664,0.000030149718,0.0001389382,0.00094813184,0.2765453,0.027728766,0.318584,0.35663554,0.0013630689],"about_ca_topic_score_codex":0.00090124836,"about_ca_topic_score_gemma":0.0012103736,"teacher_disagreement_score":0.81837106,"about_ca_system_score_codex":0.000012543835,"about_ca_system_score_gemma":0.00005264251,"threshold_uncertainty_score":0.49918723},"labels":[],"label_agreement":null},{"id":"W2537596455","doi":"10.1109/icm.2011.6177419","title":"Transistor level optimization of sub-pipelined AES design in CMOS 65nm","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"CMOS; Transistor; Advanced Encryption Standard; Throughput; Computer science; Reduction (mathematics); Dissipation; Encryption; Electronic engineering; Logic gate; Low-power electronics; Power consumption; Embedded system; Power (physics); Electrical engineering; Engineering; Voltage; Algorithm; Mathematics","score_opus":0.1270912029139936,"score_gpt":0.268341144535679,"score_spread":0.1412499416216854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537596455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013535423,0.000019949528,0.9855197,0.000081502825,0.00005875317,0.00015514968,0.000002563561,0.000033696608,0.0005932671],"genre_scores_gemma":[0.5466279,0.000009079583,0.4533012,0.00004038341,0.0000026841628,0.0000065304744,0.0000016510614,0.000001994808,0.000008576262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993179,0.00005644532,0.00024826577,0.00015045136,0.00011061622,0.0001163505],"domain_scores_gemma":[0.99962825,0.00003556343,0.000048062015,0.00019280615,0.00006657557,0.000028765868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027114846,0.00006238006,0.00009313357,0.00017159179,0.000029740568,0.00001365386,0.00025337428,0.000027852137,0.00012954549],"category_scores_gemma":[0.000010236234,0.00005701715,0.000035801528,0.0005095638,0.000024351599,0.0002521802,0.000022101278,0.000033100692,0.000001802975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018675673,0.0022614927,0.016002106,0.00011035531,0.00008682114,0.00002493063,0.07064328,0.05144994,0.008523936,0.7385537,0.0026091782,0.10954748],"study_design_scores_gemma":[0.0014399166,0.00023699804,0.022486754,0.000016524558,0.000010805179,0.0000041042617,0.0004103777,0.93306154,0.035220955,0.0067202784,0.00009343488,0.00029828557],"about_ca_topic_score_codex":0.00034667738,"about_ca_topic_score_gemma":0.0002998974,"teacher_disagreement_score":0.88161165,"about_ca_system_score_codex":0.000010183174,"about_ca_system_score_gemma":0.000042303524,"threshold_uncertainty_score":0.2325092},"labels":[],"label_agreement":null},{"id":"W2538079512","doi":"10.1109/itict.2005.1609672","title":"A Reconfigurable Hardware Unit for the HMAC Algorithm","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash-based message authentication code; Hash function; MD5; Computer science; Secure Hash Algorithm; Cryptographic hash function; SHA-2; Message authentication code; Hash chain; Throughput; Double hashing; Checksum; Algorithm; Parallel computing; Computer hardware; Embedded system; Cryptography; Operating system; Programming language","score_opus":0.026293333588694033,"score_gpt":0.27835624760364447,"score_spread":0.25206291401495046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538079512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036990538,0.0000839307,0.9881108,0.0027556005,0.00017929167,0.0002530743,0.000016114918,0.00008673169,0.008144567],"genre_scores_gemma":[0.24293996,0.00005233105,0.7425996,0.0026052191,0.00041344107,0.00044860976,0.00007434219,0.000020477892,0.010846022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994445,0.000013270626,0.00012429402,0.00014862968,0.00009432342,0.00017498685],"domain_scores_gemma":[0.9994282,0.00015620579,0.000028958882,0.00028743912,0.00007895076,0.000020222344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001973861,0.000058881706,0.00005354462,0.000043046173,0.00029892148,0.00017781802,0.00039184105,0.000016832753,0.0001634107],"category_scores_gemma":[0.000004780073,0.00003805327,0.00006125263,0.0002780006,0.000020171548,0.00016196608,0.000027921411,0.000037964233,0.000011779788],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.6593184e-7,0.000032526073,0.00015587475,0.0000031265079,0.000011590042,7.071228e-7,0.00012604099,0.000019145498,0.000042967262,0.722856,0.043838006,0.2329132],"study_design_scores_gemma":[0.00045328398,0.00004783733,0.0020844876,0.0000024030082,0.000007668429,0.000007653761,0.0002058977,0.1480462,0.0012211126,0.06324719,0.78454125,0.00013501752],"about_ca_topic_score_codex":0.0009823923,"about_ca_topic_score_gemma":0.0004883682,"teacher_disagreement_score":0.7407032,"about_ca_system_score_codex":0.000005822771,"about_ca_system_score_gemma":0.00002631182,"threshold_uncertainty_score":0.22990926},"labels":[],"label_agreement":null},{"id":"W2538487613","doi":"10.1109/icm.2008.5393805","title":"An area optimized implementation of the Advanced Encryption Standard","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Advanced Encryption Standard; NIST; AES implementations; Encryption; Computer science; Throughput; Field-programmable gate array; Embedded system; Identification (biology); Cryptography; Encryption software; Computer hardware; 56-bit encryption; Computer network; Public-key cryptography; Computer security; Operating system; Wireless","score_opus":0.01982416871983819,"score_gpt":0.30647304945016113,"score_spread":0.28664888073032296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538487613","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52186185,0.0000059968215,0.47749448,0.00017051205,0.00007552173,0.00015245934,0.0000068226227,0.000034792687,0.00019752426],"genre_scores_gemma":[0.89456356,0.00002756919,0.105275296,0.00009772272,0.000006376652,0.000013652162,0.000006572431,0.000002345263,0.0000069370453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991859,0.000056541427,0.00022038138,0.000156836,0.00025864033,0.00012165407],"domain_scores_gemma":[0.99933654,0.000020958352,0.00010015666,0.00039912402,0.00010944535,0.00003378621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015711892,0.00006425652,0.000085410844,0.000060991464,0.00020447811,0.000022861568,0.00037263896,0.00001572107,0.00018945723],"category_scores_gemma":[0.000004254627,0.000044464035,0.00006021375,0.00038189022,0.00004171716,0.00050395884,0.000058981943,0.00003819783,8.5214594e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011628158,0.00038344515,0.066497594,0.000024736037,0.00008296726,0.000005611531,0.028807152,0.0024246986,0.052165505,0.6057582,0.0027523055,0.2409815],"study_design_scores_gemma":[0.013344474,0.0016951833,0.58150005,0.000027524144,0.000045546683,0.000087218636,0.01410925,0.054921877,0.29449567,0.033099398,0.0056979135,0.0009758667],"about_ca_topic_score_codex":0.00010267144,"about_ca_topic_score_gemma":0.00017483476,"teacher_disagreement_score":0.5726588,"about_ca_system_score_codex":0.000019003459,"about_ca_system_score_gemma":0.00007014658,"threshold_uncertainty_score":0.20744237},"labels":[],"label_agreement":null},{"id":"W2544612194","doi":"10.1109/icm.2009.5418647","title":"An FPGA implementation of AES with fault analysis countermeasures","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"AES implementations; Computer science; Advanced Encryption Standard; NIST; Power analysis; Cryptography; Field-programmable gate array; Cryptosystem; Encryption; Fault injection; Block cipher; Embedded system; Implementation; Redundancy (engineering); Computer engineering; Computer security; Software; Operating system","score_opus":0.01166774061304759,"score_gpt":0.3204451510096992,"score_spread":0.30877741039665163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544612194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46993384,0.0000070652736,0.5294486,0.00020609144,0.000008422787,0.00006708847,0.0000052242813,0.0000379381,0.000285697],"genre_scores_gemma":[0.9760005,0.0000047943618,0.023741858,0.00021869679,0.000006381003,0.000003271642,0.000019644449,0.0000013309624,0.0000035224957],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991956,0.000032024454,0.00019112337,0.00018580932,0.00026898115,0.00012647676],"domain_scores_gemma":[0.9993914,0.000011405213,0.00008364004,0.00033250888,0.00013718757,0.00004389731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001723481,0.00007011712,0.00011848481,0.0002662314,0.000071431976,0.00008974449,0.00028419262,0.000013161494,0.00011644167],"category_scores_gemma":[9.3744507e-7,0.000052685635,0.000055682005,0.001096123,0.00002036931,0.00046966708,0.000011171752,0.000025347414,6.605378e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028850012,0.0005380654,0.26965216,0.000011076905,0.0006610638,0.000007048239,0.009411623,0.0009907619,0.004826978,0.30040038,0.0006627468,0.41280925],"study_design_scores_gemma":[0.00064112194,0.0008292365,0.96999425,0.0000023921496,0.00014547132,0.0000029143125,0.002217057,0.010928396,0.011931942,0.002884194,0.00023407557,0.0001889818],"about_ca_topic_score_codex":0.0005622061,"about_ca_topic_score_gemma":0.0031180896,"teacher_disagreement_score":0.70034206,"about_ca_system_score_codex":0.000008810555,"about_ca_system_score_gemma":0.00003032805,"threshold_uncertainty_score":0.21484578},"labels":[],"label_agreement":null},{"id":"W2560846039","doi":"10.1007/978-3-031-53368-6","title":"Selected Areas in Cryptography – SAC 2023","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional; Indian Statistical Institute; Syddansk Universitet; Universitetet i Bergen; University of Waterloo; Università degli Studi di Salerno; Waseda University; KU Leuven; Aarhus Universitet; University of South Florida; Academia Sinica; Institut Polytechnique de Paris; University of Washington; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Royal Holloway, University of London; Radboud Universiteit","keywords":"Computer science; Cryptography; Computer security","score_opus":0.01247479556962246,"score_gpt":0.2659052419868197,"score_spread":0.25343044641719725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560846039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004946178,0.0012211736,0.99235797,0.0009947611,0.002288693,0.000541741,0.00001898007,0.00025652058,0.0018255443],"genre_scores_gemma":[0.22850966,0.00037697522,0.7651799,0.003423053,0.0014077364,0.00018198579,0.00014369417,0.00013669411,0.0006403029],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516094,0.00009358068,0.00071788277,0.0019090245,0.0011064318,0.0010121496],"domain_scores_gemma":[0.99763495,0.00046574304,0.00017349348,0.0012710656,0.00027128158,0.00018349782],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010794868,0.0005666457,0.00056000904,0.00383326,0.00020856298,0.0011155716,0.0033196763,0.00031936646,0.000040964864],"category_scores_gemma":[0.00007962788,0.0005385291,0.00019506739,0.010921748,0.00053372985,0.0006067225,0.001254566,0.001317185,0.00006303985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015779651,0.0003334211,0.0032172727,0.00039809657,0.00008386032,0.0008800971,0.0075136162,0.008517092,0.0002314978,0.07654424,0.009202769,0.89306223],"study_design_scores_gemma":[0.00060165534,0.00026116022,0.004381429,0.00083429914,0.000018080205,0.000100254765,0.0000012240769,0.33932167,0.0002800673,0.63910615,0.013705411,0.0013885646],"about_ca_topic_score_codex":0.00014135757,"about_ca_topic_score_gemma":0.0018697164,"teacher_disagreement_score":0.8916737,"about_ca_system_score_codex":0.00041436683,"about_ca_system_score_gemma":0.0017001766,"threshold_uncertainty_score":0.9999214},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06722823537149986,"score_gpt":0.3812333853457928,"score_spread":0.31400514997429296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585018408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3639172,0.00057834253,0.6018905,0.025288751,0.0020585263,0.00009306974,0.0000011574027,0.00001755299,0.0061548604],"genre_scores_gemma":[0.9690967,0.000040478466,0.030306876,0.00039424494,0.00014569765,0.00000108241,6.394051e-8,0.0000028479863,0.000011980674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991615,0.000065639615,0.00031701897,0.000086307984,0.00017886904,0.0001906935],"domain_scores_gemma":[0.9984729,0.00009726543,0.00066328153,0.00056393404,0.00016192002,0.000040679544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065374863,0.00006582752,0.0001497022,0.000111827816,0.0007260392,0.000420838,0.0017758239,0.000037517144,0.00004725208],"category_scores_gemma":[0.00010399848,0.000040226623,0.00011650492,0.000084908774,0.00013499006,0.00059192406,0.0002241675,0.00020001168,0.00000606814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015673671,0.00005112488,0.024821581,0.000005426617,0.000058579844,0.00009179406,0.0012690147,0.000010274837,0.00043127255,0.93545824,0.0078207925,0.029966198],"study_design_scores_gemma":[0.0017654521,0.0005824276,0.35950083,0.000046220677,0.0000475116,0.0031266764,0.00044345277,0.0028662663,0.0010816046,0.5476255,0.08264728,0.00026677744],"about_ca_topic_score_codex":0.000010988063,"about_ca_topic_score_gemma":0.000026964106,"teacher_disagreement_score":0.60517955,"about_ca_system_score_codex":0.000012847496,"about_ca_system_score_gemma":0.00010129036,"threshold_uncertainty_score":0.558418},"labels":[],"label_agreement":null},{"id":"W2585509444","doi":"","title":"MARC - A New Block Cipher Algorithm","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Block cipher; CBC-MAC; Block (permutation group theory); Algorithm; Arithmetic; Cryptography; Mathematics; Combinatorics","score_opus":0.023963292316285287,"score_gpt":0.282552707296034,"score_spread":0.2585894149797487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585509444","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039039357,0.00010062247,0.9836549,0.0011433442,0.0003185395,0.0000746924,9.74087e-7,0.000119943536,0.010683017],"genre_scores_gemma":[0.2847189,0.000010659407,0.7119186,0.001087854,0.00024010638,0.0000064831224,0.0000020336654,0.0000048281136,0.002010579],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993824,0.000015362397,0.00009924469,0.000109905486,0.0001381673,0.00025493684],"domain_scores_gemma":[0.999537,0.000019799887,0.000019032672,0.0002549551,0.000018549597,0.0001506758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012881472,0.0000593019,0.000052562376,0.000053750045,0.00006822424,0.000071700786,0.00025931466,0.000018991075,0.0006062004],"category_scores_gemma":[0.0000030978488,0.000049578004,0.00004071159,0.00030021256,0.00001006647,0.0004010773,0.00012309504,0.000042747102,0.00011536146],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6984889e-7,0.000106831285,0.0042573204,0.0000018834942,0.000017843327,0.0000013689395,0.0017540604,5.3607107e-7,0.00007405175,0.41949335,0.08627222,0.48802006],"study_design_scores_gemma":[0.00088426634,0.000079416124,0.03873965,0.000004244346,0.00001195473,0.000062610874,0.00025216324,0.016651036,0.000973769,0.020769795,0.9211167,0.0004544065],"about_ca_topic_score_codex":0.00025275152,"about_ca_topic_score_gemma":0.000027605642,"teacher_disagreement_score":0.83484447,"about_ca_system_score_codex":0.000008219554,"about_ca_system_score_gemma":0.000026072168,"threshold_uncertainty_score":0.66374695},"labels":[],"label_agreement":null},{"id":"W2591685570","doi":"10.1109/mwscas.2016.7870147","title":"Synthesis and evaluation of SHA-1 algorithm using altera SDK for OpenCL","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Speedup; Field-programmable gate array; Throughput; Parallel computing; Hash function; Design space exploration; High-level synthesis; Algorithm; Embedded system; Operating system","score_opus":0.0964341923546039,"score_gpt":0.37062452835402754,"score_spread":0.27419033599942366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591685570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17461202,0.000026035588,0.8246883,0.00028565328,0.00004981311,0.0002143508,0.000011469709,0.000010294149,0.000102025115],"genre_scores_gemma":[0.7003058,0.000006878285,0.29961795,0.000026560754,0.00001139248,0.000023967496,4.085401e-7,0.0000018201857,0.0000052206688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993918,0.000040634503,0.00014157103,0.00015022627,0.0001841866,0.00009159596],"domain_scores_gemma":[0.999401,0.00018352225,0.000050389135,0.00016002604,0.00017985156,0.000025229196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007841851,0.00004450615,0.0000707416,0.000075976925,0.000066995,0.000037603077,0.00013659062,0.000014238318,0.00007834905],"category_scores_gemma":[0.00004555277,0.0000293695,0.0000271707,0.00010862348,0.000023113362,0.00031642313,0.00006508007,0.000007456177,5.0385154e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011016637,0.000017878669,0.00026766764,0.000004805669,0.000011128822,5.592208e-8,0.00018671711,0.0000019307122,0.0035029652,0.02967716,0.00007003749,0.9662585],"study_design_scores_gemma":[0.00090500276,0.00006627689,0.00350037,0.00003556652,0.000047978025,0.000006020292,0.00010131542,0.9191853,0.04133952,0.034135293,0.0005369797,0.00014039227],"about_ca_topic_score_codex":0.00006449407,"about_ca_topic_score_gemma":0.000018626106,"teacher_disagreement_score":0.96611816,"about_ca_system_score_codex":0.000014310397,"about_ca_system_score_gemma":0.000041298834,"threshold_uncertainty_score":0.11976534},"labels":[],"label_agreement":null},{"id":"W2593821117","doi":"10.1007/s11390-017-1727-x","title":"A New Feistel-Type White-Box Encryption Scheme","year":2017,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada","funders":"","keywords":"White box; Computer science; Block cipher; S-box; Encryption; Cryptanalysis; Linear cryptanalysis; Cryptography; Key schedule; Context (archaeology); Theoretical computer science; Symmetric-key algorithm; Block size; Algorithm; Differential cryptanalysis; Key (lock); Computer network; Computer security; Public-key cryptography","score_opus":0.017715693433242637,"score_gpt":0.2950580230940829,"score_spread":0.27734232966084027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593821117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23401278,0.00011655089,0.7557188,0.009066625,0.0008633204,0.000051478128,1.569131e-7,0.000034560708,0.00013572347],"genre_scores_gemma":[0.65762806,0.000055208126,0.34210002,0.0001088581,0.000095551346,3.0850788e-7,4.5351957e-8,0.0000017632972,0.000010160782],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882066,0.000010377775,0.00028677715,0.00022772682,0.0004068413,0.00024760215],"domain_scores_gemma":[0.9981206,0.000016278073,0.00043174467,0.0005989666,0.00070447224,0.0001279224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007944165,0.00009093881,0.00017145884,0.0007778496,0.0006966717,0.00071590504,0.0021629406,0.00006332845,0.000008782514],"category_scores_gemma":[0.00009323062,0.00007474477,0.00003523062,0.0008756436,0.0004598515,0.0016127964,0.0006828642,0.00020318768,0.000004118194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060573766,0.000044442324,0.018596182,0.000005465321,0.000016061013,0.000045641882,0.00050088327,0.0000025296836,0.0048305294,0.31494194,0.0022556134,0.65875465],"study_design_scores_gemma":[0.006054738,0.0060528987,0.2357912,0.00030025915,0.00005900504,0.0071403887,0.0003863676,0.096572146,0.020352725,0.52628964,0.09961604,0.0013845913],"about_ca_topic_score_codex":0.000009781218,"about_ca_topic_score_gemma":0.0000082281185,"teacher_disagreement_score":0.65737003,"about_ca_system_score_codex":0.000027809723,"about_ca_system_score_gemma":0.00043012304,"threshold_uncertainty_score":0.6903489},"labels":[],"label_agreement":null},{"id":"W2594778152","doi":"10.1109/mwscas.2016.7870159","title":"Look-Up tables with multiple inputs for secured-by-design FPGAs","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Field-programmable gate array; Robustness (evolution); Computer science; Lookup table; Overhead (engineering); Embedded system; Computer hardware; Computer engineering","score_opus":0.021982424727341597,"score_gpt":0.2568943798190091,"score_spread":0.23491195509166748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594778152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067663803,0.000028854152,0.99037004,0.001980705,0.00011863368,0.0004141146,0.000038600097,0.00013159601,0.00015108459],"genre_scores_gemma":[0.7840663,0.000014294182,0.2147668,0.00042790276,0.000026925865,0.00010805975,0.000007155249,0.000009169715,0.0005733937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990185,0.000029853913,0.00015836248,0.0003221339,0.0001729148,0.0002982641],"domain_scores_gemma":[0.9991109,0.00029773972,0.000055302142,0.0003465876,0.000106831416,0.00008264381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022559478,0.00012063381,0.000111294736,0.00007877232,0.00015955813,0.00011503006,0.00039847716,0.00003305166,0.00009239372],"category_scores_gemma":[0.000023352524,0.00006836922,0.000042711064,0.00023772143,0.00004783874,0.00045152192,0.000071285365,0.000027284757,0.000012138742],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012997614,0.0003110772,0.006539383,0.000038027632,0.00013269202,0.0000051154275,0.0021086282,0.000028331833,0.022729587,0.5985524,0.26475242,0.10467237],"study_design_scores_gemma":[0.017427398,0.0026033765,0.0020833393,0.00013052343,0.00005729399,0.000051578274,0.0004870767,0.047086176,0.26808226,0.07339784,0.5866707,0.0019224397],"about_ca_topic_score_codex":0.00008241759,"about_ca_topic_score_gemma":0.00030210507,"teacher_disagreement_score":0.77729994,"about_ca_system_score_codex":0.000017324983,"about_ca_system_score_gemma":0.00005535992,"threshold_uncertainty_score":0.2788016},"labels":[],"label_agreement":null},{"id":"W2604780902","doi":"10.1007/978-3-319-55589-8_18","title":"On the Multi-output Filtering Model and Its Applications","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Distribution (mathematics); Algebraic number; Component (thermodynamics); Function (biology); Computer science; Cryptography; Algorithm; Boolean function; Discrete mathematics; Mathematics; Physics; Statistics","score_opus":0.0537975235883144,"score_gpt":0.298004775760789,"score_spread":0.24420725217247458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604780902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014584385,0.00019237048,0.99636465,0.0012914891,0.00022129383,0.00053582416,0.000013821873,0.000059630776,0.0011750833],"genre_scores_gemma":[0.64367193,0.00014554162,0.35331705,0.0021371315,0.00017932913,0.00009858973,0.000005162398,0.000027284492,0.00041796893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998041,0.000014723464,0.00025282905,0.000894752,0.00045196424,0.0003447568],"domain_scores_gemma":[0.9978599,0.00040388436,0.00019297787,0.0013323085,0.00011805417,0.00009288392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005377069,0.00028636164,0.00021498419,0.00034383356,0.0009287836,0.0007938781,0.0025807952,0.00011301604,0.0000069740063],"category_scores_gemma":[0.000053531272,0.0002125446,0.0000681332,0.00013559562,0.0003811581,0.00032969067,0.0011316771,0.00046529126,0.0000121049725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013129479,0.000023236693,0.0000062246586,0.00001841397,0.000007922382,0.000006291474,0.0010118994,0.016463503,0.00007632051,0.63715404,0.000020231717,0.34521058],"study_design_scores_gemma":[0.000106547435,0.00002803724,0.000037867623,0.00006810035,0.000003077055,0.000010509124,1.18266875e-7,0.7857374,0.00010405817,0.21277544,0.0009099362,0.00021892358],"about_ca_topic_score_codex":0.000009059641,"about_ca_topic_score_gemma":0.000089953464,"teacher_disagreement_score":0.7692739,"about_ca_system_score_codex":0.000056069024,"about_ca_system_score_gemma":0.00016200116,"threshold_uncertainty_score":0.86673176},"labels":[],"label_agreement":null},{"id":"W2606287281","doi":"10.1007/978-3-319-57339-7_8","title":"Impossible Differential Attack on Reduced Round SPARX-64/128","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Linear cryptanalysis; Boomerang attack; Impossible differential cryptanalysis; Key schedule; Differential cryptanalysis; Slide attack; Cryptanalysis; Block (permutation group theory); Key (lock); Arithmetic; Algorithm; Cryptography; Computer security; Mathematics; Combinatorics","score_opus":0.05118550427910774,"score_gpt":0.3207620935548922,"score_spread":0.2695765892757845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606287281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050939578,0.00009085316,0.98501474,0.0009914102,0.003639665,0.0004845169,0.000018415612,0.00014751167,0.0045189424],"genre_scores_gemma":[0.9056995,0.000066049084,0.091413744,0.00096829736,0.0010642289,0.000020679146,0.000026137468,0.000049821876,0.0006915792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955031,0.00004067465,0.0005790895,0.0018117393,0.0012125307,0.00085284165],"domain_scores_gemma":[0.996138,0.0002902808,0.00046737105,0.002651511,0.00021263954,0.00024023355],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058324524,0.0006311226,0.00058573275,0.0009848244,0.0009902364,0.002109117,0.0047199856,0.0003087313,0.00009611393],"category_scores_gemma":[0.000059770544,0.00056563807,0.0002443439,0.00030695242,0.00078331487,0.0007509782,0.0014763215,0.0009113298,0.00006546116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029377916,0.00018520303,0.00017617171,0.0000672586,0.00005836578,0.00019069167,0.002407056,0.00234954,0.000678618,0.18464062,0.0004816317,0.8087355],"study_design_scores_gemma":[0.0024105266,0.0015640402,0.0046290485,0.0012156321,0.00005836231,0.00020542736,9.731483e-7,0.39722124,0.0054689837,0.56498504,0.018599888,0.0036408752],"about_ca_topic_score_codex":0.00008441138,"about_ca_topic_score_gemma":0.00031084768,"teacher_disagreement_score":0.9006055,"about_ca_system_score_codex":0.00024112129,"about_ca_system_score_gemma":0.0005223776,"threshold_uncertainty_score":0.9996795},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02221386052367519,"score_gpt":0.28915963604532674,"score_spread":0.26694577552165155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621100381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029010968,0.00021534192,0.9928827,0.0003344949,0.0013080918,0.00025943102,0.000017532288,0.000056776793,0.002024509],"genre_scores_gemma":[0.84088206,0.00006374005,0.15841956,0.00013508166,0.00029304766,0.0000071047552,0.000011603421,0.000021437474,0.00016635614],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634224,0.000032553053,0.00070706184,0.0012552402,0.0010940217,0.0005688914],"domain_scores_gemma":[0.9962452,0.00021627141,0.00069738476,0.00234781,0.00033972133,0.00015363016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062072976,0.00044707186,0.0006821413,0.0012935637,0.00053617335,0.00086809974,0.0043364763,0.00023773233,0.000098126904],"category_scores_gemma":[0.000060893355,0.0004056014,0.0003222405,0.00046405182,0.0010167473,0.00066284044,0.0014464813,0.0005269519,0.000008410199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010957315,0.000116796095,0.0003394469,0.000085221574,0.0001318354,0.00006453357,0.0021563869,0.0010329395,0.0019403561,0.17960854,0.00005510496,0.8144579],"study_design_scores_gemma":[0.0008264925,0.00036453776,0.0027836298,0.0004384496,0.000109993576,0.00006432839,6.0703877e-7,0.22271426,0.006828107,0.76267916,0.0018449957,0.0013454318],"about_ca_topic_score_codex":0.00016757123,"about_ca_topic_score_gemma":0.0003731672,"teacher_disagreement_score":0.837981,"about_ca_system_score_codex":0.0001336323,"about_ca_system_score_gemma":0.0005363691,"threshold_uncertainty_score":0.9998396},"labels":[],"label_agreement":null},{"id":"W2622476250","doi":"","title":"The mini-square propagation over block cipher and its application to AES and Camellia","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; Camellia; Square (algebra); Arithmetic; Cipher; Computer science; Advanced Encryption Standard; Block (permutation group theory); Mathematics; Parallel computing; Computer security; Cryptography; Combinatorics; Encryption","score_opus":0.015247129928773652,"score_gpt":0.24494426601043315,"score_spread":0.2296971360816595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622476250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50519943,0.0021888008,0.47268873,0.013459319,0.00021828659,0.0018068274,0.0000433028,0.00022615935,0.004169114],"genre_scores_gemma":[0.9770777,0.00085349253,0.02091016,0.00012613606,0.000017259337,0.00027733084,0.00006321753,0.000019262476,0.00065539073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700564,0.0012671942,0.00039543596,0.0007474084,0.00031458403,0.0002697379],"domain_scores_gemma":[0.99645525,0.0005271725,0.00031808225,0.0014639318,0.0010659772,0.00016957149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026363665,0.00023997325,0.00019304236,0.00014129431,0.0006735849,0.0007092523,0.0010212789,0.00014163644,0.000012292771],"category_scores_gemma":[0.00025509187,0.00020951575,0.00006704746,0.00039415393,0.00012287269,0.00019417722,0.0016764018,0.00029386574,0.0000098279725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009586422,0.00021160762,0.0034126982,0.00013961564,0.00005866692,0.0000010696724,0.027328312,0.000011686033,0.0017624561,0.8076394,0.0008796121,0.15854527],"study_design_scores_gemma":[0.0029196397,0.000012580313,0.23057722,0.0028389376,0.0002690564,0.000076522825,0.0019958618,0.31702942,0.07373989,0.17382228,0.19297378,0.0037448334],"about_ca_topic_score_codex":0.0007506907,"about_ca_topic_score_gemma":0.002287617,"teacher_disagreement_score":0.63381714,"about_ca_system_score_codex":0.00003889055,"about_ca_system_score_gemma":0.00010440829,"threshold_uncertainty_score":0.8543804},"labels":[],"label_agreement":null},{"id":"W2644882662","doi":"10.1007/978-981-10-5421-1_2","title":"Security Analysis of a Design Variant of Randomized Hashing","year":2017,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Random oracle; Hash function; Universal hashing; Computer science; Theoretical computer science; Ideal (ethics); Block cipher; Scheme (mathematics); Encryption; Discrete mathematics; Algorithm; Mathematics; Cryptography; Computer security; Double hashing; Cryptographic hash function; Public-key cryptography","score_opus":0.05787759745006473,"score_gpt":0.3294114474565487,"score_spread":0.271533850006484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2644882662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000743951,0.00021956842,0.9610029,0.00022114173,0.00009463284,0.00046966656,0.00002836344,0.000018478326,0.037870865],"genre_scores_gemma":[0.6303102,0.0036828665,0.36566606,0.0001475484,0.000009231602,0.000035737394,0.0000675082,0.0000051085945,0.000075756856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997874,0.00010695171,0.001193038,0.00020328206,0.00047795498,0.00014474985],"domain_scores_gemma":[0.9945721,0.00075699965,0.0013415756,0.0026157696,0.00065564626,0.000057904577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047064563,0.00015627789,0.00076627854,0.0026569972,0.00037450992,0.00035818567,0.0035278518,0.000082757935,0.000009862986],"category_scores_gemma":[0.00015567249,0.00014586968,0.00019939763,0.00067107996,0.0016107465,0.0040225536,0.0017134727,0.00021674862,0.0000011807357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033164324,0.00001810836,0.000019775991,0.000020979247,0.00011305896,1.5461538e-7,0.005741186,0.00043215544,0.0000013315279,0.96831065,0.000016229622,0.025293225],"study_design_scores_gemma":[0.003622459,0.000028501834,0.00045315232,0.00011217201,0.00015719923,0.0000036582467,0.000022009768,0.94787675,0.000011609535,0.04525263,0.0022831229,0.00017671459],"about_ca_topic_score_codex":0.00009884784,"about_ca_topic_score_gemma":0.00003642256,"teacher_disagreement_score":0.9474446,"about_ca_system_score_codex":0.00003738584,"about_ca_system_score_gemma":0.00028141384,"threshold_uncertainty_score":0.6555685},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02688131978149743,"score_gpt":0.3016479182361479,"score_spread":0.27476659845465046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2686848947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81056136,0.0000111919435,0.10367552,0.0034583441,0.00039658716,0.00015956732,0.000001918115,0.00028852973,0.081446975],"genre_scores_gemma":[0.9494609,0.000007229612,0.05005325,0.00017566298,0.000053246276,0.0000042912393,7.973032e-7,0.0000037095601,0.00024088447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99941355,0.00001678694,0.0001137954,0.00018520631,0.00012454025,0.00014610149],"domain_scores_gemma":[0.99920934,0.000025770698,0.000094031275,0.0005910242,0.000035838024,0.000043980894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020257384,0.00005957373,0.00006454954,0.000056787543,0.0009232571,0.00053913816,0.0005142017,0.000023323084,0.00007454633],"category_scores_gemma":[0.000043105738,0.000052267787,0.00004366798,0.000061927305,0.000031957432,0.00038965195,0.000178135,0.000059685815,0.000034033506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020313807,0.000043861757,0.002506635,0.0000048218985,0.000011734081,0.0000036473084,0.0016853322,7.5608e-7,0.005109388,0.8785562,0.0010590581,0.11101654],"study_design_scores_gemma":[0.0020402216,0.00033484647,0.52935255,0.00006412782,0.000025528785,0.00008506066,0.0023915283,0.18876702,0.0039668386,0.062225282,0.20974103,0.0010059599],"about_ca_topic_score_codex":0.0008902026,"about_ca_topic_score_gemma":0.00027798954,"teacher_disagreement_score":0.8163309,"about_ca_system_score_codex":0.000012699059,"about_ca_system_score_gemma":0.00001212254,"threshold_uncertainty_score":0.71010405},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.113827035115353,"score_gpt":0.4061523450565048,"score_spread":0.2923253099411518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727655671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047148383,0.000027505379,0.94800377,0.00029746292,0.00047938142,0.00047646574,0.00003902495,0.000048843405,0.050156068],"genre_scores_gemma":[0.49295083,0.0006360724,0.50166476,0.00030018276,0.00044477484,0.00017953374,0.0012525843,0.000034961045,0.002536339],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875045,0.000019281799,0.0004888936,0.0002810222,0.00030942634,0.00015092292],"domain_scores_gemma":[0.99867433,0.000089378256,0.0002393107,0.00029835064,0.00066638814,0.000032236592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010409392,0.000121521596,0.00019630598,0.00024734234,0.00008464502,0.00007110234,0.00026010297,0.00012329027,0.00023953471],"category_scores_gemma":[0.000038362206,0.00011051678,0.00012408348,0.00022033301,0.000014818426,0.00021286722,0.00007449246,0.00007407844,0.0000015086018],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015636959,0.00033532592,0.000604495,0.0004284835,0.00020851774,8.998705e-7,0.00088449585,0.00012782979,0.00076044275,0.20535885,0.15565152,0.6356235],"study_design_scores_gemma":[0.00082817534,0.00031619004,0.00063717936,0.000047965317,0.000068099595,0.000019866082,0.00020397783,0.06741556,0.00843638,0.0064283167,0.915016,0.0005822823],"about_ca_topic_score_codex":0.0003400336,"about_ca_topic_score_gemma":0.00040267434,"teacher_disagreement_score":0.7593645,"about_ca_system_score_codex":0.000061997554,"about_ca_system_score_gemma":0.00032822898,"threshold_uncertainty_score":0.45067438},"labels":[],"label_agreement":null},{"id":"W2734024146","doi":"10.1109/cec.2017.7969342","title":"Genetic programming for improved cryptanalysis of elliptic curve cryptosystems","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cryptanalysis; Counting points on elliptic curves; Elliptic curve point multiplication; Elliptic Curve Digital Signature Algorithm; Cryptosystem; Elliptic curve cryptography; Cryptography; Public-key cryptography; Computer science; Discrete logarithm; Elliptic curve; Key (lock); Mathematics; Theoretical computer science; Algorithm; Encryption; Pure mathematics","score_opus":0.027501843344570346,"score_gpt":0.3078349570095557,"score_spread":0.28033311366498537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734024146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057837836,0.00007022634,0.9407636,0.00030236907,0.00017046127,0.00050792866,0.000007078874,0.00004734332,0.00029313593],"genre_scores_gemma":[0.7142905,0.000008890323,0.28553554,0.000018191498,0.00003304222,0.00006940951,0.0000021239466,0.000004886359,0.00003741027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890846,0.00002382325,0.00037337732,0.00029431132,0.00014114667,0.0002588694],"domain_scores_gemma":[0.9982455,0.000067143716,0.00033037105,0.0010721557,0.00021743031,0.00006744855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033959548,0.00010846927,0.00021871946,0.00012585906,0.0004276648,0.0003922917,0.0010281216,0.00003721772,0.000018383287],"category_scores_gemma":[0.0000619782,0.00009298222,0.0001996867,0.00015853693,0.00006281031,0.00030200672,0.00016204275,0.00003781814,0.0000021334058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016742872,0.00030711858,0.029397318,0.00024731015,0.00039853467,0.000002408492,0.0014176554,0.00002830906,0.009573129,0.47966632,0.00045331998,0.47849184],"study_design_scores_gemma":[0.0031777502,0.000790501,0.06054101,0.00005707248,0.00024714478,0.000013060492,0.0006736375,0.8571544,0.008960073,0.03325122,0.034199305,0.0009347948],"about_ca_topic_score_codex":0.00040037453,"about_ca_topic_score_gemma":0.00036882955,"teacher_disagreement_score":0.8571261,"about_ca_system_score_codex":0.0000123058935,"about_ca_system_score_gemma":0.000042237287,"threshold_uncertainty_score":0.37917048},"labels":[],"label_agreement":null},{"id":"W2735625861","doi":"10.2298/fuee1704459s","title":"A novel architecture with scalable security having expandable computational complexity for stream ciphers","year":2017,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Stream cipher; Modulo; Computer science; Probabilistic logic; Theoretical computer science; Cryptography; Scalability; Polynomial; Cipher; S-box; Advanced Encryption Standard; Cryptanalysis; Keystream; Algorithm; Mathematics; Encryption; Discrete mathematics; Block cipher","score_opus":0.016318863626954786,"score_gpt":0.2440353214889099,"score_spread":0.22771645786195513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735625861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24289323,0.00010077661,0.7541472,0.0017400787,0.00007239882,0.00022369905,0.00018093252,0.00005915312,0.0005825727],"genre_scores_gemma":[0.7998188,0.000083038496,0.19982925,0.000059865317,0.000015948935,0.0000061344035,0.00008912306,0.000010346424,0.00008747713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988716,0.00001844526,0.00013511292,0.0003557364,0.00019925309,0.00041982773],"domain_scores_gemma":[0.99910545,0.0000750089,0.00015827635,0.00036968337,0.00017635025,0.00011522439],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00011257535,0.0001821449,0.00019129457,0.00008510941,0.0016566898,0.00048850424,0.0004953801,0.000054213488,0.000012755332],"category_scores_gemma":[0.00001531267,0.00017597062,0.000051577197,0.00011641015,0.00025422388,0.0006898298,0.00020474404,0.00013947922,2.2242428e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009103406,0.00010614735,0.0014446067,0.000043865,0.00012973258,0.000004920941,0.0032629662,0.0038195252,0.00037634393,0.985751,0.0006431779,0.0043266932],"study_design_scores_gemma":[0.009359088,0.0039226506,0.017500203,0.00011722385,0.0002367361,0.0001876097,0.0066331564,0.28923514,0.0021844974,0.5458426,0.12267001,0.0021110915],"about_ca_topic_score_codex":0.00027553784,"about_ca_topic_score_gemma":0.002788725,"teacher_disagreement_score":0.5569256,"about_ca_system_score_codex":0.000060384293,"about_ca_system_score_gemma":0.00017084231,"threshold_uncertainty_score":0.999643},"labels":[],"label_agreement":null},{"id":"W2736532017","doi":"10.1007/978-3-319-62024-4_6","title":"Efficient Implementation of Ring-LWE Encryption on High-End IoT Platform","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Cryptography; Computation; Embedded system; Parallel computing; Computer network; Algorithm","score_opus":0.0237106971154101,"score_gpt":0.29723984714986695,"score_spread":0.2735291500344569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736532017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016965022,0.000057183865,0.9793289,0.00032684612,0.0015224045,0.0005271774,0.000038561517,0.00006869163,0.001165261],"genre_scores_gemma":[0.9023111,0.000020168127,0.09718857,0.00021812164,0.00019040682,0.000011578024,0.000018438439,0.000018136989,0.000023469483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996449,0.000021653228,0.00066378445,0.0011053812,0.001230564,0.000529611],"domain_scores_gemma":[0.99715203,0.00025009198,0.0007046608,0.0015250951,0.00024847724,0.000119630255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009672525,0.0004182702,0.00044262555,0.0011590187,0.0005070432,0.00041277803,0.0023073645,0.00018359168,0.00007737748],"category_scores_gemma":[0.000031487707,0.00038755758,0.00015435122,0.00030145148,0.0005304453,0.0002331493,0.0007636952,0.00046983513,0.000016666387],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008088001,0.000052925265,0.000110082445,0.00004127654,0.00001636923,0.000016822312,0.0013693055,0.017853342,0.00025154022,0.2418744,0.00001081713,0.73839504],"study_design_scores_gemma":[0.0024819495,0.0016358336,0.013495353,0.0008759737,0.000048072925,0.00005870425,0.000006653916,0.51639444,0.014702663,0.44684356,0.0015853668,0.0018714559],"about_ca_topic_score_codex":0.00027074717,"about_ca_topic_score_gemma":0.0005125237,"teacher_disagreement_score":0.8853461,"about_ca_system_score_codex":0.0002522787,"about_ca_system_score_gemma":0.00038538396,"threshold_uncertainty_score":0.9998576},"labels":[],"label_agreement":null},{"id":"W2736998317","doi":"10.1109/isvlsi.2017.44","title":"Secured-by-Design FPGA against Early Evaluation","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Qassim University","keywords":"Robustness (evolution); Field-programmable gate array; Lookup table; Computer science; Side channel attack; CMOS; Embedded system; Digital electronics; Logic synthesis; Logic gate; Computer hardware; Electronic circuit; Electronic engineering; Engineering; Electrical engineering; Computer security; Cryptography","score_opus":0.05821537628174,"score_gpt":0.3341636113966384,"score_spread":0.2759482351148984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736998317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058825813,0.000039576506,0.92888165,0.0013845032,0.00027420564,0.0003142215,0.0000043849795,0.00008889449,0.010186734],"genre_scores_gemma":[0.9750937,0.0000143671305,0.024456713,0.00026009924,0.000029973753,0.000032088676,0.000007580333,0.000003828902,0.00010159845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896616,0.00007392476,0.0001450857,0.00025165573,0.0003799207,0.00018325291],"domain_scores_gemma":[0.9988407,0.000034685112,0.00010521887,0.00081904954,0.0001374783,0.00006285677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077964383,0.00008275641,0.00007297496,0.00005804753,0.00062282884,0.0007811531,0.0008580424,0.000033319997,0.00010579077],"category_scores_gemma":[0.000048404745,0.00007390613,0.00004411036,0.00008757327,0.000039124858,0.00083534454,0.00014685535,0.00005918425,0.000046317124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008176587,0.0001783969,0.0024910748,0.0000067577334,0.000056008903,0.0000054013203,0.0031651307,0.000053798296,0.0028948593,0.22432168,0.1012298,0.6655889],"study_design_scores_gemma":[0.0052300226,0.00052574306,0.10808368,0.00003219551,0.000058111033,0.000008583174,0.0003002737,0.64422333,0.022596104,0.16763255,0.049991474,0.001317907],"about_ca_topic_score_codex":0.00013449362,"about_ca_topic_score_gemma":0.00004558013,"teacher_disagreement_score":0.91626793,"about_ca_system_score_codex":0.000021443522,"about_ca_system_score_gemma":0.000057768066,"threshold_uncertainty_score":0.75326777},"labels":[],"label_agreement":null},{"id":"W2740132794","doi":"10.23977/jeeem.2017.11005","title":"Clock Glitch Fault Injection Attacks on an FPGA AES Implementation","year":2017,"lang":"en","type":"article","venue":"Journal of Electrotechnology Electrical Engineering and Management","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Glitch; Computer science; Field-programmable gate array; Encryption; Advanced Encryption Standard; AES implementations; Fault injection; Embedded system; Key (lock); Fault (geology); Cryptography; Computer security; Operating system; Software","score_opus":0.008845814950456712,"score_gpt":0.2877073793628055,"score_spread":0.2788615644123488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740132794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45028064,0.00020379269,0.54644877,0.0023745308,0.00022749385,0.00024143138,6.172753e-7,0.00012013157,0.00010261614],"genre_scores_gemma":[0.98977345,0.00058867387,0.009460236,0.000087775385,0.00005563008,0.000015142719,9.635319e-7,0.000008353436,0.000009779518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988854,0.000023409002,0.00032554852,0.00021850965,0.00022407646,0.00032307341],"domain_scores_gemma":[0.9991812,0.000022218277,0.00026245925,0.000384432,0.000074677664,0.00007500546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037513176,0.00013947616,0.0001828249,0.0006010575,0.00031457472,0.0002043325,0.00059502764,0.00007489432,0.0000027814838],"category_scores_gemma":[0.000031533953,0.0001277798,0.0000608733,0.00026960124,0.000025094036,0.000428694,0.00010493779,0.00037185143,8.555593e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003551443,0.00015523673,0.00035116004,0.000023859693,0.00017308263,0.00006221927,0.00009537223,0.0008377,0.0028303221,0.50840807,0.00050296076,0.4865245],"study_design_scores_gemma":[0.016916588,0.04519358,0.1530893,0.00027454802,0.00060790824,0.0032468673,0.00072036666,0.4424413,0.1066078,0.10127481,0.12641977,0.003207168],"about_ca_topic_score_codex":0.00002062871,"about_ca_topic_score_gemma":0.00001172499,"teacher_disagreement_score":0.5394928,"about_ca_system_score_codex":0.000078366225,"about_ca_system_score_gemma":0.00001666615,"threshold_uncertainty_score":0.5210709},"labels":[],"label_agreement":null},{"id":"W2757941019","doi":"10.1109/mwscas.2017.8053158","title":"Template attacks based on static power analysis of block ciphers in 45-nm CMOS environment","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Side channel attack; Power analysis; Block cipher; Computer science; Cryptography; Block (permutation group theory); Cryptanalysis; Block size; Power consumption; Channel (broadcasting); Power (physics); S-box; Embedded system; Parallel computing; Algorithm; Computer network; Computer security; Mathematics","score_opus":0.02239333471860355,"score_gpt":0.3015380531482928,"score_spread":0.27914471842968924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757941019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8558963,0.0000055327655,0.13847218,0.0010321871,0.00006180282,0.00019756716,0.000018190292,0.000019625715,0.004296629],"genre_scores_gemma":[0.98982,0.000005571077,0.009907007,0.00021183997,0.000001762421,0.000009782178,0.0000050310687,0.0000030402182,0.00003594308],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99895024,0.00004487231,0.00027111315,0.00026673765,0.00028549018,0.00018156109],"domain_scores_gemma":[0.9987313,0.00007676807,0.0001559809,0.0009647619,0.000014966632,0.000056177836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003065221,0.00009537474,0.00019027329,0.00036248713,0.00013015504,0.00009643204,0.00055153464,0.000027093041,0.00051146804],"category_scores_gemma":[0.000011281841,0.00008344405,0.0001140733,0.0003100403,0.0000574083,0.00015677552,0.000103756276,0.00006271351,0.00000928039],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066868684,0.0020196298,0.8103174,0.00004198484,0.0011684323,0.00007376248,0.005925629,0.08781039,0.0012133381,0.061520804,0.0017530634,0.028088672],"study_design_scores_gemma":[0.00088318373,0.00018231757,0.5245722,0.000009968749,0.00008220786,2.3510437e-7,0.00022137084,0.47163278,0.0005205115,0.00042970313,0.0012644605,0.0002010688],"about_ca_topic_score_codex":0.0004663716,"about_ca_topic_score_gemma":0.0005012065,"teacher_disagreement_score":0.38382238,"about_ca_system_score_codex":0.000029693503,"about_ca_system_score_gemma":0.00002133602,"threshold_uncertainty_score":0.56002164},"labels":[],"label_agreement":null},{"id":"W2766604835","doi":"10.1007/978-3-319-69453-5_12","title":"Keymill: Side-Channel Resilient Key Generator, A New Concept for SCA-Security by Design","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Side channel attack; Computer science; Block cipher; Power analysis; Cryptography; Countermeasure; Cryptographic primitive; Stream cipher; Block cipher mode of operation; Cryptographic nonce; Computer security; Key (lock); Security analysis; Theoretical computer science; Encryption; Cryptographic protocol","score_opus":0.03349821390919246,"score_gpt":0.28576978437935513,"score_spread":0.2522715704701627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766604835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041473028,0.0017320083,0.9925858,0.0014169659,0.0021626283,0.0013603963,0.00007930237,0.00015079242,0.00047063298],"genre_scores_gemma":[0.11653953,0.00025720338,0.8769991,0.0036175076,0.0014534035,0.00010951701,0.00008290734,0.00010498391,0.0008358711],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498904,0.00006554039,0.0007378582,0.0020993215,0.0010796454,0.0010285764],"domain_scores_gemma":[0.9957258,0.0006596013,0.0005705172,0.002205407,0.00041178116,0.00042686987],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012382595,0.0007187794,0.0007040694,0.00064966734,0.0010615089,0.0014814303,0.004615368,0.00038561918,0.000024708539],"category_scores_gemma":[0.0001773934,0.00068800687,0.00028513386,0.00031989912,0.000849983,0.00079618156,0.0011932657,0.0006132199,0.000012514645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007324365,0.00020543877,0.000032537715,0.00011859826,0.00011419221,0.00010073178,0.013059193,0.018919347,0.00081074156,0.15611438,0.027630892,0.7828207],"study_design_scores_gemma":[0.0011688832,0.0005546028,0.000017505901,0.00022808352,0.000024540566,0.00003944177,9.71737e-7,0.37114647,0.0050778985,0.599175,0.021332106,0.0012344988],"about_ca_topic_score_codex":0.00019678268,"about_ca_topic_score_gemma":0.00032731175,"teacher_disagreement_score":0.7815862,"about_ca_system_score_codex":0.00024907888,"about_ca_system_score_gemma":0.0012931885,"threshold_uncertainty_score":0.99955714},"labels":[],"label_agreement":null},{"id":"W2773602264","doi":"10.1109/edssc.2017.8126542","title":"A specific data transfer controller for multiple crypto IPs in a security processor","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Industry and Information Technology of the People's Republic of China; Sustainable Development Technology Canada","keywords":"Computer science; Encryption; Embedded system; Cryptography; Pipeline (software); Transfer (computing); Controller (irrigation); Process (computing); Data transmission; Computer hardware; Parallel computing; Operating system; Algorithm","score_opus":0.1053883407517516,"score_gpt":0.3460025070679005,"score_spread":0.24061416631614888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773602264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06774961,0.00007816613,0.92740744,0.0020507274,0.00017882715,0.0011213926,0.0001530417,0.000072697796,0.0011881193],"genre_scores_gemma":[0.97284263,0.000023018145,0.026703812,0.00018452486,0.000054569384,0.00012810931,0.000029320187,0.0000068118316,0.000027211749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986385,0.000025811703,0.00028683673,0.00054790423,0.00017889649,0.00032204422],"domain_scores_gemma":[0.99818105,0.00013765879,0.000048937585,0.0014735572,0.0000873404,0.000071483555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058631506,0.00012761937,0.00020084108,0.0001068766,0.00040767412,0.00056048005,0.0023052099,0.000047624057,0.00004457549],"category_scores_gemma":[0.00009268152,0.000109515975,0.00006179155,0.00012628139,0.00006107397,0.0012038954,0.00029475853,0.00009473879,0.000006648321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029403568,0.0011752272,0.046537288,0.00014223321,0.000087178334,0.000018478713,0.008825874,0.0000061683672,0.0011704233,0.8429139,0.017660758,0.081168436],"study_design_scores_gemma":[0.022400545,0.00025672393,0.07944042,0.000050865507,0.000020667352,0.000011558036,0.0006216478,0.5803335,0.0014275435,0.11511805,0.19934885,0.00096965197],"about_ca_topic_score_codex":0.00020785457,"about_ca_topic_score_gemma":0.0032906993,"teacher_disagreement_score":0.905093,"about_ca_system_score_codex":0.000013376921,"about_ca_system_score_gemma":0.00005041814,"threshold_uncertainty_score":0.5404722},"labels":[],"label_agreement":null},{"id":"W2777450615","doi":"10.1007/978-3-319-72565-9_22","title":"Multidimensional Zero-Correlation Linear Cryptanalysis of Reduced Round SPARX-128","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Linear cryptanalysis; Algorithm; Cryptanalysis; Codebook; Cryptography","score_opus":0.026933934945217456,"score_gpt":0.2906427089962751,"score_spread":0.26370877405105764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777450615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002081283,0.00017548006,0.99494773,0.00036776997,0.0012309114,0.000298347,0.000013070907,0.000055989625,0.0008294406],"genre_scores_gemma":[0.50924915,0.000037801095,0.49018767,0.00016670927,0.00017756302,0.0000050396725,0.000022149681,0.000017806451,0.00013608427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963592,0.00004346872,0.0007497167,0.0012102696,0.0011805699,0.00045675354],"domain_scores_gemma":[0.99635535,0.0003845472,0.0007786212,0.0018264736,0.0005147952,0.00014019907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001028064,0.00041672454,0.00059182604,0.0011437862,0.00051969255,0.00028042094,0.002272564,0.00026189908,0.00004987889],"category_scores_gemma":[0.00013605898,0.0003901818,0.00026797934,0.00045823105,0.00071886403,0.0007401049,0.0009586689,0.0005572341,0.00001781579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002916976,0.00020284898,0.0009809979,0.000088271016,0.00015412744,0.0000889569,0.0033357868,0.07738209,0.0032350305,0.23200548,0.00008806926,0.68240917],"study_design_scores_gemma":[0.0004470651,0.00014037106,0.0009263962,0.0002259709,0.000038270737,0.000024948044,2.4030908e-7,0.8152626,0.002256791,0.17917463,0.00094191177,0.00056081987],"about_ca_topic_score_codex":0.00014207179,"about_ca_topic_score_gemma":0.00015113644,"teacher_disagreement_score":0.7378805,"about_ca_system_score_codex":0.00014820398,"about_ca_system_score_gemma":0.0004990453,"threshold_uncertainty_score":0.999855},"labels":[],"label_agreement":null},{"id":"W2783187901","doi":"10.1109/asicon.2017.8252500","title":"The configurable current flattening circuit for DPA countermeasures","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Crohn's and Colitis Foundation of Canada","keywords":"Power analysis; Computer science; Cryptography; Chip; Design flow; Flattening; Power (physics); Cryptographic primitive; CMOS; Embedded system; Key (lock); Side channel attack; Electronic engineering; Electrical engineering; Cryptographic protocol; Computer security; Engineering; Telecommunications","score_opus":0.07540101510016846,"score_gpt":0.3507157958616234,"score_spread":0.27531478076145494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783187901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008263454,0.00025803753,0.9790372,0.0022093237,0.0011812598,0.00035009193,0.0000076244964,0.00007027714,0.008622731],"genre_scores_gemma":[0.99844956,0.00004293606,0.0011135191,0.00009646134,0.000061547595,0.000059404952,0.0000017626252,0.0000033212923,0.00017146212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928063,0.000013833801,0.00013801841,0.0001752298,0.00016161807,0.00023068002],"domain_scores_gemma":[0.99892515,0.00012542435,0.00009929046,0.0006979296,0.00011168598,0.00004053733],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047318474,0.00006793994,0.00006678201,0.000023299266,0.0023859935,0.0013753843,0.0010986701,0.00001337064,0.000015089275],"category_scores_gemma":[0.00006211809,0.00004411217,0.00006911169,0.000033036657,0.000073939955,0.00033761727,0.00009575193,0.000055756132,0.000007595238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015719469,0.000011587598,0.0013163006,0.000005223412,0.000010984804,2.7340803e-7,0.000239373,7.9784945e-7,0.00011927442,0.79020363,0.0072833365,0.20080762],"study_design_scores_gemma":[0.0010152258,0.00007368824,0.028655337,0.000024484503,0.000012580631,0.0000071513036,0.0002099095,0.030592406,0.0013075027,0.11444415,0.8233771,0.00028048982],"about_ca_topic_score_codex":0.00005944165,"about_ca_topic_score_gemma":0.00022504665,"teacher_disagreement_score":0.99018615,"about_ca_system_score_codex":0.00001019544,"about_ca_system_score_gemma":0.00004183303,"threshold_uncertainty_score":0.99966127},"labels":[],"label_agreement":null},{"id":"W2784107617","doi":"10.1109/uemcon.2017.8248990","title":"Electromagnetic analysis method for ultra low power cipher Midori","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Egg Farmers of Canada; National Security Agency","keywords":"Side channel attack; Cipher; Cryptography; Computer science; Power analysis; Power (physics); Power consumption; Electromagnetic radiation; Key (lock); Electrical engineering; Computer security; Engineering; Encryption; Physics; Optics","score_opus":0.01589744893180434,"score_gpt":0.340005374166496,"score_spread":0.3241079252346917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784107617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018957311,0.00001782848,0.97363806,0.0012872989,0.00011740869,0.0001694602,0.0000049517826,0.00005477086,0.0057529244],"genre_scores_gemma":[0.5821846,0.000003874252,0.4171474,0.0002305531,0.00001660273,0.00002807996,0.0000038617986,0.0000032183416,0.00038176257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990786,0.000031369582,0.00016534995,0.00031273524,0.0001459813,0.00026599562],"domain_scores_gemma":[0.9987109,0.00009857414,0.00009422574,0.00093377865,0.00009605742,0.00006648526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037417747,0.000092323135,0.00015578861,0.0001558919,0.00045899383,0.000487344,0.0008541585,0.000031889213,0.00036120333],"category_scores_gemma":[0.0000370258,0.00007832599,0.00022869892,0.0003288996,0.000026102343,0.00029829566,0.000060283644,0.000045074616,0.000006950639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014982764,0.00025146123,0.007416469,0.000017957667,0.00092568254,0.000005073526,0.0015311422,0.00002945713,0.013293435,0.9149871,0.007496373,0.05403087],"study_design_scores_gemma":[0.0041481876,0.0015427805,0.36866233,0.000011005906,0.0011308863,0.000018550983,0.00039589792,0.40023124,0.033245314,0.13260916,0.056287933,0.0017167145],"about_ca_topic_score_codex":0.00023009226,"about_ca_topic_score_gemma":0.00044040487,"teacher_disagreement_score":0.78237796,"about_ca_system_score_codex":0.000010166743,"about_ca_system_score_gemma":0.000025154352,"threshold_uncertainty_score":0.46994692},"labels":[],"label_agreement":null},{"id":"W2785873973","doi":"10.1109/pimrc.2017.8292209","title":"SIMON 32/64 and 64/128 block cipher: Study of cross correlation and linear span attack immunity","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; Computer science; Cryptography; Cipher; Stream cipher; Power analysis; Realization (probability); Block (permutation group theory); Correlation attack; Span (engineering); Linear span; Theoretical computer science; Embedded system; Computer engineering; Algorithm; Mathematics; Computer security; Encryption; Engineering; Discrete mathematics; Statistics","score_opus":0.05051019145519279,"score_gpt":0.3691588482566055,"score_spread":0.3186486568014127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785873973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856359,0.000029554873,0.012822325,0.00009672943,0.00011490468,0.00028849705,0.0000035177961,0.000027999817,0.0009806164],"genre_scores_gemma":[0.99754703,0.000023904162,0.0022758578,0.000023626953,0.000018773462,0.0000058668957,0.0000020504356,0.0000035684247,0.000099338446],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999184,0.00006006522,0.00024067205,0.00021917291,0.00015849271,0.0001375855],"domain_scores_gemma":[0.9989337,0.00007513584,0.00017575372,0.00063566735,0.00012565931,0.0000540965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035906586,0.00009157604,0.0001385274,0.00005710226,0.0008091913,0.00025700944,0.00033694916,0.000039119022,0.000019221578],"category_scores_gemma":[0.000038290324,0.00008103526,0.000021723203,0.00008945541,0.00011991357,0.0005110192,0.00046248804,0.00010800909,0.0000017231372],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001032031,0.0002123708,0.9862044,0.000013642271,0.000026044354,0.0000016528803,0.0046981424,0.00005314238,0.00006682906,0.0029735046,0.00008286312,0.0056571285],"study_design_scores_gemma":[0.0012673807,0.0003213065,0.9413065,0.000006846189,0.000011977725,0.0000018881151,0.0012106611,0.05479926,0.00008084335,0.00041770167,0.00046273135,0.00011290655],"about_ca_topic_score_codex":0.0016964254,"about_ca_topic_score_gemma":0.0022726099,"teacher_disagreement_score":0.054746117,"about_ca_system_score_codex":0.000006110139,"about_ca_system_score_gemma":0.000016650978,"threshold_uncertainty_score":0.62237275},"labels":[],"label_agreement":null},{"id":"W2785890835","doi":"10.1109/icm.2017.8268841","title":"Fault analysis-resistant implementation of Rainbow Signature scheme","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Overhead (engineering); Cryptography; Cryptosystem; Signature (topology); Field-programmable gate array; Digital signature; Fault injection; Computer engineering; Embedded system; Algorithm; Computer security; Mathematics","score_opus":0.018424066915271868,"score_gpt":0.33979673633384083,"score_spread":0.32137266941856896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785890835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48733172,0.000052914365,0.5076509,0.0018579533,0.00014056868,0.00024828225,0.000037377577,0.00007108733,0.0026091584],"genre_scores_gemma":[0.9500017,0.000007393613,0.049807664,0.00008836604,0.000013700157,0.0000074242525,0.000016439171,0.0000023152422,0.000054959426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99904454,0.000026112335,0.0002605473,0.0002328041,0.0002687769,0.00016720332],"domain_scores_gemma":[0.998663,0.000026690153,0.00025627887,0.00086528604,0.0001388206,0.000049926584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028887403,0.00008486393,0.00015606545,0.00022521486,0.00035320432,0.00023840845,0.0008270418,0.00003342751,0.00031593462],"category_scores_gemma":[0.00001466645,0.000072417155,0.00015673596,0.00041265727,0.00004935309,0.000482306,0.00019203221,0.00005931374,0.0000025999284],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000853733,0.00009086619,0.077723466,0.000018905235,0.0006350538,0.0000055595096,0.001710307,0.000015045324,0.016747981,0.87444234,0.0020106442,0.02659131],"study_design_scores_gemma":[0.0015505393,0.00015663181,0.93539053,0.000006549908,0.00020367409,0.0000012423036,0.0016898833,0.018433457,0.024727728,0.011920977,0.005523546,0.00039521873],"about_ca_topic_score_codex":0.00095289527,"about_ca_topic_score_gemma":0.0022052089,"teacher_disagreement_score":0.86252135,"about_ca_system_score_codex":0.000011551634,"about_ca_system_score_gemma":0.000041501717,"threshold_uncertainty_score":0.34592625},"labels":[],"label_agreement":null},{"id":"W2787740847","doi":"10.1109/icm.2017.8268818","title":"A power analysis resistant FPGA implementation of NTRUEncrypt","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Power analysis; Computer science; Cryptosystem; Field-programmable gate array; Cryptography; Side channel attack; Public-key cryptography; Key (lock); Correlation attack; Encryption; Embedded system; Theoretical computer science; Parallel computing; Block cipher; Algorithm; Computer network; Computer security","score_opus":0.017310103254226404,"score_gpt":0.3358451019182855,"score_spread":0.3185349986640591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787740847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4722717,0.00001688234,0.51939255,0.0011142337,0.00009768754,0.00013859247,0.000018795366,0.000041309853,0.0069082393],"genre_scores_gemma":[0.977868,0.0000065487197,0.022016453,0.00005960272,0.0000055028436,0.000006916613,0.000005123883,0.0000019427928,0.000029875364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99910957,0.000025760135,0.00026818662,0.00020852727,0.00023479322,0.00015319584],"domain_scores_gemma":[0.9986222,0.00002400365,0.00023516663,0.00096337555,0.00010956307,0.000045693752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029067232,0.000068821566,0.00014166105,0.00024843076,0.00032240644,0.00022819958,0.0007250786,0.0000182685,0.00069300865],"category_scores_gemma":[0.000012549486,0.00005965073,0.0001437106,0.00039179114,0.00004873202,0.0004653703,0.00018590315,0.000030561012,0.0000038952785],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008167322,0.00007672449,0.08588655,0.000008348202,0.0005246924,0.000005532497,0.0025204313,0.0000050498265,0.0022878735,0.8839687,0.001091142,0.023616781],"study_design_scores_gemma":[0.0005169591,0.000098605335,0.9778277,0.0000020175992,0.00009008942,7.149783e-7,0.0009247731,0.0009275514,0.007659601,0.010081344,0.0017260846,0.0001445301],"about_ca_topic_score_codex":0.0016897445,"about_ca_topic_score_gemma":0.0025707502,"teacher_disagreement_score":0.8919412,"about_ca_system_score_codex":0.000011778713,"about_ca_system_score_gemma":0.000038370832,"threshold_uncertainty_score":0.75879586},"labels":[],"label_agreement":null},{"id":"W2789275941","doi":"10.1109/access.2018.2799802","title":"Multi-Core Dataflow Design and Implementation of Secure Hash Algorithm-3","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dataflow; Computer science; Correctness; Asynchronous communication; Multi-core processor; Distributed computing; Dataflow architecture; Algorithm; Parallel computing; Embedded system; Computer network","score_opus":0.08566160202923975,"score_gpt":0.3973451439915232,"score_spread":0.31168354196228343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789275941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14396523,0.000029773653,0.8553214,0.000084200125,0.00026338984,0.00025707504,0.000033482796,0.000035615398,0.000009833833],"genre_scores_gemma":[0.6725165,0.000026034679,0.3272239,0.00013260252,0.000062357445,0.00001785663,0.000012593669,0.0000050957915,0.0000030440576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999084,0.000043368702,0.00023228797,0.0002785742,0.00017863256,0.00018314474],"domain_scores_gemma":[0.99927986,0.00005068248,0.0001181084,0.0003452101,0.00014964382,0.00005648307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028759122,0.000097427095,0.00011214211,0.00013221863,0.00015150824,0.0001892092,0.00059545925,0.00003117494,0.000056922723],"category_scores_gemma":[0.000004870767,0.00009157085,0.000025130435,0.00042407485,0.000089231085,0.0009933915,0.00019276631,0.000050554005,0.0000032626194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017895669,0.00030875424,0.029626215,0.000092185335,0.00014041623,0.000014475965,0.012982505,0.000026438425,0.013367867,0.012634352,0.013983615,0.91680527],"study_design_scores_gemma":[0.0066222968,0.0010171243,0.18702129,0.00006749476,0.00008940923,0.000052834574,0.0014628945,0.5828776,0.19348717,0.019862255,0.006368049,0.0010716169],"about_ca_topic_score_codex":0.00039712156,"about_ca_topic_score_gemma":0.0003380231,"teacher_disagreement_score":0.91573364,"about_ca_system_score_codex":0.000009223451,"about_ca_system_score_gemma":0.000048140402,"threshold_uncertainty_score":0.3734151},"labels":[],"label_agreement":null},{"id":"W2792724063","doi":"10.1007/978-3-319-78556-1_2","title":"Improved Meet-in-the-Middle Attacks on Reduced Round Kuznyechik","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Block cipher; Cipher; Ciphertext; Plaintext; GOST (hash function); Algorithm; Theoretical computer science; Encryption; Cryptography; Computer security","score_opus":0.03911000237980846,"score_gpt":0.28815823016191994,"score_spread":0.24904822778211147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792724063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004736492,0.00010368906,0.9872818,0.0015654694,0.0018446537,0.0007157083,0.000009051076,0.00009872339,0.0036444247],"genre_scores_gemma":[0.8244362,0.00003481809,0.16835552,0.005910701,0.0009713399,0.000044252163,0.000015746402,0.00004628595,0.00018511953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586433,0.000079803125,0.0006244074,0.0015774205,0.001053307,0.0008007508],"domain_scores_gemma":[0.99689776,0.0005740913,0.00028116876,0.0019352032,0.00019042926,0.000121364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016287151,0.00053011585,0.0004381303,0.0010401731,0.00043845407,0.00096116826,0.004406057,0.00025703973,0.00005618515],"category_scores_gemma":[0.00006673849,0.00041273536,0.00017059036,0.0011620376,0.0007858995,0.0004849739,0.0007729009,0.0007727307,0.00003379866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004699962,0.00038271325,0.000105699255,0.00009335251,0.000047345493,0.00024230125,0.03039538,0.0017661832,0.0007540861,0.39130995,0.00076427305,0.57409173],"study_design_scores_gemma":[0.0012655423,0.0014974377,0.00050365826,0.000600996,0.000020213642,0.0001430892,0.0000081164,0.33429408,0.0018167523,0.64824945,0.009834973,0.0017656741],"about_ca_topic_score_codex":0.00008369283,"about_ca_topic_score_gemma":0.00104063,"teacher_disagreement_score":0.8196997,"about_ca_system_score_codex":0.00023022694,"about_ca_system_score_gemma":0.00039146296,"threshold_uncertainty_score":0.99983245},"labels":[],"label_agreement":null},{"id":"W2794116586","doi":"10.1109/tc.2018.2811467","title":"Towards a Cryptographic Minimal Design: The sLiSCP Family of Permutations","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Institute of Standards and Technology","keywords":"Computer science; Cryptography; Cryptographic primitive; Symmetric-key algorithm; Encryption; Theoretical computer science; Overhead (engineering); Pseudorandom number generator; Hash function; Cryptographic protocol; Algorithm; Public-key cryptography; Computer network; Computer security","score_opus":0.04050270576651208,"score_gpt":0.2847700426373786,"score_spread":0.24426733687086652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794116586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033169135,0.000021817697,0.9639811,0.00095410744,0.0011768249,0.00032717045,0.000020818445,0.0001297539,0.00021928948],"genre_scores_gemma":[0.8829626,0.000021400805,0.11633895,0.0005666407,0.000051279414,0.00004214835,0.0000010054816,0.000009757298,0.000006201461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984413,0.00017283179,0.00036673548,0.0003483667,0.00037955193,0.0002912537],"domain_scores_gemma":[0.9986821,0.00027880372,0.00010869209,0.00061604107,0.0002269185,0.000087445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032464432,0.0001815092,0.00017344781,0.00039656842,0.00057461753,0.00013200869,0.000864175,0.000054181015,0.000035961366],"category_scores_gemma":[0.000002799025,0.00014333695,0.00022339768,0.0014597785,0.00036326193,0.00028975113,0.0000072089133,0.00017917053,0.000019028696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022858918,0.0021711485,0.00009889409,0.00005298074,0.0009307202,0.00002333587,0.042710688,0.029336542,0.010575023,0.12616943,0.00982471,0.7778779],"study_design_scores_gemma":[0.0038701023,0.004399352,0.015496285,0.0001701513,0.00023945482,0.00011409255,0.0023884578,0.91127205,0.04063242,0.012915885,0.0071027526,0.001398977],"about_ca_topic_score_codex":0.00012374374,"about_ca_topic_score_gemma":0.00005471491,"teacher_disagreement_score":0.88193554,"about_ca_system_score_codex":0.00002321216,"about_ca_system_score_gemma":0.00012568524,"threshold_uncertainty_score":0.5845111},"labels":[],"label_agreement":null},{"id":"W2799714514","doi":"10.1155/2018/8475818","title":"Path Hopping: An MTD Strategy for Long-Term Quantum-Safe Communication","year":2018,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Eavesdropping; Communication source; Cryptosystem; Computer security; Adversary; Key (lock); Cryptography; Term (time); Path (computing); Theoretical computer science; Computer network","score_opus":0.04203667645628207,"score_gpt":0.32778477146391305,"score_spread":0.285748095007631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799714514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25613916,0.0040648086,0.7358516,0.0017461468,0.0001561738,0.0007973939,0.00001702812,0.00024037891,0.0009873009],"genre_scores_gemma":[0.98770714,0.0028207225,0.008496582,0.0004593999,0.000090521644,0.00010392861,0.00030252157,0.000012267969,0.000006920483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838966,0.0003880447,0.0004055976,0.00034445533,0.00015551597,0.00031675052],"domain_scores_gemma":[0.99698156,0.00025751433,0.00022770888,0.0020658092,0.00033015994,0.00013722741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009479239,0.00017832046,0.00018907161,0.0000992248,0.0012737762,0.00047491145,0.0015564096,0.00013795131,0.000028158227],"category_scores_gemma":[0.00001861458,0.00018828246,0.00006926391,0.00039508005,0.00032568446,0.00094177946,0.0004809452,0.00028091288,0.0000029792734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003575004,0.00029580842,0.0032677324,0.000030946365,0.000040442425,3.7385024e-7,0.0070375227,0.000050975996,0.000015347941,0.93056023,0.0009187309,0.057746142],"study_design_scores_gemma":[0.0012982425,0.00064594473,0.032387283,0.00010961189,0.000036109486,0.000019211893,0.0010173763,0.79940593,0.000040189487,0.15957874,0.004909693,0.00055167667],"about_ca_topic_score_codex":0.00012610768,"about_ca_topic_score_gemma":0.001387935,"teacher_disagreement_score":0.799355,"about_ca_system_score_codex":0.000024591938,"about_ca_system_score_gemma":0.00004723271,"threshold_uncertainty_score":0.9796985},"labels":[],"label_agreement":null},{"id":"W2808222014","doi":"10.1007/978-3-319-93638-3_9","title":"Distributed Time-Memory Tradeoff Attacks on Ciphers","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Block cipher; Key schedule; Key (lock); Distributed computing; Parallel computing; Stream cipher; Block size; Block cipher mode of operation; Cryptography; Block (permutation group theory); Theoretical computer science; Algorithm; Computer security; Differential cryptanalysis; Mathematics","score_opus":0.01869273401177257,"score_gpt":0.268629110131184,"score_spread":0.24993637611941144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808222014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070237194,0.000075503776,0.99120796,0.000987687,0.0013950854,0.0004295847,0.000048227506,0.00021122834,0.0049423343],"genre_scores_gemma":[0.46666282,0.00009578955,0.51719177,0.011030155,0.0029337322,0.00006172324,0.00028972857,0.0001830711,0.0015512068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594295,0.000044783323,0.0005470422,0.0015936736,0.0011018782,0.0007696492],"domain_scores_gemma":[0.9972851,0.00039478374,0.00026860504,0.0016109573,0.00021518023,0.00022534809],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000771653,0.0005570767,0.00047923593,0.0008164775,0.0004278301,0.0006125197,0.0031392674,0.00029033067,0.00035007467],"category_scores_gemma":[0.00005058092,0.0005137308,0.0001999778,0.00094757654,0.0009840176,0.0004470737,0.0007887243,0.00070380856,0.00024631855],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036372305,0.00024715497,0.00012945772,0.00007273031,0.000083755505,0.00026191914,0.005211057,0.009518179,0.00023256888,0.064989716,0.0051402887,0.9140768],"study_design_scores_gemma":[0.0014268511,0.0015353984,0.0008209024,0.00065592694,0.000034468147,0.00013573287,0.0000021821515,0.6475629,0.0021549056,0.31634253,0.02672531,0.0026028804],"about_ca_topic_score_codex":0.000015112676,"about_ca_topic_score_gemma":0.000057860143,"teacher_disagreement_score":0.91147393,"about_ca_system_score_codex":0.00027032843,"about_ca_system_score_gemma":0.00038655594,"threshold_uncertainty_score":0.9997314},"labels":[],"label_agreement":null},{"id":"W2810306726","doi":"10.1109/uic-atc.2017.8397603","title":"Whitenoise encryption implementation with increased robustness to side-channel attacks","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"A&L Canada Laboratories (Canada); University of Victoria","funders":"","keywords":"Robustness (evolution); Side channel attack; Computer science; Power analysis; Power consumption; Encryption; Implementation; Cryptography; Embedded system; Computer engineering; Power (physics); Computer network; Algorithm","score_opus":0.024842247735049658,"score_gpt":0.31839338600862366,"score_spread":0.293551138273574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810306726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37535828,0.000002414965,0.6215461,0.0015582575,0.00009633565,0.00031251513,0.0000073932274,0.00008789949,0.0010308151],"genre_scores_gemma":[0.952953,0.0000038588328,0.04643201,0.00041676007,0.00004734099,0.000077081306,0.000026465948,0.000008283714,0.000035189612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987254,0.00003828897,0.00022101899,0.00039567225,0.00031560863,0.00030401978],"domain_scores_gemma":[0.9985512,0.000027450336,0.00014700656,0.00092098274,0.0001851486,0.00016819207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031361767,0.00014686707,0.00012896948,0.00017825542,0.00082795025,0.0007658348,0.00077872595,0.000031158204,0.00010351672],"category_scores_gemma":[0.00001685206,0.00012116912,0.00004339681,0.00022312363,0.000037015998,0.00113738,0.00024907844,0.00006300971,0.000022701486],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023218368,0.00080305897,0.1117982,0.00011022084,0.00029414365,0.00012436291,0.014248019,0.0036148073,0.008416534,0.4849029,0.0156439,0.3598117],"study_design_scores_gemma":[0.0046768067,0.00095078547,0.9269422,0.000045203953,0.000054281263,0.000051719053,0.0030504914,0.04432574,0.009260189,0.0062373937,0.0032255228,0.0011796108],"about_ca_topic_score_codex":0.0019506529,"about_ca_topic_score_gemma":0.004181729,"teacher_disagreement_score":0.81514406,"about_ca_system_score_codex":0.000035507168,"about_ca_system_score_gemma":0.00006324275,"threshold_uncertainty_score":0.7384963},"labels":[],"label_agreement":null},{"id":"W2835352419","doi":"10.1016/j.jisa.2018.06.005","title":"Single key MITM attack and biclique cryptanalysis of full round Khudra","year":2018,"lang":"en","type":"article","venue":"Journal of Information Security and Applications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Board for Higher Mathematics","keywords":"Block cipher; Boomerang attack; Slide attack; Cryptanalysis; Man-in-the-middle attack; Computer science; Computer security; Key (lock); Linear cryptanalysis; Cryptography","score_opus":0.0162376093343239,"score_gpt":0.2803890867211197,"score_spread":0.2641514773867958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2835352419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27493006,0.00015902474,0.72264946,0.0011300439,0.000035432953,0.00014169214,0.000017028575,0.000011326402,0.00092592934],"genre_scores_gemma":[0.9728389,0.00023370453,0.026627094,0.00021589267,0.000068078116,0.0000071845407,0.00000541963,0.0000016962315,0.0000020299253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895775,0.000029050376,0.00063839735,0.00007134208,0.00020702057,0.00009645923],"domain_scores_gemma":[0.99842215,0.00007396902,0.0006101488,0.00019050768,0.00061425444,0.000088985005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004414314,0.00007542373,0.00016085921,0.00030575955,0.00019257554,0.00018457182,0.00022919488,0.000045016266,0.000021801123],"category_scores_gemma":[0.00002769487,0.00006692625,0.000063626474,0.00058465125,0.00013282009,0.0018026588,0.00007862603,0.00009799558,0.0000033062163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004347253,0.0003658779,0.0020131937,0.00017857103,0.00020123496,6.6314897e-7,0.029944481,0.000022352755,0.0023900582,0.8603025,0.0024245093,0.10211305],"study_design_scores_gemma":[0.0034857802,0.0020088295,0.021062128,0.00016149812,0.00030905925,0.00075820886,0.010059888,0.036863647,0.0073132883,0.15803826,0.7591002,0.0008392097],"about_ca_topic_score_codex":0.000015434292,"about_ca_topic_score_gemma":0.000042222156,"teacher_disagreement_score":0.7566757,"about_ca_system_score_codex":0.000014768053,"about_ca_system_score_gemma":0.000045159926,"threshold_uncertainty_score":0.27291733},"labels":[],"label_agreement":null},{"id":"W286115074","doi":"10.1007/978-3-319-16745-9_17","title":"Second Preimage Analysis of Whirlwind","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Whirlwind; Cryptographic hash function; Collision attack; Function (biology); Block (permutation group theory); Algorithm; Compression (physics); Theoretical computer science; Arithmetic; Mathematics; Computer security; Double hashing; Combinatorics","score_opus":0.029655636589684585,"score_gpt":0.2892135006867308,"score_spread":0.25955786409704623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W286115074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006219619,0.0003448955,0.9917933,0.00015268536,0.0005420431,0.00023282836,0.000041696087,0.0000516387,0.00621895],"genre_scores_gemma":[0.5920076,0.000031147527,0.4068395,0.0005395693,0.00017102975,0.000008029491,0.00003976345,0.000025408845,0.00033797955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968593,0.000032053078,0.0006120989,0.0010501861,0.0010211222,0.00042520787],"domain_scores_gemma":[0.99732125,0.00025417216,0.00037731745,0.0014199842,0.00046800185,0.00015929143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011157207,0.00033895916,0.00066232675,0.0026299472,0.0001208572,0.00027210143,0.002519429,0.00017741107,0.0002452058],"category_scores_gemma":[0.000040415638,0.00031569356,0.00025412248,0.0026662322,0.00055368646,0.0005059721,0.0009921392,0.00041228582,0.00000787465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011670986,0.00014043743,0.0011011553,0.000099366094,0.0006279093,0.00008769651,0.006642007,0.03775309,0.00029047503,0.23391101,0.0003136443,0.71902156],"study_design_scores_gemma":[0.0005068194,0.0002866458,0.0023223993,0.00011497171,0.00023961687,0.000019959094,9.1252605e-7,0.7076292,0.0007473086,0.27991748,0.007267752,0.00094691786],"about_ca_topic_score_codex":0.0000326489,"about_ca_topic_score_gemma":0.00079128373,"teacher_disagreement_score":0.7180746,"about_ca_system_score_codex":0.00012953229,"about_ca_system_score_gemma":0.0005060738,"threshold_uncertainty_score":0.9999295},"labels":[],"label_agreement":null},{"id":"W2888884259","doi":"10.1145/3233245","title":"<scp>S</scp> L <scp>I</scp> SCP-light","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Overhead (engineering); Cryptography; Hash function; Authentication (law); Throughput; Computer network; Function (biology); Distributed computing; Embedded system; Wireless; Computer security","score_opus":0.02397591806881854,"score_gpt":0.281675925712029,"score_spread":0.25770000764321044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888884259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19111012,0.00028423328,0.795837,0.00021506325,0.0045014163,0.0007600187,0.000037996615,0.0009713804,0.0062827654],"genre_scores_gemma":[0.9750142,0.000031526695,0.022352777,0.00039942624,0.0007192731,0.00007605837,0.000019256666,0.00006822309,0.0013192382],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99469876,0.00047104646,0.0011792304,0.001331112,0.0010402523,0.00127961],"domain_scores_gemma":[0.99298775,0.0030597714,0.00049614784,0.0024951214,0.00054499053,0.0004161992],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012208202,0.00062350923,0.0006657112,0.00084402255,0.0018528925,0.0010522419,0.002547863,0.00029267004,0.000013400329],"category_scores_gemma":[0.00040210472,0.00062966475,0.00041628015,0.002425728,0.00020200045,0.0006776483,0.000117224314,0.00067415147,0.00041300125],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025691417,0.0060502794,0.0029573874,0.0016994196,0.003921564,0.00038169514,0.34674513,0.030268498,0.009960815,0.19726373,0.3028866,0.09783916],"study_design_scores_gemma":[0.005077315,0.001986172,0.001953725,0.0009880398,0.00032910137,0.0008536366,0.043108057,0.41343004,0.012427735,0.0061766156,0.5129395,0.00073001883],"about_ca_topic_score_codex":0.00029165923,"about_ca_topic_score_gemma":0.00010198969,"teacher_disagreement_score":0.7839041,"about_ca_system_score_codex":0.00016531629,"about_ca_system_score_gemma":0.00019378802,"threshold_uncertainty_score":0.99998474},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008776883584582446,"score_gpt":0.24230064974730744,"score_spread":0.233523766162725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889579243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1482794,0.000011592197,0.8497766,0.000619841,0.0004962357,0.0004038428,0.00012311595,0.00014008516,0.00014928535],"genre_scores_gemma":[0.9692067,0.00009450539,0.029938068,0.0005967444,0.00005834508,0.000058566497,0.000033857305,0.00000790095,0.0000053128833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858844,0.00003877494,0.00043317775,0.00030421585,0.00036167985,0.00027367935],"domain_scores_gemma":[0.9989077,0.00007163488,0.00017751078,0.00036685538,0.00033920325,0.00013713044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024562576,0.00023115576,0.00018567969,0.00029111328,0.00079750543,0.00038257567,0.00019351278,0.00012610719,0.000034786102],"category_scores_gemma":[0.000008549632,0.0002145473,0.000063604464,0.00046238254,0.00023286689,0.0018005782,0.0000090841895,0.00025161574,0.000035977642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007351226,0.00031523572,0.00004553873,0.0001427465,0.00009346598,0.0000017536001,0.042209126,0.00016207503,0.000050441864,0.2661442,0.00046379134,0.69029814],"study_design_scores_gemma":[0.003915523,0.002219494,0.0040215715,0.00012456105,0.000113006114,0.00008823488,0.002176968,0.85015637,0.006243039,0.12318909,0.00665456,0.0010975682],"about_ca_topic_score_codex":0.00011907359,"about_ca_topic_score_gemma":0.00010171555,"teacher_disagreement_score":0.8499943,"about_ca_system_score_codex":0.00004986691,"about_ca_system_score_gemma":0.000058457896,"threshold_uncertainty_score":0.8748985},"labels":[],"label_agreement":null},{"id":"W2890717930","doi":"10.1109/arith.2018.8464780","title":"New Area Record for the AES Combined S-Box/Inverse S-Box","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"CMC Microsystems","keywords":"S-box; Advanced Encryption Standard; Application-specific integrated circuit; Computer science; Inverse; Encryption; Block cipher; Block (permutation group theory); AES implementations; Field (mathematics); Embedded system; Computer engineering; Operating system; Mathematics","score_opus":0.03979836206827013,"score_gpt":0.3021690613774875,"score_spread":0.26237069930921736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890717930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069967518,0.000013134963,0.9827031,0.0064684115,0.0007373462,0.00033342364,0.0000036056472,0.00011800865,0.0026262242],"genre_scores_gemma":[0.41345704,0.00004133464,0.5772349,0.0047925147,0.00042501107,0.00007622404,0.000009835283,0.000013885542,0.003949226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992508,0.000017014218,0.00016258904,0.00021830459,0.00012933159,0.00022194655],"domain_scores_gemma":[0.9990864,0.00019872877,0.00004906458,0.0004862964,0.00010512883,0.00007442267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002123558,0.000088592235,0.00008235702,0.000059560116,0.00034712767,0.00017954929,0.0006348052,0.000025283694,0.000608458],"category_scores_gemma":[0.000023097162,0.00005732028,0.00008490506,0.00035068847,0.000058339676,0.00022754211,0.00013658717,0.00004337239,0.000043980228],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018495717,0.00003673605,0.0008487884,0.00000326884,0.00003217817,5.2804535e-7,0.0013810283,7.151593e-7,0.000119774515,0.5198218,0.35079175,0.1269449],"study_design_scores_gemma":[0.0021247528,0.0008927926,0.0032936628,0.000008997433,0.000030631065,0.000006486752,0.0008173521,0.06440362,0.003190114,0.12608258,0.79878426,0.00036471823],"about_ca_topic_score_codex":0.00064587005,"about_ca_topic_score_gemma":0.0030398653,"teacher_disagreement_score":0.4479925,"about_ca_system_score_codex":0.000010446452,"about_ca_system_score_gemma":0.00006178023,"threshold_uncertainty_score":0.6662189},"labels":[],"label_agreement":null},{"id":"W2899886600","doi":"10.1007/978-3-030-00581-8_17","title":"SIM Cards Forensics","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Computer security","score_opus":0.027363042485798864,"score_gpt":0.2687497710150949,"score_spread":0.24138672852929605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899886600","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000087870485,0.000050363622,0.30258298,0.0001749962,0.00044638384,0.00011153812,0.000015919879,0.000121218574,0.6964878],"genre_scores_gemma":[0.002881656,0.00016068896,0.13702086,0.0018413799,0.0007553083,0.0000112813,0.00009133069,0.000049391943,0.8571881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897605,0.000004816489,0.00021168163,0.00034037346,0.00028777882,0.00017928352],"domain_scores_gemma":[0.9989685,0.000030331496,0.000082267194,0.00068608054,0.00016234787,0.00007047565],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011723299,0.0001816891,0.00017456757,0.00013848775,0.000104323095,0.0001315285,0.000544253,0.00012886115,0.0019471106],"category_scores_gemma":[0.0000031391469,0.00016142483,0.00015296812,0.000045702152,0.000084476625,0.00012364844,0.00028662581,0.00012738816,0.00025829923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1691675e-7,0.0000018132539,0.0000021833562,0.0000038237336,0.000021834068,0.0000041337553,0.00016239745,6.660053e-8,4.3104197e-7,0.9178574,0.06525274,0.016692873],"study_design_scores_gemma":[0.0000665647,0.000045137807,0.0000072834696,0.00000751249,0.0000083611485,0.0000053033905,0.0000057055195,0.00027866024,0.000011606769,0.3982649,0.6011374,0.0001615752],"about_ca_topic_score_codex":0.0000261285,"about_ca_topic_score_gemma":0.00022343904,"teacher_disagreement_score":0.5358846,"about_ca_system_score_codex":0.000023127763,"about_ca_system_score_gemma":0.00007290225,"threshold_uncertainty_score":0.99896526},"labels":[],"label_agreement":null},{"id":"W2901118812","doi":"10.1109/access.2018.2881130","title":"Differential Cryptanalysis of Round-Reduced LEA","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Impossible differential cryptanalysis; Linear cryptanalysis; Differential cryptanalysis; Cryptanalysis; Higher-order differential cryptanalysis; Computer science; Differential (mechanical device); Boomerang attack; Computer security; Cryptography; Physics","score_opus":0.04321816406101602,"score_gpt":0.352472366483284,"score_spread":0.309254202422268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901118812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5607252,0.0000056979325,0.43829754,0.00010982739,0.00037620813,0.00004603134,0.000002587956,0.000027724887,0.0004091984],"genre_scores_gemma":[0.9971308,0.000006000063,0.0025943448,0.0000816124,0.00015173246,0.000007323417,0.0000027940273,0.0000039961183,0.000021376607],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905866,0.000037452206,0.00024388454,0.00023455921,0.00024503376,0.00018041812],"domain_scores_gemma":[0.9991505,0.0000343383,0.00011505685,0.00047705765,0.00017216914,0.00005088219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084589825,0.000085535816,0.0001479804,0.00019640141,0.00013251668,0.00022759345,0.0011119856,0.00002987172,0.00032176066],"category_scores_gemma":[0.000008916312,0.00007623777,0.00008346158,0.0008186273,0.0000898128,0.0005708255,0.00016689017,0.0000482856,0.000012382187],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007898186,0.0014236093,0.041378867,0.00012234066,0.000918138,0.00001887599,0.011584846,0.00005382102,0.36984095,0.2513556,0.017220486,0.3060035],"study_design_scores_gemma":[0.0015757993,0.0004210692,0.10962088,0.000029120522,0.00015323957,0.000009781832,0.0001731999,0.02758143,0.8147218,0.04079452,0.004206733,0.0007123937],"about_ca_topic_score_codex":0.00037525382,"about_ca_topic_score_gemma":0.00022960472,"teacher_disagreement_score":0.44488087,"about_ca_system_score_codex":0.000011802753,"about_ca_system_score_gemma":0.000034118468,"threshold_uncertainty_score":0.35230535},"labels":[],"label_agreement":null},{"id":"W2906861169","doi":"10.1109/newcas.2018.8585541","title":"Template Attacks of a Masked S-Box Circuit: A Comparison Between Static and Dynamic Power Analyses","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Power analysis; Side channel attack; Computer science; Dynamic demand; Static analysis; S-box; Exploit; Cryptography; Electronic circuit; Context (archaeology); Power (physics); Channel (broadcasting); Embedded system; Electrical engineering; Engineering; Computer security; Telecommunications","score_opus":0.08356389971908902,"score_gpt":0.41353054466761757,"score_spread":0.32996664494852856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906861169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54038274,0.000022113987,0.45872328,0.00011575056,0.000031827498,0.00008359076,0.000010355235,0.000032516844,0.00059780496],"genre_scores_gemma":[0.97883064,0.0000043644422,0.021051364,0.000069538175,0.0000074423506,0.0000033302988,0.000006366434,0.0000040940795,0.000022840666],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99896514,0.000050054794,0.0003476474,0.000246895,0.00019493776,0.00019529132],"domain_scores_gemma":[0.9992569,0.00011559971,0.00012117852,0.00033072283,0.000102675964,0.00007290193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020481864,0.00010147718,0.00023153651,0.00020966095,0.0001105167,0.00008193666,0.000282835,0.000029537423,0.00013776503],"category_scores_gemma":[0.000010683325,0.00008633357,0.00004733599,0.0005386311,0.00014472395,0.00021169995,0.00013327919,0.0000564371,0.000007790034],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026629916,0.0005255716,0.70548606,0.00017636872,0.00083833904,0.0000120377035,0.040424347,0.000013504394,0.011954684,0.14340109,0.0037868936,0.093354486],"study_design_scores_gemma":[0.0017650416,0.0012258788,0.8865294,0.000049321403,0.000119067474,0.000013162248,0.0022018196,0.06890865,0.004644493,0.032070223,0.0018596145,0.00061335857],"about_ca_topic_score_codex":0.00021695356,"about_ca_topic_score_gemma":0.000265963,"teacher_disagreement_score":0.4384479,"about_ca_system_score_codex":0.000010646641,"about_ca_system_score_gemma":0.000027965629,"threshold_uncertainty_score":0.35205808},"labels":[],"label_agreement":null},{"id":"W2908603308","doi":"10.1007/978-3-030-10970-7_4","title":"Integral Attacks on Round-Reduced Bel-T-256","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer security","score_opus":0.02475309377687479,"score_gpt":0.2880603088840484,"score_spread":0.2633072151071736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908603308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015932649,0.00013358977,0.98677707,0.0010591653,0.0032953524,0.0005467136,0.000012114888,0.0001627086,0.0064200284],"genre_scores_gemma":[0.7812667,0.000063495725,0.2119492,0.0049970387,0.00073384255,0.000018877943,0.00003518936,0.00006641457,0.0008692576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956555,0.000041556683,0.0005815074,0.0017310979,0.0011984814,0.00079186214],"domain_scores_gemma":[0.99701,0.00045426103,0.00028315943,0.0018537983,0.00021495107,0.00018382136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075361284,0.0006073933,0.0005514213,0.0012573401,0.00033944016,0.0008713484,0.0036326717,0.00030097147,0.00008698836],"category_scores_gemma":[0.000046564044,0.0005369253,0.00024090875,0.0008630548,0.0005042728,0.0005877913,0.0011381315,0.0010874955,0.00016308404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012665923,0.000073325646,0.000112134076,0.00003207764,0.000023756096,0.000052231273,0.001715577,0.003830502,0.00012809823,0.2780195,0.00019091318,0.7158092],"study_design_scores_gemma":[0.0017379817,0.0019190699,0.0019180168,0.0011749695,0.00003585889,0.00020006337,0.0000030321826,0.43550482,0.0030310166,0.52363205,0.027474137,0.0033689882],"about_ca_topic_score_codex":0.00006330152,"about_ca_topic_score_gemma":0.00020639929,"teacher_disagreement_score":0.7796734,"about_ca_system_score_codex":0.00032051312,"about_ca_system_score_gemma":0.0007087949,"threshold_uncertainty_score":0.99970824},"labels":[],"label_agreement":null},{"id":"W2909396136","doi":"10.3390/cryptography3010004","title":"Cryptanalysis of Round-Reduced Fantomas, Robin and iSCREAM","year":2019,"lang":"en","type":"article","venue":"Cryptography","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Narodowe Centrum Nauki","keywords":"Linear cryptanalysis; Cryptanalysis; Cipher; Differential cryptanalysis; Computer science; Impossible differential cryptanalysis; Ciphertext; Block cipher; Correlation attack; Plaintext; Higher-order differential cryptanalysis; Algorithm; Mathematics; Boomerang attack; Theoretical computer science; Cryptography; Encryption; Computer security","score_opus":0.006511629793455391,"score_gpt":0.23395729770705237,"score_spread":0.22744566791359697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909396136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88093615,0.0004756617,0.11570279,0.00020920443,0.00016423073,0.00022796814,0.000008928401,0.00008597092,0.0021891075],"genre_scores_gemma":[0.96348304,0.00010468964,0.036249675,0.000105639476,0.000016468151,0.000012134225,0.000009148542,0.0000085006595,0.000010701345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985595,0.000063562424,0.0003632117,0.000429064,0.0003011026,0.00028357346],"domain_scores_gemma":[0.99883854,0.00008332057,0.00016136661,0.00068695494,0.00012062206,0.00010918836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027172253,0.00017085242,0.00030029085,0.0006917787,0.00010209155,0.00013820488,0.00051032676,0.000061033148,0.0001288804],"category_scores_gemma":[0.000009247216,0.00015921546,0.0002424138,0.0019157607,0.00010655267,0.00041946355,0.00017606969,0.00010155103,0.0000109486855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002075911,0.00023759129,0.114089064,0.00007834215,0.0003189386,0.0000033278145,0.0023065945,0.000017002574,0.024418067,0.83977926,0.00065821357,0.018072855],"study_design_scores_gemma":[0.0073784483,0.0023139187,0.6475009,0.00021547255,0.00048576316,0.000082303995,0.004663437,0.025794325,0.0367341,0.23170795,0.040201537,0.0029218716],"about_ca_topic_score_codex":0.00016249261,"about_ca_topic_score_gemma":0.000021057229,"teacher_disagreement_score":0.6080713,"about_ca_system_score_codex":0.0000076584465,"about_ca_system_score_gemma":0.000031674528,"threshold_uncertainty_score":0.6492618},"labels":[],"label_agreement":null},{"id":"W2911870428","doi":"","title":"Proceedings of the 11th international conference on Selected Areas in Cryptography","year":2004,"lang":"en","type":"article","venue":"International Conference on Selected areas in Cryptography","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Computer science; Computer security","score_opus":0.030931606605174713,"score_gpt":0.2958750544442885,"score_spread":0.26494344783911383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911870428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94640994,0.000027729995,0.009900985,0.005985564,0.0011990095,0.0010139673,0.00012769975,0.00023587338,0.03509923],"genre_scores_gemma":[0.99376315,0.00019484515,0.005231609,0.00044998733,0.000075955315,0.00017744632,0.000071302056,0.000026340791,0.000009369404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99559784,0.00010142286,0.001054163,0.0010407564,0.0015460742,0.00065976917],"domain_scores_gemma":[0.9963767,0.00013406042,0.00055856066,0.00048400453,0.0022914673,0.00015524073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043235198,0.0005237462,0.00045749897,0.0027757443,0.00016963332,0.00044571952,0.0030989163,0.00021802894,0.00028177025],"category_scores_gemma":[0.00019989737,0.00045846766,0.0002895449,0.0068977466,0.0003242043,0.00072554476,0.0003085738,0.00092827436,0.00001122923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000153991,0.0009314415,0.11937508,0.00001367314,0.00012568926,0.000008494157,0.0013154174,0.000080962986,0.004462499,0.8714438,0.00020769071,0.0018812664],"study_design_scores_gemma":[0.005185794,0.0006537914,0.6596296,0.0010918971,0.000022789965,0.000042408377,0.00096849824,0.00804932,0.009085147,0.3135172,0.00073905423,0.0010145141],"about_ca_topic_score_codex":0.00048395214,"about_ca_topic_score_gemma":0.0012008975,"teacher_disagreement_score":0.5579266,"about_ca_system_score_codex":0.0002266969,"about_ca_system_score_gemma":0.00046746305,"threshold_uncertainty_score":0.99978673},"labels":[],"label_agreement":null},{"id":"W2912177847","doi":"10.1016/j.vlsi.2019.01.004","title":"Kernel-based template attacks of cryptographic circuits using static power","year":2019,"lang":"en","type":"article","venue":"Integration","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Side channel attack; Computer science; Power analysis; Parametric statistics; Electronic circuit; Dynamic demand; Cryptography; Probabilistic logic; Electronic engineering; Static analysis; Power (physics); Algorithm; Engineering; Electrical engineering; Mathematics","score_opus":0.024988110511591066,"score_gpt":0.2961857292463071,"score_spread":0.27119761873471604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912177847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5125027,0.000012321262,0.48681295,0.00005928492,0.00016275194,0.00015602306,0.0000052584764,0.00003209047,0.00025663458],"genre_scores_gemma":[0.9828161,0.0000018361744,0.017001754,0.00013802748,0.000007522164,0.000006628137,0.000013939699,0.000007107644,0.0000070574906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989143,0.00006555629,0.000332522,0.00024265925,0.00027272283,0.00017226538],"domain_scores_gemma":[0.9991042,0.000080687096,0.00017769549,0.0003967903,0.00019817012,0.000042440406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025324296,0.00011478795,0.00014671916,0.00033246365,0.00006872212,0.00008889659,0.00026307735,0.000048821887,0.00015294203],"category_scores_gemma":[0.000018599618,0.000104486564,0.00009722535,0.0007427827,0.00004001292,0.00041642212,0.000030403318,0.00009764671,0.000017866823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039435778,0.0007305342,0.10910092,0.00021865654,0.00016763901,0.000016483578,0.011074433,0.0039897216,0.24533339,0.5792295,0.00080701447,0.049292326],"study_design_scores_gemma":[0.002699711,0.0008988912,0.07680478,0.00042037296,0.000047314315,0.000026382359,0.0012072414,0.8416291,0.03770905,0.036124203,0.0015399959,0.00089294213],"about_ca_topic_score_codex":0.00014830308,"about_ca_topic_score_gemma":0.000053766205,"teacher_disagreement_score":0.8376394,"about_ca_system_score_codex":0.000027458933,"about_ca_system_score_gemma":0.00009016307,"threshold_uncertainty_score":0.42608383},"labels":[],"label_agreement":null},{"id":"W2918105805","doi":"10.1007/978-3-031-82852-2","title":"Selected Areas in Cryptography – SAC 2024","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Mannheim; Università degli Studi di Salerno; Université de Montréal; Universitetet i Bergen; Centre National de la Recherche Scientifique; Memorial University of Newfoundland; University of Waterloo; KU Leuven; Technische Universiteit Eindhoven; Indian Statistical Institute; Université du Québec à Montréal; University of Alberta; University of Washington; University of Haifa; Aarhus Universitet; University of South Florida; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; National Research Council Canada; Case Western Reserve University; Radboud Universiteit","keywords":"Computer science; Cryptography; Computer security","score_opus":0.010128335871827756,"score_gpt":0.26289794075050904,"score_spread":0.2527696048786813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918105805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030946528,0.0006067582,0.991736,0.00070424174,0.0021549184,0.00058519177,0.000014568359,0.00016387407,0.00372501],"genre_scores_gemma":[0.10554868,0.00029486718,0.88742024,0.004636554,0.0006792235,0.00014702148,0.00009760535,0.000059212936,0.0011166136],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954624,0.000114901915,0.00072874513,0.0017592664,0.00096629525,0.00096835225],"domain_scores_gemma":[0.99725074,0.0006212129,0.00021326567,0.0013995413,0.00036138657,0.00015388399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009666126,0.00054516515,0.0005996615,0.004063292,0.0002653135,0.00075592194,0.0036978736,0.00032477776,0.00004452223],"category_scores_gemma":[0.00012339921,0.00053836347,0.00017810178,0.01103327,0.00050219236,0.0005723517,0.0012506753,0.0011582432,0.00001104126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016311582,0.00033299276,0.0074984753,0.00024163253,0.000055438166,0.00024836502,0.00376736,0.0077276784,0.00009113404,0.0684936,0.0057345056,0.90579253],"study_design_scores_gemma":[0.0013357103,0.00030507924,0.012429367,0.0011760534,0.000023209828,0.00005697015,0.0000015956423,0.34351417,0.00048321727,0.62269163,0.016159363,0.0018235983],"about_ca_topic_score_codex":0.0001377911,"about_ca_topic_score_gemma":0.0016193117,"teacher_disagreement_score":0.90396893,"about_ca_system_score_codex":0.00041277596,"about_ca_system_score_gemma":0.0025414687,"threshold_uncertainty_score":0.9997068},"labels":[],"label_agreement":null},{"id":"W2924203149","doi":"10.1002/cta.2623","title":"Using deep learning to combine static and dynamic power analyses of cryptographic circuits","year":2019,"lang":"en","type":"article","venue":"International Journal of Circuit Theory and Applications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Side channel attack; Leakage (economics); Computer science; Cryptography; Dynamic demand; Power analysis; Computer engineering; Electronic circuit; Leakage power; Electronic engineering; Embedded system; Artificial neural network; Power (physics); Algorithm; Artificial intelligence; Engineering; Transistor; Electrical engineering","score_opus":0.025982804643448206,"score_gpt":0.35019421685468227,"score_spread":0.32421141221123406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924203149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4305764,0.00019535975,0.5688987,0.000046953235,0.000054574182,0.00009369822,0.000004039202,0.000005325598,0.00012497723],"genre_scores_gemma":[0.9982319,0.00009630918,0.0015125478,0.00012374802,0.00001580522,0.000005394925,0.000002312561,0.000005293792,0.000006693457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897516,0.00009856835,0.00040184657,0.00014906285,0.00027565824,0.0000997077],"domain_scores_gemma":[0.9987641,0.00029976378,0.0003263635,0.00013962436,0.00038637035,0.00008379757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006107209,0.000085143256,0.00016796103,0.0004910529,0.000077553195,0.00009403839,0.00040181784,0.000024787563,0.000044313925],"category_scores_gemma":[0.00003823208,0.00007982734,0.00006880908,0.00037514349,0.00006488579,0.0002933756,0.0000824865,0.00012468814,0.0000016186553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009382177,0.00007942296,0.0037976222,0.000011509979,0.00015950536,0.0000022770553,0.0013588098,0.000531185,0.023538906,0.9421019,0.0000013904448,0.028408071],"study_design_scores_gemma":[0.0015907128,0.0003887891,0.04962093,0.0001397508,0.00011332533,0.00046909816,0.0027875388,0.0059585837,0.0009221659,0.9359863,0.0016793216,0.00034349682],"about_ca_topic_score_codex":0.000005992515,"about_ca_topic_score_gemma":0.0000024523383,"teacher_disagreement_score":0.5676555,"about_ca_system_score_codex":0.000017714165,"about_ca_system_score_gemma":0.00003335704,"threshold_uncertainty_score":0.32552645},"labels":[],"label_agreement":null},{"id":"W2942504727","doi":"10.1007/978-3-030-18419-3_15","title":"Fault Analysis of the New Ukrainian Hash Function Standard: Kupyna","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Byte; Fault (geology); Cryptographic hash function; SHA-2; Fault model; Function (biology); Theoretical computer science; Computer security; Programming language; Engineering","score_opus":0.014914975441493018,"score_gpt":0.26119977023853697,"score_spread":0.24628479479704396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942504727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006577425,0.0001649829,0.994682,0.00091831415,0.0015933192,0.00035148853,0.000029593046,0.000045904075,0.001556652],"genre_scores_gemma":[0.8465653,0.000048142152,0.1500092,0.0022642203,0.0002951264,0.0000046714276,0.000024077832,0.00003059256,0.0007586391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968374,0.00004005326,0.00054698,0.0009646295,0.0012128733,0.00039807623],"domain_scores_gemma":[0.9972099,0.00027321724,0.0004208824,0.0017148651,0.0002758166,0.000105311774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072633935,0.00032700054,0.0005475375,0.0013674832,0.00023317662,0.00033353714,0.0026647814,0.00018082198,0.00009467657],"category_scores_gemma":[0.000043001248,0.00024279249,0.0003884023,0.0029340428,0.00041822594,0.00034949672,0.0009531391,0.0004736474,0.0000066820876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014863643,0.0000302732,0.0010858813,0.000032176467,0.00031528424,0.000004872481,0.0051759765,0.05512839,0.00011621647,0.104490966,0.00012279658,0.8334823],"study_design_scores_gemma":[0.0010161308,0.0005682256,0.012460654,0.0002999799,0.0005679011,0.000014613017,0.000002292181,0.76808536,0.0006468015,0.1670513,0.048057675,0.0012290957],"about_ca_topic_score_codex":0.00012097775,"about_ca_topic_score_gemma":0.0013882146,"teacher_disagreement_score":0.84590757,"about_ca_system_score_codex":0.0001483333,"about_ca_system_score_gemma":0.0009693738,"threshold_uncertainty_score":0.99007905},"labels":[],"label_agreement":null},{"id":"W2946207961","doi":"10.23919/date.2019.8715150","title":"Methodology for EM Fault Injection: Charge-based Fault Model","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fault injection; Computer science; Fault model; Fault (geology); Key (lock); Embedded system; Fault coverage; Set (abstract data type); Stuck-at fault; Reliability engineering; Software; Fault detection and isolation; Electrical engineering; Computer security; Engineering; Operating system; Electronic circuit; Programming language","score_opus":0.08790962796678346,"score_gpt":0.3516670382339161,"score_spread":0.2637574102671326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946207961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052021902,0.0000109197845,0.9450928,0.0009078735,0.00037623727,0.0003924821,0.000009991647,0.00013979865,0.0010480022],"genre_scores_gemma":[0.41617084,0.0000014367291,0.5814998,0.0015889474,0.000029715515,0.000072246956,0.0000140856455,0.00000602421,0.00061690656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903107,0.00006260896,0.00019751268,0.00033037012,0.00013585457,0.00024257033],"domain_scores_gemma":[0.99915045,0.00021232112,0.000057410143,0.00039479145,0.00013267066,0.000052324474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005002141,0.00010006422,0.00014598477,0.00015125668,0.00011507278,0.00008086493,0.00036492807,0.000060151637,0.0001908759],"category_scores_gemma":[0.00002349684,0.00008770293,0.00011192693,0.00031595648,0.000014196363,0.00022901566,0.000062250016,0.00006930933,0.00004455592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002243268,0.00009371865,0.0005208288,0.000030655392,0.000026005702,4.2022606e-7,0.0013542542,0.009567317,0.0018705472,0.95981866,0.0044988957,0.022196243],"study_design_scores_gemma":[0.0007269319,0.0001644216,0.00009137846,0.0000017832299,0.0000044989374,0.0000033172773,0.00010753255,0.97280955,0.0023269062,0.019426847,0.0042014006,0.00013540938],"about_ca_topic_score_codex":0.000043858847,"about_ca_topic_score_gemma":0.000082358594,"teacher_disagreement_score":0.96324223,"about_ca_system_score_codex":0.000017982004,"about_ca_system_score_gemma":0.000073433774,"threshold_uncertainty_score":0.35764217},"labels":[],"label_agreement":null},{"id":"W2947149071","doi":"10.1007/978-3-030-23696-0_14","title":"On MILP-Based Automatic Search for Differential Trails Through Modular Additions with Application to Bel-T","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Modular design; Differential (mechanical device); Algorithm; Integer (computer science); Cipher; Lookup table; Parallel computing; Arithmetic; Mathematics; Cryptography; Encryption; Programming language; Computer network","score_opus":0.01989023891447446,"score_gpt":0.2835753954137794,"score_spread":0.26368515649930496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947149071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012111464,0.000014123767,0.99462515,0.0012630344,0.00036456902,0.002042894,0.0001123902,0.00012770611,0.00023900441],"genre_scores_gemma":[0.47820008,0.0000018349645,0.5196417,0.0017032132,0.00013419538,0.00016593195,0.00009509369,0.000029487217,0.000028460707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968255,0.000027733264,0.00037570013,0.0012901461,0.00092825474,0.0005526426],"domain_scores_gemma":[0.9975681,0.0006204688,0.00014373852,0.0012705235,0.00026570234,0.00013150251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031837527,0.00039385102,0.00038313097,0.00072394306,0.00038608626,0.00041987014,0.0017463313,0.00015121064,0.000046039342],"category_scores_gemma":[0.000016224154,0.00033389876,0.0001332709,0.0007387513,0.00025821174,0.0003036334,0.00023455697,0.0003504797,0.000026710557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002562407,0.00016360794,0.000013478975,0.0001344317,0.00002976878,0.00000624382,0.0016606566,0.1285358,0.00035448078,0.50003976,0.00010214574,0.368934],"study_design_scores_gemma":[0.00064769754,0.00082057086,0.00021576036,0.00024940076,0.000014226774,0.0000064059877,5.081253e-7,0.89477205,0.0012915845,0.10065198,0.00081973075,0.0005100643],"about_ca_topic_score_codex":0.000029298964,"about_ca_topic_score_gemma":0.00016095245,"teacher_disagreement_score":0.76623625,"about_ca_system_score_codex":0.0001774296,"about_ca_system_score_gemma":0.000533435,"threshold_uncertainty_score":0.9999113},"labels":[],"label_agreement":null},{"id":"W2949283829","doi":"","title":"The Simeck Family of Lightweight Block Ciphers.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; Computer science; Application-specific integrated circuit; Cipher; CMOS; Block (permutation group theory); Power consumption; Power analysis; Embedded system; Throughput; Cryptanalysis; Differential cryptanalysis; Differential (mechanical device); Cryptography; Power (physics); Computer security; Operating system; Electrical engineering; Engineering; Mathematics; Encryption; Wireless","score_opus":0.029131919527570188,"score_gpt":0.2935757807247714,"score_spread":0.2644438611972012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949283829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10783832,0.0015428347,0.86927044,0.0034708073,0.002303426,0.00093523576,0.00010690829,0.00019667779,0.014335374],"genre_scores_gemma":[0.48263994,0.0011455367,0.51514536,0.00038606513,0.00026666207,0.0002849437,0.00007648457,0.000046897123,0.000008085911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965614,0.0005286303,0.00089354074,0.00088620145,0.0004969416,0.0006332825],"domain_scores_gemma":[0.99591076,0.0007651018,0.0006464687,0.0021126769,0.00036282497,0.00020213534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009535552,0.00041879958,0.00062093075,0.00027749632,0.00032742968,0.00015277801,0.0031351487,0.00026218727,0.000018398294],"category_scores_gemma":[0.0001113058,0.00031931195,0.00038124327,0.00032916665,0.0006972668,0.000094597046,0.004926598,0.0010403594,0.000054834658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024941033,0.00009956988,0.001133827,0.0000320658,0.0002170225,0.000020853111,0.0036733786,0.0001813965,0.000279465,0.98179173,0.00540603,0.0071396865],"study_design_scores_gemma":[0.00043559616,0.0001089122,0.0042286473,0.000037541733,0.000041815583,0.000023806831,0.00044541497,0.0044665225,0.00047677464,0.95505214,0.034323156,0.00035970044],"about_ca_topic_score_codex":0.00016821685,"about_ca_topic_score_gemma":0.00030696552,"teacher_disagreement_score":0.37480164,"about_ca_system_score_codex":0.000056417837,"about_ca_system_score_gemma":0.00059999543,"threshold_uncertainty_score":0.9999259},"labels":[],"label_agreement":null},{"id":"W2949421005","doi":"","title":"Garbled Circuits for Leakage-Resilience: Hardware Implementation and Evaluation of One-Time Programs.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Side channel attack; Embedded system; Cryptography; Application-specific integrated circuit; Smart card; Field-programmable gate array; Resilience (materials science); Power analysis; Leakage (economics); Information leakage; Tamper resistance; Implementation; Hardware security module; Computer hardware; Computer security; Software engineering","score_opus":0.0483773076526309,"score_gpt":0.35682744812970824,"score_spread":0.3084501404770773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949421005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39161143,0.00007264037,0.6042594,0.00048762772,0.00034498223,0.0027357605,0.00013392478,0.00007653355,0.0002777128],"genre_scores_gemma":[0.63123316,0.000048186153,0.3666236,0.00005105537,0.00007635904,0.0013772501,0.00056789577,0.000021765441,6.93874e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964245,0.00045594468,0.0008444559,0.0011031951,0.00065539073,0.00051650725],"domain_scores_gemma":[0.9970346,0.000356745,0.00074006437,0.00097654766,0.0007513638,0.0001406527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019945872,0.0003622387,0.00059942185,0.00047649513,0.00025272352,0.0001586586,0.0009643915,0.00028791136,0.00012308953],"category_scores_gemma":[0.00014056997,0.0003944763,0.00023577343,0.00022142164,0.0003819672,0.0002071067,0.0013184077,0.000611677,0.00000722762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022480262,0.00022796832,0.0048694545,0.00022819679,0.00021133985,0.0000014501377,0.0063248053,0.0001131008,0.0082275225,0.68861264,0.00012424844,0.29103678],"study_design_scores_gemma":[0.0019458807,0.0002694194,0.04059911,0.00007897578,0.0002583372,0.000015995196,0.0004565527,0.04178675,0.0036904828,0.9100234,0.00040653985,0.00046854012],"about_ca_topic_score_codex":0.00015262651,"about_ca_topic_score_gemma":0.00085894443,"teacher_disagreement_score":0.29056823,"about_ca_system_score_codex":0.0000562183,"about_ca_system_score_gemma":0.0005818981,"threshold_uncertainty_score":0.9998507},"labels":[],"label_agreement":null},{"id":"W2949894824","doi":"","title":"On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cipher; Ideal (ethics); Key (lock); Computer science; Pseudorandom permutation; Theoretical computer science; Set (abstract data type); Exploit; Brute-force attack; Computer security; Block cipher; Cryptography; Encryption","score_opus":0.039522491679589586,"score_gpt":0.3044025286411247,"score_spread":0.2648800369615351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949894824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15355489,0.0001204572,0.8102442,0.0023516333,0.0009254328,0.0011168867,0.000050044673,0.00017572343,0.031460714],"genre_scores_gemma":[0.8233632,0.0002050991,0.17454547,0.0012388292,0.000055988516,0.0004854852,0.000061976796,0.000038278013,0.000005701715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995039,0.000980586,0.0010103179,0.0015192394,0.00057957834,0.0008712674],"domain_scores_gemma":[0.99607044,0.00065457326,0.0004725932,0.0025654172,0.000089205125,0.0001477675],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013111971,0.00060516386,0.00065683376,0.0005689111,0.00027078015,0.00017926768,0.00359443,0.00045946252,0.00021478695],"category_scores_gemma":[0.00008907618,0.00048740258,0.0004120712,0.00034265182,0.000359252,0.00014128174,0.0031151762,0.0026824581,0.00022429864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003667741,0.00029072215,0.0014567,0.00002620151,0.00010019486,0.0001335841,0.024162028,0.0072014397,0.000022652715,0.9627134,0.0011470085,0.0027093776],"study_design_scores_gemma":[0.0006105935,0.000116928815,0.0068698404,0.00006378799,0.000028041602,0.000056706223,0.0002959731,0.041592963,0.00003193289,0.94948786,0.00036385457,0.0004815335],"about_ca_topic_score_codex":0.0005709435,"about_ca_topic_score_gemma":0.0018361992,"teacher_disagreement_score":0.66980827,"about_ca_system_score_codex":0.00010011652,"about_ca_system_score_gemma":0.00027743282,"threshold_uncertainty_score":0.99975777},"labels":[],"label_agreement":null},{"id":"W2949962707","doi":"","title":"Preimage attacks on Reduced-round Stribog.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; GOST (hash function); Collision attack; Cryptographic hash function; Function (biology); Compression (physics); Collision resistance; SHA-2; Theoretical computer science; Algorithm; Perfect hash function; Double hashing; Computer security","score_opus":0.026824657496467428,"score_gpt":0.31276562901185756,"score_spread":0.2859409715153901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949962707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16951297,0.00004066083,0.81688887,0.0024184037,0.001755891,0.00076469517,0.00011775589,0.0003407714,0.008160005],"genre_scores_gemma":[0.57719696,0.00008733567,0.4209598,0.0008507052,0.0003424733,0.00028462708,0.00023234283,0.00004149921,0.00000422412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953557,0.0006814413,0.0008176059,0.0017745534,0.0004932019,0.0008774793],"domain_scores_gemma":[0.99565506,0.000737436,0.00053195306,0.0026477508,0.0001494181,0.0002784029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006643213,0.00064714235,0.0007799642,0.0006385404,0.00035944892,0.00034811615,0.0027184316,0.00039175185,0.00016670648],"category_scores_gemma":[0.0001489251,0.00065151096,0.00046290117,0.0002660494,0.0004290891,0.00014828834,0.0040916135,0.00190708,0.00033987657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030878276,0.00020208555,0.0007621822,0.00006198389,0.00015221772,0.000049681927,0.002216792,0.0003519885,0.00026654743,0.9825203,0.004018528,0.009366823],"study_design_scores_gemma":[0.00063733343,0.00025972424,0.011877504,0.00009719522,0.000040577022,0.0000510419,0.00007310503,0.008707223,0.00068171875,0.9617508,0.015099983,0.00072380714],"about_ca_topic_score_codex":0.00012889465,"about_ca_topic_score_gemma":0.00015008805,"teacher_disagreement_score":0.407684,"about_ca_system_score_codex":0.00010274958,"about_ca_system_score_gemma":0.00031117158,"threshold_uncertainty_score":0.9995936},"labels":[],"label_agreement":null},{"id":"W2950159141","doi":"","title":"On Continual Leakage of Discrete Log Representations.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Subspace topology; Discrete mathematics; Binary logarithm; Combinatorics; Mathematics; Element (criminal law); Representation (politics); Encryption; Affine transformation; Computer science; Pure mathematics","score_opus":0.02421039201129341,"score_gpt":0.31992005946404867,"score_spread":0.29570966745275523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950159141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1097192,0.00010016671,0.8796155,0.0012650425,0.0011276074,0.0006412998,0.00019996589,0.0001286748,0.007202537],"genre_scores_gemma":[0.6897318,0.00006431769,0.30953023,0.00023189238,0.000102131315,0.00014827588,0.00016773358,0.000020615526,0.0000029891435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967025,0.00052310794,0.00084315496,0.0009376457,0.00039528837,0.00059829233],"domain_scores_gemma":[0.9959757,0.0012139,0.00066505687,0.0018203668,0.00014453361,0.00018046006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053561066,0.00040084575,0.00067318423,0.00053327467,0.00016727654,0.000076768745,0.0015997896,0.00024136249,0.00019826142],"category_scores_gemma":[0.00023786684,0.00039153566,0.00040591243,0.0002488914,0.0005184418,0.00016558368,0.0029637988,0.0009951284,0.000081205355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003552476,0.00019051808,0.0061954902,0.000055183435,0.00015783722,0.000017325352,0.0057427166,0.00020376369,0.00028813718,0.9821997,0.001328163,0.0035856215],"study_design_scores_gemma":[0.0005763705,0.00010732629,0.04087253,0.000063759064,0.000049238875,0.00002361338,0.0002474605,0.0015065569,0.0011239918,0.95403445,0.0009925623,0.00040214535],"about_ca_topic_score_codex":0.00020839137,"about_ca_topic_score_gemma":0.00016787021,"teacher_disagreement_score":0.5800126,"about_ca_system_score_codex":0.000037614584,"about_ca_system_score_gemma":0.00015929183,"threshold_uncertainty_score":0.9998537},"labels":[],"label_agreement":null},{"id":"W2950297715","doi":"10.1109/tc.2019.2922601","title":"New Low-Area Designs for the AES Forward, Inverse and Combined S-Boxes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Western University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Application-specific integrated circuit; S-box; Computer science; Advanced Encryption Standard; Cryptography; Block (permutation group theory); Inverse; CMOS; Computer engineering; Algorithm; Embedded system; Block cipher; Mathematics; Electronic engineering; Engineering","score_opus":0.02604376551896256,"score_gpt":0.2581856610882511,"score_spread":0.23214189556928852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950297715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017911308,0.000018839364,0.9783671,0.0015662978,0.0013208957,0.00066544337,0.000014093249,0.000109068395,0.00002695738],"genre_scores_gemma":[0.9209028,0.000046103,0.077893294,0.0009467376,0.000026770089,0.000047496393,0.000002338968,0.000011450358,0.0001230164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999074,0.000032812448,0.00018336983,0.00031140997,0.00016496437,0.00023348493],"domain_scores_gemma":[0.9988373,0.00054901576,0.00005080074,0.00041222028,0.000047750735,0.000102937374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001523321,0.0001498247,0.00014223682,0.00014885319,0.000334426,0.00020691882,0.00043126638,0.000041514755,0.000036462636],"category_scores_gemma":[0.000001197152,0.00011743968,0.00013249213,0.00031561442,0.000043553442,0.00029746976,0.0000054365337,0.000113593116,0.000013173945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029251495,0.000539595,0.0004561798,0.00012880626,0.0006659501,0.000006280343,0.010844217,0.07987887,0.001529804,0.044112787,0.035662808,0.8258822],"study_design_scores_gemma":[0.0035639622,0.00087420584,0.0006103575,0.00005224789,0.000065452994,0.00001719458,0.0003328707,0.9808676,0.0034148179,0.003089519,0.0066828965,0.00042885228],"about_ca_topic_score_codex":0.000110241155,"about_ca_topic_score_gemma":0.00015194829,"teacher_disagreement_score":0.9029915,"about_ca_system_score_codex":0.000022230588,"about_ca_system_score_gemma":0.00006106726,"threshold_uncertainty_score":0.47890514},"labels":[],"label_agreement":null},{"id":"W2950312415","doi":"","title":"A Novel Permutation-based Hash Mode of Operation FP and the Hash Function SAMOSA","year":2012,"lang":"en","type":"preprint","venue":"Lirias (KU Leuven)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; SHA-2; Computer science; Permutation (music); Cryptographic hash function; Universal hashing; Random oracle; Mode (computer interface); Block cipher mode of operation; Hash chain; SWIFFT; Cryptography; Double hashing; Theoretical computer science; Conjecture; Function (biology); Algorithm; Discrete mathematics; Mathematics; Computer network; Computer security; Physics; Encryption; Operating system","score_opus":0.029740014888213935,"score_gpt":0.288363009497646,"score_spread":0.25862299460943206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950312415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08597947,0.0002674506,0.90896297,0.0026144267,0.0010704001,0.00071712246,0.00009260342,0.00007345042,0.00022214104],"genre_scores_gemma":[0.9783191,0.000025207668,0.020573352,0.00050361553,0.00017348111,0.00015928403,0.00020372818,0.000014428297,0.000027821561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817485,0.00017810376,0.0005210843,0.00046006686,0.00042243596,0.00024344242],"domain_scores_gemma":[0.9983309,0.0002669512,0.00035942468,0.00075543177,0.0002118706,0.00007543954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007182668,0.0002479742,0.00032986858,0.00019048336,0.00028292046,0.00032673802,0.0005024321,0.0001777958,0.000049470447],"category_scores_gemma":[0.00005901775,0.00019525755,0.00016911121,0.00026090562,0.00018366144,0.00037722304,0.00040361274,0.0003529035,0.0000060179855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032204756,0.0007983635,0.0022369423,0.00054125267,0.0003945439,0.0000018638235,0.03006386,0.04220395,0.003238457,0.85934395,0.0015243657,0.059330426],"study_design_scores_gemma":[0.004862459,0.00010890167,0.010112286,0.00012727758,0.00021099625,0.0000098678875,0.0004181405,0.95187783,0.00068731856,0.028255943,0.0027759112,0.00055303733],"about_ca_topic_score_codex":0.0012517576,"about_ca_topic_score_gemma":0.00047472172,"teacher_disagreement_score":0.9096739,"about_ca_system_score_codex":0.000047817604,"about_ca_system_score_gemma":0.00023996046,"threshold_uncertainty_score":0.7962372},"labels":[],"label_agreement":null},{"id":"W2950629364","doi":"","title":"SpecTre: A Tiny Side-Channel Resistant Speck Core for FPGAs.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Side channel attack; Computer science; Field-programmable gate array; Cryptography; Block cipher; Embedded system; Core (optical fiber); Cipher; Computer security; Encryption; Telecommunications","score_opus":0.0747030586666773,"score_gpt":0.334163614491068,"score_spread":0.2594605558243907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950629364","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0337389,0.00026399145,0.9528505,0.0034494854,0.001840034,0.0018205266,0.00053598883,0.00034883284,0.0051516937],"genre_scores_gemma":[0.12635426,0.0001390404,0.8710757,0.0005342834,0.00052793167,0.0008130757,0.0004756789,0.00006774418,0.000012284647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557334,0.00025582025,0.0009650335,0.0017240065,0.0004576032,0.0010242212],"domain_scores_gemma":[0.9958769,0.0006722743,0.0006273275,0.002031023,0.00041281673,0.00037965042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009965474,0.0006526142,0.0009271485,0.0006016405,0.00032772406,0.00023540264,0.0023422837,0.00035805808,0.000061627354],"category_scores_gemma":[0.00030545235,0.0006613346,0.00056487916,0.00032091912,0.0004041109,0.00013670346,0.0038121853,0.0010802672,0.000084819025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013775648,0.00017814629,0.00025724995,0.00013145531,0.00020280931,0.00009030258,0.0057311244,0.0002401015,0.00026464064,0.97924984,0.011393064,0.0021234963],"study_design_scores_gemma":[0.0010522475,0.00023805539,0.0022554188,0.00008150341,0.000062624546,0.000061513885,0.00036145977,0.015259045,0.00024653514,0.9695822,0.010129084,0.0006702881],"about_ca_topic_score_codex":0.00022734373,"about_ca_topic_score_gemma":0.001371465,"teacher_disagreement_score":0.09261536,"about_ca_system_score_codex":0.00017068053,"about_ca_system_score_gemma":0.0007058902,"threshold_uncertainty_score":0.9995838},"labels":[],"label_agreement":null},{"id":"W2950781338","doi":"","title":"Efficient Hardware Implementations of the Warbler Pseudorandom Number Generator.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pseudorandom number generator; Application-specific integrated circuit; Computer science; CMOS; Computer hardware; Embedded system; Electronic engineering; Engineering; Algorithm","score_opus":0.030766293920487034,"score_gpt":0.31291297391341777,"score_spread":0.28214667999293075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950781338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2839125,0.00009110342,0.70969254,0.0015448121,0.001607036,0.00094078504,0.00038571295,0.00008751262,0.0017379929],"genre_scores_gemma":[0.6297858,0.00004109256,0.36922416,0.00031936273,0.00013250853,0.00034837288,0.00011664873,0.000028874483,0.0000031980896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635464,0.0006761485,0.0009372385,0.00089151337,0.00057711056,0.00056334335],"domain_scores_gemma":[0.9964784,0.00028884353,0.00065762637,0.0019598308,0.00043602634,0.00017928942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073446153,0.00041981795,0.00061748235,0.00022609346,0.00033354355,0.00011288821,0.002299412,0.00019366402,0.00024629245],"category_scores_gemma":[0.0001063429,0.00032875894,0.00050392863,0.00045027913,0.000456415,0.00005314636,0.005092849,0.0008270518,0.000057269288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023713996,0.00021320714,0.018395977,0.000074204996,0.00023572354,0.000008894469,0.008440681,0.0058496934,0.00021352712,0.95891255,0.0063956166,0.0012362102],"study_design_scores_gemma":[0.002181998,0.00004969183,0.019350294,0.000078429766,0.0001334773,0.000067132525,0.00064805377,0.029875824,0.001127155,0.9399492,0.0059117908,0.00062693463],"about_ca_topic_score_codex":0.00030972745,"about_ca_topic_score_gemma":0.000449916,"teacher_disagreement_score":0.3458733,"about_ca_system_score_codex":0.00009417231,"about_ca_system_score_gemma":0.00076605764,"threshold_uncertainty_score":0.99991643},"labels":[],"label_agreement":null},{"id":"W2951069447","doi":"","title":"Side Channel Power Analysis of an AES-256 Bootloader.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Advanced Encryption Standard; Side channel attack; Power analysis; Computer science; Initialization; Byte; AES implementations; Cryptography; Firmware; Computer security; Code (set theory); Encryption; Embedded system; Operating system; Programming language","score_opus":0.019499984699482484,"score_gpt":0.30282212920135526,"score_spread":0.28332214450187276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951069447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27247578,0.00005797353,0.72406805,0.00061686704,0.0005254013,0.00035191706,0.00014032882,0.00013728281,0.0016264224],"genre_scores_gemma":[0.73994136,0.000042958472,0.2592723,0.00031155456,0.000051450108,0.0000935083,0.0002657003,0.000020417643,7.560838e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956765,0.00071988814,0.0010287442,0.0014462158,0.00045419735,0.0006744558],"domain_scores_gemma":[0.9956451,0.0004590404,0.0007905233,0.0026106483,0.00022602385,0.000268632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008013794,0.00051222113,0.0012843105,0.0019004968,0.00019042303,0.00012248113,0.0024941438,0.0003355308,0.0001676572],"category_scores_gemma":[0.00009431478,0.0005198355,0.0008720076,0.00092714146,0.00045794644,0.00017282441,0.0031088716,0.0009090942,0.000026611895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030913143,0.0003120435,0.002783174,0.00005068879,0.0020663135,0.000034490953,0.008778433,0.0060811276,0.00032030273,0.9755514,0.00016461243,0.0038264522],"study_design_scores_gemma":[0.0004613102,0.0002218894,0.07748943,0.000032484248,0.00062733056,0.000018850538,0.00030862348,0.12435159,0.0005264645,0.79453015,0.0007829716,0.0006488953],"about_ca_topic_score_codex":0.00045102913,"about_ca_topic_score_gemma":0.0011995651,"teacher_disagreement_score":0.46746555,"about_ca_system_score_codex":0.000041693253,"about_ca_system_score_gemma":0.00020158675,"threshold_uncertainty_score":0.99972534},"labels":[],"label_agreement":null},{"id":"W2951276012","doi":"","title":"Detection of Algebraic Manipulation in the Presence of Leakage.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Computer science; Upper and lower bounds; Adversary; Algorithm; Communication source; Algebraic number; Theoretical computer science; Mathematics; Computer security; Computer network","score_opus":0.027181157103419767,"score_gpt":0.2861171698116562,"score_spread":0.2589360127082364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951276012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44299692,0.000044692468,0.5557182,0.00026838336,0.00020777657,0.00047582373,0.00000767514,0.000016275999,0.0002642612],"genre_scores_gemma":[0.9122099,0.000058186444,0.08750077,0.00003741825,0.00002315655,0.0001459525,0.00001817324,0.0000062282975,1.8935947e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770296,0.00059092214,0.00069092395,0.00047528767,0.00028916495,0.0002507561],"domain_scores_gemma":[0.99768984,0.0006060085,0.0005496037,0.0010125296,0.00011155915,0.00003048189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061726704,0.00019442424,0.00035940993,0.00046590317,0.00006190309,0.00003595034,0.0013873796,0.00015118522,0.000028207352],"category_scores_gemma":[0.00010600243,0.00016116162,0.00016810188,0.00034648806,0.00027327338,0.0001366744,0.0011385141,0.00058905286,0.0000075205226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011108993,0.00011586202,0.0073612873,0.00010259454,0.000035508816,0.000003944332,0.010575665,0.0007278305,0.00367296,0.96587455,0.000027369346,0.011491326],"study_design_scores_gemma":[0.00019790049,0.00006586679,0.20331982,0.00004365796,0.000011625127,0.000012438169,0.00032621535,0.019694667,0.0023593276,0.77379245,0.000053709016,0.00012233258],"about_ca_topic_score_codex":0.00095262786,"about_ca_topic_score_gemma":0.0011220371,"teacher_disagreement_score":0.469213,"about_ca_system_score_codex":0.000020064694,"about_ca_system_score_gemma":0.00007931937,"threshold_uncertainty_score":0.657198},"labels":[],"label_agreement":null},{"id":"W2951403199","doi":"","title":"Pleco and Plectron - Two Provably Secure Password Hashing Algorithms.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Password; Hash function; Password cracking; Cryptography; Password strength; Cryptographic hash function; Cryptosystem; Theoretical computer science; One-time password; S/KEY; Computer security; Algorithm","score_opus":0.014582205305183338,"score_gpt":0.2898647781017589,"score_spread":0.2752825727965756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951403199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12204338,0.00019062133,0.87160045,0.002989639,0.0008842611,0.0008306521,0.00006300217,0.00029886377,0.0010991102],"genre_scores_gemma":[0.32652128,0.0001716165,0.67208135,0.00055753207,0.0002565641,0.0002639045,0.0001099884,0.00003617657,0.0000015801099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564403,0.0005728043,0.00074691715,0.0016969802,0.0003795324,0.0009597544],"domain_scores_gemma":[0.9970554,0.00061055826,0.0004857953,0.001441825,0.00013109605,0.00027529034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075646304,0.000627152,0.0008039045,0.0005655157,0.0004512242,0.00047486665,0.0016538725,0.000308001,0.00005159465],"category_scores_gemma":[0.000120490644,0.0006375182,0.00026803985,0.0002565288,0.00040525344,0.0002213359,0.0045808367,0.0018235391,0.000034293396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018797366,0.000089271736,0.0023955444,0.00010442614,0.00018186029,0.000049720238,0.005412637,0.0001628457,0.00021431371,0.9399748,0.0008006723,0.050595146],"study_design_scores_gemma":[0.0008940679,0.00015665931,0.0062032943,0.000073941424,0.000051216546,0.00015867312,0.00011243072,0.058396686,0.00020199764,0.92667085,0.006392779,0.0006873931],"about_ca_topic_score_codex":0.00025950148,"about_ca_topic_score_gemma":0.001018776,"teacher_disagreement_score":0.20447792,"about_ca_system_score_codex":0.00007380187,"about_ca_system_score_gemma":0.00029167038,"threshold_uncertainty_score":0.9996076},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07313631529089948,"score_gpt":0.3640269377411954,"score_spread":0.2908906224502959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29626722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070122816,0.00012918425,0.99282473,0.00072023674,0.0010942405,0.0017950706,0.00004367306,0.00018245562,0.0025092056],"genre_scores_gemma":[0.40536237,0.00005303239,0.5901226,0.0023018592,0.0012252543,0.00017894608,0.000119457676,0.000116707175,0.00051979383],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99379045,0.00010676904,0.0007407042,0.0024151262,0.0016508512,0.0012961006],"domain_scores_gemma":[0.99461305,0.0010859314,0.0002899841,0.0026998203,0.00091367034,0.000397549],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0050788014,0.0005866356,0.00070445036,0.001461228,0.0013707238,0.0029144227,0.010174677,0.00039920927,0.00007131489],"category_scores_gemma":[0.00019237577,0.0005487252,0.00014655218,0.0011683368,0.00096510653,0.0013861164,0.004377406,0.0012959562,0.000024489897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025997673,0.000100760524,0.000032217275,0.000078841374,0.00001826497,0.000014533864,0.006160161,0.0011997347,0.000071633876,0.3830149,0.0004548435,0.6088281],"study_design_scores_gemma":[0.0007697753,0.0010141068,0.000054190426,0.00019650455,0.000007540913,0.00004151252,0.0000034466736,0.39376917,0.00040831082,0.55332667,0.049609512,0.00079928664],"about_ca_topic_score_codex":0.00016099623,"about_ca_topic_score_gemma":0.0014820859,"teacher_disagreement_score":0.6080288,"about_ca_system_score_codex":0.00030256854,"about_ca_system_score_gemma":0.000814315,"threshold_uncertainty_score":0.99992937},"labels":[],"label_agreement":null},{"id":"W2966457083","doi":"","title":"On MILP-Based Automatic Search for Differential Trails Through Modular Additions with Application to Bel-T.","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Modular design; Differential (mechanical device); Computer science; Algorithm; Integer (computer science); Cipher; Lookup table; Mathematics; Arithmetic; Encryption; Cryptography; Programming language","score_opus":0.021723060791361007,"score_gpt":0.30596150979742404,"score_spread":0.28423844900606304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966457083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1336299,0.0000070654914,0.8581508,0.0027582871,0.00033001226,0.0037796726,0.0008327174,0.00023216255,0.0002794097],"genre_scores_gemma":[0.4847192,0.00000354808,0.5115414,0.00048741215,0.000060900802,0.002387663,0.0007709561,0.000028146964,7.409332e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664336,0.00026900705,0.00054669206,0.0014088725,0.00045434505,0.0006777469],"domain_scores_gemma":[0.99667233,0.00090940826,0.0002460621,0.0017905756,0.00020123408,0.00018036357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023788231,0.00047551747,0.0006140529,0.00051639945,0.00035216266,0.00017155727,0.0014700756,0.00022101283,0.00011617822],"category_scores_gemma":[0.00003443105,0.0004387395,0.0003126391,0.00032609544,0.00020370916,0.0001067721,0.00076115225,0.00068536674,0.0001052205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008208407,0.00036731272,0.0001539081,0.00017840753,0.00015888104,0.000004376068,0.0028092472,0.02069579,0.0004886278,0.96829826,0.0006081595,0.00615497],"study_design_scores_gemma":[0.0013102946,0.0006610401,0.00709074,0.0001439926,0.00006791804,0.000008487303,0.00009734278,0.30740407,0.001329552,0.68048126,0.00082789076,0.00057739514],"about_ca_topic_score_codex":0.000103159495,"about_ca_topic_score_gemma":0.00024157487,"teacher_disagreement_score":0.3510893,"about_ca_system_score_codex":0.000098620105,"about_ca_system_score_gemma":0.0003957509,"threshold_uncertainty_score":0.99980646},"labels":[],"label_agreement":null},{"id":"W2967383257","doi":"10.13154/tches.v2019.i4.126-153","title":"On-Device Power Analysis Across Hardware Security Domains.","year":2019,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Power analysis; Computer hardware; Computer science; Power (physics); Hardware security module; Embedded system; Operating system; Computer security; Cryptography; Physics","score_opus":0.13167369823470879,"score_gpt":0.5434248236002214,"score_spread":0.4117511253655126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967383257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97890234,0.0016472581,0.013212276,0.00029906892,0.000722576,0.00054019224,0.00014967994,0.000075284035,0.004451339],"genre_scores_gemma":[0.9971877,0.00076284085,0.00089120254,0.0009523209,0.000044536107,0.000026830394,0.000021166235,0.000023664474,0.00008976688],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99604475,0.00032654064,0.0009495396,0.00083381316,0.0011961422,0.0006492187],"domain_scores_gemma":[0.99638444,0.00047106546,0.000827943,0.0014952816,0.00049322227,0.00032803835],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019598028,0.00037500513,0.00090284005,0.0012320888,0.00047832148,0.0034271549,0.0061362428,0.00011485782,0.012038465],"category_scores_gemma":[0.000111573325,0.00033954362,0.00058817357,0.005239279,0.00010287789,0.003688552,0.002104124,0.00048446262,0.000082837374],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011201947,0.0007358641,0.9366911,0.00007296802,0.0016944128,0.00006370183,0.0038958874,0.00048697426,0.0033659618,0.020812005,0.026169624,0.0058994675],"study_design_scores_gemma":[0.0011452031,0.000038947426,0.93498343,0.00011774309,0.00018262678,0.0000106834,0.00042259682,0.0016202823,0.0025828981,0.040067554,0.018022694,0.00080532266],"about_ca_topic_score_codex":0.00092339684,"about_ca_topic_score_gemma":0.00028844737,"teacher_disagreement_score":0.019255547,"about_ca_system_score_codex":0.00009588094,"about_ca_system_score_gemma":0.000121893434,"threshold_uncertainty_score":0.99990565},"labels":[],"label_agreement":null},{"id":"W2976919315","doi":"10.48550/arxiv.1909.12338","title":"Hardware Design and Analysis of the ACE and WAGE Ciphers","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Application-specific integrated circuit; Computer science; Encryption; Cryptography; Authenticated encryption; Block cipher; NIST; Wage; Throughput; Computer hardware; Embedded system; Algorithm; Computer network; Telecommunications; Economics; Wireless","score_opus":0.07377969012339093,"score_gpt":0.20209274185841228,"score_spread":0.12831305173502133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976919315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47569105,0.000050670813,0.5237955,0.000059537215,0.00007373085,0.00017569715,0.000018645576,0.00001627966,0.00011890323],"genre_scores_gemma":[0.9970026,0.00019038646,0.002641343,0.000039668383,0.000003440316,3.4843404e-7,0.0000049457076,0.000003623558,0.0001136463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990367,0.00014567933,0.000117019474,0.00050291314,0.00006454278,0.00013312437],"domain_scores_gemma":[0.9988376,0.000109614884,0.0001709686,0.0007565868,0.00007261817,0.000052613523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022698718,0.00013295411,0.0002396716,0.00027655272,0.00011168364,0.000068955,0.0006844012,0.00008862251,0.000015062128],"category_scores_gemma":[0.000010066385,0.00011778931,0.00015172985,0.001102706,0.00012234219,0.00013606068,0.001401964,0.0001751863,7.050309e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003351746,0.00010406695,0.28138363,0.00015482373,0.002606848,0.000028604087,0.0051649692,0.30885768,0.00010442666,0.3990187,0.00044731615,0.0020953934],"study_design_scores_gemma":[0.00035104196,0.000030905623,0.11403958,0.00002976745,0.0008932921,0.0000010277436,0.00039214446,0.87463605,0.000073586474,0.009075768,0.00022438832,0.00025245466],"about_ca_topic_score_codex":0.00017888212,"about_ca_topic_score_gemma":0.000080838894,"teacher_disagreement_score":0.5657784,"about_ca_system_score_codex":0.000024845285,"about_ca_system_score_gemma":0.00006195228,"threshold_uncertainty_score":0.48033085},"labels":[],"label_agreement":null},{"id":"W2979200095","doi":"10.46586/tches.v2019.i4.126-153","title":"On-Device Power Analysis Across Hardware Security Domains.","year":2019,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Power analysis; Computer science; Side channel attack; Embedded system; Hardware security module; Microcontroller; Advanced Encryption Standard; Cryptography; Encryption; Computer hardware; Sample (material); Chip; Power (physics); Computer security; Telecommunications","score_opus":0.0115316641484082,"score_gpt":0.27604561776222114,"score_spread":0.2645139536138129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979200095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3950554,0.00028692363,0.59983534,0.0002830392,0.0012662937,0.0008965821,0.00041304185,0.00042549075,0.0015378749],"genre_scores_gemma":[0.99780655,0.00015406252,0.0011925419,0.0004689808,0.000040771218,0.00018117703,0.00004027939,0.00003576909,0.000079888654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562144,0.00039388845,0.0008161491,0.0013161551,0.00095883146,0.0008935484],"domain_scores_gemma":[0.9969194,0.00044441308,0.0002491504,0.0016784114,0.0003007814,0.00040784714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010153942,0.00057485397,0.0008357246,0.0012874324,0.00092694635,0.0009043424,0.0008393356,0.00028431637,0.00034285145],"category_scores_gemma":[0.000012995209,0.00053097506,0.0008139091,0.004596879,0.00014042621,0.0007367788,0.000034873676,0.00062415894,0.00014743267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071779056,0.0045896834,0.03114305,0.0013395761,0.016041107,0.0002747523,0.08806602,0.025887856,0.0009452638,0.8063056,0.0044937753,0.020195557],"study_design_scores_gemma":[0.038407505,0.012376092,0.094854355,0.0027548687,0.0063073495,0.00088452466,0.12777391,0.35394993,0.00228187,0.071058266,0.26921344,0.020137897],"about_ca_topic_score_codex":0.00039059538,"about_ca_topic_score_gemma":0.00035200943,"teacher_disagreement_score":0.7352473,"about_ca_system_score_codex":0.000060095106,"about_ca_system_score_gemma":0.00006536679,"threshold_uncertainty_score":0.9997142},"labels":[],"label_agreement":null},{"id":"W2979250315","doi":"10.1007/978-3-030-35869-3_6","title":"Related-Key Differential Cryptanalysis of Full Round CRAFT","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Key (lock); Oracle; Differential (mechanical device); Encryption; Impossible differential cryptanalysis; Key schedule; Advanced Encryption Standard; Craft; Cryptanalysis; Computer security; Theoretical computer science; Arithmetic; Differential cryptanalysis; Mathematics; Programming language; Engineering","score_opus":0.014915551474093906,"score_gpt":0.27727404712420367,"score_spread":0.26235849565010977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979250315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17923461,0.00018402601,0.8169542,0.0007611965,0.002408331,0.0003446657,0.000011823304,0.00007864976,0.00002250867],"genre_scores_gemma":[0.7459919,0.000029177854,0.2537452,0.00012234312,0.0000788657,0.000010213857,0.000011600378,0.000009736991,9.878287e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954956,0.00016224069,0.00091970264,0.0015792991,0.0011838952,0.0006592646],"domain_scores_gemma":[0.99638903,0.0003724327,0.0005384318,0.002218035,0.00035045427,0.00013158882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009635756,0.00043100584,0.0007099244,0.0014202213,0.00019426033,0.000708292,0.004339883,0.00028723298,0.00005460061],"category_scores_gemma":[0.00008835151,0.00039294214,0.0003470215,0.003117776,0.00049628667,0.0004760083,0.0043576392,0.0009238557,0.000010481578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024818217,0.0006136192,0.017102608,0.00038438482,0.00023220589,0.000049990565,0.013267296,0.5443178,0.0049575088,0.01708962,0.00005573424,0.40190443],"study_design_scores_gemma":[0.00036129032,0.00012018596,0.0075799646,0.00013041648,0.000029829782,0.000017312093,0.0000016932578,0.9057146,0.001499694,0.08405562,0.000031512725,0.00045789315],"about_ca_topic_score_codex":0.00032721148,"about_ca_topic_score_gemma":0.0003166348,"teacher_disagreement_score":0.56675726,"about_ca_system_score_codex":0.00016841617,"about_ca_system_score_gemma":0.00058540475,"threshold_uncertainty_score":0.99985224},"labels":[],"label_agreement":null},{"id":"W2982698051","doi":"10.1109/tvlsi.2019.2947202","title":"Incremental Fault Analysis: Relaxing the Fault Model of Differential Fault Attacks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fault injection; Cryptosystem; Fault (geology); Advanced Encryption Standard; Computer science; Block cipher; Cryptography; Fault model; Encryption; Embedded system; Algorithm; Computer security; Engineering; Software; Geology; Operating system; Seismology; Electrical engineering","score_opus":0.017759558249302677,"score_gpt":0.2658511145248987,"score_spread":0.248091556275596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982698051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35682616,0.000026408981,0.6410013,0.00010368231,0.000986546,0.00052874215,0.0002044237,0.00009129353,0.00023149488],"genre_scores_gemma":[0.9981403,0.000030905343,0.0011313611,0.00008034335,0.000046305984,0.0001370733,0.00004797577,0.000019022025,0.00036675858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967767,0.00031286373,0.0009649048,0.0006111982,0.00091519847,0.00041911128],"domain_scores_gemma":[0.9980431,0.000157343,0.00035610993,0.001012175,0.00032431446,0.00010694225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062393193,0.00032766658,0.0004952219,0.00064146233,0.0005137846,0.00033101946,0.00079388573,0.00017388327,0.00013479248],"category_scores_gemma":[0.0000050324834,0.00024607574,0.00057909364,0.0015442297,0.00007180968,0.0008097488,0.00001247322,0.00047075909,0.000050121187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022506896,0.0021993802,0.0020335112,0.00021161466,0.0027331763,0.000004355629,0.022986492,0.8674463,0.06247419,0.028624844,0.0010938725,0.0099672],"study_design_scores_gemma":[0.0008226465,0.0001337289,0.00030165137,0.000069763526,0.00023338912,0.0000061744277,0.0035645645,0.9844722,0.009869062,0.00008877324,0.00015979417,0.00027823556],"about_ca_topic_score_codex":0.0005671262,"about_ca_topic_score_gemma":0.0017072345,"teacher_disagreement_score":0.6413141,"about_ca_system_score_codex":0.0001424277,"about_ca_system_score_gemma":0.00008258255,"threshold_uncertainty_score":0.99999917},"labels":[],"label_agreement":null},{"id":"W2994061451","doi":"10.1007/978-3-030-35423-7_18","title":"On the Relationship Between Resilient Boolean Functions and Linear Branch Number of S-Boxes","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Boolean function; Branch predictor; Algorithm; Discrete mathematics; Arithmetic; Mathematics; Parallel computing","score_opus":0.035803269319095436,"score_gpt":0.29684143055128404,"score_spread":0.2610381612321886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994061451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022481035,0.00007373034,0.97304696,0.001381747,0.00048864837,0.0003825791,0.000026312484,0.00003390026,0.0020850908],"genre_scores_gemma":[0.97503895,0.000010193587,0.024132632,0.0003996839,0.00012925174,0.0000045750066,0.000008945131,0.000012875225,0.000262902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978569,0.000048933536,0.00042418414,0.0007296806,0.0006491302,0.00029112792],"domain_scores_gemma":[0.99580276,0.0027191138,0.00023159689,0.0010333556,0.0001409321,0.00007227132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081193727,0.00025935814,0.0002887115,0.0004101612,0.00035220516,0.00017515315,0.0011164043,0.00014720715,0.000036441812],"category_scores_gemma":[0.0001531093,0.000191405,0.0000960472,0.00059037405,0.000564654,0.00023570374,0.0005203129,0.0005943197,0.000032233835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056681083,0.000028306018,0.045082897,0.000043203938,0.00001865834,0.0000024886185,0.0013043962,0.0018401177,0.00001009965,0.874438,0.00011360395,0.077112585],"study_design_scores_gemma":[0.0004051447,0.00027314946,0.0678842,0.00041831052,0.000024369929,0.00002340868,0.0000019617921,0.0292502,0.000168493,0.89945155,0.0015310252,0.000568172],"about_ca_topic_score_codex":0.000031540818,"about_ca_topic_score_gemma":0.00006849305,"teacher_disagreement_score":0.9525579,"about_ca_system_score_codex":0.000053657386,"about_ca_system_score_gemma":0.00021980646,"threshold_uncertainty_score":0.78052694},"labels":[],"label_agreement":null},{"id":"W2998750075","doi":"10.1109/pst47121.2019.8949023","title":"Onboarding and Software Update Architecture for IoT Devices","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Firmware; Key (lock); Computer security; Software; Cryptography; Public-key cryptography; Authentication (law); Password; Digital signature; Exploit; Cryptographic primitive; Transport Layer Security; Onboarding; Embedded system; Operating system; Cryptographic protocol; Encryption; Hash function","score_opus":0.010833527798002108,"score_gpt":0.2622010073297937,"score_spread":0.25136747953179156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998750075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24361537,0.000052773164,0.754945,0.00087550166,0.0000884923,0.00017647944,0.0000043878404,0.00006729462,0.00017471782],"genre_scores_gemma":[0.50695795,0.0000035853816,0.49216548,0.0007921289,0.00001603194,0.000009883451,0.0000038949574,0.0000030074955,0.00004805456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951863,0.000008599749,0.00008019453,0.00018824793,0.000070234535,0.00013407056],"domain_scores_gemma":[0.9996645,0.00007958147,0.000022920914,0.00017252091,0.000025948417,0.000034534485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001025716,0.000057464495,0.0000690396,0.00006455164,0.00008509498,0.00012340955,0.00018273498,0.000017492142,0.00003755359],"category_scores_gemma":[0.0000061361166,0.000045616915,0.000032453172,0.00012054389,0.000009974278,0.00009636329,0.00009802992,0.000034977384,0.0000064906153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058668484,0.000021370344,0.025608642,0.00007650602,0.000030732594,6.7787226e-7,0.0013733499,0.000043814693,0.00038503905,0.5871991,0.00092889427,0.38432598],"study_design_scores_gemma":[0.0037571513,0.0005375597,0.08432229,0.0000656226,0.000038074184,0.00005722427,0.0011720367,0.05561572,0.0030064634,0.31717303,0.53303444,0.0012203496],"about_ca_topic_score_codex":0.00002155881,"about_ca_topic_score_gemma":0.00014551045,"teacher_disagreement_score":0.53210557,"about_ca_system_score_codex":0.0000032740618,"about_ca_system_score_gemma":0.000013853369,"threshold_uncertainty_score":0.18602037},"labels":[],"label_agreement":null},{"id":"W3003900572","doi":"10.1007/978-3-030-51938-4_5","title":"Impossible Differential Cryptanalysis of Reduced-Round Tweakable TWINE","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Arithmetic; Mathematics; Algorithm; Cryptography","score_opus":0.026971593269661996,"score_gpt":0.3009952814354262,"score_spread":0.2740236881657642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003900572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1947335,0.00012930423,0.8018365,0.001568141,0.0013180563,0.00029314935,0.00001556328,0.000092234375,0.000013559288],"genre_scores_gemma":[0.68779284,0.000019371708,0.31174645,0.00022021926,0.00018492533,0.000014599554,0.000012215111,0.000009127344,2.5013114e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562836,0.00012689395,0.0008494209,0.001628412,0.0011052957,0.00066163694],"domain_scores_gemma":[0.9970873,0.00024770503,0.00045898394,0.0016775057,0.000319938,0.0002085545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006720317,0.0004262549,0.0007310725,0.0010453911,0.00024503877,0.0008421859,0.004241682,0.00018877246,0.00004485769],"category_scores_gemma":[0.00011640387,0.00039462827,0.00030353884,0.0043587326,0.0004900838,0.00047081005,0.0046930294,0.0007963831,0.0000039395854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006095423,0.00118058,0.012050183,0.0008967904,0.00038578062,0.00014254848,0.023190249,0.19230868,0.07544463,0.027631821,0.0001975016,0.6665103],"study_design_scores_gemma":[0.00035552116,0.00013320403,0.005252139,0.000111569934,0.000031534477,0.000009401414,0.0000018178388,0.8389108,0.021784052,0.13291273,0.000031467993,0.00046572497],"about_ca_topic_score_codex":0.00062080385,"about_ca_topic_score_gemma":0.00018837847,"teacher_disagreement_score":0.66604453,"about_ca_system_score_codex":0.0001487311,"about_ca_system_score_gemma":0.0007739898,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W3004166306","doi":"10.1109/tcsi.2020.2970923","title":"A Standalone FPGA-Based Miner for Lyra2REv2 Cryptocurrencies","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; KU Leuven; Nvidia","keywords":"Hash function; Computer science; Field-programmable gate array; Cryptocurrency; Embedded system; Parallel computing; Cryptography; Algorithm","score_opus":0.0503163167096355,"score_gpt":0.27729749981033536,"score_spread":0.22698118310069987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004166306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032530457,0.0007256824,0.98886305,0.0016817008,0.002291593,0.0018921124,0.0008297545,0.00025062962,0.00021244441],"genre_scores_gemma":[0.9957137,0.00012622228,0.0025965373,0.00032974602,0.00012548653,0.00091223005,0.00004721772,0.00004068433,0.00010815877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970935,0.0001657324,0.0006578221,0.0010689561,0.0005675145,0.00044650107],"domain_scores_gemma":[0.99808276,0.00023250507,0.00026266495,0.0008566221,0.00021680158,0.0003486723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004534495,0.00048498952,0.00066158344,0.00036200506,0.00051076943,0.00065314036,0.00062269275,0.00028845845,0.000019286845],"category_scores_gemma":[0.000015063006,0.00045981334,0.00043349198,0.000392628,0.0001246009,0.00014890941,0.000011005646,0.00044119742,0.0000033219574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026451057,0.0020905354,0.00007623995,0.01503643,0.00356039,0.00014651012,0.022254476,0.10301263,0.033106595,0.13967259,0.015731258,0.6650478],"study_design_scores_gemma":[0.011804769,0.0027962176,0.00033788758,0.0028955871,0.0011886777,0.0001400757,0.003698062,0.7152066,0.0108045945,0.0077192555,0.23762582,0.0057824403],"about_ca_topic_score_codex":0.0001276431,"about_ca_topic_score_gemma":0.00008438798,"teacher_disagreement_score":0.99246067,"about_ca_system_score_codex":0.00010156224,"about_ca_system_score_gemma":0.00039775783,"threshold_uncertainty_score":0.99978536},"labels":[],"label_agreement":null},{"id":"W3010117922","doi":"","title":"Electromagnetic Fault Injection On Two Microcontrollers: Methodology, Fault Model, Attack and Countermeasures","year":2020,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Microcontroller; Fault (geology); Fault injection; Computer science; Embedded system; Reliability engineering; Computer security; Engineering; Geology; Operating system; Seismology; Software","score_opus":0.035145877753218493,"score_gpt":0.27634335787880054,"score_spread":0.24119748012558206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010117922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847526,0.00016119491,0.012631852,0.0013379834,0.0002053408,0.00045489852,0.000034573226,0.00010386306,0.00031771237],"genre_scores_gemma":[0.84786695,0.0007172897,0.119642675,0.0004329109,0.0000893075,0.000006279719,0.00062703784,0.00005790253,0.030559666],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983863,0.00020678746,0.00017838409,0.0006184547,0.00031207455,0.0002979465],"domain_scores_gemma":[0.9989847,0.000092024624,0.00027929386,0.0003261202,0.00020583111,0.00011201569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025175323,0.00028178547,0.0004673656,0.0004078673,0.0003109471,0.00008448423,0.0005666219,0.00019911425,0.000026666805],"category_scores_gemma":[0.00001848792,0.0003238549,0.00016817791,0.00033477703,0.00008904618,0.00031042914,0.0000889142,0.00034653107,0.000009342894],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026173857,0.0005705984,0.00048008878,0.001066723,0.001265873,0.00013857629,0.7439109,0.005182751,0.13934769,0.03693451,0.015491654,0.052993253],"study_design_scores_gemma":[0.015472919,0.0072648474,0.0074057477,0.0005481882,0.001181133,0.00007973439,0.2279806,0.70877767,0.010625747,0.013448839,0.004015896,0.0031987075],"about_ca_topic_score_codex":0.0075463825,"about_ca_topic_score_gemma":0.03493481,"teacher_disagreement_score":0.70359486,"about_ca_system_score_codex":0.00005877382,"about_ca_system_score_gemma":0.00010422317,"threshold_uncertainty_score":0.9999213},"labels":[],"label_agreement":null},{"id":"W3016801111","doi":"10.1007/978-3-030-45371-8_8","title":"Lempel-Ziv Compression with Randomized Input-Output for Anti-compression Side-Channel Attacks Under HTTPS/TLS","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Side channel attack; Compression (physics); Timing attack; Data compression; Channel (broadcasting); Compression ratio; Computer security; Algorithm; Computer network; Cryptography","score_opus":0.02959906724605882,"score_gpt":0.28309228231983213,"score_spread":0.2534932150737733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016801111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004141792,0.0004093781,0.9915391,0.0028682542,0.0014211669,0.0023162914,0.00003235817,0.00026578986,0.0007334458],"genre_scores_gemma":[0.6303251,0.00011118063,0.3644942,0.0039832722,0.0006167311,0.00012400559,0.0000841833,0.00009043545,0.00017089528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415636,0.00014476452,0.0010593558,0.002279708,0.0014389179,0.0009208772],"domain_scores_gemma":[0.9951562,0.0018396019,0.000715793,0.0014329099,0.0005041058,0.00035134717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001302152,0.0009148222,0.0015548053,0.0009824993,0.0007537942,0.0009499954,0.0030641058,0.0003860986,0.000023518158],"category_scores_gemma":[0.00009987747,0.00068760774,0.00042842398,0.0009043733,0.0011462647,0.0008242698,0.0015197139,0.0009664965,0.000015160476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005440505,0.00049963826,0.00012073201,0.0007783436,0.00044678213,0.00028032734,0.0111792665,0.22440366,0.0015835736,0.3011513,0.0013519576,0.45276392],"study_design_scores_gemma":[0.026856726,0.00042197827,0.0000814148,0.0009549889,0.000066632725,0.000054192355,0.0000028617214,0.77837086,0.0016314948,0.18812819,0.0021104838,0.0013202014],"about_ca_topic_score_codex":0.000050324492,"about_ca_topic_score_gemma":0.00006720557,"teacher_disagreement_score":0.6299109,"about_ca_system_score_codex":0.00015410055,"about_ca_system_score_gemma":0.0005544312,"threshold_uncertainty_score":0.9995575},"labels":[],"label_agreement":null},{"id":"W3022241651","doi":"10.46586/tosc.v2020.is1.132-159","title":"WAGE: An Authenticated Encryption with a Twist","year":2020,"lang":"en","type":"article","venue":"IACR Transactions on Symmetric Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology; University of Waterloo; U.S. Department of Commerce","keywords":"Authenticated encryption; Permutation (music); Encryption; Block cipher; Computer science; Pseudorandom permutation; Differential cryptanalysis; Pseudorandom number generator; Random permutation; Mathematics; Arithmetic; Theoretical computer science; Algorithm; Block (permutation group theory); Computer network; Combinatorics","score_opus":0.031221779069617924,"score_gpt":0.26755094673161584,"score_spread":0.2363291676619979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022241651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07325357,0.000027929644,0.92139745,0.0040518367,0.00017170249,0.0002746081,0.00001915716,0.00037838583,0.0004253736],"genre_scores_gemma":[0.9371664,0.000017526172,0.061605986,0.0010816068,0.000031948686,0.00005924189,0.000016915275,0.00001568179,0.0000046868067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981393,0.00016205061,0.0003382388,0.0006397886,0.00032793955,0.00039263925],"domain_scores_gemma":[0.99881303,0.00014697957,0.0001027337,0.0005149809,0.00013364821,0.00028860144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016085988,0.00021864631,0.00025750778,0.00066820177,0.00033003406,0.0001435396,0.00058148324,0.00010789625,0.0002675439],"category_scores_gemma":[0.000018112842,0.00019491758,0.000102421545,0.0040171626,0.00011378152,0.00048662265,0.000009988702,0.00032400107,0.00010308523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002132537,0.0011994252,0.0006015097,0.000030521172,0.00020549005,0.0000865134,0.007117272,0.00055833184,0.001309287,0.70086545,0.00020526751,0.28760767],"study_design_scores_gemma":[0.026844287,0.03158128,0.060093343,0.000106141815,0.0010210659,0.0019324507,0.009718067,0.68701077,0.023442946,0.068418615,0.08323034,0.006600713],"about_ca_topic_score_codex":0.00007144574,"about_ca_topic_score_gemma":0.00007017192,"teacher_disagreement_score":0.8639128,"about_ca_system_score_codex":0.000040731768,"about_ca_system_score_gemma":0.00007930705,"threshold_uncertainty_score":0.7948508},"labels":[],"label_agreement":null},{"id":"W3028888920","doi":"","title":"Time-Memory-Data Trade-off Attack on Stream Ciphers based on Maiorana-McFarland Functions.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Computer science; Correlation attack; Filter (signal processing); Generalization; Stream cipher attack; Slide attack; Algorithm; Function (biology); Cryptanalysis; Arithmetic; Cryptography; Mathematics; Computer vision","score_opus":0.054263718897311304,"score_gpt":0.3296247709428766,"score_spread":0.2753610520455653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028888920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051488623,0.00007277179,0.9197054,0.0047826897,0.0018366037,0.0013165977,0.0012513438,0.0004737398,0.019072255],"genre_scores_gemma":[0.43205765,0.00021130951,0.552318,0.0066305012,0.0009421466,0.00040748314,0.007202842,0.00019147417,0.000038637994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994287,0.000605579,0.00092050235,0.0024319305,0.00074738363,0.0010076124],"domain_scores_gemma":[0.99299127,0.0012529688,0.00050094695,0.004805753,0.00008115819,0.0003679082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011019731,0.00079629145,0.0008245407,0.0011163445,0.00048747726,0.00024339033,0.0035844403,0.0004845318,0.0006668224],"category_scores_gemma":[0.00012419418,0.000792963,0.00040791492,0.0005184705,0.00059141143,0.0001816823,0.0025780047,0.002039428,0.0005975076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012139028,0.0041701975,0.006951537,0.00031069273,0.0012662156,0.00092995074,0.005279555,0.055350263,0.00018578512,0.5163539,0.12301916,0.28496885],"study_design_scores_gemma":[0.0061431346,0.001924389,0.05264187,0.0004936418,0.00035220137,0.00011568431,0.0008216276,0.6549224,0.00032748503,0.1815294,0.097315714,0.003412454],"about_ca_topic_score_codex":0.00010512411,"about_ca_topic_score_gemma":0.00045947454,"teacher_disagreement_score":0.5995721,"about_ca_system_score_codex":0.00014744354,"about_ca_system_score_gemma":0.00045469502,"threshold_uncertainty_score":0.9994521},"labels":[],"label_agreement":null},{"id":"W3029154524","doi":"","title":"Watch your Constants: Malicious Streebog.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; SHA-2; Collision attack; Computer science; Checksum; Cryptographic hash function; GOST (hash function); Hash chain; Computer security; Function (biology); Collision; Context (archaeology); MD5; Collision resistance; Theoretical computer science; Double hashing; Operating system","score_opus":0.026266463109717864,"score_gpt":0.30398204534666295,"score_spread":0.2777155822369451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029154524","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11046333,0.000072275536,0.87501824,0.0054849563,0.0015790239,0.0006869397,0.00016174432,0.00039030914,0.006143185],"genre_scores_gemma":[0.49528623,0.00015721587,0.5030515,0.0008893247,0.00020871998,0.00020646819,0.00016098499,0.00003557879,0.000003930045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564236,0.0005666603,0.00090288,0.001521176,0.00044136384,0.0009255854],"domain_scores_gemma":[0.9962669,0.00047078994,0.0005333343,0.0022542204,0.00019001245,0.0002847516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057699083,0.0006205645,0.00085297547,0.00039239542,0.0003255236,0.00026680215,0.0026664992,0.0003901132,0.0001530868],"category_scores_gemma":[0.000097648,0.0006216682,0.00042942713,0.00032968083,0.00059334247,0.00012846295,0.0047684056,0.0014599492,0.00021624609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016636743,0.00012708097,0.005182409,0.00006516268,0.00018016067,0.000090022295,0.0039934386,0.00018265234,0.00012710721,0.97521484,0.0026645465,0.012155935],"study_design_scores_gemma":[0.000673661,0.00010468864,0.0065206694,0.00006846996,0.000046964054,0.00011429764,0.00023489202,0.009457427,0.00021361643,0.96820706,0.01367267,0.0006855557],"about_ca_topic_score_codex":0.0005743027,"about_ca_topic_score_gemma":0.0008602223,"teacher_disagreement_score":0.3848229,"about_ca_system_score_codex":0.000070711736,"about_ca_system_score_gemma":0.00033024183,"threshold_uncertainty_score":0.9996235},"labels":[],"label_agreement":null},{"id":"W3029231014","doi":"","title":"Multicollision Attacks on some Generalized Sequential Hash Functions.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Collision attack; SHA-2; Iterated function; Computer science; Cryptographic hash function; Double hashing; Hash chain; Collision resistance; Set (abstract data type); MDC-2; Class (philosophy); Function (biology); Theoretical computer science; Mathematics; Computer security; Programming language; Artificial intelligence","score_opus":0.03238088409572054,"score_gpt":0.3096803961251157,"score_spread":0.2772995120293952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029231014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2472932,0.00007803845,0.7450352,0.0020303258,0.0028784866,0.00081620784,0.00020595266,0.00034029616,0.0013223309],"genre_scores_gemma":[0.20136927,0.00014986667,0.79449886,0.0014428124,0.0006524611,0.00062109943,0.0011767261,0.00006698442,0.00002192639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99548787,0.0006233458,0.00091061275,0.0016440907,0.0005376574,0.0007964396],"domain_scores_gemma":[0.9969089,0.00036902056,0.00048783168,0.0018658977,0.00015811376,0.0002102413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044058592,0.00063151726,0.0007258692,0.0008364646,0.0005351655,0.0003372048,0.0016288393,0.0004355939,0.00015818894],"category_scores_gemma":[0.000060245013,0.00063262845,0.0005805476,0.0002884852,0.0003617117,0.00021363623,0.003112383,0.0013967825,0.00029016228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006278873,0.00038090782,0.0017092373,0.000041493407,0.00016138701,0.00008269729,0.0008218625,0.005525068,0.00057179044,0.9729753,0.010662029,0.0070054177],"study_design_scores_gemma":[0.0017509122,0.00018639112,0.014545758,0.00007526953,0.0000720488,0.00004199267,0.000035356123,0.041199524,0.0006545684,0.9275559,0.013042788,0.00083945884],"about_ca_topic_score_codex":0.00063098833,"about_ca_topic_score_gemma":0.00047524262,"teacher_disagreement_score":0.049463693,"about_ca_system_score_codex":0.00015139862,"about_ca_system_score_gemma":0.00030381614,"threshold_uncertainty_score":0.9996125},"labels":[],"label_agreement":null},{"id":"W3029452169","doi":"","title":"Another Look at \"Provable Security\". II.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Provable security; Computer security; Cryptography","score_opus":0.016453373554554906,"score_gpt":0.2709123745534825,"score_spread":0.2544590009989276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029452169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12139003,0.00028472854,0.86079746,0.003055354,0.001333904,0.00094907416,0.00012614718,0.0004299237,0.011633358],"genre_scores_gemma":[0.38162267,0.00028950223,0.61528313,0.0016762923,0.0002758039,0.00048864476,0.0002553685,0.000077251774,0.000031328545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958611,0.00028932438,0.0007671853,0.001670497,0.00044237438,0.00096950086],"domain_scores_gemma":[0.99681216,0.00019501893,0.00045753538,0.002187628,0.00013832182,0.00020930832],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00043979162,0.0006284308,0.0007409751,0.00056097726,0.00066818757,0.00017614398,0.0023642462,0.0004217955,0.00064289535],"category_scores_gemma":[0.000048696013,0.00064696255,0.00048269596,0.0003256179,0.0005108889,0.00018607965,0.010684588,0.0012804093,0.00032675252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025579562,0.00026004328,0.0018871572,0.00008785896,0.00018271795,0.00009876598,0.009834456,0.00041485677,0.00030775164,0.98333746,0.0019480203,0.0016153181],"study_design_scores_gemma":[0.0008211385,0.00012865089,0.001989872,0.00007380832,0.000035841294,0.00010938519,0.00009093161,0.0024157756,0.0011082367,0.9670392,0.025513697,0.0006734053],"about_ca_topic_score_codex":0.0004192064,"about_ca_topic_score_gemma":0.0013114393,"teacher_disagreement_score":0.26023266,"about_ca_system_score_codex":0.0002835033,"about_ca_system_score_gemma":0.0005332884,"threshold_uncertainty_score":0.99959815},"labels":[],"label_agreement":null},{"id":"W3029665865","doi":"","title":"Impossible Differential Cryptanalysis of Reduced-Round SKINNY.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Differential cryptanalysis; Differential (mechanical device); Computer science; Linear cryptanalysis; Boomerang attack; Arithmetic; Cipher; Parallel computing; Algorithm; Mathematics; Cryptography; Operating system; Physics; Encryption","score_opus":0.01865682316254539,"score_gpt":0.294327845526117,"score_spread":0.2756710223635716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029665865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29611108,0.00008024259,0.6995604,0.0010185444,0.0009718049,0.00037591782,0.00017128063,0.000116260555,0.0015944723],"genre_scores_gemma":[0.7331649,0.00015279495,0.26620033,0.000060438775,0.000176338,0.0001320419,0.00008334764,0.000026669475,0.0000031113193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99561936,0.0004986467,0.0012089865,0.0013870738,0.0005252639,0.0007606965],"domain_scores_gemma":[0.9958068,0.00048221345,0.0009265076,0.0022980927,0.00025897624,0.00022740054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004003607,0.00056593353,0.0010885976,0.0010170252,0.00023236283,0.00015807014,0.0026082457,0.00036068476,0.00043703188],"category_scores_gemma":[0.00009391755,0.00048260958,0.0008365202,0.000444564,0.0006231644,0.00018740157,0.0046541006,0.00082129275,0.00004797643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035050005,0.00021806863,0.003566048,0.00008683937,0.0006278287,0.000026603277,0.0022873608,0.000020801526,0.008284407,0.9760072,0.00047040242,0.00836934],"study_design_scores_gemma":[0.00064132625,0.00009483756,0.019713003,0.00009675896,0.00014231376,0.000028325847,0.00006657215,0.002076548,0.004605381,0.9714083,0.00060722604,0.00051942864],"about_ca_topic_score_codex":0.0001981574,"about_ca_topic_score_gemma":0.00020700395,"teacher_disagreement_score":0.43705383,"about_ca_system_score_codex":0.000083683,"about_ca_system_score_gemma":0.00041029757,"threshold_uncertainty_score":0.99976254},"labels":[],"label_agreement":null},{"id":"W3029996188","doi":"","title":"The Weakness of Integrity Protection for LTE.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Message authentication code; TRACE (psycholinguistics); Authentication (law); Harm; Extension (predicate logic); Computer network; Cryptography; Law","score_opus":0.056082150452270725,"score_gpt":0.3245970857923416,"score_spread":0.26851493534007087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029996188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030977836,0.00018379155,0.9622776,0.002297236,0.0019120937,0.0017691978,0.00008688691,0.0001040078,0.00039136928],"genre_scores_gemma":[0.5086025,0.00012270133,0.48948494,0.000052312374,0.00019249956,0.001480853,0.000044810786,0.000017889406,0.0000014853435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977012,0.0003656651,0.00063038996,0.0005721709,0.00022127364,0.0005092601],"domain_scores_gemma":[0.9971477,0.00074918004,0.00056271174,0.0011883642,0.0002602575,0.00009178968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011577733,0.0002786055,0.0004131652,0.00020487128,0.0004177139,0.000094766925,0.001564337,0.00023478954,0.000012894475],"category_scores_gemma":[0.00020058313,0.00021218917,0.0003620265,0.00018122174,0.00043403113,0.000113884475,0.0020242084,0.001021401,0.000008286387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044469532,0.00010398229,0.00093434635,0.00010414915,0.00011269973,5.7147946e-7,0.002598712,0.00002251033,0.00037631055,0.9600865,0.00021210764,0.035403624],"study_design_scores_gemma":[0.00031990433,0.000075941745,0.008875539,0.00003742216,0.000034709465,0.000015606656,0.00021021241,0.0058267764,0.0014197944,0.9753138,0.007638367,0.00023196475],"about_ca_topic_score_codex":0.00022430482,"about_ca_topic_score_gemma":0.00047757398,"teacher_disagreement_score":0.47762468,"about_ca_system_score_codex":0.000044156466,"about_ca_system_score_gemma":0.00022405399,"threshold_uncertainty_score":0.86528236},"labels":[],"label_agreement":null},{"id":"W3030198531","doi":"","title":"Integral Distinguishers for Reduced-round Stribog.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"GOST (hash function); Hash function; Permutation (music); Cryptographic hash function; Computer science; Function (biology); Compression (physics); Order (exchange); Mathematics; Computer security; Physics","score_opus":0.03555914038972926,"score_gpt":0.3165588676342527,"score_spread":0.2809997272445235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030198531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14097084,0.000067806934,0.8508882,0.0020990362,0.00234424,0.0015014197,0.00021898016,0.00027448442,0.0016349887],"genre_scores_gemma":[0.22755595,0.000035367786,0.7703148,0.0002828622,0.00030515483,0.0010686186,0.0003976899,0.00003517123,0.0000044080466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996334,0.0002658821,0.0008109478,0.0014231895,0.00028191681,0.00088406424],"domain_scores_gemma":[0.9966042,0.0007874237,0.00050841464,0.0015509082,0.00029954655,0.00024951244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004802682,0.0005566949,0.0007047248,0.00044399506,0.00036149766,0.00045516776,0.002361378,0.00033322006,0.0001172427],"category_scores_gemma":[0.000355071,0.0005465251,0.0005414909,0.0002311972,0.00043217317,0.0001905729,0.0031417385,0.001143613,0.000060750906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018810104,0.000113080794,0.0010469097,0.00008420301,0.00017562677,0.000011327872,0.0033228751,0.000043216165,0.00017894464,0.9728358,0.006279038,0.015890202],"study_design_scores_gemma":[0.0005579753,0.00012917728,0.004592305,0.000059624912,0.000043852666,0.000028934452,0.00026367797,0.011118727,0.00019958333,0.9706373,0.011798167,0.00057066453],"about_ca_topic_score_codex":0.0005806179,"about_ca_topic_score_gemma":0.00034300413,"teacher_disagreement_score":0.086585104,"about_ca_system_score_codex":0.00011442746,"about_ca_system_score_gemma":0.00037430183,"threshold_uncertainty_score":0.99969864},"labels":[],"label_agreement":null},{"id":"W3030340285","doi":"","title":"A heuristic for finding compatible differential paths with application to HAS-160.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Heuristic; Differential (mechanical device); Collision; Algorithm; Theoretical computer science; Function (biology); Perfect hash function; Context (archaeology); Hash table; Artificial intelligence; Physics; Programming language","score_opus":0.030582535978948312,"score_gpt":0.29791249010898707,"score_spread":0.26732995413003874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030340285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16700989,0.000013761621,0.82798475,0.0014805363,0.0004220731,0.0025810557,0.00014658345,0.00017360658,0.00018774961],"genre_scores_gemma":[0.50699323,0.0000058456094,0.4903217,0.00015087036,0.00008507447,0.0022032908,0.00021851053,0.00002065471,8.280074e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971144,0.00015742847,0.0005676952,0.0012397185,0.00027683357,0.0006439136],"domain_scores_gemma":[0.9974496,0.0004832815,0.00037635525,0.0012492657,0.0002034456,0.00023809412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002003642,0.0004393816,0.0006002395,0.000496308,0.0004300608,0.0003744547,0.0014385331,0.00017111629,0.00006226365],"category_scores_gemma":[0.000049347924,0.00040295353,0.00020233117,0.0002542575,0.00020643682,0.000103950784,0.0018569472,0.0005533526,0.00007811139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055928234,0.00017861385,0.0023574145,0.00013024986,0.00012253615,0.000005117887,0.005442671,0.00072757225,0.0006069636,0.9760925,0.0010365411,0.013243865],"study_design_scores_gemma":[0.0009353771,0.00034031988,0.02295527,0.000092912174,0.00006671765,0.000020051104,0.00016997058,0.09201224,0.00032373,0.8792791,0.0031255214,0.000678819],"about_ca_topic_score_codex":0.00029093458,"about_ca_topic_score_gemma":0.00059140206,"teacher_disagreement_score":0.33998334,"about_ca_system_score_codex":0.00006833336,"about_ca_system_score_gemma":0.0002087812,"threshold_uncertainty_score":0.9998422},"labels":[],"label_agreement":null},{"id":"W3030829573","doi":"","title":"On the Multi-output Filtering Model and Its Applications.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Computer science; Cryptography; Algorithm; Component (thermodynamics); Correlation attack; Function (biology); Linear feedback shift register; S-box; Theoretical computer science; Stream cipher; Block cipher; Mathematics; Shift register; Statistics; Chip","score_opus":0.04674944590206244,"score_gpt":0.3005163541680336,"score_spread":0.25376690826597115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030829573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05195276,0.00008714209,0.94300663,0.0028501002,0.00017548693,0.00097382924,0.000057912188,0.00014099079,0.00075515197],"genre_scores_gemma":[0.5393164,0.0001338098,0.45865652,0.0008822514,0.000052332503,0.0009094403,0.00002921527,0.000017538343,0.000002475109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978243,0.00024767398,0.00040249262,0.0009315584,0.00020093677,0.00039303766],"domain_scores_gemma":[0.9975002,0.00081039674,0.00024715735,0.001247558,0.00007680399,0.00011791534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000454123,0.00033348394,0.00033877615,0.00023854512,0.00039541916,0.00017149598,0.0014544677,0.00015830033,0.000017905404],"category_scores_gemma":[0.00008800084,0.00026590377,0.00014751374,0.00011510371,0.0001994396,0.00006313078,0.0032036235,0.0008769365,0.00005693054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053814056,0.00005861415,0.00007623358,0.00003888473,0.000047831712,0.0000022582965,0.0017517,0.00526904,0.00014808314,0.9870371,0.00020895772,0.0053559006],"study_design_scores_gemma":[0.0001550911,0.000017507104,0.0006205882,0.000020706502,0.000009772939,0.000009371996,0.000022964587,0.44413516,0.000079882426,0.5539419,0.0008085914,0.00017845823],"about_ca_topic_score_codex":0.000017325765,"about_ca_topic_score_gemma":0.000056063163,"teacher_disagreement_score":0.48736364,"about_ca_system_score_codex":0.000025324345,"about_ca_system_score_gemma":0.00008787553,"threshold_uncertainty_score":0.9999793},"labels":[],"label_agreement":null},{"id":"W3030978102","doi":"","title":"Exact Maximum Expected Differential and Linear Probability for 2-Round Advanced Encryption Standard (AES).","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Linear cryptanalysis; Block cipher; Advanced Encryption Standard; Upper and lower bounds; Encryption; Mathematics; Differential cryptanalysis; Differential (mechanical device); Impossible differential cryptanalysis; Value (mathematics); Provable security; Computer science; Algorithm; Statistics; Computer security; Physics; Mathematical analysis","score_opus":0.02407413391174426,"score_gpt":0.30700086941132587,"score_spread":0.2829267354995816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030978102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38201442,0.00009145075,0.6142321,0.00093948125,0.00060466706,0.0015579739,0.00027839062,0.00019500115,0.00008648018],"genre_scores_gemma":[0.30233422,0.0001903768,0.69618136,0.00006249088,0.00021061287,0.000688665,0.00030515052,0.000026269629,8.9239705e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595463,0.00036842248,0.00087511755,0.0016923731,0.00036056753,0.00074889715],"domain_scores_gemma":[0.99717546,0.00052432984,0.00048743153,0.0013074185,0.0002722592,0.0002331221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004474562,0.0005866424,0.0008243393,0.0003917745,0.00040609945,0.00022094669,0.0010190732,0.00034529052,0.00009747245],"category_scores_gemma":[0.00016517035,0.0005882362,0.00034624472,0.00017961042,0.0004592845,0.00027403413,0.0022945544,0.0008707732,0.000007176533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048953574,0.00033660303,0.0034396916,0.0002894695,0.00023734277,0.000010797004,0.005840237,0.00030675603,0.0015506608,0.91577923,0.00015610126,0.071563564],"study_design_scores_gemma":[0.0019338557,0.0003540634,0.01800606,0.0000623031,0.00006463477,0.00002728957,0.00016468974,0.012929332,0.0006175747,0.9624443,0.0027481692,0.00064773706],"about_ca_topic_score_codex":0.000047177145,"about_ca_topic_score_gemma":0.00045917236,"teacher_disagreement_score":0.08194922,"about_ca_system_score_codex":0.00014612032,"about_ca_system_score_gemma":0.00028104213,"threshold_uncertainty_score":0.9996569},"labels":[],"label_agreement":null},{"id":"W3031215330","doi":"","title":"Some observations on the theory of cryptographic hash functions.","year":2001,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Random oracle; Collision resistance; Security of cryptographic hash functions; Cryptographic hash function; Computer science; Oracle; SWIFFT; Function (biology); Theoretical computer science; SHA-2; Cryptography; Cryptographic primitive; Collision attack; Mathematics; Double hashing; Algorithm; Computer security; Cryptographic protocol; Encryption; Programming language; Public-key cryptography","score_opus":0.059008740401374424,"score_gpt":0.2818161552245252,"score_spread":0.22280741482315075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031215330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15352824,0.00021460428,0.8352496,0.0063922866,0.001317528,0.00087963406,0.00015419816,0.00019488072,0.0020690432],"genre_scores_gemma":[0.68329686,0.0012591069,0.31020987,0.0031129962,0.0005242414,0.0012214422,0.00028679526,0.00007342521,0.00001528037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600035,0.0010145534,0.00090173964,0.0010196706,0.00047396324,0.0005897379],"domain_scores_gemma":[0.99422747,0.0022158327,0.00065562135,0.0025319993,0.00023680954,0.00013224795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011359731,0.0004928978,0.0006023349,0.0008194829,0.0005638844,0.00013911162,0.0025310316,0.0002809116,0.00021513592],"category_scores_gemma":[0.00024201759,0.00038797993,0.00062257046,0.0007819496,0.0009159052,0.00017887366,0.002351629,0.0014875077,0.00006716399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032374075,0.00028216676,0.005236854,0.000033311404,0.0002866166,0.0000109814,0.0019540743,0.0004055425,0.00021086643,0.9867876,0.001641682,0.0031179364],"study_design_scores_gemma":[0.00030423867,0.00011954853,0.052771736,0.0000725396,0.0000592468,0.000017369188,0.0004248528,0.0015136931,0.00012788018,0.9413515,0.0029010493,0.00033635597],"about_ca_topic_score_codex":0.00009508249,"about_ca_topic_score_gemma":0.00016043738,"teacher_disagreement_score":0.5297686,"about_ca_system_score_codex":0.00004120132,"about_ca_system_score_gemma":0.00029485588,"threshold_uncertainty_score":0.9998572},"labels":[],"label_agreement":null},{"id":"W3031310476","doi":"10.29292/jics.v15i1.100","title":"Enhancing Side Channel Attack-Resistance of the STTL Combining Multi-Vt Transistors with Capacitance and Current Paths Counterbalancing","year":2020,"lang":"en","type":"article","venue":"Journal of Integrated Circuits and Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal do Rio Grande do Sul; Fundação de Amparo à Pesquisa do Estado do Rio Grande do Sul; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Conselho Nacional de Desenvolvimento Científico e Tecnológico; NSCAD University","keywords":"Side channel attack; Computer science; Power analysis; Transistor; Exploit; Logic gate; Electrical engineering; Embedded system; Electronic engineering; Cryptography; Engineering; Voltage; Computer security; Algorithm","score_opus":0.036928496458605777,"score_gpt":0.2562918717140942,"score_spread":0.2193633752554884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031310476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70272595,0.005032267,0.29125655,0.00026962094,0.00047342363,0.00018047534,0.000022238548,0.00001125355,0.000028222814],"genre_scores_gemma":[0.9994208,0.00016382567,0.000293081,0.00006711367,0.000039291714,0.0000030773763,5.457087e-7,0.0000073938736,0.0000048630873],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985375,0.00012347827,0.00064102514,0.00018296983,0.0003411059,0.0001739405],"domain_scores_gemma":[0.99862003,0.00008335083,0.00064280943,0.00013707788,0.00039692124,0.000119808465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004750735,0.00015158497,0.00037099142,0.000078554636,0.00016164432,0.00013837873,0.0002964664,0.000034932877,6.8265194e-7],"category_scores_gemma":[0.000046679743,0.00009039164,0.00006774936,0.00042678462,0.00008344882,0.00030103684,0.000016540378,0.00029743713,7.461274e-8],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037134197,0.00096773176,0.1326004,0.0067830854,0.0017779315,0.00030171443,0.5382408,0.0031532333,0.21996279,0.04982663,0.0017147704,0.04429956],"study_design_scores_gemma":[0.031516682,0.0060064704,0.12998553,0.04513559,0.0010179897,0.0031740072,0.27096754,0.4447277,0.039034653,0.00088026235,0.022985138,0.0045684576],"about_ca_topic_score_codex":0.000060765455,"about_ca_topic_score_gemma":0.00030102502,"teacher_disagreement_score":0.44157445,"about_ca_system_score_codex":0.00004037228,"about_ca_system_score_gemma":0.00012573444,"threshold_uncertainty_score":0.3686064},"labels":[],"label_agreement":null},{"id":"W3036194274","doi":"","title":"Area and Energy Optimizations in ASIC Implementations of AES and PRESENT Block Ciphers","year":2020,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Application-specific integrated circuit; Block cipher; Advanced Encryption Standard; Computer science; S-box; Implementation; Block (permutation group theory); AES implementations; Parallel computing; Embedded system; Arithmetic; Cryptography; Mathematics; Algorithm; Programming language","score_opus":0.012806077294358915,"score_gpt":0.22105001880759614,"score_spread":0.20824394151323722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036194274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99361336,0.00029078318,0.00328802,0.002016774,0.00008560903,0.00021397068,0.00008903805,0.000030431253,0.00037201322],"genre_scores_gemma":[0.9557047,0.0020607424,0.034032516,0.00002997345,0.000013134242,0.000003329398,0.00071458105,0.000017534214,0.0074235233],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9991647,0.000048395086,0.00016836067,0.0003011133,0.00017233915,0.0001451135],"domain_scores_gemma":[0.9993948,0.000046356785,0.00019947646,0.00018273357,0.00010044738,0.0000762314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060698818,0.00013454982,0.0002475662,0.00037132163,0.0001322159,0.0000320949,0.0002654582,0.000075715296,0.00003836868],"category_scores_gemma":[0.000004454786,0.0001656393,0.000055877405,0.0004573171,0.000074238924,0.0002713349,0.00013409663,0.00008206329,2.2783142e-7],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012860323,0.00042546593,0.0212965,0.0008038152,0.0005012298,0.000055958484,0.79229146,0.0010863699,0.002758052,0.14397456,0.0031218133,0.03355617],"study_design_scores_gemma":[0.004017788,0.00061846257,0.064521976,0.00030536266,0.00035535227,0.000010219995,0.8730449,0.046423014,0.0015626036,0.0039020071,0.0042027486,0.0010355354],"about_ca_topic_score_codex":0.02454097,"about_ca_topic_score_gemma":0.07275689,"teacher_disagreement_score":0.14007254,"about_ca_system_score_codex":0.000017106328,"about_ca_system_score_gemma":0.000069085094,"threshold_uncertainty_score":0.9819547},"labels":[],"label_agreement":null},{"id":"W3038577324","doi":"10.6028/nist.ir.8214a","title":"NIST roadmap toward criteria for threshold schemes for cryptographic primitives","year":2020,"lang":"en","type":"report","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Standards and Technology; Information Technology Laboratory; University of Waterloo; KU Leuven","keywords":"NIST; Cryptographic primitive; Cryptography; Computer science; Cryptographic protocol; Theoretical computer science; Computer security; Natural language processing","score_opus":0.14793478945817415,"score_gpt":0.39760655708333725,"score_spread":0.2496717676251631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038577324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015617436,0.0007774922,0.97664416,0.0035127508,0.0018996631,0.0026561685,0.0005801215,0.0004414296,0.013332034],"genre_scores_gemma":[0.17602256,0.0020640022,0.810358,0.0018532557,0.0022791775,0.004156877,0.0018805052,0.00017761628,0.0012080036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964299,0.000033170298,0.0008644136,0.0012467726,0.0007593985,0.00066634256],"domain_scores_gemma":[0.99723136,0.00026010137,0.00039979158,0.0008077049,0.0010655363,0.00023548941],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076183316,0.0005418791,0.0007675625,0.00045674664,0.00041513448,0.0008203233,0.0013874103,0.00030357318,0.00012351305],"category_scores_gemma":[0.00020928525,0.0004995649,0.0009542957,0.0006658021,0.0001298708,0.0004166127,0.00041057737,0.00025847764,0.0000042622664],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051956067,0.00026532082,0.0007115078,0.0019052933,0.0005990468,0.000007074219,0.0012001711,4.1124096e-7,0.0003053034,0.61801916,0.34739593,0.029538823],"study_design_scores_gemma":[0.0008343397,0.00045582184,0.0005412532,0.000080060076,0.00010843729,0.000015861426,0.0001824143,0.0028228497,0.00047977874,0.028427508,0.9652786,0.0007730546],"about_ca_topic_score_codex":0.000069362795,"about_ca_topic_score_gemma":0.00010055264,"teacher_disagreement_score":0.61788267,"about_ca_system_score_codex":0.00006960439,"about_ca_system_score_gemma":0.0010107921,"threshold_uncertainty_score":0.9997456},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0276569169730396,"score_gpt":0.2721816388021825,"score_spread":0.2445247218291429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042003498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40382352,0.000015414797,0.58255696,0.005700592,0.000112948386,0.000106542095,0.0000017433764,0.00016586317,0.007516385],"genre_scores_gemma":[0.9907092,0.000006309643,0.0068327175,0.0023955489,0.000027422964,0.0000027048407,0.0000010357526,0.0000013757244,0.000023713676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996257,0.000012417602,0.00006566056,0.00014591747,0.00008264943,0.00006769994],"domain_scores_gemma":[0.99981725,0.00001666599,0.000014521779,0.00008437766,0.000015362235,0.000051826137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043161708,0.00003901644,0.000037572197,0.00003233866,0.00007236628,0.00009179039,0.00009148486,0.000012293579,0.00006655794],"category_scores_gemma":[0.000007759056,0.000032356875,0.000015113437,0.00021761715,0.000007564064,0.00013121314,0.000053497115,0.000044429256,0.00002399847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009226873,0.00009213634,0.0023664448,0.00001088074,0.000015263335,0.000004976627,0.008381241,0.000060926504,0.00032228892,0.76775783,0.0131336665,0.20784512],"study_design_scores_gemma":[0.0033860956,0.005059857,0.07557704,0.000018635681,0.000022544318,0.000057575624,0.0052184244,0.6214608,0.0077183386,0.06567215,0.21471436,0.0010941606],"about_ca_topic_score_codex":0.000027546621,"about_ca_topic_score_gemma":0.000037992046,"teacher_disagreement_score":0.7020857,"about_ca_system_score_codex":0.0000032088092,"about_ca_system_score_gemma":0.0000056567173,"threshold_uncertainty_score":0.1319475},"labels":[],"label_agreement":null},{"id":"W3045801415","doi":"10.1109/icc40277.2020.9149305","title":"Dynamic Reduced-Round Cryptography for Energy-Efficient Wireless Communication of Smart IoT Devices","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Encryption; Computer network; Cryptography; Energy consumption; Embedded system; Efficient energy use; Wireless; Cryptographic protocol; Computer security; Operating system; Engineering; Electrical engineering","score_opus":0.024290219587268694,"score_gpt":0.28248464182893956,"score_spread":0.2581944222416709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045801415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28787202,0.00012932507,0.7089437,0.002458994,0.000057225316,0.00018005334,0.000012404734,0.00008016515,0.00026607487],"genre_scores_gemma":[0.90314597,0.000026084716,0.096163735,0.0005824459,0.000006878355,0.00004292702,0.000021773949,0.0000063849243,0.0000037911036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989455,0.00005765179,0.00034448705,0.00026982094,0.00019734717,0.00018521547],"domain_scores_gemma":[0.9989682,0.00014411204,0.00015405193,0.00048052488,0.00016838474,0.00008471378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019437338,0.00011139716,0.00016324657,0.0001327195,0.00018414442,0.000089416775,0.0008008868,0.000037336245,0.00001961279],"category_scores_gemma":[0.0000097364145,0.000104553736,0.00013900166,0.00083812734,0.0000725399,0.00010974244,0.00018412498,0.00005351679,0.000001098147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017056298,0.00016687979,0.00041963556,0.00005119874,0.0000472273,2.1526255e-7,0.0023423405,0.0001624146,0.003139015,0.97240615,0.00066468405,0.020583171],"study_design_scores_gemma":[0.0009430812,0.00037011242,0.0032920882,0.000027261545,0.000029260107,0.0000022187626,0.0009211464,0.9643497,0.005907761,0.01253759,0.011280587,0.00033923454],"about_ca_topic_score_codex":0.00019348199,"about_ca_topic_score_gemma":0.00045410622,"teacher_disagreement_score":0.96418726,"about_ca_system_score_codex":0.000012068659,"about_ca_system_score_gemma":0.000042819574,"threshold_uncertainty_score":0.42635775},"labels":[],"label_agreement":null},{"id":"W3048030299","doi":"10.1109/access.2020.3015099","title":"Memory-Efficient Random Order Exponentiation Algorithm","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Canada Research Chairs","keywords":"Modular exponentiation; Exponentiation; Computer science; Side channel attack; Cryptosystem; Algorithm; Power analysis; Public-key cryptography; Cryptography; Modular arithmetic; Random number generation; Theoretical computer science; Arithmetic; Encryption; Mathematics; Computer security","score_opus":0.03840300572360002,"score_gpt":0.3063297767279557,"score_spread":0.2679267710043557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048030299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046027116,0.00004685223,0.95049095,0.0021718715,0.00057701423,0.00022965927,0.0000062783756,0.00014294045,0.00030734699],"genre_scores_gemma":[0.9768736,0.000013158535,0.021167222,0.0017209558,0.00016554206,0.000034248606,0.000010292041,0.00000702508,0.000007956019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989344,0.00005540867,0.00021733431,0.0003059982,0.00029153016,0.00019532078],"domain_scores_gemma":[0.99939716,0.000048034217,0.00008086174,0.00025144516,0.00011881717,0.00010365542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016410094,0.0000977204,0.00011779122,0.000079578924,0.00016431033,0.00039664123,0.00079322373,0.000028407114,0.0001088555],"category_scores_gemma":[0.0000217515,0.0000910554,0.0000591644,0.00092861906,0.000020730347,0.0005156069,0.00015459729,0.00008189904,0.00003909209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006153081,0.00051596493,0.00085567485,0.00007098139,0.00014310477,0.000065237815,0.016636645,0.011927903,0.0028803207,0.011114024,0.025432518,0.9302961],"study_design_scores_gemma":[0.003211564,0.00006148039,0.0020437657,0.0000069047665,0.000017901568,0.0000055179985,0.00014328359,0.96942896,0.017185794,0.0011955113,0.0063643754,0.00033492217],"about_ca_topic_score_codex":0.00007014328,"about_ca_topic_score_gemma":0.000008737188,"teacher_disagreement_score":0.95750105,"about_ca_system_score_codex":0.000012092899,"about_ca_system_score_gemma":0.000039330782,"threshold_uncertainty_score":0.38248205},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01814031823590541,"score_gpt":0.28334244665298514,"score_spread":0.26520212841707974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084828086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07164299,0.000037611695,0.9242778,0.0022888514,0.000044965273,0.0010587244,0.00018685107,0.0004260997,0.000036122558],"genre_scores_gemma":[0.82301533,0.000017753173,0.17627612,0.000350139,0.00003926237,0.00019745485,0.00009381927,0.000009465901,6.36845e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987602,0.000014175631,0.0003951562,0.0004214758,0.00019621554,0.00021277502],"domain_scores_gemma":[0.9992194,0.00010887561,0.00017625808,0.00027087878,0.00013375371,0.00009082784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009588083,0.00016532083,0.00021789779,0.00011426058,0.0001260382,0.00029109413,0.00042914433,0.00004120755,0.0000034358636],"category_scores_gemma":[0.0000050396807,0.00016439178,0.00008444729,0.0004342699,0.000089299836,0.00043492927,0.00024833082,0.00005863024,7.626468e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010482307,0.00015257242,0.0001579902,0.00008938184,0.000050952767,0.0000012234166,0.0014736806,0.00012577674,0.00041232767,0.20387676,0.005003572,0.78864527],"study_design_scores_gemma":[0.008300502,0.009886449,0.013834728,0.0003313143,0.00027713785,0.00011628315,0.0047418824,0.11101785,0.43767306,0.22153817,0.18755683,0.0047257678],"about_ca_topic_score_codex":0.000031279294,"about_ca_topic_score_gemma":0.000005770397,"teacher_disagreement_score":0.7839195,"about_ca_system_score_codex":0.000020343618,"about_ca_system_score_gemma":0.000037678044,"threshold_uncertainty_score":0.6703702},"labels":[],"label_agreement":null},{"id":"W3092829266","doi":"10.48550/arxiv.2010.05296","title":"Improved Fault Analysis on SIMECK Ciphers","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Correctness; Block cipher; Computer science; Internet of Things; Block (permutation group theory); Computer security; Key (lock); Cryptography; Security analysis; Embedded system; Distributed computing; Algorithm; Mathematics","score_opus":0.07536396553189204,"score_gpt":0.21847143196843904,"score_spread":0.143107466436547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092829266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2050499,0.000011501532,0.79163414,0.0004373184,0.0002858791,0.0002685431,0.00005199618,0.00026220156,0.0019985167],"genre_scores_gemma":[0.9971151,0.000052898962,0.0021628507,0.0003981111,0.00004354652,0.0000012945428,0.00006737196,0.000010811933,0.00014801607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793315,0.00012149706,0.00022494727,0.0012767137,0.00011756883,0.0003261402],"domain_scores_gemma":[0.9980569,0.00008761415,0.00024115942,0.0012664741,0.00012367309,0.00022419658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015595669,0.00030228612,0.00039430658,0.00057166634,0.00019075569,0.00019702037,0.0016752359,0.0001819439,0.00010947194],"category_scores_gemma":[0.00002157756,0.0003489725,0.0005907282,0.0027572277,0.000067235735,0.00020316814,0.001324513,0.00053166604,0.000043346146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006625949,0.00027765386,0.004852457,0.000069053596,0.0027281756,0.00033517135,0.0016415045,0.20306191,0.00011795204,0.7837964,0.0012240265,0.0018293853],"study_design_scores_gemma":[0.00046052082,0.000102556274,0.0025735775,0.000010776002,0.00052609306,3.7962633e-7,0.00022817167,0.9688728,0.000076572804,0.025769241,0.00090198603,0.00047731286],"about_ca_topic_score_codex":0.00041425865,"about_ca_topic_score_gemma":0.000277289,"teacher_disagreement_score":0.7920652,"about_ca_system_score_codex":0.000121434474,"about_ca_system_score_gemma":0.00012592644,"threshold_uncertainty_score":0.9998962},"labels":[],"label_agreement":null},{"id":"W3096884914","doi":"10.1007/978-3-030-65411-5_24","title":"Integral Cryptanalysis of Reduced-Round Tweakable TWINE","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cryptanalysis; Computer security; Cryptography","score_opus":0.023477293588727122,"score_gpt":0.27317043801397156,"score_spread":0.24969314442524443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096884914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005353839,0.00026115307,0.9948206,0.0013696871,0.0007168662,0.00025464452,0.0000142985955,0.00008663959,0.0019407169],"genre_scores_gemma":[0.48574927,0.000041551244,0.51299125,0.0008544284,0.00025221516,0.000006438856,0.000014536501,0.000022917351,0.00006742051],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963918,0.000036185967,0.0007715341,0.0012791578,0.0010334516,0.00048786862],"domain_scores_gemma":[0.9975507,0.00026872696,0.00040882034,0.0012475476,0.00033798898,0.00018619656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006449398,0.0004373252,0.0006956944,0.0011034864,0.00019453603,0.00036484146,0.003028312,0.00018308664,0.0000893493],"category_scores_gemma":[0.000080818565,0.00039863872,0.0002899018,0.0017991668,0.00065290835,0.00053100876,0.0011736846,0.0006468945,0.000014953302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013670693,0.000091508075,0.0002206692,0.00010262126,0.00010960239,0.00008807371,0.00302781,0.004680774,0.0014963631,0.4352418,0.00015773858,0.5547694],"study_design_scores_gemma":[0.00047066476,0.00040236136,0.0002272426,0.00026405422,0.00005461007,0.00004252062,0.0000017672129,0.42609686,0.0040090033,0.5636778,0.0038545881,0.00089850836],"about_ca_topic_score_codex":0.00014464707,"about_ca_topic_score_gemma":0.00019459502,"teacher_disagreement_score":0.55387086,"about_ca_system_score_codex":0.00015562636,"about_ca_system_score_gemma":0.00050879974,"threshold_uncertainty_score":0.9998466},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.029945249842396077,"score_gpt":0.28849232010327863,"score_spread":0.2585470702608825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103728101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06178371,0.00006735449,0.9345753,0.00062465994,0.0014112405,0.0011057217,0.00016894947,0.00018101145,0.000082040184],"genre_scores_gemma":[0.99104714,0.0000127618405,0.00800166,0.0004135133,0.000054669865,0.00034940723,0.00005939515,0.000019744355,0.00004170883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762034,0.00013830642,0.00086623605,0.00054924603,0.0004778551,0.00034803385],"domain_scores_gemma":[0.99862546,0.0001823315,0.0003385987,0.00033196766,0.00037333308,0.00014833071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047558532,0.00025650757,0.00033881856,0.00030783852,0.00030542805,0.00028598777,0.0005020112,0.00010272629,0.00007273133],"category_scores_gemma":[0.000009310471,0.00024373434,0.00028990838,0.000729926,0.000042887972,0.00074480823,0.000006517188,0.0001780049,0.000017520546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092030835,0.0044142148,0.0013348599,0.0021670456,0.0014451161,0.000015262975,0.22462922,0.036283594,0.10223218,0.23721874,0.01414927,0.3751902],"study_design_scores_gemma":[0.0016654074,0.0007218224,0.000108349865,0.00015348448,0.0000740721,0.00000989394,0.009623338,0.8925051,0.088621795,0.00013324464,0.005960663,0.0004228051],"about_ca_topic_score_codex":0.00035309236,"about_ca_topic_score_gemma":0.00043829132,"teacher_disagreement_score":0.9292634,"about_ca_system_score_codex":0.00009554225,"about_ca_system_score_gemma":0.00009020208,"threshold_uncertainty_score":0.9939198},"labels":[],"label_agreement":null},{"id":"W310630150","doi":"","title":"Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Mount Allison University","funders":"","keywords":"Advanced Encryption Standard; Computation; Benchmark (surveying); Cryptanalysis; Computer science; Cryptography; S-box; Algorithm; Hull; Linear cryptanalysis; Block cipher; Engineering","score_opus":0.03571488709859343,"score_gpt":0.30547575470197885,"score_spread":0.2697608676033854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W310630150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22061197,0.000022360093,0.7748854,0.0016099144,0.00047829378,0.00189651,0.00020512872,0.000051170406,0.00023923011],"genre_scores_gemma":[0.63740855,0.000021185439,0.361948,0.00015070678,0.00005229954,0.00023713308,0.00016500727,0.000016814249,2.8529746e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997262,0.0003299607,0.00094066927,0.0007633844,0.00031041415,0.00039355762],"domain_scores_gemma":[0.9968884,0.00077527645,0.0009311173,0.00096480345,0.00037136313,0.00006902533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000722512,0.00035411734,0.0006455087,0.00034186873,0.0002280971,0.000053153013,0.0011355769,0.00020500738,0.000022051057],"category_scores_gemma":[0.00013607244,0.00029002127,0.0004518631,0.00021753776,0.00054842647,0.000073153285,0.001094376,0.00061492494,0.0000050831727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116077914,0.0003387494,0.00065197854,0.0002833405,0.00016448765,0.0000015207436,0.0037365393,0.008641242,0.0016630944,0.98130196,0.000075097305,0.0030259085],"study_design_scores_gemma":[0.00092635606,0.00040191266,0.009607092,0.00013123438,0.000035813613,0.000007680555,0.00009965395,0.07075656,0.0024437096,0.9150807,0.00025941365,0.00024983773],"about_ca_topic_score_codex":0.00022780911,"about_ca_topic_score_gemma":0.00014352077,"teacher_disagreement_score":0.41679657,"about_ca_system_score_codex":0.00007835962,"about_ca_system_score_gemma":0.00034935403,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W3109251207","doi":"10.11591/ijres.v9.i3.pp235-241","title":"Efficient adaptation of the Karatsuba algorithm for implementing on FPGA very large scale multipliers for cryptographic algorithms","year":2020,"lang":"en","type":"article","venue":"International Journal of Reconfigurable and Embedded Systems (IJRES)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"CMC Microsystems","keywords":"Multiplier (economics); Algorithm; Computer science; Operand; Field-programmable gate array; 8-bit; Arithmetic; 32-bit; 16-bit; Bit field; Parallel computing; Computer hardware; Mathematics; Engineering","score_opus":0.03197335431487476,"score_gpt":0.28691577059547807,"score_spread":0.2549424162806033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109251207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09175819,0.0003147676,0.90417796,0.00097008364,0.001748681,0.0006751488,0.00024429086,0.000014600898,0.000096269876],"genre_scores_gemma":[0.97617173,0.000047650923,0.023074593,0.00025057863,0.000363027,0.0000514386,0.0000136714225,0.0000133928115,0.000013902573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979681,0.00010066428,0.0008529874,0.0002504936,0.00055117515,0.00027659815],"domain_scores_gemma":[0.9976419,0.0003625598,0.0008506706,0.00015765287,0.0008752316,0.000111980706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012191124,0.00015586863,0.00029508414,0.00025173294,0.00024126987,0.00021529138,0.0006836206,0.000058799702,0.000008247689],"category_scores_gemma":[0.00009913721,0.00011917873,0.00031329194,0.00026869192,0.00003875192,0.00019666641,0.00005464294,0.00013853436,5.4983e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000945144,0.0012320268,0.0024614688,0.0007524054,0.002901788,0.000025744192,0.051129512,0.066319965,0.012355901,0.09532448,0.008984095,0.75756747],"study_design_scores_gemma":[0.0030714667,0.0004014589,0.00027251604,0.00017120873,0.0000404506,0.000039125633,0.0060346993,0.974464,0.002907448,0.00055124983,0.011884191,0.00016217986],"about_ca_topic_score_codex":0.00004151412,"about_ca_topic_score_gemma":0.00001842227,"teacher_disagreement_score":0.90814406,"about_ca_system_score_codex":0.00003728943,"about_ca_system_score_gemma":0.000113642775,"threshold_uncertainty_score":0.48599675},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05453471449101069,"score_gpt":0.31646912885574574,"score_spread":0.2619344143647351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110871108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44535607,0.0000632641,0.55382323,0.00041162458,0.00017215859,0.000075619326,0.000011686569,0.000013416602,0.000072950446],"genre_scores_gemma":[0.8214166,0.00003052038,0.1782279,0.0002522157,0.000057045756,0.0000034868272,0.0000027706617,0.0000044211793,0.0000050026933],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847525,0.000054526878,0.0006752287,0.00022215844,0.00036369343,0.00020914919],"domain_scores_gemma":[0.9984766,0.00013993253,0.0006328009,0.0001716735,0.00045092148,0.00012807146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036893273,0.00014531036,0.00050323585,0.0005811341,0.00008842882,0.000111704416,0.00080857106,0.000042428775,0.000048858325],"category_scores_gemma":[0.00001715171,0.0001214927,0.0005265252,0.001262314,0.00009234073,0.00043280804,0.00006943972,0.00020571356,0.0000011236693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012612971,0.0020058404,0.12570493,0.0008998846,0.032532964,0.000054529042,0.5334559,0.010762057,0.11132584,0.09091607,0.024867158,0.06621354],"study_design_scores_gemma":[0.0008581022,0.00076961255,0.005535022,0.00006274612,0.00045318613,0.000022127639,0.0006102279,0.8921779,0.09677922,0.0010531928,0.0014369304,0.00024178042],"about_ca_topic_score_codex":0.00003027126,"about_ca_topic_score_gemma":0.0000039458173,"teacher_disagreement_score":0.8814158,"about_ca_system_score_codex":0.000013984173,"about_ca_system_score_gemma":0.000044500623,"threshold_uncertainty_score":0.49543285},"labels":[],"label_agreement":null},{"id":"W3114532883","doi":"10.1109/tetc.2020.3045802","title":"Chaotic Clock Driven Cryptographic Chip: Towards a DPA Resistant AES Processor","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cryptography; Computer science; Side channel attack; Power analysis; Encryption; Chaotic; Advanced Encryption Standard; Cipher; Field-programmable gate array; Embedded system; Computer security; Artificial intelligence","score_opus":0.03449170158862826,"score_gpt":0.2925539634275542,"score_spread":0.25806226183892594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114532883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15973032,0.000060056474,0.8333521,0.0055476874,0.00053404283,0.0002577667,0.0000055699693,0.00027868545,0.00023376755],"genre_scores_gemma":[0.9611299,0.000042375428,0.037932616,0.0007254797,0.00012463283,0.000018207433,0.0000017044957,0.000017222243,0.0000078457815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978609,0.0001058405,0.000547939,0.0006117644,0.00040548938,0.00046806695],"domain_scores_gemma":[0.9991715,0.00008900417,0.00012660072,0.00037812095,0.00008767319,0.0001471267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026358332,0.00024155741,0.000273778,0.00040667175,0.00046144178,0.00017443504,0.000719673,0.0000778894,0.000027775939],"category_scores_gemma":[0.000015803633,0.00025821806,0.00016928968,0.0019374454,0.000058872676,0.0002460418,0.000017360713,0.00051329803,0.000006357856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015354273,0.0014321813,0.0028157032,0.000824938,0.00033477074,0.00019027705,0.08472534,0.20031762,0.0026034026,0.12262337,0.00036594822,0.5836129],"study_design_scores_gemma":[0.0014150972,0.00039252554,0.003497853,0.00020552991,0.000031442003,0.000011943835,0.0009204504,0.9837109,0.0019505295,0.0034404933,0.0037236565,0.00069959846],"about_ca_topic_score_codex":0.00010593004,"about_ca_topic_score_gemma":0.00020272433,"teacher_disagreement_score":0.8013996,"about_ca_system_score_codex":0.00005167791,"about_ca_system_score_gemma":0.000092348244,"threshold_uncertainty_score":0.999987},"labels":[],"label_agreement":null},{"id":"W3117927252","doi":"10.1109/host45689.2020.9300292","title":"Application-Specific Instruction Set Architecture for an Ultralight Hardware Security Module","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Embedded system; Cryptography; Hardware security module; Flexibility (engineering); Authentication (law); Instruction set; Datapath; Computer hardware; Computer security","score_opus":0.032499190276721476,"score_gpt":0.2816791596418214,"score_spread":0.2491799693650999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117927252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039910816,0.000025093557,0.9545435,0.00434038,0.000101335216,0.0005053042,0.00007493354,0.00025585602,0.00024278092],"genre_scores_gemma":[0.90989256,0.0000107817295,0.08872849,0.0009237434,0.00016458928,0.00010917721,0.00015867605,0.000007703656,0.0000042714955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897504,0.00003113806,0.0001969909,0.00044423237,0.00016224394,0.00019038263],"domain_scores_gemma":[0.99929774,0.000027076983,0.000057343597,0.00037569655,0.00009268784,0.0001494787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009082328,0.00011487694,0.00010892091,0.00006219053,0.00021858732,0.00016112211,0.00048472936,0.000044888046,0.000037909816],"category_scores_gemma":[0.000005784006,0.000105169645,0.000076392345,0.0004586866,0.000027203923,0.00039369112,0.0000539511,0.000093209695,0.000009117999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022078,0.00009232607,0.001062627,0.000047592526,0.000023460105,6.288691e-7,0.010643853,0.00026469087,0.0032791072,0.8590368,0.013679843,0.11184699],"study_design_scores_gemma":[0.0016392345,0.0004284716,0.0031233032,0.0000039269917,0.000010396057,0.000019733323,0.00084779045,0.13090028,0.010894308,0.12377814,0.7277956,0.0005588029],"about_ca_topic_score_codex":0.00003587415,"about_ca_topic_score_gemma":0.000094317256,"teacher_disagreement_score":0.86998177,"about_ca_system_score_codex":0.000013062463,"about_ca_system_score_gemma":0.000019826028,"threshold_uncertainty_score":0.42886937},"labels":[],"label_agreement":null},{"id":"W3122568127","doi":"","title":"Multidimensional Meet-in-the-Middle Attack and Its Applications to KATAN32/48/64","year":2011,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; Computer science; Key (lock); Key schedule; Block size; Cipher; Computer security; Block (permutation group theory); Boomerang attack; Theoretical computer science; Cryptography; Linear cryptanalysis; Differential cryptanalysis; Mathematics; Encryption","score_opus":0.0884500202643863,"score_gpt":0.31166254347288747,"score_spread":0.22321252320850116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122568127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26901728,0.00006437562,0.7265643,0.0013509872,0.00008674285,0.0006032449,0.00001616981,0.000044643115,0.0022522903],"genre_scores_gemma":[0.59047115,0.000019930376,0.4083838,0.0007913255,0.000022530125,0.00029717767,0.0000074318277,0.0000056266554,0.000001030107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986002,0.00015831941,0.0002795517,0.00046897505,0.00015481883,0.00033814824],"domain_scores_gemma":[0.9989788,0.00030252847,0.00006492197,0.00048526312,0.000051652893,0.00011683644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003243801,0.00014254032,0.00015962012,0.00022108735,0.00021928559,0.00002750517,0.0006429406,0.00004291674,0.00006363214],"category_scores_gemma":[0.00003405233,0.00011989488,0.000051869767,0.0003648252,0.000112361115,0.00013176091,0.0004626977,0.00016743876,0.0001601156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094953275,0.00011850183,0.002933017,0.000005615451,0.000012416924,0.000013284633,0.013521268,0.0000057230604,0.00036382713,0.9802913,0.00035739652,0.0023681244],"study_design_scores_gemma":[0.001011705,0.00017983267,0.13507389,0.000020768946,0.000019326708,0.00017399577,0.0018563429,0.0055126646,0.00097400503,0.82565784,0.029029235,0.0004904032],"about_ca_topic_score_codex":0.000050810308,"about_ca_topic_score_gemma":0.00059454143,"teacher_disagreement_score":0.3214539,"about_ca_system_score_codex":0.000011610185,"about_ca_system_score_gemma":0.000038514143,"threshold_uncertainty_score":0.48891714},"labels":[],"label_agreement":null},{"id":"W3127331669","doi":"","title":"A Software Radio Based Ionosonde Using GNU Radio","year":2011,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ionosonde; Software-defined radio; Software; Computer science; Telecommunications; Operating system; Physics","score_opus":0.17357974672520093,"score_gpt":0.3223779429661152,"score_spread":0.14879819624091428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127331669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6440935,0.000040807783,0.35501266,0.00004784157,0.00025722387,0.00020038158,0.00001636327,0.00027554884,0.00005568475],"genre_scores_gemma":[0.9768884,0.000012007781,0.022461055,0.00033958774,0.000052880143,0.0000015302113,0.000015579883,0.000030906507,0.00019804259],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99752873,0.0002987872,0.00031670227,0.00077211665,0.0004441398,0.0006395006],"domain_scores_gemma":[0.99811584,0.000090677786,0.00022462982,0.0010334131,0.00018401942,0.0003514417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004042742,0.00034621244,0.0003158403,0.0008957221,0.0005321796,0.0003751185,0.0018192091,0.00016725039,0.00008211096],"category_scores_gemma":[0.000027380831,0.00040191362,0.00023816919,0.0013041564,0.0001321634,0.0029039802,0.0004827244,0.0004297187,0.000066463486],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037724927,0.00016638185,0.99454916,0.000028397852,0.000056132783,0.00032217443,0.0013824833,0.0000232617,0.00033001995,0.0019488139,0.0000012879939,0.0011541742],"study_design_scores_gemma":[0.002242786,0.00025206164,0.990052,0.00011633372,0.00009997724,0.00009950739,0.00025782362,0.00009433945,0.003199018,0.0011254683,0.0015973609,0.000863313],"about_ca_topic_score_codex":0.000030688803,"about_ca_topic_score_gemma":0.00063687575,"teacher_disagreement_score":0.3327949,"about_ca_system_score_codex":0.00021515603,"about_ca_system_score_gemma":0.00024069655,"threshold_uncertainty_score":0.9998433},"labels":[],"label_agreement":null},{"id":"W3158904099","doi":"10.1109/access.2021.3077977","title":"Metis: An Integrated Morphing Engine CPU to Protect Against Side Channel Attacks","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Metis; Side channel attack; Morphing; Channel (broadcasting); Embedded system; Computer hardware; Operating system; Computer network; Computer security; Computer graphics (images); Database; Cryptography","score_opus":0.05271762586385733,"score_gpt":0.3468250016893239,"score_spread":0.2941073758254666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158904099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39129695,0.00003702963,0.6067436,0.0009167114,0.00042136776,0.00025574796,0.000013554458,0.00015215993,0.00016288014],"genre_scores_gemma":[0.9771992,0.000014982053,0.02100679,0.001482338,0.000112716574,0.00011578868,0.000030261206,0.00001355137,0.00002437262],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99851847,0.00010634023,0.00026746123,0.00049657194,0.00026816098,0.00034299903],"domain_scores_gemma":[0.9988281,0.00004483688,0.00006397281,0.0006338579,0.00025379704,0.00017543706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000303408,0.00016310034,0.00018071817,0.00023164632,0.0002038027,0.0007807698,0.001076698,0.000048409212,0.00003348887],"category_scores_gemma":[0.00005630641,0.0001559979,0.00006704908,0.0016700833,0.00001675738,0.0012123036,0.00027314492,0.00018305714,0.000015523756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043776578,0.0010317975,0.0016152178,0.00016077634,0.00030006035,0.0010443587,0.020280626,0.020008935,0.07044832,0.0097657535,0.0078078867,0.8674925],"study_design_scores_gemma":[0.0029552507,0.0005888056,0.01936345,0.00037277525,0.000051962194,0.00015729853,0.0026911746,0.3025493,0.60829383,0.011732454,0.048630174,0.0026134795],"about_ca_topic_score_codex":0.0003363338,"about_ca_topic_score_gemma":0.00075768743,"teacher_disagreement_score":0.864879,"about_ca_system_score_codex":0.000038626094,"about_ca_system_score_gemma":0.0001070674,"threshold_uncertainty_score":0.75289816},"labels":[],"label_agreement":null},{"id":"W3158975875","doi":"10.1109/iscas51556.2021.9401197","title":"Acceleration of the Secure Hash Algorithm-256 (SHA-256) on an FPGA-CPU Cluster Using OpenCL","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure","funders":"CMC Microsystems","keywords":"Computer science; Field-programmable gate array; Hash function; Cryptographic hash function; Implementation; Secure Hash Algorithm; Parallel computing; Throughput; Cryptography; Ranging; Embedded system; SHA-2; Algorithm; Operating system; Wireless; Programming language","score_opus":0.047086394465090775,"score_gpt":0.3250296744506166,"score_spread":0.2779432799855258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158975875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29989552,0.000021738646,0.69625366,0.0015595392,0.00046507182,0.00025805438,0.000014418235,0.0000423816,0.0014895872],"genre_scores_gemma":[0.88972723,0.000006978279,0.10841664,0.0016302349,0.00007249234,0.000006631171,0.000016452845,0.0000074886902,0.0001158294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998747,0.00014899203,0.00026898462,0.00031781712,0.00033382553,0.00018337579],"domain_scores_gemma":[0.99895924,0.000042750195,0.00009414677,0.00065712316,0.00019486164,0.000051898176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025927063,0.00010954772,0.00012036619,0.00006885835,0.00028362777,0.00029151436,0.00055742025,0.000048813912,0.00025402775],"category_scores_gemma":[0.000013540214,0.00007977186,0.00008716536,0.00065000704,0.000034965415,0.0006048177,0.0003249532,0.00011724393,0.000003920335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022137245,0.0015502099,0.0048335637,0.00007337954,0.0001576878,0.000031990527,0.017219167,0.0028715732,0.02289465,0.570477,0.008092086,0.37177655],"study_design_scores_gemma":[0.0014479669,0.00022091386,0.014233318,0.00005979515,0.000031648673,0.000053728087,0.0014091148,0.8820565,0.080275506,0.013391166,0.0063539166,0.000466444],"about_ca_topic_score_codex":0.00019913737,"about_ca_topic_score_gemma":0.0005895951,"teacher_disagreement_score":0.8791849,"about_ca_system_score_codex":0.000026172122,"about_ca_system_score_gemma":0.00014939974,"threshold_uncertainty_score":0.32530022},"labels":[],"label_agreement":null},{"id":"W3159054868","doi":"10.1109/access.2021.3077843","title":"Energy Efficiency Analysis of Post-Quantum Cryptographic Algorithms","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; NIST; Cryptography; Energy consumption; Quantum computer; Standardization; Computer engineering; Efficient energy use; Algorithm; Theoretical computer science; Quantum; Operating system; Electrical engineering","score_opus":0.025770521745709676,"score_gpt":0.31697778072798194,"score_spread":0.2912072589822723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159054868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31604794,0.00022596473,0.68278575,0.00021481779,0.00035134805,0.000033929624,0.000025593856,0.000049454156,0.0002652232],"genre_scores_gemma":[0.99546534,0.00011795984,0.0039276103,0.0004022593,0.000027734864,0.000012212865,0.00003127954,0.0000056869353,0.000009890816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983721,0.00009359091,0.00039882064,0.0004403263,0.00041153602,0.00028366823],"domain_scores_gemma":[0.99838144,0.00011965234,0.00016158426,0.0007549312,0.0004942382,0.000088154615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020915327,0.00013313541,0.00029865437,0.0009366387,0.00014504645,0.0002558786,0.0011647105,0.000051219362,0.00014570728],"category_scores_gemma":[0.000018237244,0.00012894199,0.00033223824,0.008567701,0.00007071594,0.00055538653,0.00024362223,0.00007465002,0.0000014883834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014488975,0.001516787,0.03797678,0.00006403645,0.002617813,0.00018624346,0.002609612,0.0021502774,0.018567484,0.8312292,0.0009675421,0.102099754],"study_design_scores_gemma":[0.0013290413,0.00026141742,0.20500152,0.00003447542,0.0011269401,0.000030527346,0.00045500425,0.69397664,0.06071121,0.031069936,0.0049191606,0.0010841229],"about_ca_topic_score_codex":0.0007623084,"about_ca_topic_score_gemma":0.0006033224,"teacher_disagreement_score":0.8001592,"about_ca_system_score_codex":0.000010608952,"about_ca_system_score_gemma":0.00011051934,"threshold_uncertainty_score":0.5258102},"labels":[],"label_agreement":null},{"id":"W3160058940","doi":"10.22215/etd/2019-13732","title":"Onboarding and Software Update Architecture for IoT Devices","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Key (lock); Cryptography; Computer security; Public-key cryptography; Software; Authentication (law); Onboarding; Architecture; Exploit; Embedded system; Operating system; Encryption","score_opus":0.012562470495730943,"score_gpt":0.28911360314201506,"score_spread":0.2765511326462841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160058940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07738871,0.0005431558,0.91915387,0.00036036724,0.0008326629,0.00073927257,0.00005078415,0.00016555222,0.00076563953],"genre_scores_gemma":[0.107533835,0.000091617505,0.88731265,0.001006968,0.00012789608,0.00015275695,0.0015175085,0.000041877316,0.0022148713],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903274,0.00001511302,0.00018941457,0.00040642428,0.00015244713,0.00020385279],"domain_scores_gemma":[0.99934894,0.000121254125,0.00011014903,0.0002834941,0.00008812765,0.00004801314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012112814,0.0001759329,0.00019827597,0.00020275445,0.0001705985,0.00027235583,0.00036623474,0.000107858425,0.000027636646],"category_scores_gemma":[0.00001659879,0.0001516308,0.00009571643,0.00016985297,0.000008767626,0.000100530255,0.000054555403,0.00012404757,0.000005058592],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002591267,0.000032735017,0.0009359281,0.0008313899,0.00012804955,0.0000015691297,0.005019408,0.000019298963,0.00013518453,0.24889623,0.0021383783,0.7418359],"study_design_scores_gemma":[0.0057698055,0.000985346,0.056531996,0.00092680694,0.00051019783,0.000058504545,0.012157477,0.026039459,0.004361946,0.3094689,0.5778812,0.005308348],"about_ca_topic_score_codex":0.000053828655,"about_ca_topic_score_gemma":0.0016075729,"teacher_disagreement_score":0.73652756,"about_ca_system_score_codex":0.000008629024,"about_ca_system_score_gemma":0.000074503565,"threshold_uncertainty_score":0.61833245},"labels":[],"label_agreement":null},{"id":"W3160438197","doi":"","title":"Improved Fault Analysis on SIMECK Ciphers.","year":2020,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Computer science; Correctness; Block cipher; Block (permutation group theory); Computer security; Internet of Things; Key (lock); Cryptography; Embedded system; Algorithm","score_opus":0.02710703697913363,"score_gpt":0.30444328724430497,"score_spread":0.27733625026517134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160438197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03622897,0.00004212318,0.9519949,0.0061925557,0.000740966,0.0006819821,0.00017406314,0.00038298182,0.0035614523],"genre_scores_gemma":[0.5383807,0.00006698218,0.45936167,0.0015488206,0.00013941815,0.00019365706,0.00028134472,0.000026052707,0.0000014005072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572587,0.00046905837,0.00079469755,0.001902533,0.0004025602,0.00070527015],"domain_scores_gemma":[0.9964919,0.00048078803,0.0005144074,0.0020486312,0.00013287108,0.0003313827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034101805,0.00059435953,0.0010197198,0.00092880655,0.00026149568,0.0002591985,0.0024842895,0.00032606907,0.00023607409],"category_scores_gemma":[0.00013216991,0.00059683167,0.0009933815,0.0011448852,0.00026482303,0.000105587285,0.003948324,0.0016280359,0.00014245829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004605979,0.00016652321,0.0019878757,0.00003961569,0.0019086865,0.00007655154,0.0047097146,0.001615457,0.00041138858,0.9823181,0.00082306954,0.005896936],"study_design_scores_gemma":[0.00058962416,0.0002276539,0.014925113,0.00001977348,0.00045646014,0.0000072854095,0.00023778214,0.16207266,0.00040657524,0.8178205,0.0024970935,0.0007394653],"about_ca_topic_score_codex":0.0002586859,"about_ca_topic_score_gemma":0.0005680605,"teacher_disagreement_score":0.50215167,"about_ca_system_score_codex":0.00007799136,"about_ca_system_score_gemma":0.00024718035,"threshold_uncertainty_score":0.99964833},"labels":[],"label_agreement":null},{"id":"W3163808675","doi":"10.1049/cdt2.12031","title":"Strengthened 32‐bit AES implementation: Architectural error correction configuration with a new voting scheme","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"South Health Campus","funders":"","keywords":"Computer science; Advanced Encryption Standard; Byte; Pipeline (software); Reliability (semiconductor); Fault tolerance; Resilience (materials science); Encryption; Error detection and correction; Embedded system; Computer engineering; Distributed computing; Computer network; Computer hardware; Algorithm; Operating system","score_opus":0.01565170674294585,"score_gpt":0.28350205492381436,"score_spread":0.2678503481808685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163808675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10607149,0.000029091936,0.89043504,0.001249844,0.00025713397,0.00033460825,0.000014050111,0.0008528769,0.00075587124],"genre_scores_gemma":[0.8308999,0.0000035919682,0.16841556,0.00029593913,0.000100201345,0.00003038298,0.0001878637,0.000014211815,0.00005237389],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99836516,0.0000428556,0.000390359,0.0005165242,0.00035577355,0.00032935306],"domain_scores_gemma":[0.9990156,0.000098260425,0.00018867361,0.00035816693,0.0002155568,0.00012373256],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00010372685,0.00024111458,0.0002065624,0.00018594408,0.00023082382,0.0012206378,0.00036599592,0.000050366034,0.000032984084],"category_scores_gemma":[0.000014035649,0.00022695323,0.00010648001,0.0007198781,0.00005483062,0.0013385345,0.00018785532,0.00016450936,0.000004253861],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025957315,0.0001291605,0.003792676,0.000021928867,0.00010051656,0.00005714029,0.0021176485,0.000038156675,0.0022517743,0.036113907,0.0072150403,0.9481361],"study_design_scores_gemma":[0.0071886126,0.005074011,0.0410713,0.0010411047,0.00014648054,0.0040564626,0.0063484726,0.12559399,0.6718397,0.03257246,0.099719316,0.005348069],"about_ca_topic_score_codex":0.00011835842,"about_ca_topic_score_gemma":0.0002775716,"teacher_disagreement_score":0.942788,"about_ca_system_score_codex":0.00006282271,"about_ca_system_score_gemma":0.00020146869,"threshold_uncertainty_score":0.9998162},"labels":[],"label_agreement":null},{"id":"W3172830517","doi":"10.46586/tosc.v2021.i2.389-422","title":"Algorithm Substitution Attacks: State Reset Detection and Asymmetric Modifications","year":2021,"lang":"en","type":"article","venue":"IACR Transactions on Symmetric Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stateful firewall; Computer science; Substitution (logic); Semantic security; Scheme (mathematics); Symmetric-key algorithm; Cryptography; State (computer science); Computer security; Adversary; Encryption; Simple (philosophy); Theoretical computer science; Cryptographic protocol; Reset (finance); Algorithm; Public-key cryptography; Mathematics; Programming language; Philosophy; Attribute-based encryption","score_opus":0.02404941094490313,"score_gpt":0.285916197675827,"score_spread":0.26186678673092384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172830517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012823944,0.0005267157,0.9839904,0.00094536063,0.00069694297,0.00025013275,0.00008245033,0.00021378935,0.00047030463],"genre_scores_gemma":[0.8701263,0.0008930851,0.12856413,0.00020466927,0.00002945723,0.00010939103,0.00002365778,0.000014493561,0.000034806017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977339,0.00026234577,0.00047539832,0.0007393861,0.00035144153,0.0004375165],"domain_scores_gemma":[0.99819374,0.0004729911,0.00012673854,0.0006748102,0.00035212637,0.00017959705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003560439,0.00022460958,0.00027226447,0.001998079,0.0007245706,0.0002128935,0.00029664976,0.00014634948,0.0000522114],"category_scores_gemma":[0.0000812665,0.00024495262,0.00013595285,0.007659176,0.00013715269,0.0004944963,0.000021777503,0.0003816517,0.000048320788],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009549132,0.00035430412,0.0000803766,0.0000123298905,0.0000793009,0.000029644907,0.0002713425,0.00022327164,0.00045585955,0.08630538,0.000045258927,0.9121334],"study_design_scores_gemma":[0.010428188,0.0021818758,0.08022983,0.00007767061,0.00049063965,0.0035216096,0.0019434901,0.4236964,0.076281376,0.27965537,0.118066005,0.0034275488],"about_ca_topic_score_codex":0.000114538685,"about_ca_topic_score_gemma":0.00024304948,"teacher_disagreement_score":0.90870583,"about_ca_system_score_codex":0.00011690046,"about_ca_system_score_gemma":0.00013248308,"threshold_uncertainty_score":0.99888784},"labels":[],"label_agreement":null},{"id":"W3197640590","doi":"10.1007/978-3-030-85987-9_12","title":"(Short Paper) Analysis of a Strong Fault Attack on Static/Ephemeral CSIDH","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Binary number; Logarithm; Upper and lower bounds; Discrete logarithm; Theoretical computer science; Countermeasure; Function (biology); Discrete mathematics; Algorithm; Public-key cryptography; Mathematics; Arithmetic; Computer security; Encryption","score_opus":0.037852699792482535,"score_gpt":0.3191274654758222,"score_spread":0.2812747656833397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197640590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034589833,0.00013703118,0.9935486,0.00042230237,0.0005391536,0.00025862892,0.000046740257,0.000052490956,0.0015360804],"genre_scores_gemma":[0.7697778,0.0000704075,0.22858122,0.0012588568,0.00012592562,0.000010797998,0.00007114405,0.000022999626,0.00008088413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958806,0.000054221644,0.00077291386,0.0013838913,0.0013406469,0.00056771346],"domain_scores_gemma":[0.9971205,0.0004950454,0.00027427808,0.001564688,0.00039362645,0.00015184609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062006054,0.00045142858,0.00080728746,0.0017903221,0.00020755424,0.0003746646,0.0020435762,0.00017615223,0.0001368908],"category_scores_gemma":[0.000049323182,0.00042138484,0.00039631117,0.0026993982,0.00047072925,0.00042447477,0.00081298506,0.00055375247,0.000004101275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010713449,0.00020027309,0.00084026734,0.000060619026,0.0005580748,0.00013271827,0.0026901895,0.16097191,0.00014845876,0.1961689,0.00008029216,0.6381376],"study_design_scores_gemma":[0.00042107352,0.000504467,0.0039663767,0.00028439224,0.0002882105,0.000014199195,0.000004213424,0.96819353,0.0007544578,0.022137746,0.002314907,0.0011163983],"about_ca_topic_score_codex":0.000065627115,"about_ca_topic_score_gemma":0.00075270166,"teacher_disagreement_score":0.80722165,"about_ca_system_score_codex":0.00015576271,"about_ca_system_score_gemma":0.0003680762,"threshold_uncertainty_score":0.9998238},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012317765967567286,"score_gpt":0.24277997715522454,"score_spread":0.23046221118765725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197657782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6162161,0.0010075772,0.38195884,0.00031345175,0.00040701297,0.00005705065,0.0000023843602,0.000020765356,0.00001680282],"genre_scores_gemma":[0.97778517,0.0007077971,0.02138244,0.000018290508,0.000085054606,0.0000035360933,0.0000011990932,0.000013027435,0.000003479338],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99832094,0.000054664775,0.00061414536,0.00015197531,0.0005905125,0.000267738],"domain_scores_gemma":[0.9983726,0.00019434614,0.00039620607,0.00038060313,0.00054449256,0.00011174738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005910181,0.0001495952,0.00024488478,0.0003770537,0.00016188786,0.00016571942,0.00049092394,0.000045812318,0.000009742432],"category_scores_gemma":[0.000070848866,0.00010519231,0.00022681526,0.001458753,0.000044450462,0.00047774776,0.00006845484,0.00027736265,4.1380312e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047020026,0.0010722526,0.017923025,0.00059459644,0.0018521469,0.00060066784,0.0037982021,0.020807514,0.51309013,0.42041886,0.0008981369,0.018474262],"study_design_scores_gemma":[0.014360359,0.0047968216,0.34606192,0.002577978,0.0006404136,0.003651736,0.0077504907,0.25129244,0.280113,0.020756798,0.06505207,0.0029459635],"about_ca_topic_score_codex":0.000010897283,"about_ca_topic_score_gemma":0.000038019476,"teacher_disagreement_score":0.39966205,"about_ca_system_score_codex":0.000021864103,"about_ca_system_score_gemma":0.00012821218,"threshold_uncertainty_score":0.42896178},"labels":[],"label_agreement":null},{"id":"W3202691802","doi":"10.5281/zenodo.5718027","title":"Fault-enabled chosen-ciphertext attacks on Kyber","year":2021,"lang":"en","type":"paratext","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"Bundesministerium für Bildung und Forschung; European Commission","keywords":"Computer science; Ciphertext; Computer security; Semantic security; Encryption; Public-key cryptography; Attribute-based encryption","score_opus":0.04244730969702028,"score_gpt":0.29000394137295904,"score_spread":0.24755663167593878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202691802","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010368429,0.0005672935,0.075463235,0.0022886642,0.0017430433,0.0010226979,0.0008141657,0.0009854333,0.9160786],"genre_scores_gemma":[0.25838643,0.009214466,0.017579371,0.011274692,0.005891864,0.0000031416018,0.10779957,0.019409012,0.5704414],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962097,0.00064636825,0.00049507595,0.0011261379,0.00082225574,0.00070048025],"domain_scores_gemma":[0.99691814,0.00006159355,0.00025427644,0.0015089696,0.0009724598,0.00028458398],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00065462955,0.00037768745,0.00037970234,0.0005276224,0.0029845072,0.0033629711,0.003026786,0.00022255928,0.08955352],"category_scores_gemma":[0.00021979392,0.000399203,0.00019136688,0.0015970722,0.00013343872,0.00041055176,0.0026869038,0.000814116,0.06910602],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012950069,0.00019542704,1.5007895e-7,0.00007089765,0.00008456043,0.00002974428,0.0009207778,0.0000769218,0.00017922469,0.01370504,0.91880786,0.06591645],"study_design_scores_gemma":[0.00059793144,0.0002354889,0.000043948985,0.00008879503,0.000014865653,0.00007213889,0.0001847479,0.000812704,0.00017909196,0.00018376844,0.99716336,0.00042315247],"about_ca_topic_score_codex":0.00003711262,"about_ca_topic_score_gemma":0.000001539358,"teacher_disagreement_score":0.34563717,"about_ca_system_score_codex":0.00023451539,"about_ca_system_score_gemma":0.000023801078,"threshold_uncertainty_score":0.999846},"labels":[],"label_agreement":null},{"id":"W3203177029","doi":"10.5753/sbseg.2021.17313","title":"Towards constant-time probabilistic root finding for code-based cryptography","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Probabilistic logic; Computer science; Cryptography; McEliece cryptosystem; Cryptosystem; Timing attack; Algorithm; Probabilistic analysis of algorithms; Deterministic algorithm; Code (set theory); Theoretical computer science; Root (linguistics); Side channel attack; Artificial intelligence","score_opus":0.031475309683963934,"score_gpt":0.297102111994265,"score_spread":0.26562680231030106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203177029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010301135,0.000054386728,0.9813968,0.0019614827,0.00019148519,0.0003899735,0.00006874442,0.00019968161,0.005436332],"genre_scores_gemma":[0.53334767,0.000001833421,0.46556664,0.00080592337,0.000033248667,0.00012135994,0.00006489394,0.000011025976,0.00004738815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986305,0.000054457374,0.00029179404,0.00043902855,0.00023651784,0.00034765698],"domain_scores_gemma":[0.9988146,0.00026172522,0.00006637635,0.0004616771,0.00029219108,0.00010342641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003130487,0.00014178213,0.00018253607,0.00017181392,0.000260786,0.00030067677,0.00037756763,0.000047364785,0.0003667097],"category_scores_gemma":[0.00009343426,0.00013387461,0.00020051193,0.0009530301,0.000069083835,0.00019069616,0.00007431609,0.00006795471,0.0000114150025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060899665,0.000131947,0.0006759729,0.000036903733,0.000027846929,0.000008583735,0.00019248335,0.000046257755,0.00097541173,0.987409,0.0031933608,0.0072961743],"study_design_scores_gemma":[0.006258038,0.00064368284,0.0048866645,0.0001060291,0.00011192204,0.00005438975,0.000497934,0.4140348,0.028260412,0.43671143,0.10683471,0.0015999678],"about_ca_topic_score_codex":0.000015349533,"about_ca_topic_score_gemma":0.0001717944,"teacher_disagreement_score":0.55069757,"about_ca_system_score_codex":0.000025408272,"about_ca_system_score_gemma":0.00033069222,"threshold_uncertainty_score":0.54592484},"labels":[],"label_agreement":null},{"id":"W3205608997","doi":"10.1109/fdtc53659.2021.00018","title":"Short Paper: EMFI for Safety-Critical Testing of Automotive Systems","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Automotive industry; Computer science; Process (computing); Functional safety; Fault injection; Reliability engineering; System safety; Automotive electronics; Life-critical system; Safety standards; Embedded system; Engineering; Software","score_opus":0.047929441342083316,"score_gpt":0.32885519934386837,"score_spread":0.28092575800178504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205608997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072010066,0.00010347596,0.9871118,0.00076913304,0.00029579224,0.00016729225,0.000023998158,0.000078155914,0.0042493376],"genre_scores_gemma":[0.8399878,0.0000029679675,0.15979476,0.00011898046,0.000029643816,0.000018764515,0.000006319054,0.000003279807,0.000037481135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991265,0.000040781397,0.00027947352,0.00021922182,0.00015398009,0.00018004297],"domain_scores_gemma":[0.9984031,0.0007386865,0.000021563203,0.00025148317,0.00053402234,0.000051191215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002680231,0.00006420218,0.00013512907,0.000043915225,0.00011625807,0.00007862519,0.00019246234,0.000026029433,0.00002490897],"category_scores_gemma":[0.00036361304,0.000058913993,0.000063276355,0.0004190195,0.000035002857,0.00020711662,0.000108135806,0.00004159564,0.0000011628947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015176342,0.00007440312,0.0019900904,0.000060589176,0.000017862392,0.0000063336824,0.00032877922,0.00003231778,0.00090106315,0.9821898,0.00039696327,0.014000311],"study_design_scores_gemma":[0.0023168104,0.0009931643,0.07729659,0.00036114623,0.0001344707,0.00037741847,0.008955291,0.769468,0.029053334,0.06298106,0.046675835,0.0013868953],"about_ca_topic_score_codex":0.000045315363,"about_ca_topic_score_gemma":0.000027768448,"teacher_disagreement_score":0.9192087,"about_ca_system_score_codex":0.0000128294605,"about_ca_system_score_gemma":0.00008122844,"threshold_uncertainty_score":0.2402443},"labels":[],"label_agreement":null},{"id":"W3208713480","doi":"10.1080/23799927.2021.2018115","title":"An adaptive attack on 2-SIDH","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Computer Mathematics Computer Systems Theory","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Ministry of Business, Innovation and Employment","keywords":"Computer science; Computer security","score_opus":0.05048415019322754,"score_gpt":0.33369730225840394,"score_spread":0.2832131520651764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208713480","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034975905,0.00030349125,0.9384029,0.00028650044,0.025321813,0.0003547294,0.00003264412,0.00010580622,0.00021621276],"genre_scores_gemma":[0.4729469,0.000060733124,0.5209717,0.00060028693,0.005299162,0.000016708833,0.000038304755,0.00004916597,0.000017030328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99422103,0.00085636805,0.0020096279,0.0006695781,0.001879532,0.00036388842],"domain_scores_gemma":[0.9926446,0.0007980503,0.002352816,0.001371993,0.0025593576,0.00027316244],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023037049,0.00058357936,0.0010295259,0.0010241247,0.000113193004,0.0026490546,0.0054819584,0.00026997362,0.000024784444],"category_scores_gemma":[0.000022334916,0.00052074494,0.00068657554,0.00024154152,0.00008598406,0.00080800644,0.0018937787,0.0010553264,0.00001620402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007723538,0.001998204,0.000032400567,0.00024524247,0.0023916357,0.0010979364,0.012359713,0.10242527,0.000026760254,0.84044963,0.006202099,0.032693896],"study_design_scores_gemma":[0.0010865403,0.0010685686,0.00020945528,0.002442185,0.00007760691,0.0015277391,0.00039674656,0.94761354,0.000077339035,0.04333141,0.0014455742,0.0007232849],"about_ca_topic_score_codex":0.00001055038,"about_ca_topic_score_gemma":0.0000028574466,"teacher_disagreement_score":0.84518826,"about_ca_system_score_codex":0.00024957655,"about_ca_system_score_gemma":0.0004288315,"threshold_uncertainty_score":0.99989885},"labels":[],"label_agreement":null},{"id":"W3209311178","doi":"10.1109/msec.2021.3107078","title":"The Advanced Encryption Standard: 20 Years Later","year":2021,"lang":"en","type":"article","venue":"IEEE Security & Privacy","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Advanced Encryption Standard; Encryption; Standardization; Computer science; Cryptography; Column (typography); Computer security; Operating system; Computer network","score_opus":0.011822298157738557,"score_gpt":0.27925681055443147,"score_spread":0.2674345123966929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209311178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9178968,0.0006578987,0.07402872,0.0046098116,0.0014707885,0.00026561008,0.000031405478,0.00019389635,0.00084503525],"genre_scores_gemma":[0.99146056,0.0003895948,0.0075421715,0.00039241745,0.00009445848,0.000022238755,0.000014861492,0.000009467638,0.00007420927],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984471,0.00012675545,0.0002762996,0.00037533927,0.00041036113,0.0003641334],"domain_scores_gemma":[0.9986541,0.00012297899,0.000080853686,0.00086307264,0.0001876596,0.000091317095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003754016,0.00012949071,0.00013315072,0.000054717162,0.00040644014,0.00043340406,0.000725822,0.000051211235,0.000067022826],"category_scores_gemma":[0.000053921358,0.00011061489,0.000120810946,0.0005338902,0.00006648151,0.00050138857,0.00026902833,0.00021007186,0.000044394026],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097391065,0.0004094051,0.0034015435,0.00005130843,0.00024999026,0.00031360562,0.03526886,0.0000612239,0.015998153,0.41050923,0.034652974,0.4989863],"study_design_scores_gemma":[0.0013452232,0.000119862496,0.008178853,0.000022376324,0.000018590901,0.000047403508,0.00042557274,0.0016409047,0.025683746,0.19414158,0.76794004,0.0004358507],"about_ca_topic_score_codex":0.000015601878,"about_ca_topic_score_gemma":0.00019525153,"teacher_disagreement_score":0.73328704,"about_ca_system_score_codex":0.00004759351,"about_ca_system_score_gemma":0.00014174427,"threshold_uncertainty_score":0.45107445},"labels":[],"label_agreement":null},{"id":"W3210870794","doi":"","title":"Implementation of a Leakage-Resilient ElGamal Key Encapsulation Mechanism","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Leakage (economics); Computer science; Exponentiation; Cryptography; Bounded function; Theoretical computer science; Key encapsulation; Distributed computing; Mathematics; Computer security; Public-key cryptography; Encryption","score_opus":0.014960937843101872,"score_gpt":0.3025323465778388,"score_spread":0.2875714087347369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210870794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32575083,0.00002716697,0.671725,0.00056638656,0.00067870534,0.00067907106,0.00006674492,0.000105738254,0.0004003966],"genre_scores_gemma":[0.6536078,0.00004175833,0.34584603,0.00010847049,0.00007203692,0.00014757445,0.00015945379,0.000016447097,4.101089e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619275,0.0005730347,0.001104225,0.001064027,0.0005057291,0.0005602139],"domain_scores_gemma":[0.9970732,0.00028059428,0.0009344249,0.0013363963,0.00022717779,0.00014821572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007739745,0.00043384416,0.0006562147,0.00069361797,0.00019204504,0.00010194033,0.0013676962,0.00025626665,0.00019927364],"category_scores_gemma":[0.000048606995,0.00046123733,0.000371322,0.00026458286,0.00020913874,0.00016857171,0.0025225496,0.00065971585,0.0000370601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014663463,0.000091628244,0.003258402,0.00009458468,0.00012061426,0.0000071304326,0.0059598773,0.0004998981,0.0027335219,0.9763847,0.00016150117,0.010673472],"study_design_scores_gemma":[0.00075737707,0.00018659263,0.039622437,0.0000445309,0.000055685803,0.00001933632,0.00047959667,0.017598646,0.007231789,0.93314576,0.0004473913,0.000410875],"about_ca_topic_score_codex":0.00062491157,"about_ca_topic_score_gemma":0.00087250734,"teacher_disagreement_score":0.327857,"about_ca_system_score_codex":0.00007495498,"about_ca_system_score_gemma":0.00029103263,"threshold_uncertainty_score":0.99978393},"labels":[],"label_agreement":null},{"id":"W3216103369","doi":"10.1007/978-3-319-78262-1_300486","title":"Physical Layer Security","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Layer (electronics); Computer science; Materials science; Composite material","score_opus":0.031236055784473856,"score_gpt":0.27819903400218954,"score_spread":0.24696297821771568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216103369","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034605833,0.000042804408,0.063865595,0.001897134,0.00019946964,0.00017704618,0.000025924997,0.00027546682,0.93348193],"genre_scores_gemma":[0.606206,0.00024154065,0.038255733,0.01194372,0.0027749324,0.000056550485,0.00026007107,0.00016850643,0.34009296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885726,0.000009016162,0.00018360339,0.00046427746,0.0003239004,0.00016193019],"domain_scores_gemma":[0.99920183,0.00004354424,0.00007761265,0.0004912827,0.00005965589,0.00012607909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005160461,0.0002211572,0.00024697016,0.000080877304,0.000083713094,0.00013438595,0.0006465145,0.0000908007,0.0005058059],"category_scores_gemma":[0.0000034072716,0.00019962869,0.00022647042,0.000063052685,0.000042226224,0.00015838453,0.00039193046,0.0003053189,0.0004243082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8809857e-7,0.000013247617,0.0000016077756,0.000008518507,0.000025349364,0.0000140924785,0.00044182915,1.0098687e-7,0.0000069621638,0.98072857,0.014995936,0.003763092],"study_design_scores_gemma":[0.00010457277,0.000048445596,0.000005370664,0.000006307175,0.000011577942,0.000003963492,0.0000055036894,0.002579969,0.00004825553,0.5573635,0.43958947,0.0002330754],"about_ca_topic_score_codex":0.000013746146,"about_ca_topic_score_gemma":0.000033887864,"teacher_disagreement_score":0.60617137,"about_ca_system_score_codex":0.000017542165,"about_ca_system_score_gemma":0.000055132834,"threshold_uncertainty_score":0.8140622},"labels":[],"label_agreement":null},{"id":"W3216877439","doi":"10.1109/arith51176.2021.00034","title":"A Faster Hardware Implementation of the AES S-box","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Exponentiation; Computer science; Transformation matrix; Transformation (genetics); Inverse; Arithmetic; Algorithm; Matrix multiplication; Multiplicative inverse; S-box; Mathematics; Cryptography; Block cipher","score_opus":0.017596621478734194,"score_gpt":0.3012906243440678,"score_spread":0.2836940028653336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216877439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49043623,0.00006289856,0.49945033,0.006052552,0.00038340507,0.00018623116,0.000017456134,0.00004658904,0.003364335],"genre_scores_gemma":[0.98553383,0.0000051812876,0.013793648,0.00050582405,0.000010008442,0.000006494164,0.0000035922203,0.0000016526587,0.00013974303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994485,0.00003924961,0.0001458149,0.00011952181,0.00015581894,0.00009110518],"domain_scores_gemma":[0.999507,0.000019428262,0.000044671808,0.0003140739,0.000098296565,0.000016500795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076419004,0.000040912262,0.000050389328,0.000026528722,0.00007615149,0.000055960445,0.0002479923,0.000010170321,0.0004958412],"category_scores_gemma":[0.0000043018676,0.000027694543,0.00006367764,0.00038687643,0.000016124835,0.00016257129,0.00019534549,0.000028602448,0.0000032231237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.990223e-7,0.00006666281,0.05749802,0.0000190837,0.0000361195,0.0000028604609,0.0053165797,0.0000039687725,0.0061908765,0.8319814,0.0055307425,0.09335289],"study_design_scores_gemma":[0.0015131622,0.00008432991,0.470635,0.000021887172,0.000028030494,0.000039878385,0.014166072,0.0015359399,0.42993817,0.026870007,0.054835685,0.00033185488],"about_ca_topic_score_codex":0.00010307808,"about_ca_topic_score_gemma":0.0008652942,"teacher_disagreement_score":0.8051114,"about_ca_system_score_codex":0.000006057204,"about_ca_system_score_gemma":0.00006327116,"threshold_uncertainty_score":0.5429113},"labels":[],"label_agreement":null},{"id":"W32326993","doi":"10.1007/978-0-387-35597-9_18","title":"Modeling Power Dynamics for an Embedded DSP Processor Core","year":2002,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Very long instruction word; Computer science; Benchmark (surveying); Digital signal processing; Embedded system; Very-large-scale integration; Cryptography; Power (physics); Dynamic demand; Multi-core processor; Power analysis; Computer hardware; Computer architecture; Parallel computing","score_opus":0.025729018278344534,"score_gpt":0.3046915461846237,"score_spread":0.2789625279062792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32326993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003485214,0.0036745046,0.9292491,0.0009860446,0.00012037483,0.0010035462,0.00005360973,0.00040689614,0.06415742],"genre_scores_gemma":[0.60496163,0.044151466,0.34425664,0.0011443092,0.000024239922,0.0011054446,0.0019057938,0.000062552186,0.002387897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880457,0.000009897533,0.0006601676,0.00020051394,0.00014256361,0.00018229827],"domain_scores_gemma":[0.99828154,0.000050306582,0.0003476351,0.000985088,0.00029866106,0.0000367784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022350911,0.00019952792,0.00023679661,0.0008667001,0.00023515744,0.00011812277,0.0010644848,0.00032360203,0.000016534908],"category_scores_gemma":[0.000034002765,0.00021554802,0.00004114856,0.00020871447,0.00013902264,0.002531632,0.00026946797,0.00035600923,0.0000055906708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041820595,0.000010441063,0.000009105834,0.000028524219,0.0000043346895,5.9801444e-8,0.0007187417,0.00024011669,1.813103e-7,0.8304173,0.000017106186,0.16854994],"study_design_scores_gemma":[0.00034978936,0.00008940047,0.0000012032234,0.00005224895,0.0000042236175,0.00000846524,0.00048746003,0.44894966,0.0000022581128,0.4806861,0.06917168,0.00019751281],"about_ca_topic_score_codex":0.000004608924,"about_ca_topic_score_gemma":0.00033926914,"teacher_disagreement_score":0.6046131,"about_ca_system_score_codex":0.00007447607,"about_ca_system_score_gemma":0.000036540758,"threshold_uncertainty_score":0.8789793},"labels":[],"label_agreement":null},{"id":"W33958249","doi":"10.1016/j.ophtha.2021.04.003","title":"Evaluation of Security Level of Cryptography: RSA-OAEP, RSA-PSS, RSA Signature","year":2001,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PKCS #1; Cryptography; Public-key cryptography; Mathematics; Digital signature; Signature (topology); Arithmetic; Computer security; Computer science; Encryption; Hash function; Cryptosystem","score_opus":0.12168231290541362,"score_gpt":0.3494186071660381,"score_spread":0.2277362942606245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33958249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51571834,0.0005623426,0.47798938,0.0005820527,0.0003021258,0.0005597109,0.0001023841,0.00008765108,0.004095977],"genre_scores_gemma":[0.9803421,0.000073457966,0.019361338,0.00012052212,0.000037482772,0.000020333262,0.000021737718,0.000007654811,0.000015404823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705386,0.0002500965,0.00057417207,0.00040146094,0.0014177535,0.0003026429],"domain_scores_gemma":[0.99764603,0.000091118796,0.00028325903,0.0007182165,0.0011683396,0.00009300633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019791964,0.00018840464,0.00028101524,0.0004251866,0.00011139287,0.00003973893,0.0007032984,0.00012075402,0.0005881637],"category_scores_gemma":[0.000075564996,0.0001708629,0.00022462347,0.0017209247,0.00011564476,0.00050476816,0.00016798843,0.00017671961,0.000004691928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048182734,0.0014500422,0.019938124,0.00011239204,0.0003976939,0.000006813766,0.009688679,0.00034240112,0.01157136,0.7700765,0.008015131,0.17835267],"study_design_scores_gemma":[0.006067014,0.00080538704,0.20947911,0.00011618628,0.0004711901,0.000040739815,0.002202568,0.30973646,0.027930439,0.43111134,0.01081798,0.0012216031],"about_ca_topic_score_codex":0.0008254745,"about_ca_topic_score_gemma":0.00093326776,"teacher_disagreement_score":0.4646237,"about_ca_system_score_codex":0.000031923024,"about_ca_system_score_gemma":0.00019577476,"threshold_uncertainty_score":0.6967587},"labels":[],"label_agreement":null},{"id":"W34647140","doi":"10.1007/978-3-642-21969-6_20","title":"Differential Fault Analysis of Sosemanuk","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fault (geology); Differential (mechanical device); Computer science; Geology; Seismology; Engineering; Aerospace engineering","score_opus":0.02377345204130989,"score_gpt":0.268941645781219,"score_spread":0.24516819373990908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34647140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015580561,0.00009654651,0.9955606,0.00009123103,0.0007234419,0.00020003461,0.000020359757,0.000058056845,0.0016916661],"genre_scores_gemma":[0.87241554,0.000051854327,0.1270937,0.00022928456,0.00010008909,0.0000054788957,0.000020206504,0.000014183466,0.000069681446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997025,0.000027315173,0.00062633055,0.0010484707,0.0008307177,0.00044216696],"domain_scores_gemma":[0.9976967,0.00020657959,0.00038064795,0.0013413588,0.00025752455,0.00011721928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036983285,0.00035916222,0.0006733243,0.0026646985,0.00015924475,0.00019587127,0.0026489354,0.00019063574,0.00025082182],"category_scores_gemma":[0.000020746975,0.00032242766,0.00036674386,0.0019279249,0.00059493195,0.000316505,0.0010196406,0.00038305798,0.0000066737966],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007448081,0.00011284511,0.0007566017,0.000041043135,0.0003924965,0.000031254618,0.003919939,0.004028867,0.00022773561,0.29770553,0.000017573599,0.6927587],"study_design_scores_gemma":[0.00046272494,0.00029234725,0.0061963564,0.00013978394,0.0004121803,0.000013358729,5.54644e-7,0.5934259,0.0024521174,0.39478043,0.0007455221,0.0010786875],"about_ca_topic_score_codex":0.00013601487,"about_ca_topic_score_gemma":0.0005537699,"teacher_disagreement_score":0.8708575,"about_ca_system_score_codex":0.0000704346,"about_ca_system_score_gemma":0.00020254956,"threshold_uncertainty_score":0.99992275},"labels":[],"label_agreement":null},{"id":"W372232218","doi":"10.6633/ijns.201307.15(4).08","title":"A Hybrid Fault Tolerant Approach for AES","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Byte; Scheme (mathematics); Communication source; Fault tolerance; Field-programmable gate array; Process (computing); Computation; Error detection and correction; Embedded system; Fault (geology); Computer hardware; Computer engineering; Algorithm; Parallel computing; Distributed computing; Computer network; Operating system","score_opus":0.021591637303387503,"score_gpt":0.26188653190343686,"score_spread":0.24029489460004935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W372232218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035910252,0.000015158449,0.9595439,0.0006794293,0.00006091037,0.00040191994,0.000003089846,0.00008957033,0.0032957776],"genre_scores_gemma":[0.6532663,0.00000146486,0.34599763,0.0004160358,0.000018439085,0.00017084688,0.000007808356,0.0000021702945,0.0001192759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994213,0.000009716443,0.00012029398,0.00018875807,0.00008634269,0.00017361564],"domain_scores_gemma":[0.9995933,0.000030494106,0.000021949676,0.00023595079,0.00007114398,0.00004712222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009109624,0.000059713544,0.00006751692,0.00005091638,0.000104892504,0.00018746435,0.00030822773,0.000010539591,0.00009594274],"category_scores_gemma":[0.0000050116278,0.00004575316,0.00005717597,0.00010646329,0.0000145142085,0.00030872403,0.00006228668,0.000026452284,0.000016934026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001243997,0.0001378045,0.00022074986,0.000016664122,0.000016890797,3.8687915e-7,0.0006544376,0.000049954142,0.00028633635,0.8617591,0.042844594,0.09401182],"study_design_scores_gemma":[0.00046526795,0.00007005298,0.0009049886,0.000001221767,0.0000028327338,0.000009873537,0.00018095732,0.9440619,0.000994922,0.03959424,0.0135524385,0.00016133442],"about_ca_topic_score_codex":0.00018202706,"about_ca_topic_score_gemma":0.0000055511914,"teacher_disagreement_score":0.9440119,"about_ca_system_score_codex":0.000005005329,"about_ca_system_score_gemma":0.000013194634,"threshold_uncertainty_score":0.18657598},"labels":[],"label_agreement":null},{"id":"W3794380","doi":"10.1007/978-1-4419-1530-6_8","title":"Side Channel Attacks on the Embedded System","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Side channel attack; Plaintext; Computer security; Ciphertext; Computer science; Encryption; Channel (broadcasting); Watermarking attack; Cryptography; Key (lock); Computer network; Public-key cryptography; Attribute-based encryption","score_opus":0.036162257902013016,"score_gpt":0.2616375216374886,"score_spread":0.22547526373547558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3794380","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013730585,0.000062121275,0.049786154,0.001977171,0.00035114255,0.00041078107,0.000013036627,0.00026254775,0.9471233],"genre_scores_gemma":[0.18119927,0.00016525804,0.0062223217,0.010851901,0.00089354196,0.00008686724,0.00007519005,0.0000890197,0.80041665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985751,0.000025561536,0.0003113689,0.00042869017,0.0004176476,0.00024161692],"domain_scores_gemma":[0.9985392,0.00013732791,0.00015323256,0.0010162918,0.0000839147,0.00007003694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027584925,0.00027313238,0.00023397799,0.00017414428,0.00025547293,0.00022133274,0.0009544133,0.00013575566,0.00017718431],"category_scores_gemma":[0.000004293962,0.00017384683,0.0002059452,0.000073856354,0.00003761906,0.00008643836,0.000144765,0.0002789122,0.0002777351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011850734,0.0000073469155,9.993573e-8,0.000008517133,0.000023637895,0.000012597197,0.00021737553,0.000003341332,9.391483e-7,0.9806375,0.011058255,0.0080292225],"study_design_scores_gemma":[0.00066635374,0.00055091985,0.00007283984,0.00050774065,0.00007026877,0.00010068258,0.0004996813,0.015804563,0.0001364659,0.31421176,0.665952,0.0014267139],"about_ca_topic_score_codex":0.00001899431,"about_ca_topic_score_gemma":0.000051225557,"teacher_disagreement_score":0.6664257,"about_ca_system_score_codex":0.00005246082,"about_ca_system_score_gemma":0.000046568315,"threshold_uncertainty_score":0.7089268},"labels":[],"label_agreement":null},{"id":"W41193951","doi":"","title":"Energy Efficiency Analysis and Implementation of AES on an FPGA","year":2009,"lang":"en","type":"article","venue":"UWSpace (University of Waterloo)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Field-programmable gate array; Computer science; Efficient energy use; Embedded system; Parallel computing; Computer architecture; Engineering; Electrical engineering","score_opus":0.00839104310253319,"score_gpt":0.23242932155151513,"score_spread":0.22403827844898194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41193951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9547024,0.000010767173,0.04440416,0.00076041865,0.000013734171,0.0000437601,0.000009461513,0.000019885954,0.000035446043],"genre_scores_gemma":[0.9928477,0.00003160148,0.006873906,0.000038224418,0.000003130177,5.5846456e-8,0.000013737871,0.0000011074142,0.0001905426],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993821,0.00004422685,0.00008515768,0.00020118376,0.00016646004,0.00012089205],"domain_scores_gemma":[0.999528,0.000015635356,0.00010039385,0.00023832783,0.00006407114,0.00005357692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119153774,0.00006680316,0.00014135128,0.00045779234,0.00012102942,0.000018885292,0.0002561296,0.00002383165,0.00004259589],"category_scores_gemma":[7.674657e-7,0.000072324096,0.00007009426,0.0007473004,0.000049735067,0.0003201204,0.00004764241,0.000025837566,3.9084617e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005872669,0.00065984536,0.03729812,0.000027193923,0.00035326788,0.000018204642,0.24908154,0.00033209551,0.013792509,0.26350215,0.00023774541,0.4346386],"study_design_scores_gemma":[0.0020916006,0.002796683,0.83338934,0.000015081555,0.00037954023,0.0000029927712,0.10525152,0.024799932,0.024415612,0.0061413045,0.00025994086,0.00045642772],"about_ca_topic_score_codex":0.024674997,"about_ca_topic_score_gemma":0.023365721,"teacher_disagreement_score":0.79609126,"about_ca_system_score_codex":0.000010525853,"about_ca_system_score_gemma":0.000014930994,"threshold_uncertainty_score":0.99445534},"labels":[],"label_agreement":null},{"id":"W412618279","doi":"10.1007/978-3-319-01766-2_129","title":"Using RC4-BHF to Construct One-way Hash Chains","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Hash function; SHA-2; Computer science; Hash chain; Cryptographic hash function; MDC-2; Secure Hash Algorithm; Security of cryptographic hash functions; Cryptography; Construct (python library); Cryptographic primitive; Hash-based message authentication code; Double hashing; Message authentication code; Theoretical computer science; Cryptographic protocol; Computer network; Computer security","score_opus":0.025147421991609735,"score_gpt":0.2517020794668848,"score_spread":0.22655465747527503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W412618279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000758698,0.00049538957,0.99473816,0.00026834075,0.00033890267,0.0004942523,0.00000792783,0.00020388298,0.002694437],"genre_scores_gemma":[0.534401,0.00008822297,0.4631162,0.0010006252,0.0005986331,0.000057063433,0.000027158054,0.00015143296,0.00055963616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778706,0.000014398944,0.00047926363,0.00064940256,0.00040142302,0.0006684774],"domain_scores_gemma":[0.9987652,0.00031114745,0.00009400968,0.0005425853,0.00008572022,0.0002013928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014302446,0.00045149706,0.00051200716,0.00094352494,0.00008804929,0.000194982,0.00066844857,0.00036420967,0.00013188482],"category_scores_gemma":[0.0001456807,0.00047934108,0.00016144488,0.0006249028,0.000026746498,0.00014543821,0.00021312184,0.00094472815,0.000027561688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050022413,0.0000370842,0.000038313185,0.00006884336,0.00010990715,0.00005168134,0.0006993935,0.046529885,0.0033339271,0.7741549,0.00005061335,0.17492044],"study_design_scores_gemma":[0.0006253473,0.00024223974,0.0001797826,0.00033729535,0.000048372214,0.00011028453,7.2876924e-7,0.9297443,0.0019341114,0.04671916,0.018344129,0.0017142434],"about_ca_topic_score_codex":0.000081043596,"about_ca_topic_score_gemma":0.000051829436,"teacher_disagreement_score":0.8832144,"about_ca_system_score_codex":0.00035075803,"about_ca_system_score_gemma":0.00013391614,"threshold_uncertainty_score":0.9997658},"labels":[],"label_agreement":null},{"id":"W4210400661","doi":"10.1109/globecom46510.2021.9685173","title":"On Evaluating Delegated Digital Signing of Broadcasting Messages in 5G","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Global Communications Conference (GLOBECOM)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Man-in-the-middle attack; Identifier; Broadcasting (networking); Computer network; Computer security; Vulnerability (computing); Adversary; Authentication (law)","score_opus":0.09147067409722377,"score_gpt":0.3757926520429125,"score_spread":0.28432197794568875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210400661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76737785,0.00079842715,0.18444407,0.0037628906,0.00037841388,0.00053662807,0.00023092603,0.0001589295,0.042311855],"genre_scores_gemma":[0.967948,0.00012665278,0.031657867,0.000106803935,0.000009570158,0.000032525335,0.00008613171,0.0000062843023,0.00002613822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976708,0.0004089699,0.00071211974,0.00042976197,0.00042044578,0.00035786608],"domain_scores_gemma":[0.9964865,0.00050761877,0.0002801916,0.001976674,0.00065945956,0.0000895748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055421016,0.00020155091,0.00031143767,0.00014178256,0.0002946854,0.00044375274,0.0018631866,0.00007610494,0.00009105325],"category_scores_gemma":[0.0004987575,0.00020608703,0.00011296991,0.0020791683,0.00014082117,0.0006606539,0.0006739831,0.00030188216,0.00001945519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014210144,0.0008610955,0.015186847,0.000036751742,0.00008660221,0.000022834114,0.0016328496,0.0008570011,0.0032498492,0.62604034,0.00044763493,0.35156396],"study_design_scores_gemma":[0.0047591105,0.0007425905,0.06362214,0.0014797128,0.00009705603,0.00012854392,0.008706403,0.7600245,0.0065640463,0.14865659,0.0032924586,0.0019268384],"about_ca_topic_score_codex":0.00039488138,"about_ca_topic_score_gemma":0.0011833275,"teacher_disagreement_score":0.7591675,"about_ca_system_score_codex":0.00012362958,"about_ca_system_score_gemma":0.0005189819,"threshold_uncertainty_score":0.8403985},"labels":[],"label_agreement":null},{"id":"W4221034053","doi":"10.3390/electronics11060952","title":"Two-Layer Bus-Independent Instruction Set Architecture for Securing Long Protocol Data Units in Automotive Open System Architecture-Based Automotive Electronic Control Units","year":2022,"lang":"en","type":"article","venue":"Electronics","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Embedded system; Byte; FlexRay; AUTOSAR; Frame (networking); Instruction set; Hash function; Automotive industry; Computer hardware; Controller (irrigation); Data transmission; Computer network; Operating system; Software; Engineering","score_opus":0.03872459991865326,"score_gpt":0.32090043621399483,"score_spread":0.2821758362953416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221034053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046353742,0.000177805,0.8677786,0.0010946901,0.00029937743,0.08299714,0.0007292761,0.000420633,0.00014870327],"genre_scores_gemma":[0.94076216,0.0000020131363,0.0031822473,0.00040899555,0.000080496386,0.054887008,0.000608779,0.00005365027,0.000014653946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950045,0.0009121866,0.00068340305,0.0012571522,0.00073494535,0.0014078555],"domain_scores_gemma":[0.9972548,0.0002995122,0.00044265363,0.0014216607,0.00044138194,0.00013999965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021681811,0.00043924677,0.00048732886,0.00069030793,0.00095950585,0.00045525757,0.003888528,0.00008875611,0.000029330597],"category_scores_gemma":[0.00011964618,0.00045672033,0.000081325416,0.0031933086,0.00005095412,0.00057355716,0.0014741704,0.001449724,0.0000015091188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002860962,0.0012377121,0.0027051829,0.0008191557,0.00098295,0.0001670771,0.014260871,0.45499432,0.0010983777,0.41258734,0.0011003643,0.10718571],"study_design_scores_gemma":[0.040418908,0.0041707903,0.0016162148,0.00018333795,0.00014799922,0.00050046254,0.00241925,0.8513103,0.0040582134,0.017147116,0.07615167,0.0018757042],"about_ca_topic_score_codex":0.00026501788,"about_ca_topic_score_gemma":0.006820712,"teacher_disagreement_score":0.8944084,"about_ca_system_score_codex":0.0015223502,"about_ca_system_score_gemma":0.0033224812,"threshold_uncertainty_score":0.99978846},"labels":[],"label_agreement":null},{"id":"W4221048763","doi":"10.3390/s22062090","title":"Compact Finite Field Multiplication Processor Structure for Cryptographic Algorithms in IoT Devices with Limited Resources","year":2022,"lang":"en","type":"article","venue":"Sensors","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Cryptography; Encryption; Cryptographic primitive; Cryptographic protocol; Embedded system; Public-key cryptography; Multiplier (economics); Algorithm; Energy consumption; Distributed computing; Computer network; Engineering","score_opus":0.01715402475444999,"score_gpt":0.27147067212295234,"score_spread":0.25431664736850235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221048763","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97660863,0.000069177615,0.020450749,0.001975767,0.00006767114,0.00062146824,0.000070754846,0.0000950801,0.00004068929],"genre_scores_gemma":[0.9782826,0.0000036298043,0.021082465,0.00046533448,0.000027167605,0.00008138349,0.000037399404,0.000010164562,0.000009892773],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987598,0.00008259019,0.00023148315,0.00037967294,0.00027759533,0.00026887772],"domain_scores_gemma":[0.9990461,0.00035535282,0.00013996719,0.00032112497,0.00008498312,0.0000524715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018857076,0.00013773944,0.00015027124,0.00040292297,0.00038401535,0.00010562862,0.00045573435,0.00003479568,0.00003021923],"category_scores_gemma":[0.00003317628,0.000121480116,0.00005450476,0.0014673779,0.00003106828,0.0001064316,0.00007292473,0.00019454691,3.729558e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013012888,0.0017117107,0.48290524,0.0006754383,0.00047205147,0.000080073674,0.112862796,0.19146697,0.003705396,0.052119754,0.0024999587,0.15019932],"study_design_scores_gemma":[0.0036998626,0.0014906946,0.1685293,0.000047009093,0.00003482559,0.00004061776,0.0058398596,0.7629496,0.0017451358,0.0067759007,0.048004374,0.0008428278],"about_ca_topic_score_codex":0.00024594855,"about_ca_topic_score_gemma":0.0010470442,"teacher_disagreement_score":0.5714826,"about_ca_system_score_codex":0.000023418248,"about_ca_system_score_gemma":0.000032497035,"threshold_uncertainty_score":0.49538153},"labels":[],"label_agreement":null},{"id":"W4221133369","doi":"10.3390/s22072535","title":"Fast Constant-Time Modular Inversion over Fp Resistant to Simple Power Analysis Attacks for IoT Applications","year":2022,"lang":"en","type":"article","venue":"Sensors","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Field-programmable gate array; Power analysis; Cryptography; Virtex; Modular design; Embedded system; Modular exponentiation; Elliptic curve cryptography; Byte; Computer engineering; Public-key cryptography; Computer hardware; Algorithm; Computer network; Operating system","score_opus":0.011015464205982935,"score_gpt":0.2748922386962183,"score_spread":0.2638767744902354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221133369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.630942,0.000025740374,0.36528742,0.0016858311,0.00007988878,0.0009233998,0.00047839386,0.00012124337,0.000456056],"genre_scores_gemma":[0.9792621,0.0000019543374,0.01947815,0.00068789016,0.00001700197,0.00020336772,0.00011391033,0.000010382233,0.00022524183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857354,0.00007601164,0.00025792498,0.000453563,0.00034900836,0.00028993769],"domain_scores_gemma":[0.9989403,0.00010916477,0.000087781766,0.0006397505,0.00009898122,0.00012405748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002979652,0.00011858618,0.00018489118,0.00047664842,0.0006992633,0.00010756232,0.0004593332,0.00002398772,0.00049465115],"category_scores_gemma":[0.000013523303,0.00012850907,0.00020690153,0.0023390767,0.000032292373,0.00007545712,0.0003131978,0.00008360801,0.000018167506],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003549781,0.0015616487,0.0071921903,0.000066317996,0.002270707,0.00004707533,0.01817176,0.16406633,0.041782573,0.6383761,0.105233446,0.020876868],"study_design_scores_gemma":[0.00099738,0.000438787,0.0037958713,0.0000025767108,0.00023473325,0.0000040589402,0.0027119506,0.3609561,0.00060231687,0.00872426,0.6209098,0.00062216626],"about_ca_topic_score_codex":0.00010633498,"about_ca_topic_score_gemma":0.00011080235,"teacher_disagreement_score":0.62965184,"about_ca_system_score_codex":0.00009135907,"about_ca_system_score_gemma":0.000053360458,"threshold_uncertainty_score":0.5416083},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.059373724428926945,"score_gpt":0.2779993758868514,"score_spread":0.21862565145792448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225654141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053312756,0.000002891706,0.94314706,0.0004161997,0.0018205671,0.00082988525,0.00029899616,0.00010849365,0.00006315145],"genre_scores_gemma":[0.9641031,0.000006667202,0.034114335,0.00056338514,0.00011919306,0.0007605763,0.00019651766,0.000020448299,0.00011574541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981773,0.00010095539,0.00067021756,0.00020081646,0.00052289874,0.0003278406],"domain_scores_gemma":[0.998827,0.00015279693,0.00023829624,0.00060399564,0.000038625425,0.00013930336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058038306,0.00018736378,0.00017277618,0.0003758712,0.001055949,0.00019152396,0.00063315156,0.000094038194,0.00020956103],"category_scores_gemma":[0.000006112191,0.00020061807,0.0001511367,0.0006121227,0.000050334467,0.00083831453,0.000007973132,0.00040674416,0.00002536044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017083896,0.018011825,0.0012174571,0.00038981848,0.0014022052,0.000013296393,0.060066406,0.36194417,0.005529272,0.14987572,0.030493954,0.36934748],"study_design_scores_gemma":[0.0047457833,0.0015104128,0.000059915288,0.000015741314,0.000088569825,0.000008849359,0.0011219588,0.8365345,0.014886122,0.0008795921,0.13955493,0.0005936336],"about_ca_topic_score_codex":0.000022809301,"about_ca_topic_score_gemma":0.000010421146,"teacher_disagreement_score":0.9107904,"about_ca_system_score_codex":0.00017361894,"about_ca_system_score_gemma":0.00015971069,"threshold_uncertainty_score":0.81809676},"labels":[],"label_agreement":null},{"id":"W4231955914","doi":"10.32920/ryerson.14656857.v1","title":"A new Modulo Addition with enhanced scalable security against algebraic attack","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modulo; Probabilistic logic; Computer science; Algebraic number; Scalability; Theoretical computer science; Advanced Encryption Standard; Block cipher; Cryptography; Mathematics; Discrete mathematics; Algorithm","score_opus":0.017055778232464073,"score_gpt":0.266030379912824,"score_spread":0.24897460168035995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231955914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17143191,0.00011523866,0.820411,0.000700473,0.0004224996,0.00046640463,0.00003790044,0.00032020142,0.00609433],"genre_scores_gemma":[0.801565,0.00014046484,0.19635439,0.0006982114,0.00014775911,0.000103368555,0.00066607835,0.000020890326,0.00030385144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973223,0.00010561091,0.0004207987,0.0011202801,0.0005747289,0.00045624876],"domain_scores_gemma":[0.9978013,0.000057879523,0.00022351944,0.0013759666,0.00029487914,0.0002464271],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000211161,0.00037974294,0.0004035586,0.00022232247,0.00019926674,0.0009614802,0.00097171153,0.00020795749,0.0010378652],"category_scores_gemma":[0.000015492786,0.00034451374,0.00019769018,0.0007883769,0.00004471083,0.0005688569,0.0012949227,0.00056754024,0.000026733964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117646414,0.0021436943,0.00095433486,0.0014917835,0.0017879729,0.0003750697,0.04531844,0.008720965,0.0032114787,0.29712278,0.25750497,0.38125086],"study_design_scores_gemma":[0.013333046,0.0015532421,0.01401416,0.0035795935,0.0004907455,0.0001862892,0.0059231077,0.5555035,0.08633264,0.24747236,0.059639905,0.011971451],"about_ca_topic_score_codex":0.0005706989,"about_ca_topic_score_gemma":0.0022818292,"teacher_disagreement_score":0.6301331,"about_ca_system_score_codex":0.00008943403,"about_ca_system_score_gemma":0.0007406256,"threshold_uncertainty_score":0.9999007},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Encryption; Ciphertext; Learning with errors; Computer security","score_opus":0.029949300054314617,"score_gpt":0.32955850391566927,"score_spread":0.29960920386135464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235846187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056792405,0.00017390074,0.93964714,0.001071571,0.0008268279,0.0006625791,0.00008226909,0.0002792591,0.00046402594],"genre_scores_gemma":[0.9815319,0.00032233834,0.017536761,0.00023367099,0.00015083487,0.00016592098,0.00001586399,0.00002444087,0.000018268165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741536,0.00027174255,0.0005634882,0.0007541788,0.00047778257,0.00051744987],"domain_scores_gemma":[0.9985151,0.00020551139,0.000164556,0.0005803975,0.00023554538,0.00029886924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006870823,0.0003316492,0.00033343286,0.00064263714,0.0009692749,0.0006539173,0.0002471555,0.00015860674,0.00010984265],"category_scores_gemma":[0.000011750432,0.00031236254,0.00013544413,0.0010754098,0.00025924653,0.000837624,0.000024155059,0.00031408604,0.00002089626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023746741,0.0010291709,0.005179109,0.00056348916,0.0011607338,0.000098140314,0.026816724,0.00005457015,0.0024803774,0.8217279,0.0069073457,0.13374501],"study_design_scores_gemma":[0.031420268,0.013762998,0.056147046,0.0015925196,0.0018353042,0.0047617955,0.12878148,0.20803772,0.009555233,0.059870064,0.47372755,0.010508023],"about_ca_topic_score_codex":0.00028504673,"about_ca_topic_score_gemma":0.0004486095,"teacher_disagreement_score":0.9247395,"about_ca_system_score_codex":0.000025983614,"about_ca_system_score_gemma":0.000074077936,"threshold_uncertainty_score":0.9999328},"labels":[],"label_agreement":null},{"id":"W4245484527","doi":"10.1109/isss.2002.1227156","title":"Security-driven exploration of cryptography in DSP cores","year":2003,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Computer science; Digital signal processing; Computer security; Computer hardware","score_opus":0.029091787579726823,"score_gpt":0.2846880189499999,"score_spread":0.2555962313702731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245484527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2546473,0.000054333977,0.737083,0.00022187388,0.00012767369,0.00019356019,0.0000023932562,0.00005299413,0.0076168277],"genre_scores_gemma":[0.9599774,0.000038660128,0.039879836,0.00007610135,0.0000042015236,0.0000153411,0.0000031071545,0.0000025482832,0.000002830459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917156,0.000079176156,0.00025484266,0.00017879513,0.00016818539,0.00014747155],"domain_scores_gemma":[0.9995313,0.000047749294,0.000062253646,0.00026043117,0.000062884385,0.000035343655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021474971,0.00007156121,0.000105730054,0.0003425082,0.000042188218,0.000040159506,0.00022520828,0.000028563714,0.000077347395],"category_scores_gemma":[0.000018562263,0.00006733483,0.000057546855,0.0010683786,0.000036988316,0.0006829857,0.000035990546,0.000058118734,0.0000034061884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011731007,0.00008786108,0.019198386,0.0000059338145,0.000004421001,0.0000012106603,0.0021517384,0.00003262041,0.00023698082,0.97727513,0.00022357958,0.0007809664],"study_design_scores_gemma":[0.0018930632,0.00029552306,0.026130894,0.000030240062,0.000007849255,0.000006583279,0.002891535,0.013132067,0.015027854,0.9283424,0.011776705,0.0004652963],"about_ca_topic_score_codex":0.00010176206,"about_ca_topic_score_gemma":0.0006016558,"teacher_disagreement_score":0.7053301,"about_ca_system_score_codex":0.0000070502415,"about_ca_system_score_gemma":0.000029887304,"threshold_uncertainty_score":0.2745835},"labels":[],"label_agreement":null},{"id":"W4246009519","doi":"10.32920/ryerson.14656857","title":"A new Modulo Addition with enhanced scalable security against algebraic attack","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modulo; Probabilistic logic; Computer science; Algebraic number; Scalability; Theoretical computer science; Advanced Encryption Standard; Block cipher; Cryptography; Mathematics; Discrete mathematics; Algorithm","score_opus":0.017055778232464073,"score_gpt":0.266030379912824,"score_spread":0.24897460168035995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246009519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17143191,0.00011523866,0.820411,0.000700473,0.0004224996,0.00046640463,0.00003790044,0.00032020142,0.00609433],"genre_scores_gemma":[0.801565,0.00014046484,0.19635439,0.0006982114,0.00014775911,0.000103368555,0.00066607835,0.000020890326,0.00030385144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973223,0.00010561091,0.0004207987,0.0011202801,0.0005747289,0.00045624876],"domain_scores_gemma":[0.9978013,0.000057879523,0.00022351944,0.0013759666,0.00029487914,0.0002464271],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000211161,0.00037974294,0.0004035586,0.00022232247,0.00019926674,0.0009614802,0.00097171153,0.00020795749,0.0010378652],"category_scores_gemma":[0.000015492786,0.00034451374,0.00019769018,0.0007883769,0.00004471083,0.0005688569,0.0012949227,0.00056754024,0.000026733964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117646414,0.0021436943,0.00095433486,0.0014917835,0.0017879729,0.0003750697,0.04531844,0.008720965,0.0032114787,0.29712278,0.25750497,0.38125086],"study_design_scores_gemma":[0.013333046,0.0015532421,0.01401416,0.0035795935,0.0004907455,0.0001862892,0.0059231077,0.5555035,0.08633264,0.24747236,0.059639905,0.011971451],"about_ca_topic_score_codex":0.0005706989,"about_ca_topic_score_gemma":0.0022818292,"teacher_disagreement_score":0.6301331,"about_ca_system_score_codex":0.00008943403,"about_ca_system_score_gemma":0.0007406256,"threshold_uncertainty_score":0.9999007},"labels":[],"label_agreement":null},{"id":"W4249246001","doi":"10.4018/978-1-4666-4707-7.ch005","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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cryptography; Computer security; Computer science; Authentication (law); Encryption; Identification (biology); Confidentiality; Key (lock); Public-key cryptography; Cryptographic protocol","score_opus":0.04848189568759899,"score_gpt":0.3120439594122597,"score_spread":0.26356206372466073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249246001","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024924998,0.0014704221,0.024158804,0.000040539322,0.0003577419,0.00042660453,0.00015130793,0.00015959928,0.97298574],"genre_scores_gemma":[0.7329994,0.0007771384,0.24950503,0.004344916,0.0008455077,0.00019915884,0.0000956404,0.0002079894,0.011025242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982102,0.000026894666,0.00050653744,0.00050654676,0.00046335303,0.00028645503],"domain_scores_gemma":[0.9980793,0.000022196946,0.00032314518,0.0011838075,0.00021404517,0.00017748823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012667854,0.00033519772,0.00042800105,0.00017935426,0.000088545574,0.0001528297,0.0011614965,0.00021738622,0.00021046547],"category_scores_gemma":[0.0000022777383,0.00032617478,0.00036419678,0.000075112,0.000121575526,0.00018374731,0.00022294073,0.00016572556,0.00006359081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016836236,0.00001805347,0.00002888755,0.00004012969,0.00005948339,0.000005376382,0.00008586957,3.408094e-7,0.000013967348,0.9748379,0.0015621079,0.023346215],"study_design_scores_gemma":[0.00021500337,0.00017992125,0.0002635614,0.00009152088,0.000033946013,0.000012725326,0.00000757064,0.000096500386,0.000025928575,0.9548373,0.043888334,0.000347664],"about_ca_topic_score_codex":0.00023807783,"about_ca_topic_score_gemma":0.00011813191,"teacher_disagreement_score":0.9619605,"about_ca_system_score_codex":0.000034577657,"about_ca_system_score_gemma":0.00011914314,"threshold_uncertainty_score":0.99991906},"labels":[],"label_agreement":null},{"id":"W4249458288","doi":"10.1109/fdtc.2007.4318984","title":"A Structure-independent Approach for Fault Detection Hardware Implementations of the Advanced Encryption Standard","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Implementation; Encryption; Embedded system; Advanced Encryption Standard; Fault detection and isolation; Computer hardware; Operating system; Software engineering; Artificial intelligence","score_opus":0.014344266959835298,"score_gpt":0.29780051173008937,"score_spread":0.28345624477025405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249458288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14120486,0.000009040917,0.85749525,0.00006923111,0.000194922,0.00068365736,0.000075211465,0.000041326985,0.00022648514],"genre_scores_gemma":[0.82368356,0.0000019587992,0.17617233,0.000055235294,0.000019421417,0.000032229163,0.000018919945,0.000004151815,0.00001219111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988662,0.000027530567,0.00032663342,0.00023234743,0.00033114228,0.00021616215],"domain_scores_gemma":[0.9991954,0.000058957845,0.00015219917,0.0003341772,0.00021950231,0.000039762977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039533022,0.000093571056,0.00009911736,0.000118584976,0.00030416858,0.00005265845,0.00035168364,0.000036692396,0.000028756427],"category_scores_gemma":[0.00002243109,0.00006750434,0.00011284365,0.0004981226,0.000029882738,0.00028015347,0.00008579635,0.00007036781,1.5583598e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013578899,0.00015640457,0.0039339247,0.00009575797,0.00009960555,3.6143297e-7,0.005288218,0.0015076834,0.1015728,0.4489294,0.0002746818,0.43800536],"study_design_scores_gemma":[0.005802659,0.0007641219,0.08192764,0.000016671376,0.00007859056,0.000030538857,0.010887202,0.0430747,0.79331064,0.055065744,0.00840464,0.0006368407],"about_ca_topic_score_codex":0.00006180048,"about_ca_topic_score_gemma":0.0013212338,"teacher_disagreement_score":0.69173783,"about_ca_system_score_codex":0.0000627272,"about_ca_system_score_gemma":0.000045289406,"threshold_uncertainty_score":0.27527472},"labels":[],"label_agreement":null},{"id":"W4250656566","doi":"10.1109/emsoft.2015.7318271","title":"Exp-HE: a family of fast exponentiation algorithms resistant to SPA, fault, and combined attacks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalar multiplication; Side channel attack; Modular exponentiation; Power analysis; Cryptography; Algorithm; Exponentiation; Elliptic curve cryptography; Modular arithmetic; Timing attack; Cryptosystem; Vulnerability (computing); Computer engineering; Public-key cryptography; Embedded system; Theoretical computer science; Elliptic curve; Computer security; Encryption; Mathematics","score_opus":0.04177927509778567,"score_gpt":0.29683808939648837,"score_spread":0.2550588142987027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250656566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47463554,0.00004557846,0.5232438,0.0007424687,0.000128433,0.0001911562,0.000009095569,0.000048163012,0.00095577026],"genre_scores_gemma":[0.9216268,0.000009137366,0.07800502,0.00021609498,0.000014498751,0.000015234779,0.0000089612395,0.0000040059604,0.00010021888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99900365,0.000040795327,0.00026132874,0.00023916102,0.00029426278,0.00016081451],"domain_scores_gemma":[0.99927,0.00003231977,0.00006864738,0.00030038517,0.00017811845,0.00015052811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029975324,0.000092262824,0.00013372682,0.00016130967,0.000063051324,0.00009280926,0.00023950847,0.000027329677,0.000011185891],"category_scores_gemma":[0.000019145724,0.00007987351,0.000031572676,0.00045591392,0.000027361792,0.00027323142,0.00017615697,0.00003875432,0.0000055823193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003312535,0.0011389398,0.019237017,0.00011533214,0.00023461762,0.00003530043,0.06333561,0.00011679099,0.054765556,0.5710549,0.090374075,0.1992606],"study_design_scores_gemma":[0.016997114,0.006248694,0.5779653,0.00016777751,0.00011562729,0.000040449377,0.036102917,0.22384213,0.026666528,0.047829878,0.061520744,0.00250281],"about_ca_topic_score_codex":0.00040075596,"about_ca_topic_score_gemma":0.00014723612,"teacher_disagreement_score":0.55872834,"about_ca_system_score_codex":0.000016953776,"about_ca_system_score_gemma":0.00003838862,"threshold_uncertainty_score":0.32571474},"labels":[],"label_agreement":null},{"id":"W4250756852","doi":"10.1109/codess.2003.1275277","title":"Security wrappers and power analysis for SoC technology","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; Computer network; Wireless; Computer security; Layer (electronics); Core (optical fiber); Network processor; Transport layer; Embedded system; Operating system; Telecommunications; Network packet","score_opus":0.010316939956818292,"score_gpt":0.27539962312876576,"score_spread":0.26508268317194744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250756852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25100532,0.000046375055,0.7446236,0.0037234293,0.000029538809,0.00010736101,0.000004278046,0.00009382319,0.00036623888],"genre_scores_gemma":[0.94552946,0.000010375023,0.054182544,0.00024414368,0.0000034887871,0.00001870679,0.0000026549687,0.0000016926451,0.0000069517755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994108,0.0000050788144,0.00010916779,0.00022542631,0.00006961646,0.00017991927],"domain_scores_gemma":[0.9996306,0.000019801448,0.0000259762,0.00023131452,0.000050167957,0.000042192234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013048894,0.00006110862,0.000100908896,0.00040111848,0.00013125227,0.000061081715,0.00020252993,0.000042031417,0.00002580673],"category_scores_gemma":[0.0000087711105,0.000053912914,0.00007563884,0.0012798316,0.00005548995,0.00013874436,0.00008392577,0.000039685074,0.0000013597589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010088418,0.00003320272,0.0075275847,0.000002082598,0.00010054976,7.15973e-7,0.00065418467,0.000013390153,0.00006215934,0.9902263,0.000081243685,0.0012975455],"study_design_scores_gemma":[0.0020207595,0.00033632672,0.020891968,0.000003308487,0.000151052,0.000014142796,0.0022212316,0.00537818,0.002934432,0.95397943,0.011637134,0.00043203522],"about_ca_topic_score_codex":0.000054489898,"about_ca_topic_score_gemma":0.00033431465,"teacher_disagreement_score":0.6945241,"about_ca_system_score_codex":0.000012375007,"about_ca_system_score_gemma":0.000023544873,"threshold_uncertainty_score":0.21985048},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02469502833058283,"score_gpt":0.2745805529607446,"score_spread":0.24988552463016175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251236654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09980541,0.00024070923,0.8928243,0.00032715744,0.0021765826,0.0009702657,0.00009681149,0.00067270285,0.0028860595],"genre_scores_gemma":[0.9921808,0.00023551476,0.0063510295,0.00032053064,0.00033896067,0.00049377757,0.000015059076,0.000046771253,0.00001751721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99599713,0.00047955566,0.0007663821,0.0011734014,0.0007864216,0.0007971072],"domain_scores_gemma":[0.99722433,0.0005703703,0.00025074315,0.0010582819,0.00049961236,0.00039668608],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00085903367,0.0005691283,0.0005536755,0.0032684412,0.0019086316,0.00069293083,0.0006178742,0.00027017517,0.00006629732],"category_scores_gemma":[0.000047453195,0.00053290377,0.00043173254,0.0062690694,0.00037112765,0.00084847445,0.000026794072,0.00067910395,0.000074481184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023552577,0.0020929023,0.0016694979,0.00031923584,0.0015215186,0.00005702762,0.015372842,0.0009953753,0.0018432904,0.8190723,0.0023135573,0.15450689],"study_design_scores_gemma":[0.04318347,0.04752032,0.054149788,0.0074275765,0.0027983158,0.002965703,0.13114485,0.2375403,0.027018473,0.15634051,0.26627287,0.023637814],"about_ca_topic_score_codex":0.00032701777,"about_ca_topic_score_gemma":0.00013328988,"teacher_disagreement_score":0.8923754,"about_ca_system_score_codex":0.000060326143,"about_ca_system_score_gemma":0.000070355185,"threshold_uncertainty_score":0.9997122},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02556082910383931,"score_gpt":0.2989783847245377,"score_spread":0.27341755562069836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283644776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1046353,0.000030012974,0.89419496,0.00020849743,0.0001467802,0.00024722685,0.000014824144,0.0001625693,0.00035980463],"genre_scores_gemma":[0.8837188,0.0000026071727,0.1158388,0.00029888962,0.000008739567,0.00010350984,0.000016757265,0.0000043542395,0.000007554728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986639,0.00017576669,0.0002671484,0.00029475594,0.0003878835,0.0002105495],"domain_scores_gemma":[0.99946594,0.000058013717,0.000080334205,0.0003108826,0.000050732284,0.000034099357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008545145,0.000076104785,0.00009659203,0.00036416986,0.00032603275,0.00010981436,0.00038086707,0.000013929212,0.00015603084],"category_scores_gemma":[0.00003742334,0.00007888762,0.000059104877,0.0017379472,0.00001638209,0.0003504734,0.00037109735,0.00012894726,8.210212e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016105292,0.00026623203,0.124272384,0.000035185843,0.000013016394,0.000009982795,0.00569265,0.0005983437,0.0005010626,0.7656423,0.0008028272,0.10214995],"study_design_scores_gemma":[0.0107686985,0.0016933401,0.5437026,0.000028775552,0.000027145194,0.000061475395,0.023218434,0.11691317,0.0035281072,0.23619066,0.060593452,0.003274135],"about_ca_topic_score_codex":0.00071073184,"about_ca_topic_score_gemma":0.00045319783,"teacher_disagreement_score":0.7790835,"about_ca_system_score_codex":0.00006443674,"about_ca_system_score_gemma":0.00010208726,"threshold_uncertainty_score":0.32169437},"labels":[],"label_agreement":null},{"id":"W4283820582","doi":"10.1109/icics55353.2022.9811140","title":"A High-Speed FPGA Implementation of AES for Large Scale Embedded Systems and its Applications","year":2022,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Field-programmable gate array; Computer science; Advanced Encryption Standard; Throughput; Virtex; Embedded system; Encryption; Suite; Bandwidth (computing); Reconfigurable computing; Computer hardware; Computer architecture; Wireless; Operating system","score_opus":0.019436037957790486,"score_gpt":0.3146282759107357,"score_spread":0.29519223795294525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283820582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13881706,0.00013570025,0.85854006,0.0004880563,0.00011982634,0.0013920148,0.00037349312,0.000063964566,0.00006984927],"genre_scores_gemma":[0.9891378,0.000009501414,0.009882858,0.00008272458,0.000016934055,0.00074713136,0.00007650295,0.000004268781,0.000042272673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991625,0.000048120633,0.00025354166,0.00020899464,0.00017340803,0.00015343906],"domain_scores_gemma":[0.99948883,0.000081068974,0.00010794359,0.00019498386,0.00009037429,0.000036810314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041350257,0.00006203023,0.000106955136,0.00012375058,0.0003591796,0.000055847962,0.00022765537,0.000010755435,0.00008938063],"category_scores_gemma":[0.000002465749,0.00006271809,0.000036758523,0.0003788572,0.0000075361713,0.0001683145,0.00018583387,0.000032153595,6.5171946e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003678263,0.000097678036,0.00038333176,0.000051263298,0.00002174126,1.1450389e-7,0.0025256206,0.000052525684,0.0016944419,0.9882971,0.0013929004,0.005479619],"study_design_scores_gemma":[0.016488003,0.0019837331,0.015592692,0.00002044731,0.0001997502,0.00007425715,0.14378093,0.49353868,0.046914823,0.054615606,0.22514199,0.0016490961],"about_ca_topic_score_codex":0.00015926851,"about_ca_topic_score_gemma":0.0001388107,"teacher_disagreement_score":0.9336815,"about_ca_system_score_codex":0.000017299653,"about_ca_system_score_gemma":0.00003386598,"threshold_uncertainty_score":0.27625555},"labels":[],"label_agreement":null},{"id":"W4285141020","doi":"10.1007/978-3-031-08147-7_8","title":"Implementation of Lightweight Ciphers and Their Integration into Entity Authentication with IEEE 802.11 Physical Layer Transmission","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Handshaking; Computer science; Computer network; Handshake; Physical layer; Mutual authentication; Authentication protocol; Embedded system; Wireless; Operating system","score_opus":0.013506559331970886,"score_gpt":0.2748908163341187,"score_spread":0.26138425700214785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285141020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043600205,0.000058691065,0.95505404,0.00043656834,0.0002523294,0.00044187164,0.000009181872,0.00004373338,0.000103389066],"genre_scores_gemma":[0.9246525,0.000038720573,0.075063445,0.00011469845,0.000063764004,0.000020796246,0.000024031991,0.000013838611,0.000008168106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978561,0.000054884014,0.0003863823,0.0008123847,0.0006305968,0.00025965238],"domain_scores_gemma":[0.9987477,0.0001610271,0.00029476843,0.0005382337,0.00017153361,0.00008670179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004782979,0.0003067285,0.00031405006,0.0005691377,0.0003093304,0.00019805362,0.0008101384,0.00007668964,0.000057512425],"category_scores_gemma":[0.00000423708,0.000233146,0.00008492874,0.0006353338,0.00035506504,0.00072086096,0.00024357409,0.00031541628,6.777498e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012677771,0.00008607557,0.00045305194,0.0000559107,0.000023670978,0.000004040079,0.030088639,0.0005487482,0.0057337587,0.07567816,0.000010286822,0.88730496],"study_design_scores_gemma":[0.0020728041,0.0019311467,0.0049436814,0.00048488355,0.00009585123,0.000060687016,0.00011048272,0.4604466,0.107714534,0.41697633,0.0034368837,0.0017261304],"about_ca_topic_score_codex":0.00032200065,"about_ca_topic_score_gemma":0.00085110194,"teacher_disagreement_score":0.8855789,"about_ca_system_score_codex":0.00013760524,"about_ca_system_score_gemma":0.0002488249,"threshold_uncertainty_score":0.9507418},"labels":[],"label_agreement":null},{"id":"W4285585166","doi":"10.1016/j.aej.2022.07.013","title":"Compact hardware accelerator for field multipliers suitable for use in ultra-low power IoT edge devices","year":2022,"lang":"en","type":"article","venue":"Alexandria Engineering Journal","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Research Council Canada","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Field-programmable gate array; Cryptography; Embedded system; Multiplication (music); Edge device; Application-specific integrated circuit; Field (mathematics); Computer hardware; Hardware acceleration; Operating system; Computer security; Telecommunications","score_opus":0.02521257791491411,"score_gpt":0.2677550925691742,"score_spread":0.24254251465426008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285585166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39753017,0.0001262285,0.6003054,0.0003173071,0.0011666939,0.00042113403,0.000068569025,0.000051711886,0.000012815964],"genre_scores_gemma":[0.95386577,0.0000070490128,0.04568335,0.00022669253,0.00008570833,0.00007807801,0.00001039771,0.000016192062,0.000026753954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988548,0.000025254329,0.00031101552,0.00020825477,0.0001860037,0.0004146673],"domain_scores_gemma":[0.9990152,0.0005195539,0.00008788255,0.00018789076,0.00007604624,0.00011339965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004728557,0.0001389811,0.00018334958,0.00028277287,0.0003854317,0.0002949269,0.0004915468,0.00003415686,0.00009191392],"category_scores_gemma":[0.00009686588,0.00014355515,0.00014305294,0.0003283797,0.000005667043,0.00043875843,0.000051116545,0.00028952622,4.1084735e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007549405,0.0016697185,0.19673657,0.000656884,0.0009386881,0.00019586577,0.024730798,0.5478419,0.038564656,0.057151426,0.115891725,0.014866794],"study_design_scores_gemma":[0.010012772,0.0013658276,0.042988777,0.00013813651,0.000047524412,0.00034720983,0.0015082855,0.68283594,0.00630839,0.0005050441,0.2526464,0.0012957308],"about_ca_topic_score_codex":0.000027787723,"about_ca_topic_score_gemma":0.000042089407,"teacher_disagreement_score":0.5563356,"about_ca_system_score_codex":0.00008552778,"about_ca_system_score_gemma":0.00007039655,"threshold_uncertainty_score":0.58540094},"labels":[],"label_agreement":null},{"id":"W4288070531","doi":"10.18280/ts.390305","title":"Optimized Piccolo Lightweight Block Cipher: Area Efficient Implementation","year":2022,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Block cipher; CBC-MAC; Embedded system; Power consumption; Cipher; Cryptography; Block (permutation group theory); Resource consumption; Computer hardware; Parallel computing; Computer engineering; Algorithm; Power (physics); Encryption; Computer network","score_opus":0.016298480839231484,"score_gpt":0.26035571306198446,"score_spread":0.24405723222275297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288070531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5722009,0.00011371384,0.42140207,0.002738902,0.0006685516,0.0013030388,0.00011017598,0.0003345186,0.0011281573],"genre_scores_gemma":[0.9839098,0.000006592204,0.014681377,0.0007337519,0.00006588405,0.00046024212,0.00009283119,0.000012953057,0.00003658948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743223,0.00020645426,0.0005384536,0.0005126173,0.00083589245,0.00047432582],"domain_scores_gemma":[0.9991525,0.00008076018,0.00019349228,0.00036678498,0.00007899406,0.00012750839],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007259466,0.00021160013,0.00020236892,0.0002733943,0.0010277934,0.00019556163,0.00078219455,0.000022460043,0.005722087],"category_scores_gemma":[0.0000025777513,0.00021403599,0.00016499854,0.0008099607,0.000033829077,0.0001875247,0.0004574696,0.00017468855,0.000014494922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004329806,0.005872389,0.0069230646,0.00008881501,0.0008739135,0.0002746978,0.045163207,0.19099756,0.016322207,0.53692824,0.10207368,0.094049275],"study_design_scores_gemma":[0.020608174,0.0029899958,0.017127318,0.000020268611,0.00021644509,0.00017947536,0.009470338,0.68849826,0.009126726,0.005174872,0.24431321,0.0022748976],"about_ca_topic_score_codex":0.00007089432,"about_ca_topic_score_gemma":0.000021805612,"teacher_disagreement_score":0.53175336,"about_ca_system_score_codex":0.00016727153,"about_ca_system_score_gemma":0.00010648801,"threshold_uncertainty_score":0.9951868},"labels":[],"label_agreement":null},{"id":"W4289713251","doi":"10.1109/isit50566.2022.9834366","title":"On the Security Properties of Combinatorial All-or-nothing Transforms","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tuple; Cryptography; Combinatorial design; Encryption; Independent and identically distributed random variables; Preprocessor; Computer science; Discrete mathematics; Mathematics; Combinatorics; Theoretical computer science; Random variable; Algorithm; Computer security; Statistics","score_opus":0.018029025700138392,"score_gpt":0.2544920531541213,"score_spread":0.23646302745398293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289713251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8848533,0.000025109326,0.05373834,0.018629879,0.011355797,0.0016387311,0.00040069496,0.0002997486,0.029058373],"genre_scores_gemma":[0.9961618,0.00001630335,0.000049391678,0.0033980047,0.00006242356,0.00018976581,0.000047766523,0.0000067073925,0.000067833855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976437,0.0002267701,0.0005996417,0.00017180563,0.0011652055,0.00019287398],"domain_scores_gemma":[0.9988066,0.0003096038,0.00031257363,0.00037504174,0.00015234358,0.00004384182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014990468,0.00015995537,0.00014069208,0.0002564097,0.0005412233,0.00021636904,0.0013757261,0.00003573789,0.00077607104],"category_scores_gemma":[0.00005682474,0.00010909816,0.00014587805,0.0003878585,0.00006936841,0.0012465313,0.00019027422,0.00036029093,0.000027605525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000372042,0.00014664493,0.000011100169,0.000012534757,0.000081819555,0.0000011743128,0.025042916,0.0017600256,0.0006602863,0.9692528,0.0015245768,0.0011340833],"study_design_scores_gemma":[0.005996433,0.0026313332,0.00018433682,0.00013254146,0.000058539084,0.00010224362,0.015796304,0.1307931,0.06748015,0.57324684,0.20238578,0.0011924073],"about_ca_topic_score_codex":0.000044069373,"about_ca_topic_score_gemma":0.0000033021583,"teacher_disagreement_score":0.39600596,"about_ca_system_score_codex":0.00018154115,"about_ca_system_score_gemma":0.00007631114,"threshold_uncertainty_score":0.84974337},"labels":[],"label_agreement":null},{"id":"W4291909978","doi":"10.1109/ecai54874.2022.9847520","title":"FPGA Implementation of SIMON-128 Cryptographic Algorithm Using Artix-7","year":2022,"lang":"en","type":"article","venue":"2022 14th International Conference on Electronics, Computers and Artificial Intelligence (ECAI)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Field-programmable gate array; Computer science; Cryptography; Block cipher; Context (archaeology); Embedded system; Block (permutation group theory); Computer architecture; Algorithm; Mathematics","score_opus":0.056425423162841694,"score_gpt":0.3383692220016601,"score_spread":0.28194379883881837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291909978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10605035,0.00017830388,0.88986015,0.0018007663,0.0013884144,0.00036775906,0.000105726176,0.00007494446,0.00017355809],"genre_scores_gemma":[0.98104274,0.00031437448,0.018037517,0.00036617022,0.00010906351,0.00003714523,0.00006904402,0.000015332387,0.0000085866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970667,0.00018045492,0.0007738606,0.0006690903,0.0008224827,0.0004874058],"domain_scores_gemma":[0.998718,0.00010741507,0.0003994255,0.0003615157,0.00030056684,0.00011302824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006392272,0.00026350093,0.0002800751,0.0006454499,0.0005650819,0.00029251218,0.0010773834,0.000044458608,0.00071847666],"category_scores_gemma":[0.000011258246,0.00029781807,0.00015699725,0.00081922376,0.0001421358,0.00040768023,0.0005494821,0.00042558514,0.0000037446687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021716882,0.00017973354,0.00013731045,0.0000045254124,0.00007684313,0.000006321311,0.0009446499,0.0012016752,0.001481042,0.6425862,0.000093632756,0.3532664],"study_design_scores_gemma":[0.00018864327,0.00084555545,0.00024255602,0.000016921782,0.000016014637,0.00002107547,0.003863517,0.8280743,0.0113285985,0.15252434,0.002462512,0.0004160122],"about_ca_topic_score_codex":0.00038730467,"about_ca_topic_score_gemma":0.00017987109,"teacher_disagreement_score":0.87499243,"about_ca_system_score_codex":0.00015880134,"about_ca_system_score_gemma":0.00028544996,"threshold_uncertainty_score":0.99994737},"labels":[],"label_agreement":null},{"id":"W4292072120","doi":"10.1109/host54066.2022.9839849","title":"WiP: Applicability of ISO Standard Side-Channel Leakage Tests to NIST Post-Quantum Cryptography","year":2022,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"NIST; Cryptography; Quantum cryptography; Side channel attack; Leakage (economics); Computer science; Computer security; Reliability engineering; Embedded system; Quantum; Engineering; Physics; Quantum information; Quantum mechanics","score_opus":0.013825517933542395,"score_gpt":0.27457516944433397,"score_spread":0.26074965151079155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292072120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39129454,0.000040770556,0.6025536,0.0025275096,0.00023943212,0.000718582,0.00029939882,0.00019923442,0.0021269084],"genre_scores_gemma":[0.978723,0.0000030578885,0.020078689,0.000982471,0.000016426684,0.00015284498,0.000019620042,0.000010200589,0.000013682045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779177,0.00011876315,0.00047590106,0.0005620253,0.00067299244,0.000378547],"domain_scores_gemma":[0.9984179,0.0001503901,0.0001181582,0.00091349136,0.0002295319,0.00017052279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007428195,0.00017433397,0.0002670993,0.00036453444,0.00050013955,0.00009688315,0.0009989274,0.000026678883,0.00038389227],"category_scores_gemma":[0.00003700445,0.00017238701,0.00020423926,0.0019466977,0.00009345564,0.00020560116,0.00095997076,0.00017946132,0.0000075683697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001130653,0.00078725716,0.0074703563,0.00006318881,0.00006869837,0.000013007047,0.005628805,0.00029997714,0.008959651,0.9521633,0.008615116,0.015817614],"study_design_scores_gemma":[0.0053899423,0.011250511,0.1883493,0.00003519689,0.000094873554,0.00010721808,0.022026803,0.019734986,0.01575775,0.5228166,0.21122299,0.0032138391],"about_ca_topic_score_codex":0.0005761031,"about_ca_topic_score_gemma":0.00033681432,"teacher_disagreement_score":0.58742845,"about_ca_system_score_codex":0.00004938133,"about_ca_system_score_gemma":0.00010223408,"threshold_uncertainty_score":0.70297384},"labels":[],"label_agreement":null},{"id":"W4292730044","doi":"10.1007/978-3-031-07021-1_3","title":"ADS-B Broadcast Authentication","year":2022,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Authentication (law); Computer network; Certificate; Message authentication code; Computer security; Broadcast domain; Transmission (telecommunications); Atomic broadcast; Broadcasting (networking); Cryptography; Telecommunications","score_opus":0.016555099645028083,"score_gpt":0.23860387616814552,"score_spread":0.22204877652311744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292730044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084348554,0.0016830512,0.7239214,0.00067512324,0.0021565384,0.0006216459,0.00004695214,0.00044217778,0.27036875],"genre_scores_gemma":[0.5963718,0.007579973,0.010941189,0.0027077403,0.0027944634,0.0005195205,0.002561717,0.00037933871,0.37614426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982702,0.000033697434,0.00038773104,0.00056898256,0.000424246,0.00031512196],"domain_scores_gemma":[0.99856395,0.000077026816,0.00027160166,0.0009118611,0.0000757755,0.00009979011],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023150332,0.0002761083,0.00026881543,0.00020305185,0.00036986943,0.00018272924,0.0009903904,0.00017517553,0.0019030937],"category_scores_gemma":[0.0000019232705,0.00030664046,0.00019846864,0.00014967173,0.00006553544,0.00020476963,0.00055014115,0.00056523085,0.000043191063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022788909,0.000015563633,0.000007688055,0.0000070674105,0.000035261877,0.000011788959,0.00023871785,0.00014273392,9.390471e-7,0.8391768,0.004824859,0.15553631],"study_design_scores_gemma":[0.00024352364,0.00004820892,0.00006516789,0.00003578543,0.00003504715,0.00002031217,0.000013481025,0.13547736,8.837389e-7,0.025958596,0.8376485,0.00045309434],"about_ca_topic_score_codex":0.00002818162,"about_ca_topic_score_gemma":0.000033298005,"teacher_disagreement_score":0.8328237,"about_ca_system_score_codex":0.00008320452,"about_ca_system_score_gemma":0.00006852396,"threshold_uncertainty_score":0.99993855},"labels":[],"label_agreement":null},{"id":"W4292730268","doi":"10.1007/978-3-031-07021-1_2","title":"Modern Cryptography for ADS-B Systems","year":2022,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Computer security; Computer science; Wireless; Telecommunications","score_opus":0.021413871149612164,"score_gpt":0.24379385763838993,"score_spread":0.22237998648877777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292730268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016641889,0.0037815652,0.9437296,0.000111620604,0.0023463692,0.0011403067,0.00014369511,0.0003035242,0.04842667],"genre_scores_gemma":[0.67729086,0.020100864,0.0793228,0.0051692864,0.013066711,0.011053599,0.008309642,0.0019005475,0.1837857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975152,0.000038554106,0.000582999,0.0008297637,0.0004929257,0.0005405412],"domain_scores_gemma":[0.99805564,0.00021068647,0.00039387424,0.0010412035,0.00014940239,0.00014918439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036535686,0.00044616713,0.00054184324,0.00038300935,0.0005645621,0.00034548558,0.0013046807,0.00029258494,0.00017034018],"category_scores_gemma":[0.0000019287925,0.00048181054,0.00052333425,0.00019357687,0.00007631556,0.00022464884,0.00045016065,0.00055837556,0.0000046325104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009930514,0.000020814048,0.000009820175,0.00004990468,0.00012955554,0.000009481696,0.00016560346,0.0036404675,6.378976e-7,0.95057726,0.010792438,0.034594096],"study_design_scores_gemma":[0.0004044638,0.00010706998,0.000005284623,0.000057744237,0.000045182045,0.000012594283,0.000014330547,0.417619,2.1844787e-7,0.052816983,0.5284079,0.00050929445],"about_ca_topic_score_codex":0.000044779947,"about_ca_topic_score_gemma":0.000046552777,"teacher_disagreement_score":0.8977603,"about_ca_system_score_codex":0.00007129867,"about_ca_system_score_gemma":0.00008448671,"threshold_uncertainty_score":0.99976337},"labels":[],"label_agreement":null},{"id":"W4295788736","doi":"10.1109/jiot.2022.3206667","title":"Dynamic Reduced-Round TLS Extension for Secure and Energy-Saving Communication of IoT Devices","year":2022,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Extension (predicate logic); Embedded system; Computer network; Computer security; Internet of Things","score_opus":0.019138908206757066,"score_gpt":0.2914797206513767,"score_spread":0.2723408124446196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295788736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8124944,0.00061625446,0.1859052,0.00056892366,0.00031714034,0.000050987896,0.0000050897365,0.0000102836575,0.000031729745],"genre_scores_gemma":[0.9574525,0.00006542366,0.04224901,0.00016490066,0.000010535611,0.000006457776,0.0000033439678,0.0000057714087,0.000042096093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898803,0.000104217805,0.00040423358,0.00013539288,0.0002476777,0.00012044389],"domain_scores_gemma":[0.99889064,0.00014136823,0.0005269191,0.00022537417,0.00017571253,0.0000399648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008050106,0.000076668475,0.00015112593,0.00019801423,0.00022966793,0.00009710716,0.0006776102,0.000022482489,0.00001878199],"category_scores_gemma":[0.00002075181,0.00007446187,0.00008767863,0.00015612348,0.00004774258,0.00034548886,0.00027231334,0.00019494965,4.4913392e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036273434,0.0010003723,0.003024204,0.0003901281,0.00063811254,0.000023787088,0.13758847,0.0011567486,0.2726867,0.23985495,0.009917269,0.33335656],"study_design_scores_gemma":[0.0032022395,0.0022655462,0.007891969,0.00069017947,0.00014774225,0.002180653,0.006936158,0.78141177,0.021680273,0.15346716,0.0193794,0.00074690947],"about_ca_topic_score_codex":0.00024360904,"about_ca_topic_score_gemma":0.00006477335,"teacher_disagreement_score":0.780255,"about_ca_system_score_codex":0.000042416,"about_ca_system_score_gemma":0.00003765104,"threshold_uncertainty_score":0.30364668},"labels":[],"label_agreement":null},{"id":"W4296437373","doi":"10.1109/tvlsi.2022.3203307","title":"Design and Implementation of a Secure RISC-V Microprocessor","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Microprocessor; NIST; Side channel attack; Power analysis; Embedded system; Reduced instruction set computing; Cryptography; Random number generation; Encryption; Advanced Encryption Standard; CMOS; Key (lock); Computer hardware; Instruction set; Operating system; Computer security; Engineering; Electronic engineering","score_opus":0.014063146294325013,"score_gpt":0.2701678365108595,"score_spread":0.2561046902165345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296437373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08098772,0.00012661364,0.91664934,0.00019912185,0.00084813876,0.00081591855,0.00024195884,0.000095766205,0.00003539562],"genre_scores_gemma":[0.99296147,0.000037794733,0.0062569384,0.000092909104,0.00002175841,0.00049582944,0.000025765527,0.000015242678,0.00009231332],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977904,0.00038650536,0.00059839914,0.00043413855,0.0005152538,0.00027527913],"domain_scores_gemma":[0.99899876,0.00011582667,0.00025430493,0.00036711042,0.00018337287,0.000080596095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008030084,0.00019854214,0.0002492792,0.0004481506,0.0007389973,0.00016601362,0.00034197894,0.000055738496,0.00020230551],"category_scores_gemma":[0.0000018299066,0.00019710891,0.00011044039,0.000863232,0.00003962596,0.00053922954,0.000009219031,0.00027495413,0.000006238931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010751421,0.0077878037,0.0020487562,0.0015046182,0.0016470586,0.000076246535,0.23745367,0.16298425,0.23403955,0.096284434,0.021827584,0.23327088],"study_design_scores_gemma":[0.007307225,0.0031141082,0.0009368276,0.00017576228,0.00024007836,0.00039630127,0.08953007,0.6847154,0.1950823,0.001890175,0.015030927,0.0015808122],"about_ca_topic_score_codex":0.00037345922,"about_ca_topic_score_gemma":0.00036449707,"teacher_disagreement_score":0.9119737,"about_ca_system_score_codex":0.0001115904,"about_ca_system_score_gemma":0.00011850601,"threshold_uncertainty_score":0.8037868},"labels":[],"label_agreement":null},{"id":"W4307203669","doi":"10.1145/3569455","title":"Hardware Optimizations of Fruit-80 Stream Cipher: Smaller than Grain","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Field-programmable gate array; Parallel computing; Throughput; Stream cipher; Key (lock); Lookup table; Cipher; Embedded system; Computer architecture; Computer hardware; Cryptography; Algorithm; Encryption; Operating system","score_opus":0.021814342786676332,"score_gpt":0.24983134176268365,"score_spread":0.22801699897600733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307203669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08867171,0.0010293027,0.90110254,0.0043636723,0.0010855421,0.0008862151,0.00030338287,0.00060332584,0.0019543092],"genre_scores_gemma":[0.9945864,0.00011868754,0.0042757927,0.00004588403,0.000005708144,0.00038715877,0.000014619087,0.000010585819,0.00055513845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866474,0.000121041194,0.00039338504,0.00038078192,0.00018669918,0.00025336788],"domain_scores_gemma":[0.9987345,0.000104968436,0.00014932718,0.00087071577,0.00008826183,0.000052266223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000314519,0.00014919169,0.00025683272,0.0008757112,0.0008541966,0.000053071122,0.000785402,0.00011185354,0.0002955093],"category_scores_gemma":[0.000015105285,0.00015451713,0.00008250004,0.0014783976,0.00011071542,0.00016804779,0.000027261436,0.00034663873,0.0000036553374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006852458,0.001546482,0.0058384906,0.00022505656,0.0008139215,0.00004056078,0.0045885793,0.042632453,0.001806758,0.748281,0.002383229,0.19177495],"study_design_scores_gemma":[0.015764734,0.010023267,0.007941707,0.00058974547,0.0006637776,0.0033031476,0.11999429,0.31740212,0.028268972,0.19521801,0.29517576,0.0056544803],"about_ca_topic_score_codex":0.0002113764,"about_ca_topic_score_gemma":0.000096750715,"teacher_disagreement_score":0.9059147,"about_ca_system_score_codex":0.00003432474,"about_ca_system_score_gemma":0.00006215789,"threshold_uncertainty_score":0.6569876},"labels":[],"label_agreement":null},{"id":"W4311131193","doi":"10.36948/ijfmr.2022.v04i06.1124","title":"A Hybrid Approach for a Secured Information Security Using Modified Encryption Technique","year":2022,"lang":"en","type":"article","venue":"International Journal For Multidisciplinary Research","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Computer science; Encryption; Plaintext; Block cipher mode of operation; Cipher; Running key cipher; Advanced Encryption Standard; Block cipher; Ciphertext; Cryptography; Computer security","score_opus":0.12031018621084406,"score_gpt":0.4416062047667229,"score_spread":0.32129601855587886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311131193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053969894,0.000031216812,0.9415016,0.0012892548,0.0008457265,0.0017846902,0.00037357814,0.00005086935,0.0001531606],"genre_scores_gemma":[0.84009814,0.000012691267,0.1577242,0.000047224567,0.00023505623,0.0015217975,0.00032922873,0.0000119399365,0.000019703903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694234,0.0002809137,0.0005592771,0.00029751836,0.0014503209,0.00046965474],"domain_scores_gemma":[0.9974842,0.00027619215,0.00024387384,0.00025871999,0.0016092245,0.0001277631],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0046637445,0.00013834733,0.00014840333,0.0012185888,0.0023439378,0.0006179975,0.0016812045,0.00004195453,0.00003101499],"category_scores_gemma":[0.00015136853,0.00014134133,0.00024109134,0.00047049587,0.000066078566,0.0017219004,0.0010882103,0.0006420989,8.7052865e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037938415,0.003394399,0.00063989515,0.0002974934,0.00076955644,0.000082795596,0.036644414,0.07222823,0.024278173,0.78882015,0.025329197,0.043721877],"study_design_scores_gemma":[0.0015754129,0.00039013667,0.00006463824,0.000010040711,0.0000057118864,0.0005844768,0.0018389337,0.8655579,0.0006775577,0.12327317,0.0058518983,0.00017013072],"about_ca_topic_score_codex":0.00005861555,"about_ca_topic_score_gemma":0.000003162149,"teacher_disagreement_score":0.79332966,"about_ca_system_score_codex":0.00050295057,"about_ca_system_score_gemma":0.00036183855,"threshold_uncertainty_score":0.9989549},"labels":[],"label_agreement":null},{"id":"W4313829147","doi":"10.1186/s13634-022-00963-3","title":"A reconfigurable and compact subpipelined architecture for AES encryption and decryption","year":2023,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Advanced Encryption Standard; Encryption; Key (lock); AES implementations; Cryptography; Computer hardware; Embedded system; Key size; Throughput; Public-key cryptography; Wireless; Computer network; Algorithm; Telecommunications; Operating system","score_opus":0.026170535895119102,"score_gpt":0.32895619395037423,"score_spread":0.30278565805525515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313829147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3481893,0.002553127,0.64708215,0.0015987541,0.00013096108,0.00021795063,0.000003948189,0.000073250674,0.00015052293],"genre_scores_gemma":[0.9857636,0.001129285,0.0128189055,0.0001707014,0.00008829192,0.000008138883,0.0000043648797,0.000008314233,0.000008380422],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989333,0.00006764778,0.00030365738,0.0002523064,0.0001816943,0.0002614044],"domain_scores_gemma":[0.9993578,0.00022964933,0.00017672803,0.000066175024,0.00007939908,0.000090233974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007176712,0.00012661715,0.00015646155,0.00040246482,0.00039658992,0.00037933732,0.00015014199,0.000033523404,0.000005661817],"category_scores_gemma":[0.000052482632,0.00010652221,0.000034504108,0.0005622105,0.000051122766,0.0010564685,0.000016971924,0.00023157326,0.0000010015887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009565032,0.000035773955,0.0027251677,0.00010465287,0.0000048980855,0.000014744467,0.0017082397,0.0025443758,0.0027425243,0.004418216,0.00008150203,0.98552424],"study_design_scores_gemma":[0.0045283097,0.0013573779,0.03220798,0.0011617088,0.000022352113,0.0005870383,0.0019433576,0.3605207,0.0022412518,0.5718667,0.022757584,0.0008056942],"about_ca_topic_score_codex":0.0000018624347,"about_ca_topic_score_gemma":0.00002060473,"teacher_disagreement_score":0.98471856,"about_ca_system_score_codex":0.00002470338,"about_ca_system_score_gemma":0.000040882132,"threshold_uncertainty_score":0.43438497},"labels":[],"label_agreement":null},{"id":"W4320027508","doi":"10.53759/aist/978-9914-9946-1-2_28","title":"Pathway For a More Discrete Fintech Application","year":2022,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Stream cipher; Hash function; Computer science; Cryptanalysis; Cipher; Cryptography; Advanced Encryption Standard; Process (computing); Block cipher; Encryption; Secure Hash Algorithm; Computer security; Cryptographic hash function; SHA-2; Programming language","score_opus":0.01401475890342778,"score_gpt":0.2890564836853447,"score_spread":0.2750417247819169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320027508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052615567,0.000010484603,0.9907216,0.0029802034,0.00006099352,0.0003255402,0.000027303638,0.00009272528,0.0005196268],"genre_scores_gemma":[0.93363434,7.1872154e-7,0.06477713,0.00056758075,0.00001273583,0.0008474387,0.000035451827,0.0000028726834,0.00012171856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994969,0.000012142203,0.00009378719,0.0001710255,0.000120671786,0.00010546836],"domain_scores_gemma":[0.9996415,0.00003186788,0.000028956501,0.00025267608,0.00002332156,0.000021726017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001608537,0.000039378603,0.00004046461,0.00005513393,0.00029451775,0.000037369704,0.0003483706,0.0000062399004,0.00007068016],"category_scores_gemma":[0.0000034751179,0.00003673301,0.000046555102,0.00028578186,0.000010568154,0.00009052104,0.0001956205,0.000039302657,0.0000017928589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002154958,0.000029606857,0.00015773001,0.0000029749312,0.00000387632,2.3618567e-7,0.000652612,0.000026978192,0.0006833409,0.9480241,0.0023563486,0.048060052],"study_design_scores_gemma":[0.0006381431,0.00021371506,0.0012772626,7.5534416e-7,0.0000040212803,0.000011265282,0.0012714698,0.33188024,0.0023037784,0.10290073,0.5592651,0.00023357138],"about_ca_topic_score_codex":0.000043583237,"about_ca_topic_score_gemma":0.000021977636,"teacher_disagreement_score":0.9283728,"about_ca_system_score_codex":0.00001675675,"about_ca_system_score_gemma":0.000024409259,"threshold_uncertainty_score":0.22652222},"labels":[],"label_agreement":null},{"id":"W4323926098","doi":"10.59035/uwcb7557","title":"Side channel attack performance of correlation power analysis method in noise","year":2023,"lang":"en","type":"article","venue":"International Journal on Information Technologies and Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mitel (Canada)","funders":"","keywords":"Side channel attack; Power analysis; Encryption; Computer science; Advanced Encryption Standard; Noise (video); Channel (broadcasting); Power (physics); Software; Computer security; Cryptography; Embedded system; Electronic engineering; Telecommunications; Engineering; Operating system; Artificial intelligence","score_opus":0.016013027348032324,"score_gpt":0.30936473843738305,"score_spread":0.2933517110893507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323926098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85781443,0.00002147135,0.13896964,0.0020778626,0.00035041236,0.000100727644,0.000021650603,0.00016840674,0.00047541014],"genre_scores_gemma":[0.99677676,0.00059153774,0.002480884,0.00010635278,0.000007038809,0.000008067178,0.000024440056,0.000001721487,0.0000031795632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987269,0.00003187942,0.0005480821,0.00010726388,0.00043602593,0.00014985657],"domain_scores_gemma":[0.99907684,0.000106096966,0.00034598127,0.00016536067,0.00027965775,0.000026089296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007227981,0.00009546077,0.0001598876,0.0022416152,0.00009283537,0.00016198446,0.0005328625,0.00008431714,0.000011356651],"category_scores_gemma":[0.00012830402,0.00008411797,0.0000885651,0.0016947094,0.00004082911,0.0016120075,0.00020168693,0.00025848657,0.000009198713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024034455,0.00023838361,0.08213796,0.000067295405,0.00093039457,0.00003688167,0.02217002,0.089898854,0.000104687104,0.4004492,0.0020420714,0.40168393],"study_design_scores_gemma":[0.00070548814,0.00018739534,0.097885534,0.000036356887,0.000015818368,0.000034181434,0.002769473,0.8810298,0.0005314383,0.014225821,0.0024147613,0.000163972],"about_ca_topic_score_codex":0.000021741547,"about_ca_topic_score_gemma":0.000017532253,"teacher_disagreement_score":0.7911309,"about_ca_system_score_codex":0.000066451765,"about_ca_system_score_gemma":0.000031680334,"threshold_uncertainty_score":0.34302315},"labels":[],"label_agreement":null},{"id":"W4360778198","doi":"10.5267/j.ijdns.2023.2.001","title":"A novel security analysis for a new NTRU variant with additional private key","year":2023,"lang":"en","type":"article","venue":"International Journal of Data and Network Science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"NTRU; Computer security; Computer science; Key (lock); Public-key cryptography; Encryption","score_opus":0.044464432033198144,"score_gpt":0.3313834671454451,"score_spread":0.2869190351122469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360778198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013722182,0.00002807576,0.98250216,0.002393908,0.0003382967,0.000072015384,0.000893372,0.000016117243,0.00003388271],"genre_scores_gemma":[0.54556507,0.00012714381,0.45272118,0.00043674506,0.0007037829,0.00000496793,0.0004222911,0.00000459814,0.000014229197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983835,0.000013106215,0.00029786563,0.00029393545,0.0007904731,0.00022111925],"domain_scores_gemma":[0.9985793,0.00026620654,0.00027659495,0.00029734004,0.00043112735,0.00014942708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012977273,0.000078522025,0.0001381489,0.0005056998,0.00021142964,0.0004771456,0.0023229937,0.00001584933,0.00006184604],"category_scores_gemma":[0.0001015263,0.000059999446,0.00005368775,0.0024442954,0.00014201702,0.0018541177,0.00058376236,0.00008507088,0.0000011096902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025853762,0.00027542116,0.012507518,0.0000107883325,0.0020240766,0.00015255297,0.0025039061,0.007370174,0.00043192672,0.80163425,0.11754491,0.055285968],"study_design_scores_gemma":[0.0020207919,0.00030088724,0.062327582,0.00008566682,0.00017266619,0.0005943515,0.000116922085,0.75626385,0.000033495035,0.06411473,0.11366698,0.00030209468],"about_ca_topic_score_codex":0.00002019937,"about_ca_topic_score_gemma":0.00009618081,"teacher_disagreement_score":0.7488937,"about_ca_system_score_codex":0.000021935175,"about_ca_system_score_gemma":0.000376037,"threshold_uncertainty_score":0.4601126},"labels":[],"label_agreement":null},{"id":"W4362709249","doi":"10.1109/cis58238.2022.00088","title":"A 32-bit efficient subpipelined architecture for AES encryption and decryption","year":2022,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Encryption; Computer science; Advanced Encryption Standard; Cryptography; Throughput; Field (mathematics); Arithmetic; Computer hardware; Embedded system; Algorithm; Operating system; Mathematics","score_opus":0.012662318168938303,"score_gpt":0.25640203797259004,"score_spread":0.24373971980365172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362709249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25488722,0.00005131587,0.7430755,0.0013698806,0.00012711776,0.00031007375,0.000012439045,0.00008025381,0.00008618727],"genre_scores_gemma":[0.92931676,0.000005305364,0.070022985,0.00038519266,0.000027401715,0.00017956391,0.000024393685,0.0000044294484,0.00003397237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914724,0.00004879208,0.00015926902,0.00027959613,0.00018659285,0.0001784985],"domain_scores_gemma":[0.99958116,0.000082010265,0.000048839203,0.00019514369,0.000042210104,0.000050628274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003481639,0.00008070704,0.00007800018,0.0001614428,0.0004943077,0.00009236714,0.00020740768,0.000015467722,0.00008757663],"category_scores_gemma":[0.000013883095,0.000074388845,0.000055189874,0.00033375845,0.00002111493,0.00006639191,0.00020020035,0.00007629661,0.0000010910542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004300281,0.00016660972,0.0006678901,0.00002713975,0.000017209648,0.0000019478505,0.00400824,0.0035328923,0.0033498479,0.8532398,0.0018263155,0.13311915],"study_design_scores_gemma":[0.0023289428,0.00072216685,0.0064148037,0.0000055795044,0.000022831227,0.000059078717,0.0011733114,0.785659,0.00076599995,0.11097845,0.091401026,0.00046878168],"about_ca_topic_score_codex":0.00004542428,"about_ca_topic_score_gemma":0.000062432024,"teacher_disagreement_score":0.7821261,"about_ca_system_score_codex":0.000024812942,"about_ca_system_score_gemma":0.0000266776,"threshold_uncertainty_score":0.38018653},"labels":[],"label_agreement":null},{"id":"W4364361157","doi":"10.36227/techrxiv.22583746","title":"Real-Time Switched Capacitor Based Power Side-Channel Attack Detection","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Khalifa University of Science, Technology and Research","keywords":"Computer science; Cryptography; Capacitor; Power (physics); Side channel attack; Channel (broadcasting); Embedded system; Electronic engineering; Real-time computing; Voltage; Electrical engineering; Engineering; Telecommunications; Algorithm; Physics","score_opus":0.0476163177462973,"score_gpt":0.3025004339975376,"score_spread":0.2548841162512403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364361157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07026346,0.0000069042303,0.9218602,0.0013042117,0.002581786,0.00061889394,0.000050160186,0.0014392055,0.0018751771],"genre_scores_gemma":[0.97025704,0.000023160477,0.02835123,0.00020723537,0.00017570138,0.00018159137,0.00008926721,0.00004344914,0.000671344],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997525,0.00011902327,0.00049795053,0.0009238903,0.000497554,0.00043662533],"domain_scores_gemma":[0.9979252,0.00019186766,0.00022072553,0.0012812781,0.00022687385,0.00015403291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005760245,0.0003399117,0.00033193346,0.00050387724,0.00021995232,0.0004146372,0.0009151657,0.00028238326,0.00023262213],"category_scores_gemma":[0.000048894417,0.000332965,0.00029944628,0.00064592785,0.00004445889,0.00019762648,0.0008501457,0.00042442855,0.00038863427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053469115,0.0051626917,0.003542584,0.0035305042,0.0042945277,0.0010959767,0.0542829,0.034897935,0.2967334,0.11388298,0.3389849,0.1430569],"study_design_scores_gemma":[0.0010690762,0.00024868496,0.008582903,0.000109239874,0.00005634189,0.000009426286,0.00034925796,0.95434576,0.0077209435,0.02397483,0.0020570345,0.0014764719],"about_ca_topic_score_codex":0.0016013992,"about_ca_topic_score_gemma":0.0006777957,"teacher_disagreement_score":0.91944784,"about_ca_system_score_codex":0.00011077163,"about_ca_system_score_gemma":0.00018982959,"threshold_uncertainty_score":0.99991226},"labels":[],"label_agreement":null},{"id":"W4364376037","doi":"10.36227/techrxiv.22583746.v1","title":"Real-Time Switched Capacitor Based Power Side-Channel Attack Detection","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Khalifa University of Science, Technology and Research","keywords":"Computer science; Cryptography; Capacitor; Side channel attack; Power (physics); Channel (broadcasting); Embedded system; Real-time computing; Key (lock); Electronic engineering; Voltage; Electrical engineering; Telecommunications; Engineering; Algorithm; Computer security; Physics","score_opus":0.0476163177462973,"score_gpt":0.3025004339975376,"score_spread":0.2548841162512403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364376037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07026346,0.0000069042303,0.9218602,0.0013042117,0.002581786,0.00061889394,0.000050160186,0.0014392055,0.0018751771],"genre_scores_gemma":[0.97025704,0.000023160477,0.02835123,0.00020723537,0.00017570138,0.00018159137,0.00008926721,0.00004344914,0.000671344],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997525,0.00011902327,0.00049795053,0.0009238903,0.000497554,0.00043662533],"domain_scores_gemma":[0.9979252,0.00019186766,0.00022072553,0.0012812781,0.00022687385,0.00015403291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005760245,0.0003399117,0.00033193346,0.00050387724,0.00021995232,0.0004146372,0.0009151657,0.00028238326,0.00023262213],"category_scores_gemma":[0.000048894417,0.000332965,0.00029944628,0.00064592785,0.00004445889,0.00019762648,0.0008501457,0.00042442855,0.00038863427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053469115,0.0051626917,0.003542584,0.0035305042,0.0042945277,0.0010959767,0.0542829,0.034897935,0.2967334,0.11388298,0.3389849,0.1430569],"study_design_scores_gemma":[0.0010690762,0.00024868496,0.008582903,0.000109239874,0.00005634189,0.000009426286,0.00034925796,0.95434576,0.0077209435,0.02397483,0.0020570345,0.0014764719],"about_ca_topic_score_codex":0.0016013992,"about_ca_topic_score_gemma":0.0006777957,"teacher_disagreement_score":0.91944784,"about_ca_system_score_codex":0.00011077163,"about_ca_system_score_gemma":0.00018982959,"threshold_uncertainty_score":0.99991226},"labels":[],"label_agreement":null},{"id":"W4365934985","doi":"10.1007/978-3-031-30545-0","title":"Advances in Cryptology – EUROCRYPT 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Santa Barbara; University of Haifa; Institut Universitaire de France; Aalto-Yliopisto; KU Leuven; Technische Universiteit Eindhoven; University of Melbourne; University of California, San Diego; Bar-Ilan University; Durham University; Universiteit Leiden; Université du Luxembourg; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; University of Edinburgh; Johns Hopkins University; Florida State University; Microsoft Research; Indian Institute of Science; York University; Intel Corporation","keywords":"Computer science; Cryptography; Theoretical computer science; Algorithm","score_opus":0.01673783775470455,"score_gpt":0.29470404848705056,"score_spread":0.277966210732346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365934985","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011020561,0.0009275907,0.99199843,0.000862649,0.0029554674,0.00038719882,0.000009427666,0.00020349298,0.0025455467],"genre_scores_gemma":[0.05202079,0.0035155697,0.9357518,0.0052305316,0.0016575616,0.00021339055,0.000105976185,0.00016109405,0.0013432777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957897,0.00010630112,0.0006706146,0.0016135211,0.00084021746,0.0009796433],"domain_scores_gemma":[0.9974532,0.0008686469,0.00023813646,0.0011541474,0.00015153135,0.00013430222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010869439,0.00044033548,0.00055157894,0.0022604403,0.00022281703,0.00038544534,0.0035776934,0.00025047996,0.000024266701],"category_scores_gemma":[0.00014571234,0.00043150116,0.00012123049,0.0044912356,0.00061164296,0.00093524944,0.0015021119,0.0008777388,0.00010048843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052368546,0.00006916221,0.000710111,0.00008539602,0.000005825393,0.00034445495,0.0014924296,0.013544646,0.000024913803,0.05731814,0.00054341834,0.9258563],"study_design_scores_gemma":[0.0005471246,0.00020237124,0.0016641215,0.00027861082,0.000004297468,0.00005704951,0.0000012100359,0.2113777,0.000079900325,0.7687424,0.01622051,0.00082475034],"about_ca_topic_score_codex":0.000041254065,"about_ca_topic_score_gemma":0.002203059,"teacher_disagreement_score":0.92503154,"about_ca_system_score_codex":0.00029955685,"about_ca_system_score_gemma":0.0009986486,"threshold_uncertainty_score":0.9998137},"labels":[],"label_agreement":null},{"id":"W4366580988","doi":"10.1038/s41598-023-32461-3","title":"Optimization of the multivariate polynomial public key for quantum safe digital signature","year":2023,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Univariate; Polynomial; Public-key cryptography; Mathematics; Key (lock); Discrete mathematics; Multivariate statistics; Computer science; Encryption; Statistics; Computer security; Mathematical analysis","score_opus":0.02618080632098485,"score_gpt":0.27310526618473807,"score_spread":0.24692445986375322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366580988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18677908,0.00003490493,0.7904911,0.0031248936,0.017594429,0.0011684181,0.00006421507,0.0002493815,0.0004935843],"genre_scores_gemma":[0.99372077,7.305496e-7,0.005738551,0.000019942525,0.000035621913,0.000026928368,0.00009656616,0.0000062280124,0.00035465462],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984391,0.000028124461,0.0004024407,0.00045621963,0.00041221766,0.00026193156],"domain_scores_gemma":[0.9985076,0.00007083874,0.00030477988,0.00079510483,0.0002651722,0.000056509223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009965808,0.00008627453,0.00010420342,0.00023578011,0.0004915603,0.00078449165,0.00044742905,0.000045874265,0.00001606256],"category_scores_gemma":[0.00028543227,0.00006248719,0.00014578033,0.0020237032,0.0001315791,0.00065546366,0.00025803642,0.00006126527,0.0000023261719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004429916,0.0009708072,0.0238438,0.00023351076,0.0002589296,0.00011108872,0.018367209,0.06389673,0.03824298,0.28548557,0.51319695,0.055348136],"study_design_scores_gemma":[0.000670378,0.00006937564,0.006927267,0.00003394197,0.000018201508,0.000057784317,0.00038658894,0.80470675,0.0050540874,0.054825135,0.1268448,0.00040570163],"about_ca_topic_score_codex":0.00001296796,"about_ca_topic_score_gemma":0.000011949601,"teacher_disagreement_score":0.8069417,"about_ca_system_score_codex":0.00001721672,"about_ca_system_score_gemma":0.00018919019,"threshold_uncertainty_score":0.75648713},"labels":[],"label_agreement":null},{"id":"W4381512968","doi":"10.21203/rs.3.rs-2279231/v1","title":"A SAT Solver + Computer Algebra Attack on the Minimum Kochen-Specker Problem","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Waterloo","funders":"","keywords":"Kochen–Specker theorem; Complementarity (molecular biology); Solver; Dimension (graph theory); Cryptography; Automated theorem proving; Computer science; Mathematics; Discrete mathematics; Algebra over a field; Theoretical computer science; Quantum; Algorithm; Pure mathematics; Quantum mechanics; Mathematical optimization; Physics","score_opus":0.2215221344947306,"score_gpt":0.42982766458598093,"score_spread":0.20830553009125033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381512968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43814674,0.0008731826,0.36573416,0.16311473,0.004796623,0.016010085,0.00077817903,0.002646085,0.007900215],"genre_scores_gemma":[0.9565686,0.0006023963,0.035077244,0.0014583821,0.0017429052,0.0020683222,0.00049060513,0.00016275625,0.0018287685],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938857,0.0009090054,0.000508067,0.0012889307,0.0022698725,0.0011384482],"domain_scores_gemma":[0.9951378,0.0014038335,0.0001333066,0.0024308765,0.0006674386,0.00022671802],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0035312902,0.00037484636,0.00034933834,0.00074185245,0.0007942299,0.0014867814,0.0031479264,0.00026758315,0.00025752175],"category_scores_gemma":[0.00008553091,0.0002664642,0.0003557252,0.0015330286,0.0002819531,0.0001700649,0.006313477,0.002278278,0.0012158433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031009346,0.00044862958,0.0018157811,0.0006109277,0.000254289,0.0001499839,0.009319876,0.0004165721,0.00004084442,0.39781567,0.57589346,0.01320298],"study_design_scores_gemma":[0.002257215,0.001858887,0.07003988,0.0031620858,0.000043293992,0.000029057492,0.0024341824,0.21398604,0.00042680567,0.4553539,0.24773963,0.0026690313],"about_ca_topic_score_codex":0.00024161507,"about_ca_topic_score_gemma":0.00027941942,"teacher_disagreement_score":0.5184219,"about_ca_system_score_codex":0.00018769852,"about_ca_system_score_gemma":0.00043165882,"threshold_uncertainty_score":0.9999788},"labels":[],"label_agreement":null},{"id":"W4381789422","doi":"10.1007/978-3-031-37679-5_5","title":"A Side-Channel Attack Against Classic McEliece When Loading the Goppa Polynomial","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche; Impact Fund; Silicon Valley Community Foundation","keywords":"McEliece cryptosystem; NIST; Computer science; Cryptography; Post-quantum cryptography; Polynomial; Cryptosystem; Theoretical computer science; Public-key cryptography; Discrete mathematics; Algorithm; Arithmetic; Mathematics; Computer security; Encryption; Speech recognition","score_opus":0.04166387649255496,"score_gpt":0.27992201413202233,"score_spread":0.23825813763946738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381789422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038362946,0.0002225088,0.98739207,0.004682994,0.003443728,0.0005905987,0.000020988395,0.0003036565,0.0029598],"genre_scores_gemma":[0.72827333,0.00054329465,0.24442911,0.019071357,0.0043631094,0.00014552184,0.00007993119,0.00028372512,0.002810629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954165,0.000068247864,0.0007112006,0.0016147178,0.0012053213,0.000983992],"domain_scores_gemma":[0.99653757,0.0009600925,0.0003603312,0.0017274985,0.0002158633,0.00019862856],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013907119,0.0006022512,0.0005034528,0.0009912543,0.00088227156,0.0012381006,0.00456173,0.00027621016,0.000019443998],"category_scores_gemma":[0.00009566197,0.00047075335,0.00027018416,0.0011679246,0.00089626334,0.0006036942,0.002269514,0.0010960312,0.0001234324],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013602956,0.00006508814,0.00005921026,0.00007281167,0.000077549994,0.00023961382,0.010883283,0.031155244,0.000217478,0.043638892,0.003742867,0.9098344],"study_design_scores_gemma":[0.00067215046,0.00021237906,0.0002481261,0.00043804536,0.000024617757,0.00007573647,0.000005640549,0.8029437,0.00033208585,0.17546214,0.018202912,0.0013824651],"about_ca_topic_score_codex":0.000068569505,"about_ca_topic_score_gemma":0.00073286565,"teacher_disagreement_score":0.9084519,"about_ca_system_score_codex":0.00026227455,"about_ca_system_score_gemma":0.0005704244,"threshold_uncertainty_score":0.9997987},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05966546207419866,"score_gpt":0.2679069968707073,"score_spread":0.20824153479650864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385237357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44012797,0.0000034141622,0.557019,0.0002457123,0.0019318016,0.00013044251,0.000007501916,0.0005041081,0.0000300573],"genre_scores_gemma":[0.9856839,0.000060732484,0.013737428,0.00027000767,0.000072228024,0.00012679855,0.0000039801375,0.000020033931,0.00002486515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981291,0.000056998986,0.00036330716,0.0005316738,0.00042161572,0.000497257],"domain_scores_gemma":[0.9989693,0.00018244307,0.00007084306,0.00055810635,0.00007787076,0.00014141828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029955557,0.00022294815,0.00019801292,0.0006277563,0.0006115414,0.0002532914,0.000604027,0.000048570288,0.00003361525],"category_scores_gemma":[0.0000015478181,0.00022842055,0.00012657378,0.0019417849,0.000045625315,0.00051620445,0.000013351824,0.0002563446,0.00018045756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021068869,0.0002578721,0.00004733634,0.000038683,0.0000883384,0.00003281528,0.0053240852,0.7526916,0.0010159377,0.0018405527,0.0010634129,0.2375783],"study_design_scores_gemma":[0.0010361547,0.00020957195,0.0017841764,0.00008758215,0.000016714097,0.000014819708,0.00024760695,0.9814105,0.013048011,0.00008506652,0.0015937588,0.0004660641],"about_ca_topic_score_codex":0.000041126183,"about_ca_topic_score_gemma":0.0000105634335,"teacher_disagreement_score":0.54555595,"about_ca_system_score_codex":0.00006841527,"about_ca_system_score_gemma":0.000054665034,"threshold_uncertainty_score":0.931472},"labels":[],"label_agreement":null},{"id":"W4385422577","doi":"10.1007/s13389-023-00329-x","title":"Probabilistic root finding in code-based cryptography","year":2023,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"McEliece cryptosystem; Probabilistic logic; Cryptosystem; Computer science; Cryptography; Timing attack; Algorithm; Theoretical computer science; Finite field; Code (set theory); Side channel attack; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.019207484078719837,"score_gpt":0.2681746827172897,"score_spread":0.2489671986385699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385422577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49023315,0.00018807396,0.50841147,0.00037966302,0.00047357625,0.00013288941,0.0000028790255,0.00014115134,0.000037165617],"genre_scores_gemma":[0.9682087,0.000068374444,0.031566158,0.00004241263,0.00007387951,0.000016771628,0.000002458613,0.000020700714,5.6778515e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771214,0.000058666676,0.0008916226,0.00024504878,0.00058336416,0.0005091641],"domain_scores_gemma":[0.9986383,0.0003571217,0.00030185207,0.00034712817,0.0001809144,0.00017471053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014734777,0.00022068364,0.000372979,0.0040559275,0.000087650886,0.00016969789,0.0008019366,0.00008724595,0.000012834574],"category_scores_gemma":[0.00015260956,0.00021208459,0.00035687868,0.00688521,0.00004259432,0.00055648474,0.0000624024,0.00045729394,0.0000037473867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005026633,0.00042839602,0.08562416,0.00040838096,0.00021945141,0.00061989663,0.0021628747,0.30851176,0.0064658965,0.58613753,0.00090930867,0.008462067],"study_design_scores_gemma":[0.0041608815,0.0006871506,0.42548814,0.00071424263,0.00005683249,0.00012765915,0.00021218589,0.5159827,0.0008351434,0.044026453,0.006679244,0.0010293844],"about_ca_topic_score_codex":0.000008671461,"about_ca_topic_score_gemma":0.000048709262,"teacher_disagreement_score":0.5421111,"about_ca_system_score_codex":0.000037615315,"about_ca_system_score_gemma":0.000100489815,"threshold_uncertainty_score":0.8648559},"labels":[],"label_agreement":null},{"id":"W4385631900","doi":"10.4236/jis.2023.144014","title":"Hardware Security for IoT in the Quantum Era: Survey and Challenges","year":2023,"lang":"en","type":"article","venue":"Journal of Information Security","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"International Development Research Centre; Styrelsen för Internationellt Utvecklingssamarbete","keywords":"Computer science; Standardization; NIST; Computer security; Cryptography; Internet of Things; Process (computing); Implementation; Software engineering","score_opus":0.05911012603335524,"score_gpt":0.3114675430476228,"score_spread":0.25235741701426756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385631900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9480065,0.0010081392,0.030804656,0.018401925,0.00070835755,0.0006181478,0.00013407541,0.000056479083,0.0002617221],"genre_scores_gemma":[0.99731207,0.0015021735,0.00079125684,0.00031788956,0.00004458317,0.000011343367,0.000018082677,0.0000022373486,3.5662873e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99854547,0.00018649593,0.0006235899,0.000076212884,0.0003724135,0.00019581604],"domain_scores_gemma":[0.9984586,0.000546886,0.0003756789,0.00019174715,0.0003726227,0.00005444892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004817814,0.00009502547,0.00017614683,0.0004168491,0.00015636903,0.00023894278,0.0005014198,0.000052914675,0.0000035123257],"category_scores_gemma":[0.0003178592,0.0000678949,0.000080589525,0.00068514544,0.00003197643,0.0014932889,0.00008488134,0.00023270704,0.0000037010896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094099894,0.00015012847,0.0069604013,0.00036370842,0.00005902794,0.000010480241,0.18378551,0.00005757595,0.000003942789,0.7517065,0.02375113,0.03305748],"study_design_scores_gemma":[0.0025888437,0.00048668007,0.6270257,0.000059924667,0.000012001447,0.00015226852,0.015032608,0.06230869,0.000031124928,0.20468582,0.087302804,0.0003135136],"about_ca_topic_score_codex":0.000049555074,"about_ca_topic_score_gemma":0.0003213914,"teacher_disagreement_score":0.62006533,"about_ca_system_score_codex":0.000020925785,"about_ca_system_score_gemma":0.00009335688,"threshold_uncertainty_score":0.2768674},"labels":[],"label_agreement":null},{"id":"W4386215197","doi":"10.1109/csf57540.2023.00017","title":"Preimage Awareness in Linicrypt","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Random oracle; Computer science; Mathematical proof; Property (philosophy); Oracle; Theoretical computer science; Security of cryptographic hash functions; Cryptographic hash function; Computer security; Mathematics; Programming language; Public-key cryptography; Encryption","score_opus":0.043939000663059356,"score_gpt":0.3459944518632045,"score_spread":0.30205545120014515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386215197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5725026,0.000017616363,0.41406548,0.0023980038,0.0004046422,0.00019148097,0.0000031582226,0.00065392285,0.009763105],"genre_scores_gemma":[0.9906205,0.00002158621,0.0089690415,0.00018299374,0.000013673878,0.000019481517,0.0000052650266,0.0000025200075,0.0001649591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99941945,0.000022424747,0.00012962898,0.00016504405,0.00010066585,0.00016277861],"domain_scores_gemma":[0.9996406,0.000058534566,0.000014158848,0.00024197006,0.000017237346,0.000027490174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024331262,0.000042515916,0.00005483126,0.00020581769,0.000047181224,0.00006699361,0.00031860327,0.000016526257,0.00006531013],"category_scores_gemma":[0.000011709721,0.000038470447,0.000025825244,0.0013094906,0.000011051641,0.00021774732,0.00015719426,0.00004508099,0.00012875536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016357748,0.00008289886,0.08356206,0.00001315327,0.0000064515602,0.000047526573,0.0023120972,0.00007277677,0.00028657645,0.84922826,0.009769879,0.05461665],"study_design_scores_gemma":[0.0011773431,0.000074723124,0.6457826,0.000015834905,0.000002082408,0.0000058267624,0.0006538818,0.20803632,0.001268558,0.10236866,0.04022631,0.00038788485],"about_ca_topic_score_codex":0.00016472417,"about_ca_topic_score_gemma":0.00043613324,"teacher_disagreement_score":0.7468596,"about_ca_system_score_codex":0.0000061360083,"about_ca_system_score_gemma":0.00003270053,"threshold_uncertainty_score":0.16549326},"labels":[],"label_agreement":null},{"id":"W4386729590","doi":"10.2197/ipsjjip.31.550","title":"A Deeper Look into Deep Learning-based Output Prediction Attacks Using Weak SPN Block Ciphers","year":2023,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Banting and Best Diabetes Centre, University of Toronto","keywords":"Computer science; Block cipher; Linear cryptanalysis; Deep learning; Differential cryptanalysis; Cipher; Cryptanalysis; Cryptography; Artificial intelligence; Key (lock); Differential (mechanical device); Theoretical computer science; Algorithm; Computer security; Encryption","score_opus":0.018853698256101815,"score_gpt":0.2874010940473963,"score_spread":0.26854739579129444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386729590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15110888,0.000081972736,0.84778565,0.00033110165,0.00027494415,0.00008377596,7.516924e-7,0.0001018272,0.0002311031],"genre_scores_gemma":[0.9567772,0.00002451196,0.042861145,0.00022082822,0.00008794338,0.000002981338,0.000009478134,0.000006669972,0.00000922686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830806,0.00004901805,0.0007895664,0.000082162456,0.000555977,0.00021520477],"domain_scores_gemma":[0.9983155,0.000042622032,0.00082687126,0.00010968421,0.00060956896,0.00009572901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009263231,0.000113115915,0.00014590067,0.00079525885,0.00046023098,0.0005599015,0.00030107787,0.0000623609,0.000010866654],"category_scores_gemma":[0.00010188868,0.00010252665,0.00009974877,0.0012841986,0.000034061108,0.0046819467,0.00006107851,0.00027487738,0.000013798241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005180932,0.00007232967,0.011299411,0.00035314748,0.00006463277,0.000010509742,0.027927708,0.4762708,0.0004266803,0.00085380976,0.001080845,0.48158833],"study_design_scores_gemma":[0.00078190345,0.00012233909,0.0025459572,0.00013454273,0.000020290798,0.00007306994,0.00359581,0.9813361,0.00026929047,0.00062598585,0.010362107,0.00013260226],"about_ca_topic_score_codex":0.000008424621,"about_ca_topic_score_gemma":0.0000046282325,"teacher_disagreement_score":0.80566835,"about_ca_system_score_codex":0.000112444104,"about_ca_system_score_gemma":0.0002807689,"threshold_uncertainty_score":0.5399143},"labels":[],"label_agreement":null},{"id":"W4387477964","doi":"10.1007/978-3-031-45513-1_6","title":"Linicrypt in the Ideal Cipher Model","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash function; Computer science; Block cipher; Ideal (ethics); Cipher; Theoretical computer science; Cryptographic hash function; Cryptography; Algorithm; Programming language; Encryption; Computer security","score_opus":0.04341923448835318,"score_gpt":0.302954283408371,"score_spread":0.25953504892001783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387477964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018382426,0.00012131062,0.9934824,0.0022570365,0.0008873776,0.0004061899,0.000007916077,0.00011644808,0.002537505],"genre_scores_gemma":[0.46923494,0.00024787892,0.51944983,0.009764691,0.00068543066,0.00007839674,0.000021991187,0.00007823266,0.0004386219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653786,0.000050663497,0.0005722434,0.0011299937,0.0010675862,0.00064165785],"domain_scores_gemma":[0.9975876,0.000662722,0.00017531516,0.0013750012,0.00011890835,0.00008043592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018936507,0.00036837332,0.00034475198,0.0009133855,0.00026301056,0.00060078315,0.0042164116,0.00020884717,0.000013465193],"category_scores_gemma":[0.000057651723,0.00027918938,0.00014619133,0.0014235729,0.0004394631,0.000403171,0.0010743231,0.0009165235,0.000042153802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038027906,0.000049753962,0.00013629184,0.000025754382,0.000009656787,0.00013352178,0.007752822,0.08746074,0.0000149805055,0.52254266,0.00027035447,0.3815997],"study_design_scores_gemma":[0.00014841148,0.00004356292,0.00021082167,0.000060780603,0.0000025143665,0.000012906743,8.298816e-7,0.5656756,0.000009101908,0.4330685,0.0005211664,0.00024574256],"about_ca_topic_score_codex":0.00008561446,"about_ca_topic_score_gemma":0.0011749993,"teacher_disagreement_score":0.4782149,"about_ca_system_score_codex":0.00010578865,"about_ca_system_score_gemma":0.0004532229,"threshold_uncertainty_score":0.999966},"labels":[],"label_agreement":null},{"id":"W4388185945","doi":"10.1109/rfid-ta58140.2023.10290221","title":"Enhancing Radio Frequency Identification Systems Security using KLEIN algorithm","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Radio-frequency identification; Cryptography; Key (lock); Identification (biology); Computer security; Power consumption; Algorithm; Software; Power (physics); Operating system","score_opus":0.02839129005981245,"score_gpt":0.29980099492346374,"score_spread":0.2714097048636513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388185945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13439716,0.000081854356,0.8635512,0.00013061539,0.00092807226,0.00022503479,0.000009502119,0.00047812192,0.00019845182],"genre_scores_gemma":[0.9536795,0.000033016433,0.045999214,0.000034228997,0.000109231834,0.00002903304,0.000028816028,0.000009326163,0.00007760221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984916,0.00009024369,0.0004060456,0.000370381,0.00032851953,0.00031319875],"domain_scores_gemma":[0.9991391,0.00006321634,0.00010944465,0.00049458904,0.000115983676,0.00007767764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008226776,0.0001123359,0.00012990486,0.00032893286,0.0003194881,0.00042612618,0.00045482517,0.000047555142,0.000026578573],"category_scores_gemma":[0.000020406378,0.00011228592,0.00006682873,0.0017080553,0.000025033361,0.00069554005,0.00012707416,0.000089407244,0.00008911967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010409555,0.00012604555,0.0023938217,0.00013395512,0.00008901842,0.000059552767,0.009456289,0.00032477014,0.06709825,0.8903794,0.0024460691,0.027491746],"study_design_scores_gemma":[0.00022000965,0.000019176921,0.0023518498,0.000021011167,0.000009326788,0.000028456901,0.00096290634,0.9728925,0.0041120145,0.01849612,0.0006318077,0.00025479047],"about_ca_topic_score_codex":0.0011713279,"about_ca_topic_score_gemma":0.00011304764,"teacher_disagreement_score":0.97256774,"about_ca_system_score_codex":0.00006370493,"about_ca_system_score_gemma":0.000062979896,"threshold_uncertainty_score":0.45788866},"labels":[],"label_agreement":null},{"id":"W4388820962","doi":"10.1109/paine58317.2023.10317982","title":"Investigating the Effect of Electromagnetic Fault Injections on the Configuration Memory of SRAM-Based FPGA Devices","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Field-programmable gate array; Static random-access memory; Bitstream; Computer science; Embedded system; Test bench; Fault (geology); Fault injection; Computer hardware; Software","score_opus":0.019832447466295085,"score_gpt":0.28162499556162107,"score_spread":0.261792548095326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388820962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98653996,0.0000104683795,0.008803749,0.0027234377,0.000068741145,0.0003467911,0.0000025063025,0.00007294979,0.0014313984],"genre_scores_gemma":[0.99915135,0.000001323003,0.0004889234,0.0002753647,0.000010620196,0.000048737948,0.000005392535,0.0000029376974,0.00001534615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904054,0.0002518165,0.00021885155,0.00012685878,0.00023727202,0.0001246445],"domain_scores_gemma":[0.9980966,0.0013759667,0.00012248884,0.00032172358,0.00006470938,0.000018508246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073117233,0.00007315311,0.00009044934,0.000119439355,0.0002351132,0.000048422677,0.00035028157,0.00002047412,0.000034839763],"category_scores_gemma":[0.00013655167,0.000037995673,0.00006282169,0.0012785497,0.00010366471,0.00007513648,0.00003510239,0.00008827616,0.0000058841547],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029085997,0.0001564735,0.013058271,0.00032031833,0.00018931557,0.0000018914548,0.011989282,0.010715985,0.19458139,0.68693465,0.0065920134,0.07543135],"study_design_scores_gemma":[0.00066472293,0.0021824448,0.05541414,0.00005196443,0.000036500885,0.0000022156373,0.0009812884,0.2845756,0.65156,0.0041323705,0.0002379871,0.00016075207],"about_ca_topic_score_codex":0.00035405206,"about_ca_topic_score_gemma":0.0002556482,"teacher_disagreement_score":0.68280226,"about_ca_system_score_codex":0.000006676913,"about_ca_system_score_gemma":0.000045711662,"threshold_uncertainty_score":0.18083245},"labels":[],"label_agreement":null},{"id":"W4389935239","doi":"10.46298/lmcs-19(4:30)2023","title":"Categorical composable cryptography: extended version","year":2023,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Computer science; Theoretical computer science; Correctness; Cryptography; String (physics); Set (abstract data type); Bipartite graph; Computer security; Mathematics; Programming language","score_opus":0.07016060689756048,"score_gpt":0.41561688265567354,"score_spread":0.34545627575811305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389935239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026495311,0.000026975345,0.9703931,0.0008404068,0.0011702507,0.00019695733,0.0000012621846,0.0004210039,0.0004547271],"genre_scores_gemma":[0.24469638,0.000022782686,0.7548372,0.00037124116,0.000045885674,0.000017573055,0.0000022370323,0.000003842703,0.0000028265067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967033,0.00042411574,0.0004169763,0.00097027904,0.0006795202,0.000805755],"domain_scores_gemma":[0.9980733,0.0007389427,0.00008043486,0.0007457826,0.00012426138,0.00023731164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042203167,0.00019602933,0.00028076276,0.0010004478,0.00045750276,0.00039716126,0.0023269071,0.000074507225,0.00003702299],"category_scores_gemma":[0.000093217954,0.00015740188,0.00012271512,0.01068775,0.0005054451,0.00073634903,0.0015389888,0.00029119686,0.00007128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008378418,0.00021037528,0.0033698955,0.000010645126,0.0000053572817,0.000097727636,0.00068585825,0.0011977552,0.0030586123,0.5604648,0.00063918135,0.43025142],"study_design_scores_gemma":[0.00036004555,0.00018041262,0.078418545,0.000008005289,0.0000018060953,0.000021896043,0.000024735446,0.64486444,0.00087182625,0.273449,0.0015486589,0.00025061087],"about_ca_topic_score_codex":0.000042274183,"about_ca_topic_score_gemma":0.0000036846202,"teacher_disagreement_score":0.6436667,"about_ca_system_score_codex":0.00006587981,"about_ca_system_score_gemma":0.000097047356,"threshold_uncertainty_score":0.64186627},"labels":[],"label_agreement":null},{"id":"W4390606138","doi":"10.1109/icm60448.2023.10378898","title":"Real-Time Switched Capacitor Based Power Side-Channel Attack Detection","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Cryptography; Side channel attack; Capacitor; Power (physics); Embedded system; Channel (broadcasting); Voltage; Electronic engineering; Real-time computing; Computer hardware; Electrical engineering; Telecommunications; Engineering; Algorithm","score_opus":0.027787728031174453,"score_gpt":0.2838292518198644,"score_spread":0.25604152378868994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390606138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43741205,0.00000200317,0.5558406,0.0011900604,0.0005782107,0.00022619253,0.000007317818,0.0010879932,0.0036555917],"genre_scores_gemma":[0.9939529,0.0000042161496,0.0054349694,0.00018282825,0.00004281874,0.000028881874,0.000010957651,0.0000090657795,0.00033339244],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889827,0.000046939047,0.00019984331,0.00031073048,0.0002521497,0.00029208823],"domain_scores_gemma":[0.999251,0.000111754656,0.000048954942,0.00041461884,0.00008444861,0.00008920681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031871774,0.000111454574,0.0001057892,0.000271825,0.00019607836,0.00012989886,0.00029021333,0.000050190745,0.00022571239],"category_scores_gemma":[0.000023892893,0.000102510385,0.000088366905,0.0012395204,0.000023238385,0.00027974625,0.00008318051,0.00006946791,0.0005512989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000911596,0.0007120616,0.0019166273,0.00011006432,0.00024934855,0.00016897936,0.012655376,0.0012477447,0.72686833,0.06286161,0.1133863,0.07973238],"study_design_scores_gemma":[0.0011586702,0.00028924146,0.020337738,0.000011558949,0.000011484415,0.000008997544,0.00055581133,0.94252104,0.024591237,0.0046140607,0.0053443215,0.0005558248],"about_ca_topic_score_codex":0.0002397757,"about_ca_topic_score_gemma":0.00015196115,"teacher_disagreement_score":0.94127333,"about_ca_system_score_codex":0.000028452474,"about_ca_system_score_gemma":0.000038861668,"threshold_uncertainty_score":0.70860165},"labels":[],"label_agreement":null},{"id":"W4391572494","doi":"10.54254/2755-2721/37/20230503","title":"Parallel implementation of Wiener's attack on RSA: Algorithm design and performance evaluation","year":2024,"lang":"en","type":"article","venue":"Applied and Computational Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cryptosystem; Public-key cryptography; Robustness (evolution); Computer science; Algorithm; Thread (computing); Key (lock); Laptop; Adversary; Key generation; Mathematics; Theoretical computer science; Cryptography; Computer security; Encryption; Operating system","score_opus":0.02736191178095903,"score_gpt":0.29259532597155047,"score_spread":0.26523341419059143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391572494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15055752,0.00016825873,0.8488683,0.000063627966,0.000062426465,0.00019672248,0.0000029383414,0.000048519163,0.000031690077],"genre_scores_gemma":[0.7944165,0.00002897162,0.20544803,0.00002354042,0.000018666056,0.000042313728,0.000016920614,0.0000044288445,6.185836e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930304,0.000010796636,0.00016182192,0.00019573509,0.00023144012,0.0000971631],"domain_scores_gemma":[0.99972653,0.00011600534,0.00002577863,0.000060804017,0.00003926001,0.00003159144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029442416,0.00008529907,0.00007471671,0.00014683063,0.00005891651,0.000075750046,0.00006191211,0.000018453866,0.0000051885663],"category_scores_gemma":[0.0000013751264,0.00008473333,0.000014584524,0.00022116196,0.00001390639,0.00017484184,0.000033455224,0.0000511048,0.00000102192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021441053,0.00000841625,0.000028238594,0.00003267402,0.000024610265,4.4584036e-7,0.0005755764,0.37177408,0.0001020436,0.17081869,0.00003039902,0.4566027],"study_design_scores_gemma":[0.00029297496,0.00006846414,0.011004917,0.000016750917,0.000009577785,0.0000053992944,0.000045935492,0.98509747,0.00017533994,0.0030777713,0.00011723927,0.00008814574],"about_ca_topic_score_codex":0.000005874236,"about_ca_topic_score_gemma":4.1560992e-7,"teacher_disagreement_score":0.64385897,"about_ca_system_score_codex":0.00001636787,"about_ca_system_score_gemma":0.000037069076,"threshold_uncertainty_score":0.34553248},"labels":[],"label_agreement":null},{"id":"W4392394959","doi":"10.1016/b978-0-443-22187-3.00008-4","title":"Machine learning based side channel power attack analysis of VLSI implementations in microgrids","year":2024,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Side channel attack; Implementation; Power analysis; Computer science; Very-large-scale integration; Computer architecture; Electronic engineering; Embedded system; Engineering; Computer security; Programming language; Cryptography","score_opus":0.023564462272685716,"score_gpt":0.2971368589406743,"score_spread":0.2735723966679886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392394959","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089300505,0.0026481654,0.0077247205,0.00047185243,0.000494917,0.0010014625,0.0007086616,0.00020197617,0.9858552],"genre_scores_gemma":[0.325035,0.0003312835,0.01172136,0.0010360269,0.0001300496,0.00022665336,0.0016985834,0.00019605547,0.659625],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756485,0.000055294044,0.0009215835,0.0006705521,0.00043135206,0.0003563786],"domain_scores_gemma":[0.998629,0.00014759132,0.0003369539,0.00065400783,0.00013648352,0.00009598229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005241712,0.00038278798,0.0006835154,0.0023707729,0.00011946977,0.00014106928,0.0006048305,0.0001458259,0.0004045147],"category_scores_gemma":[0.000008794881,0.00038727757,0.0006488722,0.00047649592,0.00008938432,0.00009107652,0.00030580297,0.00053949154,0.000023859475],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019116618,0.00012525794,0.0009053739,0.0003147093,0.0039245994,0.00016364902,0.007921896,0.0014792762,0.00015877516,0.19243939,0.0001720507,0.7923759],"study_design_scores_gemma":[0.0008780396,0.00023376397,0.0008665639,0.00031802827,0.0016767812,0.0000064149685,0.00014709652,0.048098076,0.000100762954,0.015089941,0.9315749,0.001009671],"about_ca_topic_score_codex":0.000029662247,"about_ca_topic_score_gemma":0.0020337221,"teacher_disagreement_score":0.9314028,"about_ca_system_score_codex":0.000090043344,"about_ca_system_score_gemma":0.00013727721,"threshold_uncertainty_score":0.9998579},"labels":[],"label_agreement":null},{"id":"W4393405096","doi":"10.1109/msec.2024.3352848","title":"Side-Channel Attacks: A Short Tour","year":2024,"lang":"en","type":"article","venue":"IEEE Security & Privacy","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Side channel attack; Channel (broadcasting); Computer security; Computer science; Computer network; Cryptography","score_opus":0.031426857342693064,"score_gpt":0.31565881826086506,"score_spread":0.284231960918172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393405096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4978696,0.0015254503,0.48420838,0.006641587,0.0037695295,0.0006266231,0.000054351003,0.0014621101,0.0038423687],"genre_scores_gemma":[0.9959667,0.00009139713,0.0030248149,0.0004883797,0.00029038024,0.000043686672,0.00001241517,0.000020052048,0.000062226245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978675,0.000074079646,0.00038960617,0.00069677597,0.00045635545,0.00051563623],"domain_scores_gemma":[0.9986616,0.00013812035,0.000031996304,0.0008933063,0.00009186658,0.00018316027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045203205,0.00024315991,0.00021647528,0.00030206863,0.00022386637,0.00075417914,0.0011511986,0.00009112995,0.00009591779],"category_scores_gemma":[0.000033005086,0.00023601326,0.00023149914,0.0010367493,0.00006213374,0.00095658464,0.00036586454,0.00034296548,0.00015052229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001882451,0.00064671406,0.0009979119,0.00042045725,0.00039060132,0.0008478271,0.059849028,0.000054295135,0.002488061,0.646011,0.17811449,0.110160775],"study_design_scores_gemma":[0.0006980254,0.000339763,0.0025538662,0.00019755516,0.00008162588,0.0002931773,0.0005308816,0.11927835,0.009105646,0.41878855,0.4466322,0.0015003642],"about_ca_topic_score_codex":0.00011923207,"about_ca_topic_score_gemma":0.00013852926,"teacher_disagreement_score":0.49809703,"about_ca_system_score_codex":0.00006006177,"about_ca_system_score_gemma":0.00014102363,"threshold_uncertainty_score":0.9624342},"labels":[],"label_agreement":null},{"id":"W4393474141","doi":"10.5281/zenodo.1314446","title":"Supporting Material To \"Sifa: Exploiting Ineffective Fault Inductions On Symmetric Cryptography\"","year":2018,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"European Commission","keywords":"Cryptography; Computer science; Fault (geology); Computer security; Symmetric-key algorithm; Chemistry; Public-key cryptography; Biology; Encryption; Paleontology","score_opus":0.03917896588978829,"score_gpt":0.30889211527560745,"score_spread":0.26971314938581914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393474141","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003787684,0.000010140933,0.026767403,0.00046817347,0.0011671616,0.001340739,0.9626395,0.0010327428,0.002786443],"genre_scores_gemma":[0.008571291,0.00004457123,0.0024218292,0.00041980692,0.00079239695,8.7944585e-7,0.98705786,0.0006730284,0.000018318044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99656594,0.0005256138,0.000537879,0.00095773756,0.0007133063,0.0006995398],"domain_scores_gemma":[0.99732745,0.00007439205,0.0003361049,0.0011116661,0.0008472869,0.00030310798],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011963857,0.0003294658,0.00029537472,0.002141712,0.0035000541,0.0024628362,0.0024993333,0.00015559886,0.0045839176],"category_scores_gemma":[0.0010498572,0.00035290173,0.00013149044,0.0036257922,0.00012888138,0.00044366712,0.0027048883,0.00053058006,0.0034099491],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022677066,0.00015886281,3.250312e-7,0.000051811472,0.000057627007,0.000012681721,0.00046868055,0.0000056422464,0.00016895359,0.003823519,0.97786534,0.017363891],"study_design_scores_gemma":[0.00030780377,0.00079813675,0.00007423506,0.00006636075,0.000022000822,0.000059815127,0.00019958694,0.00005713767,0.00023714732,0.00040625245,0.9974085,0.00036301676],"about_ca_topic_score_codex":0.00012172252,"about_ca_topic_score_gemma":0.0000031149718,"teacher_disagreement_score":0.024418365,"about_ca_system_score_codex":0.00018018727,"about_ca_system_score_gemma":0.000010643646,"threshold_uncertainty_score":0.9998923},"labels":[],"label_agreement":null},{"id":"W4393932354","doi":"10.11591/ijece.v14i3.pp2896-2907","title":"Machine learning-based lightweight block ciphers for resource-constrained internet of things networks: a review","year":2024,"lang":"en","type":"review","venue":"International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Block cipher; Encryption; Block (permutation group theory); Overhead (engineering); Embedded system; Cryptography; Distributed computing; Internet of Things; Machine learning; Artificial intelligence; Computer security; Operating system","score_opus":0.008752995489981116,"score_gpt":0.2703034711306279,"score_spread":0.2615504756406468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393932354","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011171281,0.59187675,0.4064087,0.00024522792,0.0012487168,0.00018021844,0.000008842415,0.000011017176,0.000009334789],"genre_scores_gemma":[0.007738965,0.9858328,0.0054696673,0.00014369356,0.0007229207,0.000009766306,0.000022002954,0.00004050942,0.0000196627],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959947,0.00014622255,0.0022496774,0.00032084988,0.00095527613,0.00033328784],"domain_scores_gemma":[0.9954108,0.000596708,0.0021752971,0.00013139905,0.0014868145,0.00019898781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012720509,0.00044489818,0.0014589636,0.0012344461,0.00003721623,0.0004195607,0.001489843,0.0001660312,0.000004865586],"category_scores_gemma":[0.00010239953,0.0003334593,0.00092542724,0.00039967167,0.000043560867,0.00035245126,0.00021971011,0.001074295,3.3093343e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022216707,0.00051345857,0.000038099413,0.008041429,0.013845224,0.00079987117,0.00060734706,0.00666682,0.00001611345,0.13660769,0.0052590207,0.82738274],"study_design_scores_gemma":[0.00081818394,0.0010165455,0.0000014956308,0.015772644,0.00052514137,0.0035180824,0.0000040996088,0.32615703,0.0000036543533,0.0001637358,0.65173,0.00028939772],"about_ca_topic_score_codex":0.0000065432337,"about_ca_topic_score_gemma":6.473777e-7,"teacher_disagreement_score":0.82709336,"about_ca_system_score_codex":0.00025730598,"about_ca_system_score_gemma":0.0004380612,"threshold_uncertainty_score":0.9999117},"labels":[],"label_agreement":null},{"id":"W4396680687","doi":"10.1109/tmc.2024.3396793","title":"Covert Communication in Large-Scale Multi-Tier LEO Satellite Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Ericsson (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Communications satellite; Computer network; Covert; Satellite; Scale (ratio); Telecommunications; Distributed computing; Geography","score_opus":0.016606250999084554,"score_gpt":0.2944146018835499,"score_spread":0.2778083508844653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396680687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037679236,0.0012484707,0.9592973,0.00014820774,0.00081536395,0.00036406738,0.000009869443,0.0003279808,0.00010950942],"genre_scores_gemma":[0.9636987,0.0004366627,0.035566557,0.00014858456,0.000027751901,0.00005486793,0.000009203703,0.000016659416,0.000041041334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844056,0.0001560112,0.00040802706,0.00043259092,0.00018695107,0.00037583904],"domain_scores_gemma":[0.9989715,0.00028532057,0.000046190366,0.0005871084,0.00004032038,0.0000695325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005735656,0.00017095415,0.0001699257,0.00034612493,0.0003619641,0.00031934332,0.0004904031,0.00008522903,0.00003326313],"category_scores_gemma":[0.0000011923339,0.0001802131,0.00013720842,0.0012205546,0.000040824703,0.00039314578,0.000012876255,0.0005090496,0.000029486093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010481058,0.00070162973,0.00065769267,0.000058215002,0.000057237205,0.000018792467,0.009737267,0.44675,0.00020146444,0.004000929,0.00013442851,0.53767186],"study_design_scores_gemma":[0.00040255798,0.00005420411,0.0009872315,0.000121813275,0.000008433203,0.000010236898,0.00029344863,0.99172354,0.00027369312,0.00016647113,0.0057616006,0.00019676764],"about_ca_topic_score_codex":0.00008769863,"about_ca_topic_score_gemma":0.0005066347,"teacher_disagreement_score":0.92601943,"about_ca_system_score_codex":0.000091233305,"about_ca_system_score_gemma":0.0000429817,"threshold_uncertainty_score":0.7348877},"labels":[],"label_agreement":null},{"id":"W4401824530","doi":"10.1016/j.jisa.2024.103860","title":"A different base approach for better efficiency on range proofs","year":2024,"lang":"en","type":"article","venue":"Journal of Information Security and Applications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Base (topology); Range (aeronautics); Mathematics; Computer science; Environmental science; Calculus (dental); Materials science; Geometry; Mathematical analysis; Medicine; Composite material","score_opus":0.014034108022097893,"score_gpt":0.2698765134133341,"score_spread":0.2558424053912362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401824530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014512318,0.00015721736,0.9821561,0.0019343093,0.0000704334,0.0004918362,0.000037902304,0.00003274639,0.0006071226],"genre_scores_gemma":[0.9775193,0.00006721794,0.021483721,0.00058581115,0.00012285751,0.0001899454,0.000024928293,0.0000030606434,0.0000032105993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916893,0.000016708633,0.0004118511,0.00008755692,0.00020568234,0.000109281646],"domain_scores_gemma":[0.99937403,0.00011113382,0.00014849576,0.00014647831,0.00014886913,0.00007098899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037913592,0.000082917875,0.00010748498,0.0002966823,0.00019266477,0.00038088005,0.00022565048,0.000035188383,0.000005615511],"category_scores_gemma":[0.000012935379,0.000061404,0.00009551248,0.00032436056,0.000029826486,0.0010370403,0.00003324451,0.00014188212,0.0000030462118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011560148,0.00016852035,0.00004484473,0.00021397852,0.00002747535,3.1140183e-7,0.0051837834,0.000043125412,0.000024974504,0.90117806,0.0020861744,0.09101722],"study_design_scores_gemma":[0.0022366645,0.00078112085,0.0017994907,0.00013024647,0.00009015767,0.00018810516,0.0016745448,0.49798015,0.000850458,0.12201373,0.37175602,0.00049930747],"about_ca_topic_score_codex":0.0000011625726,"about_ca_topic_score_gemma":5.957401e-7,"teacher_disagreement_score":0.9630069,"about_ca_system_score_codex":0.00002138406,"about_ca_system_score_gemma":0.000038464703,"threshold_uncertainty_score":0.36728352},"labels":[],"label_agreement":null},{"id":"W4402264487","doi":"10.1109/icccas62034.2024.10651593","title":"Java Benchmark Performance of Homomorphic Polynomial Public Key Cryptography for Key Encapsulation and Digital Signature","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Homomorphic encryption; Computer science; Public-key cryptography; Digital signature; Key encapsulation; Encapsulation (networking); Cryptography; Java; Key (lock); Theoretical computer science; Computer security; Encryption; Operating system; Symmetric-key algorithm","score_opus":0.013498782989441975,"score_gpt":0.23932881362551706,"score_spread":0.22583003063607507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402264487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7377544,0.00063734583,0.25925967,0.00090088026,0.00033043453,0.00033400088,0.0000913823,0.00017316316,0.00051870645],"genre_scores_gemma":[0.9846088,0.000053194453,0.015127652,0.000055490138,0.00006286972,0.00001797271,0.000042443167,0.000009333903,0.00002222603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989362,0.0000138001315,0.0002783417,0.00032882497,0.00020912156,0.00023370811],"domain_scores_gemma":[0.99940085,0.00012482499,0.00005405174,0.00022598827,0.0001160733,0.000078189805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002172281,0.0001321227,0.00013495324,0.0004128994,0.00014300701,0.00049121224,0.00026827827,0.0000699099,0.000043215878],"category_scores_gemma":[0.000016564154,0.00011370136,0.00011171688,0.00085984066,0.00008415273,0.0014864759,0.000101972786,0.00010040976,0.0000019455867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028156803,0.00014659167,0.014725909,0.00033932345,0.00013605504,0.0000027521826,0.0042557134,0.00001460412,0.0024217716,0.8180956,0.009365429,0.15046804],"study_design_scores_gemma":[0.0022788777,0.0017098589,0.07203058,0.0001640142,0.00007395565,0.0000736503,0.00082456623,0.79790574,0.003502394,0.029192857,0.091019236,0.0012242644],"about_ca_topic_score_codex":0.000014010851,"about_ca_topic_score_gemma":0.000015190518,"teacher_disagreement_score":0.79789114,"about_ca_system_score_codex":0.000010233894,"about_ca_system_score_gemma":0.00006744825,"threshold_uncertainty_score":0.47367713},"labels":[],"label_agreement":null},{"id":"W4402474484","doi":"10.1109/ccece59415.2024.10667325","title":"Mixed Boolean-Arithmetic (MBA) Obfuscation Using Permutation Polynomials on Modular Lipschitz Integers","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Permutation (music); Arithmetic; Modular design; Mathematics; Lipschitz continuity; Discrete mathematics; Modular arithmetic; Computer science; Cryptography; Algorithm; Pure mathematics","score_opus":0.055374532456707114,"score_gpt":0.31040515634466365,"score_spread":0.25503062388795655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402474484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35358965,0.00012220876,0.6435036,0.00097298215,0.00070834527,0.00017903346,0.000004436981,0.00024314328,0.0006765958],"genre_scores_gemma":[0.96225864,0.000016478863,0.037243206,0.00028166117,0.00008337958,0.000014233074,0.000019155916,0.000011875248,0.000071383816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869883,0.0000857741,0.0002863974,0.00041757378,0.00028825464,0.00022314255],"domain_scores_gemma":[0.9993743,0.00010894773,0.00004539708,0.0003389414,0.00006264331,0.00006977595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037680138,0.00014202476,0.00011765873,0.0004384455,0.00018158712,0.0005728693,0.0002837745,0.000051334984,0.00007054192],"category_scores_gemma":[0.000029286863,0.0001292973,0.00010614219,0.00075944595,0.000032676075,0.0005747029,0.00006859939,0.00012736334,0.000055388577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063797734,0.00009776591,0.00013413488,0.000047497928,0.000059340353,0.000014611577,0.0026326415,0.0015566009,0.012954764,0.8181984,0.0012632104,0.16303466],"study_design_scores_gemma":[0.00020796337,0.00010499201,0.0017535513,0.00005406815,0.00002215452,0.000018491914,0.00041458043,0.9778928,0.0059934966,0.0108972145,0.0023954117,0.00024527346],"about_ca_topic_score_codex":0.00020327009,"about_ca_topic_score_gemma":0.000052558713,"teacher_disagreement_score":0.9763362,"about_ca_system_score_codex":0.00009543314,"about_ca_system_score_gemma":0.0000934706,"threshold_uncertainty_score":0.5524192},"labels":[],"label_agreement":null},{"id":"W4403175065","doi":"10.62056/ay4c3txol7","title":"Leakage Model-flexible Deep Learning-based Side-channel Analysis","year":2024,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Computer science; Byte; Leakage (economics); Deep learning; Flexibility (engineering); Artificial intelligence; Profiling (computer programming); Computer engineering; Adversary; Computer hardware; Computer security; Mathematics","score_opus":0.05008528879993302,"score_gpt":0.3582059230162055,"score_spread":0.3081206342162725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403175065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004632426,0.002228592,0.9834257,0.0061184345,0.0001098971,0.0001618785,0.000007734476,0.00040944325,0.0029059353],"genre_scores_gemma":[0.850037,0.00028749355,0.14914669,0.00027992798,0.000008070225,0.00012876625,0.00008155416,0.000011316853,0.000019206984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813336,0.00039466115,0.00048263537,0.00044734092,0.00017515037,0.000366871],"domain_scores_gemma":[0.9968797,0.0007212684,0.00007817313,0.0021517924,0.00009968974,0.000069376765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065212016,0.000167953,0.00028573358,0.001514809,0.00035316477,0.00021767302,0.0020922716,0.00011964459,0.00005252085],"category_scores_gemma":[0.000066995504,0.00017971397,0.00021762827,0.0042070895,0.0002219722,0.0003308558,0.00063025334,0.0005693747,0.000050702012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003017451,0.00014918284,0.0018047454,0.000014914593,0.00014352136,0.000008706243,0.002348259,0.14651428,0.00003845559,0.84049106,0.000116718365,0.008367136],"study_design_scores_gemma":[0.0001783232,0.000032884385,0.0010222595,0.000009508626,0.000064802414,0.0000046841224,0.000166172,0.9078223,0.000032886506,0.0850982,0.0053989342,0.00016900865],"about_ca_topic_score_codex":0.00021282068,"about_ca_topic_score_gemma":0.0032621978,"teacher_disagreement_score":0.84540457,"about_ca_system_score_codex":0.00008446085,"about_ca_system_score_gemma":0.00013620374,"threshold_uncertainty_score":0.7328523},"labels":[],"label_agreement":null},{"id":"W4404556707","doi":"10.1145/3689930.3695203","title":"Risk-Based Methodology for Optimal Cryptoperiod Calculation in ICSs Under Data Siphoning Attack","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science","score_opus":0.28766877645836103,"score_gpt":0.4397574193101388,"score_spread":0.15208864285177776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404556707","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13628255,0.000012258033,0.862028,0.0010139757,0.00021245934,0.0002416265,0.00003462945,0.00013348764,0.000041045627],"genre_scores_gemma":[0.30118817,0.0000074861096,0.69814086,0.0002934235,0.000034345405,0.000040435756,0.0002655074,0.0000074916543,0.000022272789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986918,0.0001935254,0.00026257135,0.0004337023,0.00013160426,0.00028677445],"domain_scores_gemma":[0.99839544,0.00077549816,0.00007070277,0.0006647869,0.000052270712,0.000041279363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016529957,0.00009092474,0.00013618602,0.00028619572,0.00015350126,0.00009340642,0.00066385785,0.0000530852,0.00003364301],"category_scores_gemma":[0.00016172073,0.000085917905,0.000043970864,0.0009840027,0.000029370663,0.00035466382,0.0003176146,0.00008742658,0.000012836222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086095526,0.00025989604,0.03674102,0.000078527955,0.0001114117,0.000013264622,0.004935359,0.31918705,0.0025729535,0.49969316,0.020127943,0.11619332],"study_design_scores_gemma":[0.0007254451,0.00004130371,0.040007576,0.0000032015748,0.0000056965446,8.612599e-7,0.00021847372,0.9532504,0.0001527938,0.0026236088,0.002849993,0.000120666366],"about_ca_topic_score_codex":0.0004498432,"about_ca_topic_score_gemma":0.0013300191,"teacher_disagreement_score":0.6340633,"about_ca_system_score_codex":0.000023018096,"about_ca_system_score_gemma":0.00008030924,"threshold_uncertainty_score":0.35036308},"labels":[],"label_agreement":null},{"id":"W4404621259","doi":"10.46586/tches.v2024.i4.763-794","title":"Know-Thy-Basis: Decomposing F26 for Lightweight S-box Implementation","year":2024,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Engineering and Physical Sciences Research Council","keywords":"Extension (predicate logic); Field (mathematics); Computer science; Basis (linear algebra); Tower; S-box; Normal basis; Field extension; Affine transformation; Process (computing); Elegance; Arithmetic; Discrete mathematics; Theoretical computer science; Algebra over a field; Mathematics; Cryptography; Algorithm; Pure mathematics; Programming language; Block cipher; Geometry; Galois module; Structural engineering","score_opus":0.0177697006325679,"score_gpt":0.3087615992298445,"score_spread":0.2909918985972766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404621259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009062321,0.0030746004,0.98221236,0.00090141606,0.0024076095,0.0012072008,0.00025183198,0.0006630867,0.0002195522],"genre_scores_gemma":[0.9774186,0.0007963928,0.020373214,0.00015814783,0.00020169225,0.00088542013,0.000072356,0.00004936279,0.000044794284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99719185,0.0001735691,0.0007307111,0.0008874,0.00043037508,0.00058607705],"domain_scores_gemma":[0.99854076,0.00038634666,0.000104783976,0.0005499231,0.0001846701,0.000233546],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074818276,0.00038981656,0.00038061003,0.0011666834,0.0009265238,0.0013873158,0.00039206698,0.00015438201,0.000065447],"category_scores_gemma":[0.000004358596,0.00036173663,0.00040753736,0.0015308546,0.0000769765,0.00089503574,0.000012953911,0.00027010223,0.000018590092],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087613706,0.00044841596,0.00029172187,0.0015116244,0.0012987928,0.000046847093,0.013928122,0.0005926385,0.0030255222,0.54585195,0.0062779607,0.4266388],"study_design_scores_gemma":[0.0059687537,0.0023934508,0.0007965823,0.0021470773,0.0009773336,0.00053010066,0.018387428,0.19117455,0.010898005,0.031098565,0.73206866,0.003559498],"about_ca_topic_score_codex":0.00017207509,"about_ca_topic_score_gemma":0.00023342478,"teacher_disagreement_score":0.9683563,"about_ca_system_score_codex":0.00005760637,"about_ca_system_score_gemma":0.00011593569,"threshold_uncertainty_score":0.9998835},"labels":[],"label_agreement":null},{"id":"W4405930277","doi":"10.1007/978-3-031-74643-7_20","title":"Side-Channel Based Runtime Intrusion Detection for Network Equipment","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intrusion detection system; Intrusion; Side channel attack; Computer network; Computer security; Geology; Cryptography","score_opus":0.037996771651272014,"score_gpt":0.30260627079954794,"score_spread":0.2646094991482759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405930277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020196914,0.00036503936,0.9649841,0.0012029815,0.000758504,0.00075769576,0.000023752944,0.00012954637,0.031758174],"genre_scores_gemma":[0.3080834,0.0030397936,0.6813955,0.0044096094,0.00037541258,0.00060698274,0.00047966,0.000049584192,0.001560114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998252,0.000018455152,0.00071515044,0.00033702355,0.00038560576,0.000291774],"domain_scores_gemma":[0.99761146,0.00026072137,0.00025406116,0.0014219462,0.00036090656,0.00009089992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014370189,0.00022249408,0.00021252115,0.0010915757,0.00078959455,0.000950311,0.0018332454,0.00011492187,0.000006491012],"category_scores_gemma":[0.000019558483,0.00022326865,0.00008721413,0.0006688137,0.0003773159,0.003294885,0.001715666,0.00031064916,0.000028968045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030334184,0.00001134364,0.0000022940371,0.000049934726,0.0000065505433,1.573486e-7,0.0007619553,0.0010890611,0.0000036658123,0.80862814,0.00029133866,0.18915255],"study_design_scores_gemma":[0.00022601556,0.00007967917,0.00008476785,0.00015272856,0.000008400844,0.000005360631,0.000012099303,0.74855405,0.000013935362,0.09093507,0.15970862,0.00021928769],"about_ca_topic_score_codex":0.000014007624,"about_ca_topic_score_gemma":0.000051564475,"teacher_disagreement_score":0.74746495,"about_ca_system_score_codex":0.00016296662,"about_ca_system_score_gemma":0.00022005034,"threshold_uncertainty_score":0.91638714},"labels":[],"label_agreement":null},{"id":"W4408132854","doi":"10.1007/978-3-031-85363-0_33","title":"Area Optimized Architectures for Galois Counter Mode","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mode (computer interface); Computer science; Mathematics; Parallel computing; Operating system","score_opus":0.017595222237668028,"score_gpt":0.2657785009730164,"score_spread":0.2481832787353484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408132854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005285441,0.0069893813,0.98479295,0.00022250859,0.001002661,0.00110163,0.00008085833,0.000067891684,0.005689278],"genre_scores_gemma":[0.95438987,0.0014165452,0.03158185,0.0019220483,0.0014657464,0.00063049357,0.00037024266,0.00011103993,0.008112168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982452,0.0000404942,0.0005234156,0.0006243667,0.00020320379,0.00036335274],"domain_scores_gemma":[0.99834883,0.00076458993,0.00019563109,0.0005217269,0.00010079489,0.00006842871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030523897,0.00039204687,0.00063135626,0.00032177437,0.00015979393,0.00033110418,0.00044347177,0.00041125246,0.000010908801],"category_scores_gemma":[0.000025579853,0.00032528356,0.0001869135,0.000107845095,0.000056765075,0.00003219769,0.00014741567,0.00042871648,2.8526267e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110912755,0.000029280636,0.00016561575,0.0004919907,0.00028593998,0.000023443616,0.0012438495,0.67235833,0.0000025561067,0.26443973,0.0043440517,0.056504294],"study_design_scores_gemma":[0.00076174294,0.00006526614,0.000010425885,0.0005241189,0.000035010577,0.000017940085,0.0000037092268,0.9283012,0.0000011741605,0.04499478,0.024899568,0.0003850764],"about_ca_topic_score_codex":0.00016381255,"about_ca_topic_score_gemma":0.00080874894,"teacher_disagreement_score":0.954337,"about_ca_system_score_codex":0.000048418788,"about_ca_system_score_gemma":0.000058585963,"threshold_uncertainty_score":0.99991995},"labels":[],"label_agreement":null},{"id":"W4408328228","doi":"10.1002/9781394351930.ch14","title":"Attacking IoT Light Bulbs","year":2025,"lang":"en","type":"other","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Orthopaedic Trauma Society; Dalhousie University","funders":"","keywords":"Internet of Things; Computer science; World Wide Web","score_opus":0.010699822328142356,"score_gpt":0.2824747065598391,"score_spread":0.2717748842316967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408328228","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7535476e-7,0.00025459408,0.41552424,0.0003529001,0.00028692707,0.00011237435,0.000004440248,0.00026247764,0.5832019],"genre_scores_gemma":[0.00012313746,0.00007501052,0.05853957,0.0007164948,0.00017638961,0.000024935445,0.000008398379,0.000047275706,0.9402888],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923295,0.00001892028,0.00012777613,0.0003006883,0.00014985101,0.00016980698],"domain_scores_gemma":[0.99937403,0.00001892762,0.000059979,0.0004894844,0.000022108246,0.00003549695],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006894299,0.00013128328,0.00013916458,0.00037013952,0.00005468057,0.00013313073,0.0006156752,0.00009299992,0.0035643037],"category_scores_gemma":[0.000002684604,0.00011493881,0.000075655065,0.00040568176,0.0000112228045,0.000026345586,0.00023211606,0.00009148608,0.00011445008],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.046453e-8,0.0000112755915,0.00003650502,0.000017840659,0.000019121087,0.000002607581,0.000025726591,5.3188337e-8,0.0000011358549,0.35320333,0.6270133,0.019668998],"study_design_scores_gemma":[0.000088187466,0.0000075434173,0.000020402502,0.000037346308,0.0000050992817,9.353431e-7,0.000008440083,0.00009864525,0.000021271198,0.0019590002,0.99761724,0.00013588811],"about_ca_topic_score_codex":0.00026043665,"about_ca_topic_score_gemma":0.0005446417,"teacher_disagreement_score":0.3706039,"about_ca_system_score_codex":0.00001085977,"about_ca_system_score_gemma":0.000069903304,"threshold_uncertainty_score":0.9973466},"labels":[],"label_agreement":null},{"id":"W4408383701","doi":"10.1007/978-3-031-83490-5_1","title":"Remembering Ed Dawson","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.016772942425802566,"score_gpt":0.27426843800903616,"score_spread":0.2574954955832336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408383701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058532558,0.00035387394,0.9856596,0.00073489174,0.0018297243,0.00030485747,0.000005438509,0.00016342354,0.010889644],"genre_scores_gemma":[0.10013414,0.00020906972,0.89548,0.0027539544,0.00050528045,0.0000203589,0.000015928026,0.00003150399,0.0008498048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969323,0.000022925498,0.00047877344,0.0012600821,0.0007414128,0.0005644979],"domain_scores_gemma":[0.9978751,0.00029359185,0.00017889436,0.001345099,0.00019254356,0.000114789895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007000921,0.00038861856,0.00038188617,0.001066867,0.00033503617,0.000600759,0.0027670644,0.00019391245,0.00005150425],"category_scores_gemma":[0.000053157037,0.0003786332,0.00014073064,0.0008941695,0.00033308662,0.00047242295,0.001506612,0.00060019316,0.00001703396],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021466042,0.000018945473,0.00006385523,0.0000385017,0.000011199879,0.00004082333,0.00052713114,0.0016470931,0.00006452809,0.18253116,0.0001928377,0.8148618],"study_design_scores_gemma":[0.0005821512,0.00017375742,0.0003141314,0.00069697306,0.000017777484,0.00005589965,5.023974e-7,0.5061469,0.001263834,0.45889077,0.030612143,0.0012451704],"about_ca_topic_score_codex":0.000049581122,"about_ca_topic_score_gemma":0.0002010158,"teacher_disagreement_score":0.81361663,"about_ca_system_score_codex":0.0001952073,"about_ca_system_score_gemma":0.00050923065,"threshold_uncertainty_score":0.99986655},"labels":[],"label_agreement":null},{"id":"W4410395021","doi":"10.1109/qcnc64685.2025.00084","title":"Cascade Error Correction Attack; Exploiting Implicit and Side Channel Information Leakage","year":2025,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; UK Research and Innovation; Government of the United Kingdom","keywords":"Side channel attack; Computer science; Cascade; Leakage (economics); Information leakage; Channel (broadcasting); Computer security; Computer network; Cryptography; Engineering","score_opus":0.021815316291931626,"score_gpt":0.29919801541087876,"score_spread":0.27738269911894714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410395021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13597892,0.000019474046,0.8512202,0.0010025162,0.00047536375,0.00015519558,0.0000018365791,0.00015144076,0.010995084],"genre_scores_gemma":[0.99403083,0.000016153901,0.0047137802,0.0010457507,0.000016250402,0.000024455894,0.0000088683255,0.0000016955605,0.00014219662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937963,0.000019563351,0.00021194256,0.00013472744,0.00009543906,0.00015866346],"domain_scores_gemma":[0.9996325,0.00005847867,0.00005422224,0.00016048882,0.00005911403,0.000035213438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001742743,0.0000758132,0.000075588665,0.00023429928,0.00024913155,0.00022244421,0.00013837218,0.000033068627,0.000007645153],"category_scores_gemma":[0.000027561706,0.000072108145,0.000028195333,0.00047406528,0.000016679318,0.0012931518,0.00013878784,0.00007578783,0.0000075470894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010438482,0.000056976005,0.0022602824,0.00008013584,0.000046816942,0.0000024414371,0.011334663,0.00019696305,0.00084314303,0.3468197,0.01722379,0.6211247],"study_design_scores_gemma":[0.001176566,0.000108449014,0.054025874,0.000059601447,0.00001875172,0.000050053168,0.008937353,0.8983641,0.005173301,0.009190497,0.022472935,0.00042250546],"about_ca_topic_score_codex":0.0003488557,"about_ca_topic_score_gemma":0.00024863562,"teacher_disagreement_score":0.89816713,"about_ca_system_score_codex":0.000022106025,"about_ca_system_score_gemma":0.000024625911,"threshold_uncertainty_score":0.2940485},"labels":[],"label_agreement":null},{"id":"W4411360512","doi":"10.18280/ijsse.150415","title":"Modified Lightweight Advanced Encryption Standard for Lightweight Embedded Applications","year":2025,"lang":"en","type":"article","venue":"International Journal of Safety and Security Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Encryption; Embedded system; Advanced Encryption Standard; Computer security","score_opus":0.005759833637710393,"score_gpt":0.2678448870057513,"score_spread":0.26208505336804094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411360512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008936075,0.00051365467,0.98676175,0.0024512967,0.0007684652,0.000217613,0.000038656868,0.0000368096,0.00027570673],"genre_scores_gemma":[0.93909335,0.000823101,0.05968026,0.00015254514,0.00018217444,0.000029358353,0.00001541121,0.000006458416,0.00001733312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988823,0.000014490813,0.0005147966,0.00016686258,0.00027499482,0.00014653674],"domain_scores_gemma":[0.9989029,0.00017426195,0.00017731296,0.00013705282,0.0005389383,0.00006952382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035506664,0.00011934665,0.00019283494,0.00040426495,0.00011317674,0.0001392673,0.00051411934,0.000054782242,0.0000061233013],"category_scores_gemma":[0.00004851415,0.00011396023,0.0001230009,0.0002545279,0.000020111807,0.00055859966,0.000089852045,0.00015449218,3.405868e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001646449,0.000060691305,0.000056263565,0.000041804655,0.0001841553,0.000004772109,0.00095456035,0.0024596914,0.0011813822,0.9661051,0.00016543848,0.028621487],"study_design_scores_gemma":[0.006999969,0.00030364265,0.0022484893,0.00039801755,0.000094615105,0.00012960477,0.00033645626,0.23216265,0.010009844,0.16747095,0.57922643,0.00061932596],"about_ca_topic_score_codex":0.0000021289936,"about_ca_topic_score_gemma":0.000004155118,"teacher_disagreement_score":0.9301573,"about_ca_system_score_codex":0.00008231087,"about_ca_system_score_gemma":0.000073521325,"threshold_uncertainty_score":0.46471635},"labels":[],"label_agreement":null},{"id":"W4411436213","doi":"10.1007/978-3-031-87496-3_4","title":"Priv-IoT: Privacy-Preserving Machine Learning in IoT Utilizing TEE and Lightweight Ciphers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Internet of Things; Computer security; Embedded system","score_opus":0.017404348949499257,"score_gpt":0.26694412639215387,"score_spread":0.2495397774426546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411436213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024673396,0.0020714502,0.9885252,0.0016719241,0.0007210064,0.00049004075,0.000004748289,0.00016411088,0.0038841937],"genre_scores_gemma":[0.47305423,0.0004225164,0.52458435,0.0013063259,0.00020734266,0.000020256959,0.000012534048,0.000040469477,0.00035196962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625933,0.00007925274,0.0006509487,0.001547345,0.0007296787,0.000733456],"domain_scores_gemma":[0.9976367,0.0007544605,0.0002473905,0.0010859019,0.0001295259,0.00014602777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011559833,0.00050479406,0.00053568307,0.0016311406,0.00046287314,0.0007227337,0.002887923,0.0002509258,0.000034618803],"category_scores_gemma":[0.00020953044,0.0004844821,0.000105059866,0.0013617034,0.0003954882,0.0003787757,0.0038564755,0.0012803852,0.0000030611513],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082600745,0.000044854918,0.007176631,0.00015367319,0.000022227392,0.000114261195,0.0048382306,0.0045803175,0.00015369504,0.06496449,0.00003427066,0.9179091],"study_design_scores_gemma":[0.000607231,0.00013486289,0.0019004708,0.0008473953,0.00001107946,0.000037082886,0.0000026946268,0.8776425,0.00033150255,0.105116054,0.0125729125,0.0007961938],"about_ca_topic_score_codex":0.00018600188,"about_ca_topic_score_gemma":0.00095390674,"teacher_disagreement_score":0.9171129,"about_ca_system_score_codex":0.00020486678,"about_ca_system_score_gemma":0.00040221494,"threshold_uncertainty_score":0.9997607},"labels":[],"label_agreement":null},{"id":"W4411851575","doi":"10.1007/978-3-031-76568-1_7","title":"Public-Key Cryptography","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Ottawa; Mount Royal University","funders":"","keywords":"Key (lock); Public-key cryptography; Cryptography; Computer security; Computer science; Internet privacy; Encryption","score_opus":0.051774368146964886,"score_gpt":0.2729005835403037,"score_spread":0.22112621539333882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411851575","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016827884,0.00046531172,0.24789305,0.00054134725,0.0004645845,0.0005953095,0.00004071428,0.00024098765,0.74974185],"genre_scores_gemma":[0.0022571757,0.0012261836,0.6847584,0.0016548623,0.00030258234,0.00027045613,0.00015528663,0.00018956044,0.30918548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969243,0.000032250304,0.0010873964,0.0007325746,0.0006627661,0.0005607205],"domain_scores_gemma":[0.9970974,0.00033549327,0.00043168955,0.0017462295,0.0002349646,0.00015424115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006622362,0.0005749032,0.0007217374,0.0015425718,0.00020113749,0.0005340196,0.001896141,0.00040263022,0.0002761671],"category_scores_gemma":[0.00006726058,0.0005835189,0.00043082103,0.00035561272,0.00019621469,0.000323438,0.0007507276,0.00070576154,0.00007525943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.19006e-7,0.000078533136,0.00002222961,0.00022982554,0.000074118354,0.000025918034,0.0010857907,7.0280066e-7,0.0000031557827,0.97945833,0.01146498,0.007555516],"study_design_scores_gemma":[0.00029524523,0.000035355617,0.000010452474,0.00032647836,0.000027588883,0.0000102908125,0.00004556876,0.0014878211,0.000010603971,0.7654987,0.23179224,0.00045962763],"about_ca_topic_score_codex":0.000010532098,"about_ca_topic_score_gemma":0.00013874317,"teacher_disagreement_score":0.44055638,"about_ca_system_score_codex":0.00010135937,"about_ca_system_score_gemma":0.00027859226,"threshold_uncertainty_score":0.9996616},"labels":[],"label_agreement":null},{"id":"W4412900079","doi":"10.1145/3750446","title":"Matrix: Multi-Cipher Structures Dataflow for Parallel and Pipelined TFHE Accelerator","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Dataflow; Parallel computing; Matrix (chemical analysis); Cipher; Programming language; Computer architecture; Computational science; Operating system; Encryption","score_opus":0.02131386073080926,"score_gpt":0.31209823705952505,"score_spread":0.2907843763287158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412900079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014863927,0.00016125996,0.9948422,0.0026477012,0.00013505363,0.00048872316,0.000127928,0.00008928428,0.000021509679],"genre_scores_gemma":[0.15844323,0.00021847604,0.84037656,0.0006668967,0.000016535365,0.00009459684,0.000056934256,0.000009210488,0.000117579264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912184,0.000040575356,0.0002024168,0.00037270345,0.00009230913,0.000170176],"domain_scores_gemma":[0.9992926,0.0001332266,0.000046045687,0.00040385342,0.000066578075,0.000057664147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090199734,0.00015461339,0.00013633953,0.00023209589,0.00044319415,0.00020962316,0.00028250486,0.000071861636,0.000023018287],"category_scores_gemma":[0.000019992469,0.00013619085,0.000048057183,0.00034993418,0.00004665171,0.00019971185,0.000022048764,0.00012701012,2.478807e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016143602,0.00018128136,0.00010302078,0.00009765659,0.00012612117,0.0000010250028,0.0016625653,0.6240181,0.00029000491,0.018646842,0.00034033746,0.35437167],"study_design_scores_gemma":[0.0030203108,0.0001603058,0.0008649403,0.000028071727,0.000084896164,0.000010475585,0.00016886627,0.9679689,0.0004890736,0.019763822,0.0071171345,0.00032320194],"about_ca_topic_score_codex":0.000016536751,"about_ca_topic_score_gemma":0.00021694727,"teacher_disagreement_score":0.35404846,"about_ca_system_score_codex":0.000009935849,"about_ca_system_score_gemma":0.000037972903,"threshold_uncertainty_score":0.5553702},"labels":[],"label_agreement":null},{"id":"W4413246838","doi":"10.2139/ssrn.5363395","title":"Systematic Literature Review on Comparative Analysis of Stream Ciphers Vs Block Ciphers (with a Focus on IoT, Mobile and Cloud Applications)","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Block cipher; Focus (optics); Cloud computing; Stream cipher; Block (permutation group theory); Key schedule; Mobile cloud computing; Theoretical computer science; Cryptography; Differential cryptanalysis; Computer security; Mathematics; Operating system; Combinatorics","score_opus":0.008980493916287774,"score_gpt":0.2975804880092551,"score_spread":0.2885999940929673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413246838","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049850587,0.6350781,0.29614875,0.0023950767,0.00052191777,0.012242345,0.00047283006,0.00020656489,0.00308388],"genre_scores_gemma":[0.83639157,0.16044806,0.00169071,0.000297612,0.0001029599,0.0008647153,0.00006783966,0.0000144537225,0.00012205613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"systematic_review","domain_scores_codex":[0.9967855,0.00042412884,0.0008310342,0.0006016552,0.0005421887,0.00081547245],"domain_scores_gemma":[0.99743044,0.0002642086,0.0009975492,0.0008935879,0.00031397352,0.00010022879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014505071,0.0003840831,0.0012153353,0.00081491604,0.00022301298,0.00022488505,0.00089264987,0.00012733896,0.0000058259607],"category_scores_gemma":[0.000013319076,0.00028235276,0.0004111859,0.0024771611,0.00006378526,0.000071117654,0.00019185043,0.0021191735,9.714927e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014359281,0.0007722701,0.00032672347,0.028252982,0.017747244,0.000010832768,0.00485854,0.009033281,0.000005929412,0.92883265,0.00039866765,0.009617277],"study_design_scores_gemma":[0.009048349,0.017246531,0.0012528168,0.49568284,0.049775258,0.0011266696,0.025167126,0.05490618,0.0003332481,0.3345346,0.004339157,0.0065872413],"about_ca_topic_score_codex":0.000036188794,"about_ca_topic_score_gemma":0.00066281983,"teacher_disagreement_score":0.786541,"about_ca_system_score_codex":0.00045535757,"about_ca_system_score_gemma":0.0011918107,"threshold_uncertainty_score":0.99996287},"labels":[],"label_agreement":null},{"id":"W4413266017","doi":"10.2139/ssrn.5360240","title":"Comparison of Stream and Block Ciphers in Lightweight Cryptography for IoT Devices: A Systematic Literature Review","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Block cipher; Cryptography; Computer science; Stream cipher; Block (permutation group theory); Internet of Things; Computer security; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.015643583559765296,"score_gpt":0.3291127719184269,"score_spread":0.3134691883586616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413266017","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009191218,0.86883765,0.11768133,0.0012142203,0.00037051007,0.002505409,0.00005050176,0.00003732298,0.0001118364],"genre_scores_gemma":[0.5113999,0.4658881,0.021782318,0.0003251001,0.00011360412,0.00037703023,0.00004951591,0.000024987172,0.00003939221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645114,0.0002955359,0.0012990957,0.00047117233,0.0003451159,0.0011379558],"domain_scores_gemma":[0.9978854,0.0002317575,0.00095251383,0.0005337115,0.00031874957,0.00007784506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024206578,0.00033778118,0.0011311753,0.0007695386,0.00014302558,0.00023556975,0.001046694,0.00019317618,0.0000016800547],"category_scores_gemma":[0.00005753171,0.00028057725,0.00040846688,0.0011072278,0.00003873492,0.00012694998,0.00031833662,0.0020685543,1.49465e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023621222,0.00037359152,0.007844039,0.19078384,0.00092416303,0.000004093416,0.0030480365,0.000058355392,0.0000094198485,0.78890616,0.00027339236,0.007751312],"study_design_scores_gemma":[0.0025171468,0.0010848546,0.0006080751,0.3754897,0.0010845258,0.00025829094,0.002961169,0.009545799,0.00006813104,0.6038305,0.0013564142,0.0011954067],"about_ca_topic_score_codex":0.000029027136,"about_ca_topic_score_gemma":0.0019525507,"teacher_disagreement_score":0.5022087,"about_ca_system_score_codex":0.00022129809,"about_ca_system_score_gemma":0.0017318809,"threshold_uncertainty_score":0.99996465},"labels":[],"label_agreement":null},{"id":"W4414514798","doi":"10.47191/etj/v10i09.23","title":"Quantum-Resistant AI Models for Next-Generation Cyber Defense","year":2025,"lang":"en","type":"article","venue":"Engineering and Technology Journal","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alberta Energy","funders":"","keywords":"Cryptography; Robustness (evolution); Intrusion detection system; Adversary; Anomaly detection; Quantum computer; Cryptographic protocol; Encryption","score_opus":0.022191353667562547,"score_gpt":0.25761551068858096,"score_spread":0.2354241570210184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414514798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10217988,0.0008344362,0.8931791,0.0033629742,0.0002528026,0.00006401176,0.0000015578299,0.00010671492,0.000018496003],"genre_scores_gemma":[0.9554473,0.000090812886,0.044323634,0.000071396345,0.00003012431,0.000016362506,0.0000011158724,0.0000034686784,0.000015790172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950516,0.0000054877933,0.00015646323,0.00012373373,0.000050105853,0.00015902106],"domain_scores_gemma":[0.9997104,0.000025829808,0.000028708795,0.00012899132,0.00007823987,0.000027855824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017953386,0.00007094523,0.00008500503,0.00045762875,0.00021237644,0.00014846219,0.00016596068,0.000068428846,0.0000010851884],"category_scores_gemma":[0.00002786239,0.00006643948,0.000031234067,0.00037292467,0.000017935017,0.00022959514,0.00004672459,0.00017340717,1.8731623e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016381919,0.000011228354,0.00004463587,0.0000065985464,0.000024267394,0.0000031227273,0.00006480374,0.0019415737,0.0083301915,0.9795003,0.0006895631,0.009382053],"study_design_scores_gemma":[0.00033840956,0.00004819142,0.00004595836,0.000016563676,0.000008897927,0.000061407336,0.000034933826,0.8746046,0.0012476998,0.11842562,0.005088444,0.00007928149],"about_ca_topic_score_codex":0.0000020198952,"about_ca_topic_score_gemma":0.0000042795477,"teacher_disagreement_score":0.872663,"about_ca_system_score_codex":0.000016387823,"about_ca_system_score_gemma":0.000032997414,"threshold_uncertainty_score":0.27093235},"labels":[],"label_agreement":null},{"id":"W4414822642","doi":"10.1016/j.hcc.2025.100356","title":"A compact and energy-efficient semi-systolic field multiplier for secure IoT edge devices in smart city applications","year":2025,"lang":"en","type":"article","venue":"High-Confidence Computing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Deanship of Scientific Research, Prince Sattam bin Abdulaziz University; Prince Sattam bin Abdulaziz University","keywords":"Smart city; Multiplier (economics); Internet of Things; Field (mathematics); Enhanced Data Rates for GSM Evolution; Edge device","score_opus":0.014773739687058508,"score_gpt":0.29608659977143026,"score_spread":0.28131286008437173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414822642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23201531,0.000347979,0.76575196,0.0010316789,0.0001731722,0.00034779517,0.0000072874227,0.000085519925,0.00023929821],"genre_scores_gemma":[0.9863829,0.00001033689,0.0126306545,0.0008214804,0.00005011448,0.00006840306,0.0000077177565,0.0000055341393,0.000022879613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984259,0.0000635691,0.00042736204,0.00055114424,0.00015665745,0.00037535728],"domain_scores_gemma":[0.9983476,0.0008937642,0.00013875845,0.00041489312,0.00012565203,0.000079368605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045328646,0.00018087302,0.00025696424,0.00033028136,0.00044026316,0.00023330339,0.00054731534,0.000078827456,0.000005950672],"category_scores_gemma":[0.000048067264,0.00018545896,0.00006851228,0.0009196129,0.000057683246,0.00009640269,0.00019955057,0.00015637165,0.0000010590661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001251559,0.0001794214,0.030057145,0.00016411098,0.000036618225,0.0000032272724,0.0021570148,0.0024879496,0.0005118905,0.90516454,0.0007658768,0.0584597],"study_design_scores_gemma":[0.0012876582,0.00007608942,0.08366367,0.00031097748,0.000023461314,0.00001279758,0.00046041876,0.8842421,0.0018654738,0.013121171,0.014468984,0.00046715976],"about_ca_topic_score_codex":0.0013489983,"about_ca_topic_score_gemma":0.0010844371,"teacher_disagreement_score":0.89204335,"about_ca_system_score_codex":0.0000473105,"about_ca_system_score_gemma":0.00009746294,"threshold_uncertainty_score":0.7562797},"labels":[],"label_agreement":null},{"id":"W4414869494","doi":"10.62056/a0c3tx4e-","title":"Multi User Security of LightMAC and LightMAC_Plus","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Block (permutation group theory); Context (archaeology); Upper and lower bounds; Adversary; Computer security model; Block size; Concrete security","score_opus":0.029975203983867705,"score_gpt":0.3573693460442463,"score_spread":0.3273941420603786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414869494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31791437,0.006924157,0.6416097,0.022302113,0.00043897316,0.0007730344,0.000029465893,0.00017101523,0.009837129],"genre_scores_gemma":[0.7799219,0.0007949479,0.2189889,0.00022635615,0.0000021882613,0.000045458346,0.00000644935,0.0000026273472,0.0000112029875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998837,0.0002514196,0.0004210821,0.00023487599,0.00007053359,0.00018506807],"domain_scores_gemma":[0.9976271,0.00044901096,0.00010139469,0.001682777,0.000107768545,0.000031989937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003523803,0.000100501995,0.00022253483,0.00046037423,0.00015880466,0.00003269631,0.0014740502,0.00009057704,0.000009729091],"category_scores_gemma":[0.0000776617,0.00010450471,0.000044355613,0.0009625878,0.0003159383,0.00018240302,0.0011980296,0.00022216847,0.0000028516363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028738957,0.00019770888,0.028850576,0.000015044358,0.000017809041,8.6591655e-7,0.0017368605,0.0000015248578,0.00033156932,0.9650643,0.00027024443,0.003510654],"study_design_scores_gemma":[0.0037296403,0.00012541008,0.19210374,0.00012966184,0.00004273059,0.00003410592,0.0011554924,0.04967907,0.002211229,0.55468875,0.19556749,0.00053264975],"about_ca_topic_score_codex":0.00021167695,"about_ca_topic_score_gemma":0.0023305183,"teacher_disagreement_score":0.46200752,"about_ca_system_score_codex":0.000025352801,"about_ca_system_score_gemma":0.00008116749,"threshold_uncertainty_score":0.42615783},"labels":[],"label_agreement":null},{"id":"W4415369685","doi":"10.3390/telecom6040080","title":"Securing RSA Algorithm Against Side Channel Attacks","year":2025,"lang":"en","type":"article","venue":"Telecom","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hamming weight; Side channel attack; Cryptography; Modular exponentiation; Exponentiation; Hamming code; Public-key cryptography; Hamming distance","score_opus":0.01069534291421226,"score_gpt":0.2765207636829187,"score_spread":0.26582542076870647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415369685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0438406,0.00021414003,0.9429898,0.001495042,0.0006062135,0.00017924291,0.0000077797085,0.00027303147,0.01039414],"genre_scores_gemma":[0.9395485,0.00007684823,0.057771165,0.0021617897,0.00009043459,0.000036714213,0.000017348937,0.000008527983,0.00028865781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901915,0.00003292138,0.00021201526,0.00029249676,0.00014236392,0.00030108093],"domain_scores_gemma":[0.9993687,0.000063585125,0.000045049273,0.00041052935,0.000056371846,0.000055752775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001883141,0.00011448203,0.0001269667,0.00022125326,0.00023272457,0.00015596664,0.0005474683,0.000040104278,0.000018489893],"category_scores_gemma":[0.000011697375,0.00011718952,0.00007486216,0.0007205043,0.00002594127,0.00022877022,0.00025399978,0.00013387315,0.000025134743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024513663,0.00015573131,0.0008164319,0.000032197477,0.00007859538,0.000033482265,0.0021700913,0.00009311716,0.00029295153,0.10252089,0.010826911,0.8829771],"study_design_scores_gemma":[0.002997878,0.00017206285,0.024631048,0.00014859282,0.000037880494,0.000024236218,0.0008389995,0.595788,0.011082923,0.10235558,0.26068595,0.0012368605],"about_ca_topic_score_codex":0.00006150387,"about_ca_topic_score_gemma":0.000066908746,"teacher_disagreement_score":0.8957079,"about_ca_system_score_codex":0.000034797544,"about_ca_system_score_gemma":0.0000607567,"threshold_uncertainty_score":0.477885},"labels":[],"label_agreement":null},{"id":"W4415535867","doi":"10.1007/978-981-96-9148-7_8","title":"Quantum-Enhanced Digital Signatures: A Secure and Scalable Approach for the Post-quantum Era","year":2025,"lang":"en","type":"book-chapter","venue":"Blockchain technologies","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Digital signature; Cryptography; Hash function; Key exchange; Cryptographic primitive; Scalability; Key (lock); Signature (topology)","score_opus":0.012197014763350304,"score_gpt":0.23705420796335971,"score_spread":0.2248571932000094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415535867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005875392,0.0160392,0.9440663,0.008056491,0.00048727685,0.003800922,0.0008355228,0.003364465,0.022762291],"genre_scores_gemma":[0.8868931,0.0022641013,0.06839802,0.0007893296,0.00016202337,0.0013963468,0.00030853393,0.00012852567,0.03966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797666,0.000009711878,0.0003998855,0.0008515828,0.00030743537,0.00045472497],"domain_scores_gemma":[0.9977849,0.00056451943,0.00023467597,0.0011402565,0.00024218006,0.00003346667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024426787,0.0004760101,0.00044612127,0.0004898899,0.0005685024,0.0005604645,0.0017128479,0.00063466956,0.000004970719],"category_scores_gemma":[0.00019662804,0.000340903,0.00023135637,0.00027013134,0.0004472872,0.00012795615,0.0011206141,0.00073733623,0.0000016587469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000121067915,0.000028678129,0.000002086291,0.00011208351,0.00012120481,0.0000027564897,0.00021658262,0.000015654101,0.000044760018,0.9166424,0.0040243063,0.078777336],"study_design_scores_gemma":[0.00088745623,0.0005035963,0.000012616632,0.00022072022,0.00011725176,0.000023410868,0.0023725964,0.07801118,0.0006043833,0.81750005,0.098690346,0.0010563936],"about_ca_topic_score_codex":0.000011859237,"about_ca_topic_score_gemma":0.000014579569,"teacher_disagreement_score":0.8863056,"about_ca_system_score_codex":0.000037684225,"about_ca_system_score_gemma":0.00013170978,"threshold_uncertainty_score":0.9999043},"labels":[],"label_agreement":null},{"id":"W4416785447","doi":"10.28924/2291-8639-23-2025-312","title":"A Lightweight Symmetric Encryption Framework Using Homogeneous and Non-Homogeneous Caterpillar Graphs","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Encryption; Vertex (graph theory); Scalability; Cryptography; Tree traversal; Plaintext; Homogeneous; Graph","score_opus":0.009222202033708828,"score_gpt":0.3040503137354948,"score_spread":0.29482811170178597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416785447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27475792,0.0045535993,0.718932,0.0011089955,0.0003093228,0.0001959878,0.000048726644,0.000007722263,0.00008575422],"genre_scores_gemma":[0.96274513,0.009589558,0.027075483,0.00029804267,0.00022679246,0.000017791777,0.0000147957335,0.0000090194835,0.000023374678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971515,0.00010585673,0.0012802929,0.0005159202,0.00067348406,0.00027296622],"domain_scores_gemma":[0.99666286,0.00029310386,0.00097574864,0.0004122223,0.0014457582,0.00021029444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006332448,0.00028810924,0.00056250504,0.0041513853,0.0005265804,0.0009098083,0.00089621596,0.00016726513,0.00004725047],"category_scores_gemma":[0.000051150237,0.00027490288,0.0005120246,0.0052770344,0.0002021311,0.0003867606,0.00034229306,0.00033168987,0.0000016021579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097953205,0.0012221655,0.09974697,0.000093555354,0.01838156,0.00012282311,0.0024555072,0.00289568,0.0035922988,0.524915,0.00015919091,0.3463173],"study_design_scores_gemma":[0.0031003996,0.00057094777,0.14151484,0.0006798049,0.016996937,0.0013171673,0.0015000129,0.49209955,0.003609442,0.31290588,0.023992606,0.0017124268],"about_ca_topic_score_codex":0.00020509062,"about_ca_topic_score_gemma":0.0000757906,"teacher_disagreement_score":0.6918565,"about_ca_system_score_codex":0.00011444605,"about_ca_system_score_gemma":0.00021755515,"threshold_uncertainty_score":0.9999703},"labels":[],"label_agreement":null},{"id":"W4416924011","doi":"10.1109/dasc66011.2025.11257396","title":"Open Sky, Open Threats: Replay Attacks in Space Launch and Re-Entry Phases","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Telecommunications link; Replay attack; Resilience (materials science); SIGNAL (programming language); Synchronization (alternating current); Spacecraft; Noise (video); Channel (broadcasting)","score_opus":0.0594630857878826,"score_gpt":0.4128132893717475,"score_spread":0.3533502035838649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416924011","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12251267,0.0051511326,0.15462726,0.05143321,0.0017116409,0.007377677,0.0001261536,0.00011524908,0.656945],"genre_scores_gemma":[0.9483576,0.002687409,0.023626694,0.0037174309,0.000037608974,0.00014861097,0.000021330276,0.000013901829,0.021389414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965468,0.00027053,0.0008288346,0.0014163888,0.00029273075,0.00064468174],"domain_scores_gemma":[0.9976859,0.0003540866,0.00018300692,0.0014494278,0.0001432749,0.00018430942],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016449963,0.00035772377,0.0005737417,0.00044021572,0.0006165676,0.005595379,0.003981901,0.00013506373,0.0020706244],"category_scores_gemma":[0.00008617673,0.00034078938,0.000079099074,0.0024615573,0.00019969346,0.002520572,0.010286156,0.00032284422,0.000011828083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013079657,0.0009482441,0.08293664,0.000084117455,0.00011973877,0.0000656963,0.0048833177,0.0000070895208,0.000042481843,0.7203147,0.07227414,0.11819303],"study_design_scores_gemma":[0.025341956,0.0014171117,0.08574277,0.0018363525,0.0001906669,0.00007299764,0.016539456,0.04527334,0.002558942,0.34289983,0.47554544,0.0025811475],"about_ca_topic_score_codex":0.010334603,"about_ca_topic_score_gemma":0.017748496,"teacher_disagreement_score":0.82584494,"about_ca_system_score_codex":0.000088665365,"about_ca_system_score_gemma":0.00056171604,"threshold_uncertainty_score":0.9999044},"labels":[],"label_agreement":null},{"id":"W4416962075","doi":"10.1109/pst65910.2025.11268821","title":"Empirical Evaluation and Reclassification of Cryptographic Algorithms for Energy-Efficient Secure Communication in Medical IoT Devices","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Cryptography; Hash function; NIST; Security of cryptographic hash functions; Encryption; Key exchange; Cryptographic protocol; Cryptographic hash function; Cryptographic primitive","score_opus":0.066961836336517,"score_gpt":0.40676884551828285,"score_spread":0.3398070091817659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416962075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16429827,0.0049722176,0.8160802,0.012299393,0.00032515742,0.0012930558,0.00002221928,0.000035087156,0.0006743633],"genre_scores_gemma":[0.96807665,0.0011068218,0.029754657,0.00059311034,0.000022656901,0.00034746193,0.00007734408,0.00000878275,0.0000125303595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995486,0.0008712461,0.0014122811,0.0007640591,0.0010839693,0.00038239785],"domain_scores_gemma":[0.9965074,0.0010558214,0.00041900526,0.00088986487,0.0009841104,0.00014380274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0051931157,0.0002712623,0.00043146516,0.0012155614,0.00037444165,0.00017854875,0.00086892914,0.00034443924,0.00012843586],"category_scores_gemma":[0.0003826772,0.0002681129,0.00015710601,0.003261082,0.0004149983,0.00018977786,0.00037384615,0.00026138668,3.627901e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057239762,0.0010718894,0.015598787,0.00023197324,0.00009428824,3.7797946e-7,0.0033081018,0.0002799659,0.000076701195,0.47696012,0.00054891413,0.5017716],"study_design_scores_gemma":[0.0020814585,0.00013881698,0.068906054,0.0003103682,0.00009127518,0.000002572263,0.0011098103,0.90151066,0.00019575836,0.02272481,0.0027100588,0.00021834642],"about_ca_topic_score_codex":0.0005402907,"about_ca_topic_score_gemma":0.0036368775,"teacher_disagreement_score":0.9012307,"about_ca_system_score_codex":0.000106434105,"about_ca_system_score_gemma":0.0008257398,"threshold_uncertainty_score":0.9999771},"labels":[],"label_agreement":null},{"id":"W4417082275","doi":"10.1049/blc2.70028","title":"EthVault: A Secure and Resource‐Conscious FPGA‐Based Ethereum Cold Wallet","year":2025,"lang":"en","type":"article","venue":"IET Blockchain","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Mitacs; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Architecture; Key (lock); Cryptocurrency; Malware; Cryptography; Public-key cryptography; Field-programmable gate array; Safeguard","score_opus":0.008401017860264499,"score_gpt":0.2591605112608764,"score_spread":0.25075949340061193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417082275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65017885,0.002051811,0.2852928,0.05236338,0.00062183675,0.0011239097,0.0000869807,0.0006884926,0.0075919665],"genre_scores_gemma":[0.98539674,0.00001075637,0.009920183,0.0041648066,0.000032723852,0.000047550362,0.000005204269,0.000008579352,0.00041342457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986533,0.00013838023,0.00024774074,0.00042507838,0.00021645335,0.00031904943],"domain_scores_gemma":[0.9990139,0.00022611965,0.00006479593,0.00053501385,0.00006442741,0.00009576508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005017942,0.0001641854,0.0001805593,0.00025223242,0.00028665183,0.00017691417,0.00046922604,0.00010501472,0.0000333204],"category_scores_gemma":[0.000039258593,0.00015874543,0.00007363506,0.0007473365,0.00009423211,0.000041593772,0.00020767582,0.00021974799,0.000004986833],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059273745,0.0005080881,0.004929539,0.00019908621,0.00020758649,0.000121356934,0.009843795,0.00050376914,0.0033077197,0.8043824,0.12256324,0.053374164],"study_design_scores_gemma":[0.0039777816,0.00027162684,0.002310207,0.00014989961,0.00005115689,0.000020535574,0.0010073629,0.1427489,0.004519128,0.029438071,0.8147491,0.00075619004],"about_ca_topic_score_codex":0.00016165391,"about_ca_topic_score_gemma":0.00044600744,"teacher_disagreement_score":0.7749443,"about_ca_system_score_codex":0.000025910851,"about_ca_system_score_gemma":0.000109215136,"threshold_uncertainty_score":0.64734507},"labels":[],"label_agreement":null},{"id":"W4417339181","doi":"10.1109/gcaiot68269.2025.11275544","title":"Proactive TSCA Detection via Real-Time Thermal Signature Modeling on Low-Power IoT Devices","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec en Outaouais","funders":"","keywords":"Signature (topology); Overhead (engineering); Exploit; Software deployment; Microcontroller; Thermal; Range (aeronautics); Reliability (semiconductor); Anomaly detection","score_opus":0.009797020226010764,"score_gpt":0.26688211254080857,"score_spread":0.2570850923147978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417339181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43290418,0.000088506444,0.5505284,0.00049282797,0.00070326414,0.0007647057,0.000008210179,0.00016870924,0.014341198],"genre_scores_gemma":[0.99472016,0.00003365977,0.0041737007,0.0005544338,0.00008451978,0.00005789899,0.000006483554,0.000018274235,0.00035087232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996799,0.00025793494,0.0006633819,0.001069592,0.00054995297,0.00066013326],"domain_scores_gemma":[0.99833816,0.00016973728,0.00019177597,0.00076812314,0.00039768295,0.00013452889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005703808,0.0004557796,0.00035317393,0.0006102841,0.00092414307,0.00055203936,0.0007430593,0.00030663764,0.0006218389],"category_scores_gemma":[0.000016816812,0.00041226423,0.00027875302,0.001845222,0.00008251178,0.00058184564,0.00031940237,0.00060908636,0.00007211494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007770632,0.0023384055,0.00025790324,0.00022857086,0.0012215201,0.000030442716,0.01747067,0.035562463,0.09356526,0.0704811,0.0003344175,0.7777322],"study_design_scores_gemma":[0.00068912917,0.0003796917,0.0015356274,0.00011406193,0.00006738514,0.0000038393778,0.00055947504,0.9763623,0.016980143,0.0027408744,0.00011904966,0.00044842932],"about_ca_topic_score_codex":0.0005876191,"about_ca_topic_score_gemma":0.00030629005,"teacher_disagreement_score":0.94079983,"about_ca_system_score_codex":0.00015556993,"about_ca_system_score_gemma":0.00022739278,"threshold_uncertainty_score":0.9998329},"labels":[],"label_agreement":null},{"id":"W46104077","doi":"10.1007/978-3-642-37949-9_56","title":"Filtering Nonlinear Feedback Shift Registers Using Welch-Gong Transformations for Securing RFID Applications","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":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pseudorandom number generator; Shift register; Generator (circuit theory); Sequence (biology); Transformation (genetics); Nonlinear system; Computer science; State (computer science); Radio-frequency identification; Algorithm; Stream cipher; Polynomial; Class (philosophy); Theoretical computer science; Mathematics; Chip; Artificial intelligence; Telecommunications; Power (physics); Cryptography","score_opus":0.03304272219641688,"score_gpt":0.26523068859133425,"score_spread":0.23218796639491737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46104077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033897854,0.00019597437,0.9960048,0.00079458905,0.0003289899,0.0015817173,0.00018596197,0.000112499416,0.0004564806],"genre_scores_gemma":[0.010003184,0.0000861625,0.98933864,0.00013192241,0.00014214632,0.00016887218,0.000088633016,0.000027190108,0.000013226271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839485,0.000009021616,0.00084201153,0.00020722624,0.0002353267,0.00031157435],"domain_scores_gemma":[0.998222,0.00029284396,0.0005312492,0.0006757353,0.0002123804,0.00006578915],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00033555113,0.00031116087,0.00036101614,0.0003225752,0.0014610741,0.00044572377,0.0018095317,0.00017586941,0.0000014437766],"category_scores_gemma":[0.000018636334,0.00027944293,0.00030052377,0.00032121554,0.00032225283,0.0007809189,0.00048307824,0.00030819286,4.3742708e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020071798,0.000028647602,0.0000035437063,0.00072814437,0.00016020575,3.5955953e-8,0.0060432833,0.6613059,0.000038003887,0.30662173,0.00006793253,0.025000574],"study_design_scores_gemma":[0.00030692565,0.000043931548,0.000021219274,0.00018501066,0.00006456478,0.0000095399,0.0000163905,0.94110763,0.000089210596,0.0040434455,0.053740945,0.00037117116],"about_ca_topic_score_codex":0.000048417223,"about_ca_topic_score_gemma":0.00009556625,"teacher_disagreement_score":0.30257827,"about_ca_system_score_codex":0.00008028091,"about_ca_system_score_gemma":0.00016379054,"threshold_uncertainty_score":0.9999658},"labels":[],"label_agreement":null},{"id":"W55502777","doi":"10.1007/978-1-4419-1530-6_1","title":"Where Security Began","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alice and Bob; Computer security; Computer science; Adversary; Cryptography; Channel (broadcasting); Terminology; Alice (programming language); Authentication (law); Point (geometry); Covert channel; IPsec; Cryptographic protocol; Telecommunications; The Internet; World Wide Web; Cloud computing security; Mathematics","score_opus":0.016470270995612032,"score_gpt":0.2559559895278297,"score_spread":0.23948571853221767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55502777","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006984136,0.0005793678,0.032933217,0.001310037,0.00021659536,0.0001994095,0.000015385902,0.00027102616,0.964468],"genre_scores_gemma":[0.007240844,0.0016380858,0.03613569,0.0027244291,0.00042432346,0.0000111608115,0.00008929847,0.000048744358,0.95168746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866796,0.000009884779,0.00028951795,0.0004627411,0.0003355071,0.00023437498],"domain_scores_gemma":[0.99888253,0.000029804967,0.000113881,0.0007701352,0.000092907976,0.00011072968],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013596498,0.00025675775,0.00023696569,0.00019041824,0.0001341848,0.00020572517,0.0007871259,0.00018491622,0.0014856963],"category_scores_gemma":[0.0000020879538,0.00024075239,0.00019456695,0.00006531275,0.00004008547,0.0002249159,0.0001896266,0.000291286,0.00016769058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.924679e-7,0.000011356867,0.0000033641422,0.000009242361,0.000015925261,0.000013334376,0.00017931177,9.0362896e-8,7.995624e-7,0.92919385,0.021728694,0.048843555],"study_design_scores_gemma":[0.00009289061,0.000046091223,0.000018496474,0.000020122852,0.0000073126116,0.000009918176,0.0000044185595,0.0001500447,0.0000052746077,0.3993289,0.6000994,0.00021717233],"about_ca_topic_score_codex":0.000035068577,"about_ca_topic_score_gemma":0.0005927013,"teacher_disagreement_score":0.5783707,"about_ca_system_score_codex":0.00003086717,"about_ca_system_score_gemma":0.00006875043,"threshold_uncertainty_score":0.9994271},"labels":[],"label_agreement":null},{"id":"W6901783956","doi":"10.60692/sppze-60s65","title":"An Efficient and Lightweight Deniably Authenticated Encryption Scheme for e-Mail Security","year":2019,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Authenticated encryption; Random oracle; Encryption; Cryptography; Authentication (law); Scheme (mathematics); Digital signature; Cryptographic primitive; Confidentiality; Signcryption","score_opus":0.015731296302121684,"score_gpt":0.22849547442024637,"score_spread":0.21276417811812467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901783956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6054275,0.000001903356,0.3933683,0.000039786915,0.00023468253,0.00054963975,0.00003847804,0.00016358981,0.0001760873],"genre_scores_gemma":[0.99086356,1.01371725e-7,0.008899348,0.000073494855,0.000026817614,0.00008443592,0.0000380226,0.000005181252,0.0000090189915],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869645,0.00004979362,0.00047590132,0.00024178173,0.00027521042,0.0002608611],"domain_scores_gemma":[0.99892074,0.000012142886,0.00021836824,0.0004968778,0.00023722138,0.00011464182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005242327,0.00015275888,0.0001724192,0.00029779662,0.00021153691,0.00052259833,0.0003032126,0.00008044496,0.000014578718],"category_scores_gemma":[0.0000061932546,0.00013060453,0.000060200022,0.000327621,0.00002055407,0.0014738896,0.00007469553,0.00006083606,0.00014641085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010806651,0.000039932245,0.12235722,0.0012487664,0.000111670524,0.0000015163638,0.4482984,0.00021351047,0.00016934266,0.42551726,0.00016372168,0.0017705995],"study_design_scores_gemma":[0.0022945656,0.00021520408,0.026349952,0.00007392598,0.00002193368,0.00003251969,0.008015104,0.96003574,0.0010117716,0.00014474831,0.0013980931,0.0004064416],"about_ca_topic_score_codex":0.000006351463,"about_ca_topic_score_gemma":3.5572913e-7,"teacher_disagreement_score":0.95982224,"about_ca_system_score_codex":0.000050703253,"about_ca_system_score_gemma":0.000031143172,"threshold_uncertainty_score":0.53258985},"labels":[],"label_agreement":null},{"id":"W6903440251","doi":"10.11575/prism/30860","title":"Cryptanalysis Using Nature-Inspired Optimization Algorithms","year":2007,"lang":"en","type":"other","venue":"Libraries and Cultural Resources (University of Calgary)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cryptanalysis; Optimization problem; Optimization algorithm; Minification; Computation","score_opus":0.012622707756191145,"score_gpt":0.22664244029778205,"score_spread":0.2140197325415909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903440251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012391423,0.003507604,0.90736014,0.00017164908,0.00011109215,0.00016901427,0.000016275542,0.00018000342,0.08724506],"genre_scores_gemma":[0.0010152232,0.0011995002,0.9356748,0.00015851954,0.00009301291,2.1300558e-7,0.00013315164,0.000060480397,0.06166514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990294,0.000040296876,0.00012898819,0.00033544024,0.00027285324,0.00019305204],"domain_scores_gemma":[0.999322,0.00002382416,0.000249393,0.0002520347,0.000051904513,0.00010083888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006016073,0.00018354593,0.0002915119,0.00046804198,0.00027130317,0.00015888707,0.00048975385,0.0003046604,0.0006156419],"category_scores_gemma":[0.0000055429923,0.00017882003,0.00014017812,0.0007964916,0.00023053946,0.0004886345,0.00029574113,0.00019034607,0.0000010737447],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015467643,0.00028155468,0.001958773,0.0006221379,0.0021991294,0.00026677747,0.025071993,0.0006466657,0.0000983262,0.58225423,0.15751079,0.22893493],"study_design_scores_gemma":[0.00061620155,0.00006469711,0.00042564198,0.00010774652,0.00017557802,0.000008844222,0.0021165123,0.27276272,0.000012004248,0.0004103236,0.7228236,0.00047612446],"about_ca_topic_score_codex":0.0013050889,"about_ca_topic_score_gemma":0.000115502335,"teacher_disagreement_score":0.5818439,"about_ca_system_score_codex":0.000013175654,"about_ca_system_score_gemma":0.000025260408,"threshold_uncertainty_score":0.7292069},"labels":[],"label_agreement":null},{"id":"W6929809364","doi":"10.5061/dryad.69p8cz956","title":"Data for: Loss of the world's smallest forests","year":2022,"lang":"en","type":"dataset","venue":"Open MIND","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Mitacs","keywords":"Biodiversity; Deforestation (computer science); Habitat; Global biodiversity; Habitat destruction; Intact forest landscape; Measurement of biodiversity","score_opus":0.11587720373587623,"score_gpt":0.3883220042618924,"score_spread":0.27244480052601616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929809364","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000106621505,0.000033713248,0.0009830312,0.00041434792,0.00048585862,0.00080995297,0.9970278,5.499044e-7,0.00013812668],"genre_scores_gemma":[0.00012044515,0.000012643349,0.008107211,0.0000699548,0.000032857963,0.00006310392,0.9913887,0.0000045130423,0.00020061978],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868834,0.00006751772,0.00030063026,0.0004858094,0.00027739245,0.00018032681],"domain_scores_gemma":[0.9960151,0.0001581313,0.00028412946,0.0034685628,0.000039814033,0.000034287914],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006425917,0.00012795259,0.00019808645,0.00010912308,0.00026842896,0.00029332764,0.012205589,0.00003549663,0.012918261],"category_scores_gemma":[0.000036935748,0.000097920536,0.00007274452,0.0005467336,0.000062522085,0.0002199848,0.010328432,0.00017583174,0.0000066524835],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037950822,0.000050772964,0.000066596716,0.000010993893,0.000026324673,0.0000023840714,0.000035900917,0.0000021207916,2.0418004e-7,0.00045804254,0.9933179,0.0060249604],"study_design_scores_gemma":[0.00025475075,0.00002958273,0.00021538256,0.000014186616,0.000030529765,0.0000047607323,0.000024090084,0.00013132225,0.0000060028297,0.00042706585,0.998741,0.00012135378],"about_ca_topic_score_codex":0.00038140235,"about_ca_topic_score_gemma":0.073704794,"teacher_disagreement_score":0.07332339,"about_ca_system_score_codex":0.00001736089,"about_ca_system_score_gemma":0.0002612865,"threshold_uncertainty_score":0.99767584},"labels":[],"label_agreement":null},{"id":"W6930952759","doi":"10.5281/zenodo.3790868","title":"Peltodytes tortulosus Roberts 1913","year":2009,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Forest Service; Natural Resources Canada; Nova Scotia Hospital","funders":"","keywords":"Marsh; Nova scotia; Vegetation (pathology); Waterfowl; Wildlife refuge; STREAMS; Wetland; Eutrophication","score_opus":0.028265727668308396,"score_gpt":0.2598476072087516,"score_spread":0.2315818795404432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930952759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09028285,0.00037466397,0.58376026,0.012403514,0.0004986129,0.001160332,0.00014528152,0.004788513,0.306586],"genre_scores_gemma":[0.99450856,0.000054398923,0.00413452,0.00048692196,0.00009073109,1.7924668e-8,0.00030446186,0.00021410418,0.00020627136],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866456,0.00013418548,0.00020147073,0.00035710927,0.0003176987,0.0003249867],"domain_scores_gemma":[0.99894154,0.00001599079,0.00006596849,0.0005267418,0.00030242943,0.00014731011],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039271492,0.00010724612,0.000095965595,0.00021552699,0.0016863359,0.0011058395,0.0013080343,0.00003349415,0.0030751117],"category_scores_gemma":[0.0001210502,0.0001116436,0.00005452917,0.00074836815,0.00005369837,0.00047353358,0.000573622,0.000136931,0.001263783],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012275297,0.00022057306,0.000010993717,0.000011960902,0.00002064724,0.000021362443,0.0021726815,0.000020846317,0.0023789047,0.3187117,0.19900347,0.47741458],"study_design_scores_gemma":[0.00036074404,0.00027512142,0.003267165,0.00000858902,0.00000464206,0.000093137045,0.00011307956,0.0013365827,0.00042585027,0.004186696,0.98975,0.00017836566],"about_ca_topic_score_codex":0.000013362729,"about_ca_topic_score_gemma":5.5568165e-7,"teacher_disagreement_score":0.9042257,"about_ca_system_score_codex":0.000053592375,"about_ca_system_score_gemma":0.000002987601,"threshold_uncertainty_score":0.9999311},"labels":[],"label_agreement":null},{"id":"W6958828776","doi":"10.6084/m9.figshare.c.3293033","title":"UNDERSTORY VEGETATION AND ENVIRONMENT RESPONSES TO TILLAGE, FOREST HARVESTING, AND CONIFER PLANTATION DEVELOPMENT","year":2016,"lang":"en","type":"other","venue":"Figshare","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Understory; Deciduous; Species richness; Detrended correspondence analysis; Canopy; Biodiversity; Vegetation (pathology); Coarse woody debris; Species diversity; Moss","score_opus":0.04040333986705617,"score_gpt":0.27122222300102,"score_spread":0.23081888313396381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958828776","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007861817,0.017797312,0.1841182,0.0032589557,0.0017495973,0.015368217,0.22526239,0.0035223635,0.54106116],"genre_scores_gemma":[0.09416039,0.0009794818,0.19579257,0.0043822452,0.001035671,0.0036124927,0.10720693,0.0011682371,0.591662],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918085,0.000037970363,0.00013645034,0.0003302339,0.00016888534,0.00014561777],"domain_scores_gemma":[0.9995153,0.00010023229,0.00011003126,0.00016886632,0.0000133999865,0.00009215581],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000055569202,0.00014922275,0.0001079966,0.00024241414,0.00009457923,0.00011654146,0.00013471172,0.00007546216,0.0066622365],"category_scores_gemma":[0.000045380108,0.00013308477,0.000013364544,0.00005024517,0.000010559143,0.00010171686,0.00015863712,0.00004501418,0.00037259288],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009225492,0.000022954926,0.0006461908,0.00037135015,0.00004760312,0.00001846421,0.0021195884,0.0000017306376,0.000027526794,0.0021340165,0.9183507,0.076250665],"study_design_scores_gemma":[0.00022634937,0.000031306,0.02841377,0.0008043273,0.0000036989848,0.000007896676,0.000019611041,0.00003420178,0.000024255527,0.00010208274,0.9701189,0.00021360803],"about_ca_topic_score_codex":0.000012140113,"about_ca_topic_score_gemma":0.0003240946,"teacher_disagreement_score":0.118055455,"about_ca_system_score_codex":0.000036689587,"about_ca_system_score_gemma":0.00005996288,"threshold_uncertainty_score":0.9942458},"labels":[],"label_agreement":null},{"id":"W6966631910","doi":"10.3897/phytokeys.141.48810.figure9","title":"Figure 9 from: Saarela JM, Sokoloff PC, Gillespie LJ, Bull RD, Bennett BA, Ponomarenko S (2020) Vascular plants of Victoria Island (Northwest Territories and Nunavut, Canada): a specimen-based study of an Arctic flora. PhytoKeys 141: 1-330. https://doi.org/10.3897/phytokeys.141.48810","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Habit; The arctic; Arctic; Strobilus; Habitat; Overwintering","score_opus":0.012703941829458564,"score_gpt":0.22004418904339332,"score_spread":0.20734024721393476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966631910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82675934,0.002741628,0.0039281803,0.0009454004,0.0036058405,0.008066928,0.01797512,0.0019735803,0.13400395],"genre_scores_gemma":[0.9711124,0.00023684645,0.001523239,0.00011715263,0.0009087386,0.0000028935706,0.016723303,0.0027110744,0.006664353],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995813,0.0006843484,0.0007084857,0.001050671,0.0012011899,0.0005422646],"domain_scores_gemma":[0.9972507,0.00008159868,0.0005888654,0.0013652736,0.00041872184,0.0002948931],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052621117,0.0004782551,0.00063907955,0.0005683269,0.001129418,0.0004274717,0.00206691,0.00014909642,0.08510888],"category_scores_gemma":[0.00011577601,0.00051537185,0.00010967974,0.00092140696,0.00017739009,0.00025546286,0.0013928026,0.0006070626,0.00019360485],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005325011,0.0044619795,0.013387165,0.0011754888,0.002518943,0.00057682185,0.013859959,0.00032728544,0.00060931523,0.0018754186,0.94776917,0.012905979],"study_design_scores_gemma":[0.0023495888,0.0011343899,0.015811292,0.000097023374,0.000104275576,0.000006017683,0.0014561155,0.0004876482,0.000059814003,0.00006968055,0.97786874,0.0005553959],"about_ca_topic_score_codex":0.08409068,"about_ca_topic_score_gemma":0.025336256,"teacher_disagreement_score":0.14435303,"about_ca_system_score_codex":0.0002720826,"about_ca_system_score_gemma":0.00010818616,"threshold_uncertainty_score":0.9997298},"labels":[],"label_agreement":null},{"id":"W6968453062","doi":"10.5281/zenodo.12320211","title":"2n2222 a331 datasheet pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Datasheet; Voltage; Transistor; Power (physics); Amplifier; Duty cycle; Die (integrated circuit); Power semiconductor device; Pulse-width modulation","score_opus":0.03445672713989629,"score_gpt":0.2730258098030418,"score_spread":0.23856908266314553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968453062","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005650017,0.0003804057,0.047622308,0.0006362781,0.00039777037,0.00038780126,0.0008711426,0.0020082272,0.9476904],"genre_scores_gemma":[0.004013422,0.0012005452,0.011277807,0.00093026855,0.0013935453,3.2860905e-7,0.020610156,0.019917237,0.94065666],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980572,0.00019169612,0.00023968925,0.0006900083,0.00044710736,0.00037431423],"domain_scores_gemma":[0.99852735,0.000010262436,0.0001117695,0.0010529127,0.00014002832,0.00015765689],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004632346,0.0002107327,0.00017746504,0.00068032334,0.0007161178,0.0020546503,0.0024635675,0.00010708209,0.11572805],"category_scores_gemma":[0.000081309394,0.00021908832,0.00008063965,0.0009800397,0.000112339905,0.00021034804,0.0027413087,0.0003478923,0.11596235],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016132469,0.00004350695,1.01514104e-7,0.00008343156,0.000051540323,0.000022193193,0.00035927191,5.854332e-7,0.000023857985,0.055035725,0.9113061,0.03307207],"study_design_scores_gemma":[0.00018189487,0.00007249188,0.000007129612,0.00006646936,0.000015645332,0.00006661383,0.00007280675,0.0003172275,0.000009636678,0.0012671546,0.99768704,0.00023587293],"about_ca_topic_score_codex":0.00005542696,"about_ca_topic_score_gemma":0.0000029332193,"teacher_disagreement_score":0.08638095,"about_ca_system_score_codex":0.00006476371,"about_ca_system_score_gemma":0.000005443497,"threshold_uncertainty_score":0.9989813},"labels":[],"label_agreement":null},{"id":"W6969199437","doi":"10.5683/sp3/ixoilh","title":"Rock Island Lake Alberta. 1:50,000. Map Sheet 083P06, ed. 1, 1975","year":2022,"lang":"en","type":"dataset","venue":"Borealis","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Natural (archaeology); Georeference; General partnership; Geologic map; Topographic map (neuroanatomy); Aerial photography; Raster graphics; Geographic information system","score_opus":0.013107196505065243,"score_gpt":0.2643756379812572,"score_spread":0.25126844147619193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6969199437","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025717056,0.00023856854,0.0029234407,0.00081865053,0.0007879498,0.00036825932,0.9940738,0.00007946818,0.00070725876],"genre_scores_gemma":[0.000008615443,0.00044707028,0.00051132723,0.0011923488,0.00025583632,0.00018015632,0.9970901,0.00002128286,0.00029327444],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99709433,0.00017035769,0.00054099935,0.000845862,0.00074906327,0.00059938815],"domain_scores_gemma":[0.9972755,0.00020766286,0.0002868498,0.0019587409,0.000077353354,0.00019390992],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003481878,0.00043109962,0.0004420649,0.00040657734,0.00050282787,0.00044090292,0.0023464172,0.00019159878,0.021385195],"category_scores_gemma":[0.000039431587,0.00042823495,0.00024777485,0.0005314888,0.000039531205,0.00028773668,0.0011227975,0.0005293663,0.000047527286],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060917628,0.00010821756,0.000031645177,0.000055263776,0.000066815075,0.00004356135,0.00017182143,0.000013742977,2.0655933e-7,0.0021445686,0.9968614,0.000496686],"study_design_scores_gemma":[0.000391541,0.00010643508,0.00017675426,0.000015067596,0.000054459404,0.00003064303,0.000034079163,0.00019444112,9.998727e-7,0.0006533371,0.99784213,0.00050012616],"about_ca_topic_score_codex":0.12440678,"about_ca_topic_score_gemma":0.5123306,"teacher_disagreement_score":0.3879238,"about_ca_system_score_codex":0.0000466869,"about_ca_system_score_gemma":0.00016475785,"threshold_uncertainty_score":0.99981695},"labels":[],"label_agreement":null},{"id":"W6969454659","doi":"10.5683/sp3/qirg1s","title":"Dorothy Alberta. 1:50,000. Map Sheet 082P08, ed. 1, 1967","year":2022,"lang":"en","type":"dataset","venue":"Borealis","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Georeference; General partnership; Raster graphics; Natural (archaeology); Digital mapping; Geographic information system; Government (linguistics); Viewshed analysis","score_opus":0.014100397822356052,"score_gpt":0.2704767899891761,"score_spread":0.25637639216682007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6969454659","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027799845,0.00029616005,0.0014584849,0.0012845609,0.0009281735,0.0004394771,0.99472564,0.000097628625,0.00076707726],"genre_scores_gemma":[0.0000052119285,0.0004958045,0.0014141543,0.001647842,0.000245398,0.0002698897,0.99578214,0.000022656046,0.00011687851],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969333,0.00019604468,0.00056304655,0.0008853302,0.0008053504,0.0006169681],"domain_scores_gemma":[0.99688375,0.0002241346,0.00029994504,0.0023018045,0.000076898614,0.00021348541],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043215288,0.00043570274,0.00043904394,0.000446357,0.00050416426,0.00044530563,0.0027811218,0.00018917768,0.016791807],"category_scores_gemma":[0.000045065797,0.00044049078,0.00027885212,0.0005797857,0.000082195824,0.0003090848,0.0012573489,0.00053760473,0.00004609375],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000519145,0.00011379442,0.000013097526,0.000051448187,0.00006364436,0.000043418757,0.00019396012,0.000003853901,3.711149e-7,0.006450928,0.99187243,0.0011878374],"study_design_scores_gemma":[0.00031908345,0.000105816216,0.00014590476,0.000013601538,0.000048722548,0.000025680041,0.00004984148,0.000069113834,0.000001976715,0.0012316761,0.9974804,0.00050817674],"about_ca_topic_score_codex":0.24053419,"about_ca_topic_score_gemma":0.06553142,"teacher_disagreement_score":0.17500277,"about_ca_system_score_codex":0.00010503439,"about_ca_system_score_gemma":0.00018957425,"threshold_uncertainty_score":0.9998047},"labels":[],"label_agreement":null},{"id":"W6977287265","doi":"10.6084/m9.figshare.c.5665875.v1","title":"Estimated impact of COVID-19 on preventive care service delivery: an observational cohort study","year":2021,"lang":"en","type":"other","venue":"Figshare","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Preventive care; Observational study; Preventive healthcare; Cervical cancer; Medical record; Health care; Cancer screening; Cohort study; Colorectal cancer; Primary care","score_opus":0.14482308001331218,"score_gpt":0.40860864167255834,"score_spread":0.26378556165924616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977287265","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010337434,0.00079580385,0.00028411954,0.000081205944,0.00018957054,0.00421581,0.96554726,0.00051112706,0.018037653],"genre_scores_gemma":[0.09498895,0.000008534753,0.0031150712,0.0005210106,0.0001419247,0.0007437883,0.89776605,0.00019897142,0.002515693],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9983868,0.00016856112,0.00024187408,0.0005476742,0.0004676993,0.00018737772],"domain_scores_gemma":[0.99828804,0.00009756705,0.00030017988,0.0007428172,0.00041236918,0.00015901511],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006298209,0.00025094804,0.00031236978,0.0002499323,0.00009196793,0.00010274454,0.0007566425,0.00012032818,0.19745208],"category_scores_gemma":[0.00013722839,0.0002403753,0.00014360897,0.00084044435,0.0000047221597,0.00011808441,0.00026197915,0.00014115723,0.00005295922],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112621265,0.0007199365,0.031058317,0.0006905028,0.000564677,0.00006522564,0.0049979235,0.0004015097,0.0000034172813,0.00018698856,0.9602125,0.0010876891],"study_design_scores_gemma":[0.0017922668,0.001254093,0.9081254,0.0026814276,0.00010125523,0.000009822767,0.0018451347,0.0061035953,0.0000129533755,0.00010508041,0.0769172,0.001051749],"about_ca_topic_score_codex":0.0023343326,"about_ca_topic_score_gemma":0.003967204,"teacher_disagreement_score":0.88329536,"about_ca_system_score_codex":0.0001417955,"about_ca_system_score_gemma":0.0009563192,"threshold_uncertainty_score":0.98022205},"labels":[],"label_agreement":null},{"id":"W6977441159","doi":"10.6084/m9.figshare.26730784","title":"Additional file 2 of ‘Talking lines’: the stories of diagnosis and support as told by those with lived experience of rare forms of dementia","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Lived experience; Dementia; Narrative; Qualitative research; Identity (music)","score_opus":0.035708655736892525,"score_gpt":0.29408924826326616,"score_spread":0.25838059252637363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977441159","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013022505,0.00035032956,0.000053124182,0.000028597033,0.000012632485,0.00013365399,0.98622566,0.000011351131,0.00016215917],"genre_scores_gemma":[0.8526604,0.00001539064,0.0015258938,0.00002323166,0.000010735959,0.000551364,0.145185,0.0000050342833,0.000022963666],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934655,0.000012194823,0.0002053444,0.00013209721,0.00022305633,0.00008073894],"domain_scores_gemma":[0.9988532,0.00067073444,0.00014196729,0.0001666524,0.00014645807,0.000020990828],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000283998,0.00006589755,0.000108709246,0.000052302144,0.000044061708,0.000026021808,0.00023733937,0.000019886702,0.5396157],"category_scores_gemma":[0.00018133654,0.00004400513,0.000043439217,0.00031554155,0.000040697134,0.0002498046,0.00013924183,0.000039287093,0.0000020175873],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003494679,0.000039425457,0.00013807895,0.00022483416,0.000040103336,0.0000020834925,0.009059178,8.626109e-7,0.000054081345,0.0004651313,0.9848965,0.0050762533],"study_design_scores_gemma":[0.00047565514,0.0011372876,0.01258624,0.0081751775,0.000051873885,0.000026085452,0.012986823,0.001839431,0.051961355,0.0009369716,0.9094131,0.0004099801],"about_ca_topic_score_codex":0.00002555093,"about_ca_topic_score_gemma":0.000035796027,"teacher_disagreement_score":0.8410407,"about_ca_system_score_codex":0.0000033523713,"about_ca_system_score_gemma":0.00008192964,"threshold_uncertainty_score":0.46080518},"labels":[],"label_agreement":null},{"id":"W6983752045","doi":"","title":"No.803 Howard Eisenberg MD On Dream It To Do It The Science &amp; The Magic","year":2022,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Dream; Parapsychology; MAGIC (telescope); Paranormal; George (robot)","score_opus":0.01127568072017685,"score_gpt":0.22697734141247333,"score_spread":0.2157016606922965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6983752045","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003937273,0.00008219263,0.000028093938,0.005158727,0.0007151313,0.0008272487,0.00009994547,0.00011851813,0.99293077],"genre_scores_gemma":[0.0006886889,0.00019413164,0.0022563764,0.005400031,0.00014013551,0.00006272535,0.000041950094,0.000047455494,0.9911685],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99711627,0.00014105225,0.00056870613,0.00039408598,0.0013113171,0.00046857077],"domain_scores_gemma":[0.99752355,0.00025951036,0.00045486016,0.0013888016,0.00023401098,0.0001392935],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011107647,0.00033083343,0.00026761834,0.00021558125,0.00060381397,0.00046600992,0.002784002,0.00010157296,0.28251538],"category_scores_gemma":[0.00019304802,0.00022400595,0.00018467124,0.00011569292,0.00035577492,0.0000010334961,0.0007813228,0.0004234234,0.0139089385],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014952751,0.000038824888,0.0000013629552,0.000037874415,0.000023126124,0.000003710312,0.0011485934,0.0002919945,2.963541e-7,0.002372692,0.9942665,0.001800059],"study_design_scores_gemma":[0.00021053974,0.00015451087,0.000010443611,0.00004867369,0.000017600121,0.000043120683,0.00034791656,0.000055732664,0.0000023915075,0.000061551305,0.99876815,0.00027936944],"about_ca_topic_score_codex":0.0025318218,"about_ca_topic_score_gemma":0.0018489003,"teacher_disagreement_score":0.26860642,"about_ca_system_score_codex":0.00009379863,"about_ca_system_score_gemma":0.00012168504,"threshold_uncertainty_score":0.98685884},"labels":[],"label_agreement":null},{"id":"W6987128665","doi":"","title":"Side Channel Information Leakage: Design and Implementation of Hardware Countermeasure","year":2010,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Side channel attack; Power analysis; Countermeasure; CMOS; Information leakage; Chip; Scan chain; Key (lock); Channel (broadcasting); Vulnerability (computing)","score_opus":0.010779983025828391,"score_gpt":0.22543186394641287,"score_spread":0.2146518809205845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6987128665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9584011,0.000045684985,0.040062796,0.0003569647,0.00031383,0.000596157,0.00009699213,0.00005042881,0.000076089906],"genre_scores_gemma":[0.95934147,0.00032095495,0.035015382,0.000040924806,0.000025499932,0.0000035882115,0.0014616525,0.000018172359,0.0037723612],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9989785,0.0000579218,0.0002176168,0.00021581125,0.00034753745,0.00018259286],"domain_scores_gemma":[0.9986932,0.000033309432,0.00049910485,0.00029521325,0.0004152419,0.00006387923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002918828,0.00017449065,0.00026703905,0.00045606866,0.00020512975,0.00006296577,0.0004418478,0.00018430255,0.00005448773],"category_scores_gemma":[0.000006862335,0.00020704101,0.000091874754,0.00026595278,0.000060653245,0.0013229941,0.00008105841,0.00019932393,0.0000042839433],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016789649,0.00010094403,0.00092793,0.0013071625,0.00026170883,0.000011276532,0.88106966,0.00007569701,0.009128904,0.009343637,0.0024773942,0.095127776],"study_design_scores_gemma":[0.004692215,0.00089750916,0.11318953,0.00037173094,0.0004068694,0.000018713186,0.836271,0.00935951,0.026650384,0.0038726975,0.0029702594,0.0012996045],"about_ca_topic_score_codex":0.017713636,"about_ca_topic_score_gemma":0.04182898,"teacher_disagreement_score":0.1122616,"about_ca_system_score_codex":0.000024746909,"about_ca_system_score_gemma":0.00013089391,"threshold_uncertainty_score":0.98882747},"labels":[],"label_agreement":null},{"id":"W6989236042","doi":"","title":"A825-HWIL: Hardware simulation platform for ARINC 825 cybersecurity analysis","year":2023,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Software; Key (lock); Smart card","score_opus":0.03536388046593938,"score_gpt":0.306294341092632,"score_spread":0.2709304606266926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989236042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9692435,0.000170108,0.002063998,0.00006329557,0.005023498,0.0034511306,0.0064629735,0.002146214,0.011375275],"genre_scores_gemma":[0.9807111,0.00010428923,0.0069409087,0.00018400112,0.00008414706,0.0005327801,0.008907942,0.00015512826,0.0023797299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941071,0.00017554735,0.0014482015,0.0019050471,0.0012775162,0.0010865831],"domain_scores_gemma":[0.9951957,0.00077701506,0.00097033853,0.001651005,0.001007988,0.00039794698],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014744035,0.0009058145,0.001109716,0.0021465528,0.002291495,0.0005441594,0.0018304983,0.000805599,0.00014439618],"category_scores_gemma":[0.00059301924,0.001015356,0.0014719878,0.004767183,0.000047624,0.0019083316,0.00033493165,0.0010493004,0.00014214232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000188564,0.00041935622,0.00026138802,0.00059931265,0.0031110367,0.000051949486,0.00031099922,0.0033868582,0.0005647508,0.7731626,0.000063618216,0.21787955],"study_design_scores_gemma":[0.005983994,0.0008631208,0.030272821,0.00053773,0.0063596917,0.000015365258,0.0033984983,0.14499353,0.0075681373,0.5315723,0.26130524,0.0071295737],"about_ca_topic_score_codex":0.0009457323,"about_ca_topic_score_gemma":0.016106235,"teacher_disagreement_score":0.26124164,"about_ca_system_score_codex":0.0005507798,"about_ca_system_score_gemma":0.00010949861,"threshold_uncertainty_score":0.99922967},"labels":[],"label_agreement":null},{"id":"W6989323295","doi":"","title":"An Architecture for the AES-GCM Security Standard","year":2007,"lang":"en","type":"article","venue":"UWSpace (University of Waterloo)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Block cipher mode of operation; Block cipher; Authenticated encryption; Encryption; IPsec; Advanced Encryption Standard; Triple DES; Authentication (law); Block (permutation group theory); Field-programmable gate array","score_opus":0.010656798011412286,"score_gpt":0.2361145585543925,"score_spread":0.22545776054298022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989323295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5762094,0.000025889027,0.42012563,0.0032119881,0.00009119066,0.00021581033,0.000033924982,0.000049907343,0.000036233072],"genre_scores_gemma":[0.94600725,0.000016598873,0.053199127,0.00010067492,0.000035291767,3.4575515e-7,0.00001133241,0.0000053494296,0.00062404556],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9991768,0.00003439111,0.00007963094,0.000229293,0.00021341545,0.00026649426],"domain_scores_gemma":[0.9991163,0.00012275185,0.00007426894,0.00047804444,0.00012284187,0.00008582028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005946219,0.00009229703,0.00012096748,0.00012893917,0.0004622356,0.00004774906,0.00083868037,0.000046704165,0.00003388463],"category_scores_gemma":[0.0000059181875,0.000078283374,0.0001132593,0.00029734857,0.00012737697,0.0002853918,0.00012288764,0.000103713566,0.0000017860142],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040456958,0.00025917243,0.003989456,0.00008838383,0.00017199098,0.000037341793,0.63252634,0.0002681091,0.0030947179,0.20976973,0.00573627,0.1436539],"study_design_scores_gemma":[0.00965872,0.00400011,0.061309945,0.00008023401,0.00030600227,0.000066407694,0.50022346,0.052859258,0.013548565,0.12984742,0.22625078,0.001849066],"about_ca_topic_score_codex":0.0061225286,"about_ca_topic_score_gemma":0.050468475,"teacher_disagreement_score":0.36979783,"about_ca_system_score_codex":0.000023851322,"about_ca_system_score_gemma":0.000033766515,"threshold_uncertainty_score":0.966858},"labels":[],"label_agreement":null},{"id":"W6992246778","doi":"","title":"Lâécole viennoise de contrebasse : genèse et réception","year":2013,"lang":"fr","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"French; ESPACE; Context (archaeology); Western europe","score_opus":0.006382501431413421,"score_gpt":0.17638360631098218,"score_spread":0.17000110487956877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992246778","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024153832,0.0016427856,0.023183033,0.020559989,0.0010590408,0.0009402862,0.0008591153,0.000037643167,0.92756426],"genre_scores_gemma":[0.4312503,0.001832987,0.022256482,0.009811441,0.0003101983,0.00008703601,0.00007001354,0.00013914869,0.5342424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99665374,0.00026108028,0.00048867066,0.0005137655,0.001477295,0.0006054694],"domain_scores_gemma":[0.99834484,0.00030081556,0.0003850607,0.00045919398,0.0000018882471,0.00050819706],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000034347944,0.0003962665,0.0004236513,0.00007414723,0.0002612838,0.00017245744,0.0005777357,0.00008204696,0.0025589154],"category_scores_gemma":[0.000004468232,0.0004102848,0.00007916667,0.0001908173,0.00016154362,0.00068342127,0.0003506222,0.00027881537,5.6522545e-8],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006483047,0.000099277844,0.0077742375,0.00027901048,0.00016064825,0.000103826984,0.00090935745,0.00005946845,0.0035148025,0.90723854,0.02009203,0.059703983],"study_design_scores_gemma":[0.0008398398,0.00014919696,0.055658516,0.00029588904,0.000061234554,0.000024624513,0.001833875,0.022130288,0.003106551,0.004530025,0.91069514,0.0006748507],"about_ca_topic_score_codex":0.03915838,"about_ca_topic_score_gemma":0.25632876,"teacher_disagreement_score":0.90270853,"about_ca_system_score_codex":0.000022705191,"about_ca_system_score_gemma":0.003332049,"threshold_uncertainty_score":0.9998349},"labels":[],"label_agreement":null},{"id":"W7027246576","doi":"","title":"CCSDS Guide for Secure System Interconnection - CCSDS 350.4-G-1","year":2007,"lang":"en","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; National Institute of Information and Communications Technology; Japan Aerospace Exploration Agency; Canadian Space Agency; National Commission for Science and Technology; Iran Telecommunication Research Center; European Space Agency; Agenzia Spaziale Italiana; National Institute of Standards and Technology; European Organization for the Exploitation of Meteorological Satellites; Korea Aerospace Research Institute; U.S. Geological Survey; Indian Space Research Organisation; National Oceanic and Atmospheric Administration; National Space Organization; Belgian Federal Science Policy Office; Chinese Academy of Sciences; Centre National d’Etudes Spatiales; Commonwealth Scientific and Industrial Research Organisation; National Aeronautics and Space Administration","keywords":"Data system; Key (lock); Information system; Space (punctuation); Data security; Interconnection; Reliability (semiconductor); Standardization; Data integrity; Agency (philosophy)","score_opus":0.08510900872241949,"score_gpt":0.39558764088102993,"score_spread":0.31047863215861043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027246576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014215901,0.00016247749,0.96012235,0.0032464745,0.0017750831,0.0023127066,0.0014781455,0.00039756062,0.016289284],"genre_scores_gemma":[0.9732686,0.00003317724,0.024487106,0.00009897797,0.00064051955,0.00033943052,0.00065680535,0.000046142966,0.00042923202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99477184,0.00006770075,0.00085530564,0.0010557467,0.002075986,0.0011734207],"domain_scores_gemma":[0.99483186,0.0010176102,0.00024315857,0.0006804468,0.0028538161,0.00037312598],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0053163106,0.00034761112,0.00033452327,0.0071034995,0.0012737499,0.0027357482,0.0015980507,0.00024419083,0.000026405722],"category_scores_gemma":[0.0015955359,0.00033832822,0.00039003196,0.009744632,0.00033847062,0.0040152757,0.0005786954,0.00038127982,0.00005018141],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011551852,0.00025170308,0.000049828875,0.00013831127,0.00007809297,0.0000081719045,0.00034691123,0.00014029563,0.00073709106,0.9393022,0.050340254,0.008491623],"study_design_scores_gemma":[0.001701194,0.00053153443,0.00035944136,0.00015551632,0.000013812828,0.000078165605,0.0014255187,0.0133787505,0.0017610267,0.02210669,0.9579664,0.00052193395],"about_ca_topic_score_codex":0.00006662847,"about_ca_topic_score_gemma":0.00045405515,"teacher_disagreement_score":0.9590527,"about_ca_system_score_codex":0.0007297144,"about_ca_system_score_gemma":0.00054080604,"threshold_uncertainty_score":0.9999069},"labels":[],"label_agreement":null},{"id":"W7084399279","doi":"10.6084/m9.figshare.30037045.v1","title":"Code and data for: <b>Species loss scenarios identify Canada’s northern ecosystems as disproportionately vulnerable</b>","year":2025,"lang":"en","type":"dataset","venue":"Figshare","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ecosystem; Code (set theory); Identification (biology); Context (archaeology); Biodiversity","score_opus":0.05454355496120367,"score_gpt":0.33321524110958906,"score_spread":0.2786716861483854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084399279","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007586135,0.0005279753,0.00012482646,0.00051410985,0.00044968782,0.00070601783,0.99758655,0.000043451953,0.000039789014],"genre_scores_gemma":[0.00023662673,0.0000548622,0.00011354252,0.0003076945,0.00013831415,0.00026587181,0.99866843,0.000008426216,0.00020624956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976503,0.00007239517,0.0004777919,0.0009125016,0.00051050104,0.00037648794],"domain_scores_gemma":[0.996833,0.00030495052,0.00031813062,0.002102608,0.00031145388,0.00012982913],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019932388,0.00030714678,0.0003474936,0.00016668302,0.0005923479,0.00069578085,0.0027641265,0.00015233312,0.006464562],"category_scores_gemma":[0.0007241875,0.00030005726,0.00006126891,0.000301221,0.000012193946,0.0004150726,0.001745452,0.00033449798,0.000020537584],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022053987,0.000020895588,0.000020774805,0.0007118827,0.000055874876,0.00004010344,0.000019836818,0.0000032833675,1.351486e-7,0.00012837013,0.99862844,0.00036822242],"study_design_scores_gemma":[0.00024014812,0.000018807823,0.00015203048,0.0006447911,0.000026308966,0.000022612736,0.00004173555,0.0010596117,0.0000025791371,0.00013756666,0.9973239,0.0003299503],"about_ca_topic_score_codex":0.1684103,"about_ca_topic_score_gemma":0.98040503,"teacher_disagreement_score":0.8119948,"about_ca_system_score_codex":0.00012221666,"about_ca_system_score_gemma":0.0023475462,"threshold_uncertainty_score":0.99994516},"labels":[],"label_agreement":null},{"id":"W7097000791","doi":"","title":"adc2r07c – Automation/Drive Interface Commands","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Key (lock); Encryption; Interface (matter); Key management; Value (mathematics); Data loss; Term (time)","score_opus":0.015172402102222848,"score_gpt":0.3108746358069497,"score_spread":0.2957022337047268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097000791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046948817,0.00001831539,0.9348892,0.0006921607,0.0001834256,0.00007751589,9.2915093e-7,0.00018376233,0.017005894],"genre_scores_gemma":[0.9174951,0.0000028531556,0.08195852,0.0003631461,0.000020665484,0.0000024112783,0.00000256204,0.000002330162,0.00015242794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993164,0.000014666649,0.00018107658,0.00015162569,0.0001497748,0.00018643682],"domain_scores_gemma":[0.99948245,0.00007072013,0.000038639937,0.00028657983,0.000059930913,0.00006166238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003698032,0.00006404306,0.00006126601,0.00012730232,0.00012156735,0.00009880153,0.0003734692,0.000023262563,0.00017775131],"category_scores_gemma":[0.000007877275,0.000055768316,0.000037344398,0.00040544005,0.000024474852,0.00031902362,0.00013175876,0.0000582784,0.000056145585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002182246,0.00006482484,0.003163006,0.000003883354,0.000013894462,0.0000044089747,0.0026708674,0.000009407762,0.0007519195,0.9463713,0.0076548723,0.039289393],"study_design_scores_gemma":[0.003634959,0.00067267625,0.36488163,0.000043943674,0.000026789423,0.0001383586,0.004320017,0.165421,0.0875009,0.09782654,0.27398005,0.0015531351],"about_ca_topic_score_codex":0.000057756508,"about_ca_topic_score_gemma":0.0002567738,"teacher_disagreement_score":0.8705463,"about_ca_system_score_codex":0.000017774088,"about_ca_system_score_gemma":0.000015255572,"threshold_uncertainty_score":0.22741659},"labels":[],"label_agreement":null},{"id":"W7098158741","doi":"","title":"Cryptographic Module Security Policy For Stealth MXP","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cryptography; Security policy; Cryptographic protocol; Key (lock); Confidentiality; Information security","score_opus":0.048764240246803585,"score_gpt":0.33789784714746157,"score_spread":0.289133606900658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098158741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05377044,0.000074056756,0.9351261,0.004105807,0.0002949482,0.0004922792,0.000022460355,0.00028799463,0.0058259126],"genre_scores_gemma":[0.9300924,0.000016014688,0.0683357,0.001242644,0.00015441811,0.00007481044,0.0000124121425,0.000008329086,0.00006325431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986815,0.000050174796,0.00025152293,0.0003404664,0.0002708838,0.00040543976],"domain_scores_gemma":[0.9988152,0.00006266155,0.00007026369,0.00053453457,0.00022892916,0.00028845144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005764178,0.00012965004,0.0001485737,0.00036018848,0.0001746117,0.00017180822,0.00060745573,0.00004872985,0.000015265983],"category_scores_gemma":[0.000060343984,0.000116366915,0.00011758215,0.001065839,0.00004530033,0.00044315116,0.00016360778,0.00007749547,0.000012975463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043610794,0.00007737083,0.00097232446,0.000009467657,0.0000108528375,4.1511825e-7,0.0012426483,0.0000060279103,0.0000072648845,0.9842914,0.0093083,0.0040695984],"study_design_scores_gemma":[0.0019118078,0.00039600226,0.00340812,0.000005062696,0.00000767353,0.000012687554,0.0005925524,0.035604272,0.00023791917,0.86918175,0.08828003,0.00036213285],"about_ca_topic_score_codex":0.00093902677,"about_ca_topic_score_gemma":0.00052587147,"teacher_disagreement_score":0.876322,"about_ca_system_score_codex":0.000041343756,"about_ca_system_score_gemma":0.000277946,"threshold_uncertainty_score":0.4745305},"labels":[],"label_agreement":null},{"id":"W7115935905","doi":"10.5281/zenodo.17957901","title":"Attacks on Approximate Caches in Text-to-Image Diffusion Models","year":2025,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Diffusion; Code (set theory); Artifact (error); Source code","score_opus":0.046269056298961234,"score_gpt":0.2921262082171869,"score_spread":0.24585715191822566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115935905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07040865,0.00015599038,0.6874407,0.01042003,0.00050724164,0.002461683,0.00039105024,0.0009038646,0.22731076],"genre_scores_gemma":[0.99435574,0.0002385556,0.0024580183,0.0010689927,0.00006545996,2.8384508e-7,0.0004072427,0.0006565179,0.00074918196],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960723,0.0006864677,0.0006604493,0.0011130936,0.00065227476,0.00081544474],"domain_scores_gemma":[0.997795,0.000064948625,0.00014117821,0.0011372808,0.00058354466,0.00027807528],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014118113,0.00032587638,0.0003137766,0.0015038521,0.0030576938,0.0027440684,0.0025310428,0.00011871826,0.0032013329],"category_scores_gemma":[0.00034033792,0.00036360533,0.000112637725,0.0036945494,0.00020909784,0.00073342834,0.0040310295,0.0005658417,0.0021141837],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024441714,0.0016329337,0.00002181172,0.00029148182,0.00007711867,0.000049880833,0.01562924,0.0019789082,0.0038881137,0.31474936,0.13410579,0.52733094],"study_design_scores_gemma":[0.0022823247,0.00078537024,0.0024185984,0.00042386426,0.000027237074,0.000026823467,0.0015167077,0.26062888,0.0006514733,0.010278815,0.72025746,0.00070245034],"about_ca_topic_score_codex":0.000095626536,"about_ca_topic_score_gemma":0.0000067325363,"teacher_disagreement_score":0.9239471,"about_ca_system_score_codex":0.0003299063,"about_ca_system_score_gemma":0.000016884655,"threshold_uncertainty_score":0.99988157},"labels":[],"label_agreement":null},{"id":"W7116350958","doi":"10.18280/ijsse.150906","title":"FPGA Implementation of SFN Lightweight Encryption Algorithm","year":2025,"lang":"","type":"article","venue":"International Journal of Safety and Security Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Field-programmable gate array; Encryption; Cryptography; Algorithm design","score_opus":0.0054581628328545665,"score_gpt":0.2729842389360038,"score_spread":0.26752607610314927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116350958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064434834,0.0025783344,0.9258643,0.0025913005,0.0040664757,0.00018863047,0.00011173043,0.000016077442,0.00014833982],"genre_scores_gemma":[0.9791192,0.0058101285,0.0146692265,0.00008090495,0.000284397,0.0000020768884,0.000015466047,0.000008571758,0.0000100500865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971573,0.00006888931,0.0015552171,0.00024728943,0.0007202855,0.00025103157],"domain_scores_gemma":[0.99773735,0.00018319402,0.0007201647,0.00017746477,0.001067328,0.00011452385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000954484,0.00024011885,0.0004153209,0.0010515535,0.00010930281,0.00019873165,0.00073184306,0.00011493135,0.00011594371],"category_scores_gemma":[0.000052763913,0.00025295862,0.00025605276,0.00058430067,0.00007034997,0.0010402516,0.00027269276,0.00038460206,7.691813e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016730094,0.0003246866,0.0025652684,0.00023386368,0.0015472823,0.00007199804,0.011653157,0.0012234278,0.0018116096,0.19580205,0.0002044836,0.78439486],"study_design_scores_gemma":[0.017670607,0.0016816797,0.18091042,0.0037055027,0.0008440813,0.0009944786,0.007871478,0.5862136,0.056349035,0.041494165,0.10040723,0.0018577359],"about_ca_topic_score_codex":0.0001120677,"about_ca_topic_score_gemma":0.000029435752,"teacher_disagreement_score":0.91468436,"about_ca_system_score_codex":0.0001512518,"about_ca_system_score_gemma":0.00024074857,"threshold_uncertainty_score":0.99999225},"labels":[],"label_agreement":null},{"id":"W7126046435","doi":"10.1109/bibm66473.2025.11356841","title":"Efficient Data Integrity Verification Scheme Based on Multi-Branch Authentication Tree for Electronic Health Record","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Data integrity; Authentication (law); Scheme (mathematics); Tree (set theory); Message authentication code; Enhanced Data Rates for GSM Evolution; Data security; Confidentiality; Data verification; Information privacy","score_opus":0.07816184379487977,"score_gpt":0.3821210973675394,"score_spread":0.3039592535726596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126046435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011981241,0.00022200265,0.965545,0.017937645,0.0012183365,0.0026078667,0.00020996403,0.00013855858,0.0001394035],"genre_scores_gemma":[0.87858325,0.00009225298,0.11832229,0.0019090966,0.000051679526,0.0002117731,0.0006345409,0.000014656535,0.00018045826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956337,0.0003301177,0.0010756756,0.0016189056,0.00043125238,0.00091034046],"domain_scores_gemma":[0.9954012,0.00041547735,0.00041545962,0.0032309573,0.00037843475,0.00015845249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030154912,0.00035521536,0.00038626906,0.0006297224,0.0008942887,0.00040484415,0.0020024453,0.00014632379,0.00008109279],"category_scores_gemma":[0.00024117739,0.0003609127,0.00017720879,0.0019713235,0.00011007681,0.00023185575,0.0002355854,0.0004971681,0.000020828675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019285742,0.0031566918,0.00070916646,0.0003294089,0.00008671752,1.1491165e-7,0.00080356485,0.00038005,0.00058193743,0.4043102,0.0057332395,0.58371603],"study_design_scores_gemma":[0.0023317821,0.0004938269,0.005667703,0.00012329762,0.000035398578,2.602497e-7,0.00012594435,0.9759555,0.00040892107,0.0015121514,0.013055185,0.00029002],"about_ca_topic_score_codex":0.0005828398,"about_ca_topic_score_gemma":0.0019781673,"teacher_disagreement_score":0.97557545,"about_ca_system_score_codex":0.00052674866,"about_ca_system_score_gemma":0.0022934638,"threshold_uncertainty_score":0.9998843},"labels":[],"label_agreement":null},{"id":"W7126153785","doi":"10.18280/isi.301218","title":"Enhanced Security in Information Transmission: Redundant Stream Ciphers with Time Delay Integration","year":2025,"lang":"","type":"article","venue":"Ingénierie des systèmes d information","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stream cipher; Cryptography; Redundancy (engineering); Stream cipher attack; Information security; Block cipher","score_opus":0.007029123338848928,"score_gpt":0.24039423866763304,"score_spread":0.23336511532878412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126153785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17667271,0.00013367248,0.80030704,0.00039302756,0.0004320485,0.0015084208,0.000055946417,0.0001869133,0.020310251],"genre_scores_gemma":[0.99112135,0.00021275003,0.0074007753,0.00043832947,0.000026296524,0.00019030012,0.00055772165,0.000009972911,0.000042475564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956368,0.0002677692,0.002236578,0.00036282447,0.0007522701,0.0007437173],"domain_scores_gemma":[0.9972477,0.00012989945,0.00085415907,0.0006697354,0.00091842347,0.00018007337],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.001216242,0.0005605979,0.0005527419,0.0017617036,0.00075166544,0.0017878624,0.00071919063,0.00033812743,0.00020615394],"category_scores_gemma":[0.00012982413,0.0005241743,0.00016774244,0.0042049508,0.0003255048,0.02024799,0.00015111636,0.00056071545,0.000099519275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003989874,0.00017376449,0.00030327353,0.0007606936,0.00011157301,0.0000038681005,0.11389438,0.0018732348,0.00019470588,0.048109747,0.00061612664,0.83355963],"study_design_scores_gemma":[0.0077434573,0.0014166768,0.01206624,0.005161754,0.00018587345,0.00007921868,0.02570334,0.88735914,0.011546296,0.027845982,0.018957296,0.0019347182],"about_ca_topic_score_codex":0.0007898961,"about_ca_topic_score_gemma":0.0003275653,"teacher_disagreement_score":0.8854859,"about_ca_system_score_codex":0.00087764725,"about_ca_system_score_gemma":0.0009307833,"threshold_uncertainty_score":0.999721},"labels":[],"label_agreement":null},{"id":"W7162193683","doi":"10.65521/ijeecs.v14i2.2140","title":"A Comprehensive Review of Resource-Constrained Encryption Design with Hospital Information Systems: Security Models, Optimization Techniques, and Emerging Computing Applications","year":2025,"lang":"","type":"article","venue":"International Journal of Electrical Electronics and Computer Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Encryption; Homomorphic encryption; Confidentiality; Cryptography; Client-side encryption; Wearable computer; Data security; Energy consumption; Key (lock)","score_opus":0.007568651476645328,"score_gpt":0.2536518010077972,"score_spread":0.2460831495311519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7162193683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005931377,0.08639207,0.9105098,0.0005814494,0.0004319132,0.0013500279,0.000015837926,0.00003010877,0.0000956314],"genre_scores_gemma":[0.8615225,0.0852995,0.052084073,0.00040472313,0.00053194136,0.00007116776,0.00006085685,0.00002151181,0.00000371856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995931,0.00044224743,0.0020019305,0.00035984258,0.00088777463,0.00037716312],"domain_scores_gemma":[0.9940358,0.00035663805,0.002030322,0.00024910542,0.0031921575,0.00013601995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012341606,0.0003440346,0.0007445756,0.0009803564,0.0002374061,0.0006508132,0.00070913386,0.00014943014,0.0000010924977],"category_scores_gemma":[0.00002194799,0.00031490024,0.00013761227,0.0012030762,0.00013174523,0.001168762,0.00021939499,0.00055012637,1.278552e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030117942,0.0005849776,0.00013759169,0.00538041,0.0017989166,0.000029250637,0.0018571615,0.13226521,0.000025014504,0.5878761,0.0013545784,0.26838964],"study_design_scores_gemma":[0.001196039,0.0013157192,0.000018139861,0.005666928,0.00015450931,0.0007426231,0.00014118088,0.97446084,0.000023718661,0.0007526393,0.015249583,0.00027810494],"about_ca_topic_score_codex":0.00006197822,"about_ca_topic_score_gemma":6.497256e-7,"teacher_disagreement_score":0.86092937,"about_ca_system_score_codex":0.0002708737,"about_ca_system_score_gemma":0.00065827934,"threshold_uncertainty_score":0.9999303},"labels":[],"label_agreement":null},{"id":"W75616540","doi":"10.1007/978-1-4419-1530-6_7","title":"Data Integrity and Message Authentication","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Data integrity; Hash function; Computer science; Message authentication code; Hash-based message authentication code; Data Authentication Algorithm; Computer security; Authentication (law); Cryptographic hash function; Encryption; Confidentiality; Secure Hash Algorithm; Cryptography; Authentication protocol; SHA-2","score_opus":0.08072186766866513,"score_gpt":0.3207497232972838,"score_spread":0.24002785562861867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75616540","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022406157,0.00047600848,0.37650332,0.0027102104,0.00014947451,0.0002660923,0.00013933468,0.00017269417,0.6195605],"genre_scores_gemma":[0.041018438,0.0030785343,0.3197996,0.0027749457,0.00033551917,0.000012364095,0.0025002747,0.000053611577,0.6304267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901736,0.00001003925,0.00020572073,0.0004703924,0.00018976448,0.000106721054],"domain_scores_gemma":[0.99846804,0.000039239454,0.000086782515,0.0012987411,0.00004948079,0.00005771914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028013482,0.00013989324,0.00013777448,0.00012469418,0.00008956699,0.00019302228,0.0009446903,0.00010337637,0.000222021],"category_scores_gemma":[0.000008329095,0.0001234856,0.000028887293,0.000035661895,0.000046006313,0.00035965422,0.0005813227,0.0002604893,0.000020785188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.0611088e-7,0.000006453231,0.0000034100356,0.0000043715268,0.000009766651,0.0000015271698,0.00007235503,4.2079225e-9,0.0000020389298,0.86082906,0.0039750477,0.13509564],"study_design_scores_gemma":[0.000111020985,0.000029323799,0.00045960947,0.000021451762,0.000023656006,0.00001095699,0.000008529898,0.0036686459,0.0000033841204,0.4607054,0.5347456,0.00021246371],"about_ca_topic_score_codex":0.000027513117,"about_ca_topic_score_gemma":0.00016164748,"teacher_disagreement_score":0.53077054,"about_ca_system_score_codex":0.000010739738,"about_ca_system_score_gemma":0.000045166325,"threshold_uncertainty_score":0.50355965},"labels":[],"label_agreement":null},{"id":"W806182678","doi":"10.1007/978-3-319-17533-1_3","title":"Differential Fault Analysis of Streebog","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; GOST (hash function); Cryptographic hash function; Block cipher; MDC-2; Byte; Theoretical computer science; Algorithm; Cryptography; Double hashing; Computer security; Computer hardware","score_opus":0.030337706526008857,"score_gpt":0.29329365021803216,"score_spread":0.2629559436920233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W806182678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014287933,0.00015380568,0.9960989,0.00015609991,0.0007092962,0.00019371274,0.000036525158,0.000055371973,0.0011675168],"genre_scores_gemma":[0.8583947,0.000027133345,0.14114048,0.00016751174,0.00013879774,0.000004791642,0.000038638358,0.000014490322,0.000073469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967868,0.00003006173,0.0005928748,0.0009819353,0.0011934306,0.00041493177],"domain_scores_gemma":[0.997576,0.00022339834,0.00034849602,0.0012638886,0.0004333368,0.00015486187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004898238,0.0003422164,0.00066365756,0.0024369021,0.00012207218,0.0002447034,0.0024513574,0.00017911712,0.00011371509],"category_scores_gemma":[0.000036707388,0.0003064096,0.00028439736,0.0022110962,0.0005182022,0.0003118089,0.0010269139,0.00037442366,0.000004422328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008170569,0.00010356179,0.0007807902,0.000034225035,0.00037668616,0.00003479796,0.002489989,0.03192513,0.00016535724,0.18980502,0.00006759468,0.77420866],"study_design_scores_gemma":[0.00036362128,0.00018417645,0.0012691505,0.00007290745,0.00020642782,0.000006565789,6.027428e-7,0.8482809,0.00040776227,0.14771754,0.00090881524,0.00058151805],"about_ca_topic_score_codex":0.00009533217,"about_ca_topic_score_gemma":0.000683984,"teacher_disagreement_score":0.8569659,"about_ca_system_score_codex":0.000120164645,"about_ca_system_score_gemma":0.00037084488,"threshold_uncertainty_score":0.9999388},"labels":[],"label_agreement":null},{"id":"W80835161","doi":"10.1007/978-3-319-13039-2_7","title":"Linear Cryptanalysis of the PP-1 and PP-2 Block Ciphers","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Linear cryptanalysis; Impossible differential cryptanalysis; Block cipher; Differential cryptanalysis; Higher-order differential cryptanalysis; Boomerang attack; Cryptanalysis; Computer science; Algorithm; Theoretical computer science; Arithmetic; Cryptography; Mathematics","score_opus":0.014035366588223365,"score_gpt":0.2524765620033397,"score_spread":0.23844119541511632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W80835161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041049137,0.0005800319,0.9962001,0.0006577396,0.00043763427,0.00021610167,0.0000053180174,0.00005222218,0.0014403731],"genre_scores_gemma":[0.6333342,0.0003052358,0.36444297,0.0013472424,0.00026888712,0.0000072647513,0.0000026470673,0.00004474144,0.0002468275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997743,0.000040636187,0.00040734492,0.0007795409,0.0007040978,0.00032534386],"domain_scores_gemma":[0.99799365,0.00023684523,0.00031513747,0.0012219865,0.00014158215,0.000090824324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006189767,0.00028452143,0.00037860128,0.00034962432,0.00021793407,0.00016235525,0.0020557716,0.00014073132,0.000014710894],"category_scores_gemma":[0.00003869802,0.00020734116,0.00015775773,0.00087624695,0.0008624016,0.00012609309,0.0011238117,0.0003464416,0.0000019643303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050862277,0.000049324484,0.0021790885,0.0001087436,0.000096592245,0.000013365023,0.0021963208,0.010000767,0.00030584878,0.28161964,0.00038908585,0.7030361],"study_design_scores_gemma":[0.00063864095,0.00022448713,0.0011586727,0.000380412,0.00007760324,0.00006185011,0.0000018434544,0.8319472,0.0015070889,0.1462808,0.01674055,0.0009808526],"about_ca_topic_score_codex":0.00011612943,"about_ca_topic_score_gemma":0.00036520374,"teacher_disagreement_score":0.82194644,"about_ca_system_score_codex":0.00004005468,"about_ca_system_score_gemma":0.00015651683,"threshold_uncertainty_score":0.84551275},"labels":[],"label_agreement":null},{"id":"W832575060","doi":"10.1007/978-3-319-18681-8_22","title":"Impossible Differential Properties of Reduced Round Streebog","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Block cipher mode of operation; CBC-MAC; Hash function; Construct (python library); Differential cryptanalysis; Differential (mechanical device); Cryptography; MDC-2; Block (permutation group theory); Triple DES; Key (lock); Theoretical computer science; Algorithm; Function (biology); Arithmetic; Cryptographic hash function; Computer security; Mathematics; Computer network","score_opus":0.04942437700887748,"score_gpt":0.2799178023411172,"score_spread":0.2304934253322397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W832575060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013190365,0.0005012465,0.9837092,0.00025029897,0.0012445244,0.00037080242,0.000010757389,0.000076291246,0.0006464706],"genre_scores_gemma":[0.93392414,0.000022639702,0.06564574,0.00008693807,0.0002069383,0.000007953999,0.000006130627,0.000017963766,0.00008155308],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688095,0.00003335512,0.00059584173,0.00093820336,0.0010698818,0.00048174185],"domain_scores_gemma":[0.9979028,0.0000804609,0.00032002147,0.0011160041,0.0004297457,0.0001509425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005395642,0.00037945,0.0004831759,0.00080953364,0.00017976497,0.00040818297,0.0023656404,0.0001822972,0.000029485314],"category_scores_gemma":[0.00004024487,0.00031411767,0.00013547098,0.000593887,0.0007108862,0.00054047507,0.0011428676,0.00042470664,0.0000046944847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003782648,0.00022680906,0.00017948663,0.00022474368,0.000075380885,0.00004798493,0.006745646,0.0037810004,0.012828049,0.20862873,0.00015544379,0.7670689],"study_design_scores_gemma":[0.0013878052,0.0008526928,0.0003244858,0.0008767056,0.00004100341,0.0000873054,0.0000027584883,0.47576964,0.032793052,0.48495734,0.0012505888,0.0016566259],"about_ca_topic_score_codex":0.000118819815,"about_ca_topic_score_gemma":0.00018896705,"teacher_disagreement_score":0.92073375,"about_ca_system_score_codex":0.0001499032,"about_ca_system_score_gemma":0.00071057875,"threshold_uncertainty_score":0.9999311},"labels":[],"label_agreement":null},{"id":"W87896560","doi":"10.1007/978-3-642-40576-1_18","title":"Slide Attacks against Iterated Hill Ciphers","year":2013,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Iterated function; Computer science; Cryptanalysis; Cipher; Block cipher; Stream cipher; Boomerang attack; Differential cryptanalysis; Theoretical computer science; Computer security; Cryptography; Mathematics; Encryption","score_opus":0.037023911784221875,"score_gpt":0.3001247951444379,"score_spread":0.26310088336021603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87896560","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045853903,0.0003730554,0.4368121,0.002324838,0.00053545553,0.00088732684,0.000034285236,0.00021708,0.5583573],"genre_scores_gemma":[0.31275836,0.014198064,0.6531893,0.014185559,0.00015021898,0.00026499585,0.0008370864,0.00005051992,0.0043658568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979887,0.00004802857,0.00086956617,0.00032607853,0.00046500177,0.00030263275],"domain_scores_gemma":[0.99643594,0.0001868755,0.0003814491,0.0022722345,0.0005690908,0.00015440195],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010989672,0.00025354992,0.00024833195,0.0012328761,0.00064059236,0.0013817707,0.0034074974,0.00012656196,0.00004524918],"category_scores_gemma":[0.000031104002,0.00025328982,0.00006357138,0.00073894626,0.0007365493,0.008938312,0.0022557615,0.0004629217,0.00014745176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.037783e-7,0.000011664785,0.00003457509,0.000012519999,0.0000058786786,3.0020607e-7,0.0020577332,0.00006631045,0.0000033416266,0.743621,0.0013113826,0.25287482],"study_design_scores_gemma":[0.00041191807,0.00004876531,0.0011943659,0.00015267197,0.0000051061693,0.000015703225,0.00006853145,0.525577,0.0000071657373,0.012768808,0.4592475,0.0005024586],"about_ca_topic_score_codex":0.00002658199,"about_ca_topic_score_gemma":0.00001939414,"teacher_disagreement_score":0.7308522,"about_ca_system_score_codex":0.00013065281,"about_ca_system_score_gemma":0.00025658513,"threshold_uncertainty_score":0.99999195},"labels":[],"label_agreement":null},{"id":"W8934979","doi":"","title":"Evaluation of Security Level of Cryptography: The Revised Version of EPOC-2","year":2001,"lang":"en","type":"article","venue":"Anesthesia Progress","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Computer security; Computer science","score_opus":0.09509715544867438,"score_gpt":0.34249391509083693,"score_spread":0.24739675964216257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8934979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99069506,0.00092106796,0.006787908,0.00088348705,0.000032507895,0.0004978801,0.000004451279,0.000017448112,0.00016016467],"genre_scores_gemma":[0.99630415,0.000087533444,0.0035348951,0.000027814784,0.000010429802,0.000024612604,0.000005486978,0.000004268758,7.8733956e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99797624,0.00033105345,0.00040589788,0.00018416159,0.00095429964,0.0001483163],"domain_scores_gemma":[0.9981257,0.00007591949,0.00038931184,0.0005696771,0.0008094465,0.000029997958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022312861,0.000098099954,0.0001974294,0.0001604052,0.00007735342,0.000018259612,0.0005904319,0.00004307448,0.00003880186],"category_scores_gemma":[0.00003259834,0.0000723839,0.00014398864,0.0009924809,0.0002255219,0.00020831049,0.000057489447,0.00006196175,9.66451e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014098025,0.001609915,0.23027661,0.0003289246,0.00028712655,0.00001857611,0.0147532355,0.00007005927,0.0013974692,0.27530447,0.0009862134,0.47482643],"study_design_scores_gemma":[0.006031585,0.00159816,0.7414923,0.00052041595,0.0007956926,0.00025393267,0.0026126842,0.076122046,0.039449636,0.11830146,0.012025967,0.0007961766],"about_ca_topic_score_codex":0.00011786916,"about_ca_topic_score_gemma":0.000019321094,"teacher_disagreement_score":0.5112156,"about_ca_system_score_codex":0.000010389445,"about_ca_system_score_gemma":0.000095943746,"threshold_uncertainty_score":0.295173},"labels":[],"label_agreement":null},{"id":"W982556791","doi":"10.1109/mnrc15848.2009.5338939","title":"Low-power AES coprocessor in 0.18 µm CMOS technology for secure microsystems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Coprocessor; Advanced Encryption Standard; Embedded system; Microsystem; Cryptography; CMOS; Computer science; Encryption; Microelectronics; Design flow; Computer hardware; Electrical engineering; Engineering; Operating system; Materials science; Computer security","score_opus":0.011240305509262744,"score_gpt":0.2907825052905667,"score_spread":0.27954219978130396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W982556791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38614777,0.00023381629,0.60432106,0.00660133,0.00026425626,0.0008267104,0.000014871756,0.00032050154,0.0012696845],"genre_scores_gemma":[0.9770374,0.0000075436874,0.02221423,0.00057615014,0.000015927933,0.00005638248,0.00000434702,0.0000038835074,0.000084175525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990034,0.0000114852055,0.0002642409,0.00031034288,0.00010622446,0.0003042771],"domain_scores_gemma":[0.9994613,0.00003215352,0.000058532085,0.0003122781,0.00009927165,0.000036451325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018499486,0.000109063985,0.00015271294,0.00032535096,0.00009466547,0.0001013626,0.000525183,0.00009206929,0.000045690944],"category_scores_gemma":[0.000015771479,0.00009597109,0.000050235172,0.0009339028,0.000028254737,0.00022185362,0.00005344303,0.00008577101,0.000008147731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001612815,0.0004259597,0.0033193843,0.000058573223,0.000015508764,0.000012162685,0.002464098,0.000008985075,0.010748906,0.9404911,0.020887624,0.021551592],"study_design_scores_gemma":[0.012181768,0.0034507238,0.016745917,0.00032404065,0.00002734688,0.00022870557,0.0070377714,0.03981201,0.15721856,0.47675395,0.28351462,0.0027045878],"about_ca_topic_score_codex":0.000021103702,"about_ca_topic_score_gemma":0.00024408102,"teacher_disagreement_score":0.5908896,"about_ca_system_score_codex":0.000021503502,"about_ca_system_score_gemma":0.00004248886,"threshold_uncertainty_score":0.39135873},"labels":[],"label_agreement":null}]}