{"meta":{"query_hash":"3655c7f74ef4","filters":{"venue":"Journal of Cryptographic Engineering"},"cohort_total":19,"direct_labels_cover":0,"predictions_cover":19,"exported":19,"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/3655c7f74ef4","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Cryptographic+Engineering"},"results":[{"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":"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":"W1999613060","doi":"10.1007/s13389-011-0017-8","title":"Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":49,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Consejo Nacional de Ciencia y Tecnología; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Scalar multiplication; Elliptic curve cryptography; Edwards curve; Arithmetic; Elliptic curve; Elliptic curve point multiplication; Parallel computing; Computer science; Binary number; Side channel attack; Multiplication (music); Curve25519; Mathematics; Cryptography; Algorithm; Public-key cryptography; Encryption; Pure mathematics","score_opus":0.026526956020350424,"score_gpt":0.2340954477578505,"score_spread":0.20756849173750005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999613060","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.5071194,0.0022768243,0.48977944,0.00013559677,0.00050452753,0.00011648044,2.818113e-7,0.00004913579,0.000018282779],"genre_scores_gemma":[0.88656694,0.0008832482,0.11221539,0.000049221322,0.00026227676,0.0000029205787,4.081525e-7,0.000018286655,0.0000012917941],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99850214,0.000046551733,0.0005563395,0.00021556343,0.00041531379,0.00026412186],"domain_scores_gemma":[0.99869,0.00008846505,0.00043943647,0.000423698,0.00020131927,0.0001570698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053447386,0.00019756528,0.0002283398,0.00069184427,0.00015810666,0.00008847602,0.00076395075,0.00009511761,0.0000053875947],"category_scores_gemma":[0.00006385953,0.00014954436,0.0002706105,0.0014971496,0.000057374742,0.00096001406,0.00008948102,0.00040753686,9.161196e-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.00013691114,0.0006207106,0.14689809,0.0010149482,0.0010831525,0.00009093747,0.0091709485,0.10406159,0.59392667,0.057168156,0.0005503571,0.08527755],"study_design_scores_gemma":[0.0014761233,0.00021542699,0.52897066,0.0013613343,0.00021158106,0.0007571293,0.00019668373,0.4467318,0.01621336,0.002430273,0.00082512805,0.0006104718],"about_ca_topic_score_codex":0.000060317827,"about_ca_topic_score_gemma":0.0000027107042,"teacher_disagreement_score":0.5777133,"about_ca_system_score_codex":0.00003868046,"about_ca_system_score_gemma":0.00005597488,"threshold_uncertainty_score":0.6098242},"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":"W2070532428","doi":"10.1007/s13389-011-0003-1","title":"Algorithm-level error detection for Montgomery ladder-based ECSM","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","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":"Correctness; Scalar multiplication; Computer science; Elliptic curve cryptography; Cryptography; Algorithm; Elliptic curve; Fault detection and isolation; Computation; Arithmetic; Mathematics; Public-key cryptography; Computer security; Artificial intelligence","score_opus":0.03866171637910226,"score_gpt":0.22259061327719776,"score_spread":0.1839288968980955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070532428","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.02219768,0.00063189527,0.9757245,0.000058060315,0.0011139851,0.00014103448,0.0000033572678,0.000092994946,0.000036466274],"genre_scores_gemma":[0.52865386,0.00002072341,0.4711355,0.00003512219,0.00012535494,0.000010762152,2.2052188e-7,0.00001650339,0.000001921919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985949,0.000025858102,0.00051316206,0.00019902215,0.00031764846,0.00034943956],"domain_scores_gemma":[0.9988053,0.0001666996,0.00028013115,0.00029133854,0.0002730986,0.00018345118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054641487,0.00020625717,0.00028984682,0.0011793192,0.0001029259,0.000068245936,0.00062856707,0.00011715638,0.0000068113964],"category_scores_gemma":[0.000078785764,0.00018172518,0.00050617906,0.0009790619,0.00003746064,0.0005029674,0.000036908103,0.00030282096,0.0000011033416],"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.00029530554,0.0014044294,0.0035543425,0.00067918125,0.0015943564,0.00037608857,0.003178543,0.028632252,0.0695676,0.024379382,0.00035217023,0.86598635],"study_design_scores_gemma":[0.005793058,0.0044590537,0.11952904,0.0008546164,0.00038290385,0.00082179665,0.00022212112,0.73147225,0.10845735,0.019510176,0.006549205,0.0019484145],"about_ca_topic_score_codex":0.000009860328,"about_ca_topic_score_gemma":0.0000055730616,"teacher_disagreement_score":0.86403793,"about_ca_system_score_codex":0.000019185936,"about_ca_system_score_gemma":0.000053501724,"threshold_uncertainty_score":0.74105376},"labels":[],"label_agreement":null},{"id":"W2070626323","doi":"10.1007/s13389-012-0035-1","title":"Sequential multiplier with sub-linear gate complexity","year":2012,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Coding theory and cryptography","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":"University of Waterloo","funders":"","keywords":"Multiplier (economics); Finite field; Mathematics; Binary number; Arithmetic; Time complexity; Computational complexity theory; Algorithm; Computer science; Discrete mathematics","score_opus":0.020973259563839622,"score_gpt":0.2258844092521239,"score_spread":0.20491114968828428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070626323","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.40098038,0.0003468492,0.5978943,0.000067112,0.0005017659,0.00004320816,6.139459e-7,0.00007095054,0.000094824216],"genre_scores_gemma":[0.87016237,0.00003282848,0.12938407,0.000044493107,0.00035612064,0.0000018955134,3.172429e-7,0.000016569147,0.0000013355385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985893,0.000050370072,0.00038021134,0.0001316552,0.0004030143,0.00044544885],"domain_scores_gemma":[0.998916,0.00009455064,0.0002361429,0.00030796413,0.00015683191,0.000288536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085330545,0.00020251304,0.0002791878,0.00056755927,0.00009125345,0.00007567294,0.00061115634,0.00006210633,0.000012178677],"category_scores_gemma":[0.000029225397,0.0001599953,0.00024799386,0.00090858346,0.000079624624,0.0009964181,0.00008733954,0.0004075098,0.000004233443],"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.00030007216,0.0006800094,0.04209633,0.00021000828,0.0010167097,0.00017576192,0.002775786,0.03559173,0.07962363,0.82832354,0.00021185263,0.008994572],"study_design_scores_gemma":[0.0179555,0.0054071327,0.41483796,0.0027579055,0.001031954,0.011706832,0.00052480877,0.26966763,0.14466022,0.047233894,0.07691675,0.0072994],"about_ca_topic_score_codex":0.0000014183237,"about_ca_topic_score_gemma":7.693916e-7,"teacher_disagreement_score":0.78108966,"about_ca_system_score_codex":0.00001855401,"about_ca_system_score_gemma":0.0000278877,"threshold_uncertainty_score":0.65244186},"labels":[],"label_agreement":null},{"id":"W2121404865","doi":"10.1007/s13389-015-0110-5","title":"Faster 64-bit universal hashing using carry-less multiplications","year":2015,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":28,"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 New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Byte; Computer science; Carry (investment); Arithmetic; Parallel computing; Universal hashing; Bit (key); Set (abstract data type); Double hashing; Multiplication (music); Cryptographic hash function; Mathematics; Computer hardware; Computer network; Combinatorics; Computer security; Programming language","score_opus":0.0391017793814229,"score_gpt":0.24650318069680693,"score_spread":0.20740140131538404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121404865","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.12256483,0.00035721532,0.8762266,0.00011669425,0.0005990362,0.00003784159,0.0000014432256,0.00004513709,0.000051180104],"genre_scores_gemma":[0.6460477,0.000016845841,0.35369003,0.000021376107,0.00020768613,5.2783105e-7,8.038297e-7,0.000011618488,0.0000033664078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893814,0.000023713292,0.00032430186,0.00014005868,0.00036597997,0.00020777559],"domain_scores_gemma":[0.9989158,0.00005601093,0.0002064012,0.0003096819,0.00026806953,0.00024405139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003628225,0.00012730199,0.00018900132,0.00045147692,0.00006929984,0.00016422154,0.0007016929,0.000058660215,0.0000014947177],"category_scores_gemma":[0.000050964827,0.00011282303,0.00011096116,0.0005515192,0.000018780893,0.0013465732,0.00018305938,0.00028331563,0.0000013338921],"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.00003510455,0.00023967156,0.0077214413,0.00008544621,0.00029986317,0.00032159366,0.0048299576,0.84728956,0.07822069,0.03461881,0.0008867124,0.025451168],"study_design_scores_gemma":[0.00078569225,0.00007274232,0.0020675035,0.00020448098,0.000025258818,0.00030069673,0.0002566214,0.98782825,0.00053242245,0.00039151232,0.0072926306,0.00024215631],"about_ca_topic_score_codex":0.0000192625,"about_ca_topic_score_gemma":0.0000011671027,"teacher_disagreement_score":0.5234829,"about_ca_system_score_codex":0.00005620189,"about_ca_system_score_gemma":0.00008676997,"threshold_uncertainty_score":0.46007895},"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":"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":"W2594864105","doi":"10.1007/s13389-017-0154-9","title":"Montgomery reduction within the context of residue number system arithmetic","year":2017,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","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":"Agence Nationale de la Recherche","keywords":"Residue number system; Arithmetic; Computer science; Reduction (mathematics); Cryptography; Implementation; Context (archaeology); Parallel computing; Theoretical computer science; Mathematics; Algorithm; Programming language; History","score_opus":0.00809598719957067,"score_gpt":0.21958840218044023,"score_spread":0.21149241498086957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594864105","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.7149822,0.0017083219,0.2776663,0.0010103367,0.0036891417,0.00021696239,0.0000018861267,0.00008504164,0.00063976797],"genre_scores_gemma":[0.9780057,0.0000994313,0.02163947,0.000010218752,0.00022021693,0.000003906322,9.1412815e-8,0.000015054649,0.0000059260997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99826556,0.000065701526,0.00074482267,0.00016984653,0.0005240687,0.00023001018],"domain_scores_gemma":[0.9974744,0.00012554791,0.0011040439,0.0008920212,0.00028888235,0.00011514686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012402178,0.00018276078,0.00038279864,0.00040800738,0.00030398482,0.0002551045,0.0015625072,0.00009611802,0.0000019387387],"category_scores_gemma":[0.00014432851,0.0001237253,0.00038099338,0.0004603485,0.00017442284,0.00070356956,0.00013200687,0.00046658807,0.0000016735534],"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.00013302789,0.00028529658,0.021863865,0.0009104707,0.0014148583,0.00032527538,0.0055279587,0.018845076,0.03788568,0.89632505,0.00062656985,0.015856883],"study_design_scores_gemma":[0.009871125,0.0020033275,0.61738867,0.01019161,0.0013049108,0.021286367,0.011631976,0.15896873,0.1368592,0.022986645,0.004250376,0.0032570555],"about_ca_topic_score_codex":0.00005951328,"about_ca_topic_score_gemma":0.0000052568894,"teacher_disagreement_score":0.8733384,"about_ca_system_score_codex":0.000023646868,"about_ca_system_score_gemma":0.000062094834,"threshold_uncertainty_score":0.5045371},"labels":[],"label_agreement":null},{"id":"W2806079250","doi":"10.1007/s13389-018-0197-6","title":"A new class of irreducible pentanomials for polynomial-based multipliers in binary fields","year":2018,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","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":"Carleton University","funders":"H2020 Marie Skłodowska-Curie Actions; European Commission","keywords":"Multiplier (economics); Modulo; Finite field; Binary number; Class (philosophy); Trinomial; Boolean function","score_opus":0.009644395364798096,"score_gpt":0.23900272574564468,"score_spread":0.22935833038084658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806079250","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.29667196,0.0005265203,0.70123935,0.0004775038,0.00086561684,0.00014672626,0.0000011284975,0.000021692307,0.0000495312],"genre_scores_gemma":[0.79123163,0.000025574369,0.20847514,0.000038541704,0.00021135143,0.0000033334047,2.0940122e-7,0.000011119874,0.000003089066],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986306,0.00002454506,0.0006390123,0.0001782136,0.00023417662,0.0002934747],"domain_scores_gemma":[0.99883693,0.0002737856,0.00029581794,0.00028619688,0.00015307072,0.00015416612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056891213,0.00015673069,0.00036167738,0.0014410263,0.000039903633,0.000046166424,0.00064838567,0.0001153406,0.0000078698],"category_scores_gemma":[0.000100906356,0.0001430314,0.0003514735,0.0011612495,0.00005612199,0.0002952473,0.00004719677,0.00021409462,4.3281955e-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.0016022756,0.001367691,0.046662424,0.0012608663,0.0010458579,0.00021105073,0.006098601,0.2539329,0.5729558,0.034488045,0.014061568,0.06631294],"study_design_scores_gemma":[0.02400495,0.009275748,0.15649919,0.003223379,0.0002769888,0.0003004141,0.00040186782,0.48141316,0.2942815,0.007705373,0.020373635,0.0022437978],"about_ca_topic_score_codex":0.000024757279,"about_ca_topic_score_gemma":0.000020616431,"teacher_disagreement_score":0.49455968,"about_ca_system_score_codex":0.000022819842,"about_ca_system_score_gemma":0.00018762761,"threshold_uncertainty_score":0.5832651},"labels":[],"label_agreement":null},{"id":"W3100957129","doi":"10.1007/s13389-020-00250-7","title":"Removable weak keys for discrete logarithm-based cryptography","year":2020,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Data 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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Electronics and Information technology","keywords":"Public-key cryptography; Cryptosystem; Cryptography; Discrete logarithm; Prime (order theory); Key (lock); Security parameter; Elliptic curve cryptography; Set (abstract data type)","score_opus":0.013287265691632822,"score_gpt":0.21860072871977637,"score_spread":0.20531346302814354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100957129","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.004823759,0.0012248034,0.9905936,0.0021905834,0.0006075505,0.00021961764,0.000021916332,0.00018473399,0.00013344528],"genre_scores_gemma":[0.3309938,0.00015923614,0.6677504,0.000593025,0.00044907935,0.0000123216105,0.0000060807115,0.000035721132,3.0067562e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772775,0.000042701635,0.00079497515,0.00037010346,0.0005451131,0.0005193431],"domain_scores_gemma":[0.9979027,0.00030182046,0.00041762317,0.00045617152,0.00042149375,0.00050019013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066826673,0.00032521607,0.0005254652,0.0008270681,0.00013073393,0.00026314243,0.0014154441,0.00013801089,0.000013157765],"category_scores_gemma":[0.00023973234,0.00029995898,0.0007933617,0.002677452,0.00006503729,0.0010211257,0.00008901729,0.0005121084,0.0000020910907],"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.00030885305,0.00026958308,0.002324585,0.000593802,0.0005939282,0.00012167391,0.00082155364,0.033173345,0.020327106,0.92660075,0.0076731755,0.007191649],"study_design_scores_gemma":[0.007941742,0.0032274842,0.0052264845,0.00063628325,0.00028958794,0.00019049934,0.00016409125,0.61032736,0.01129642,0.03495122,0.32367334,0.0020754728],"about_ca_topic_score_codex":0.0000026356377,"about_ca_topic_score_gemma":0.0000011490831,"teacher_disagreement_score":0.89164954,"about_ca_system_score_codex":0.000014050778,"about_ca_system_score_gemma":0.00009636386,"threshold_uncertainty_score":0.9999452},"labels":[],"label_agreement":null},{"id":"W3108917887","doi":"10.1007/s13389-020-00245-4","title":"x-only point addition formula and faster compressed SIKE","year":2020,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Royal Bank of Canada","keywords":"Point (geometry); Mathematics; Computer science; Geometry","score_opus":0.00704499768570218,"score_gpt":0.18271925261994246,"score_spread":0.17567425493424027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108917887","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.12067289,0.0009863812,0.87617004,0.0017023154,0.00023186003,0.00007118893,0.0000019369688,0.00006756774,0.00009582413],"genre_scores_gemma":[0.9373385,0.00016421932,0.062012225,0.00030200154,0.00016940845,0.000001220889,4.857526e-7,0.000011340129,6.5363844e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989455,0.000022992004,0.00038244383,0.00015441008,0.00028710626,0.00020755727],"domain_scores_gemma":[0.9992257,0.00010266091,0.00017146001,0.0001432617,0.00010694315,0.00025000115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018624277,0.00015004589,0.00024604116,0.0003634024,0.00005489247,0.00014099354,0.00037858702,0.000060013266,0.000010376732],"category_scores_gemma":[0.000046083638,0.0001269971,0.00018613899,0.00063049194,0.000032097138,0.0006768398,0.00008960983,0.00031303335,0.0000013372878],"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.00038701927,0.00073967787,0.020436144,0.0020743906,0.0021744564,0.0017140347,0.017601404,0.074444056,0.29040882,0.40537736,0.007929397,0.17671323],"study_design_scores_gemma":[0.008594677,0.003519211,0.1765532,0.0013842285,0.00030585393,0.0037273595,0.0004889081,0.72447133,0.014013935,0.015044534,0.049660333,0.0022364461],"about_ca_topic_score_codex":9.802704e-7,"about_ca_topic_score_gemma":4.4509585e-7,"teacher_disagreement_score":0.8166656,"about_ca_system_score_codex":0.000005689568,"about_ca_system_score_gemma":0.000022826358,"threshold_uncertainty_score":0.5178791},"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":"W3213153633","doi":"10.1007/s13389-022-00287-w","title":"Rethinking modular multi-exponentiation in real-world applications","year":2022,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","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":"University of Calgary","funders":"","keywords":"Modular exponentiation; Exponentiation; Computer science; Cryptography; Parallel computing; Side channel attack; Theoretical computer science; Arithmetic; Algorithm; Public-key cryptography; Mathematics; Encryption; Computer security","score_opus":0.014409619445672915,"score_gpt":0.23511993082946617,"score_spread":0.22071031138379324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213153633","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.12425357,0.00080546347,0.87407136,0.00023145971,0.0003670649,0.0001437634,8.121405e-7,0.0000648203,0.00006167652],"genre_scores_gemma":[0.8653351,0.00016278063,0.13435462,0.00003373552,0.000061980645,0.000034621942,8.279047e-7,0.0000119073,0.0000044015474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985604,0.00006938226,0.0005220166,0.00017181759,0.00045068993,0.00022569],"domain_scores_gemma":[0.99920964,0.00009357696,0.00025825974,0.0002826718,0.00007641735,0.00007943282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009348762,0.00011839278,0.00020086036,0.0020657927,0.00015508433,0.00006708336,0.00072102156,0.000031316682,0.000008662851],"category_scores_gemma":[0.00001844921,0.00012414988,0.00019736133,0.0029123786,0.000016487138,0.00038761186,0.00016319976,0.0006042719,4.768815e-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.000015899277,0.0004772241,0.025526335,0.000086802065,0.00014027413,0.00015739909,0.0029974282,0.7580715,0.024355378,0.17797862,0.000043132364,0.010150054],"study_design_scores_gemma":[0.0027526855,0.00030878087,0.33705366,0.0002020434,0.00006399683,0.00034934207,0.0002854299,0.6122245,0.0013763632,0.03297296,0.011576989,0.00083324825],"about_ca_topic_score_codex":0.000026305099,"about_ca_topic_score_gemma":0.000024271112,"teacher_disagreement_score":0.74108154,"about_ca_system_score_codex":0.00006662786,"about_ca_system_score_gemma":0.00004179265,"threshold_uncertainty_score":0.5062685},"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":"W4409238752","doi":"10.1007/s13389-025-00373-9","title":"Evaluation of encrypted matching criteria using homomorphic encryption based FSM","year":2025,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphic encryption; Encryption; Computer science; Matching (statistics); Theoretical computer science; Cryptography; Algorithm; Mathematics; Computer security; Statistics","score_opus":0.024797880886992283,"score_gpt":0.2977358301225645,"score_spread":0.2729379492355722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409238752","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.35746914,0.0009167304,0.64065987,0.000064330634,0.000684792,0.00010325042,0.0000026845464,0.00005059844,0.000048583086],"genre_scores_gemma":[0.82202744,0.000041735293,0.1778183,0.000033210166,0.00006329223,0.0000031171255,0.0000013046676,0.000011501011,7.6407176e-8],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729663,0.00021663948,0.0008963846,0.0002239098,0.0011006107,0.00026580214],"domain_scores_gemma":[0.99728143,0.00019513704,0.00052070693,0.00046743182,0.0014356085,0.0000996625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00426132,0.00021482463,0.00040229125,0.0020247966,0.000091664035,0.00012824763,0.00074718025,0.00012337512,0.00002244917],"category_scores_gemma":[0.00035862028,0.00021420055,0.00030293674,0.0027670604,0.000048589747,0.0010123891,0.00009649135,0.00036306732,4.3542e-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.000080239675,0.00047553322,0.0028462813,0.0006077365,0.0006244508,0.000034283265,0.0010524878,0.22619593,0.56608313,0.18471578,0.0001573069,0.017126827],"study_design_scores_gemma":[0.0017574637,0.0001340763,0.014120541,0.0010996962,0.00038008858,0.000056608285,0.000071831695,0.9363169,0.011527359,0.0339975,0.00022638058,0.0003115605],"about_ca_topic_score_codex":0.000019547246,"about_ca_topic_score_gemma":0.0000029743128,"teacher_disagreement_score":0.710121,"about_ca_system_score_codex":0.00007799004,"about_ca_system_score_gemma":0.00036095642,"threshold_uncertainty_score":0.8734845},"labels":[],"label_agreement":null},{"id":"W560384006","doi":"10.1007/s13389-015-0101-6","title":"Some new results on binary polynomial multiplication","year":2015,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"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; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Multiplication (music); Mathematics; Finite field; Binary number; Multiplication algorithm; Polynomial; Logarithm; Binary operation; Field (mathematics); Algorithm; Strassen algorithm; Arithmetic; Discrete mathematics; Combinatorics; Matrix multiplication; Pure mathematics","score_opus":0.021652763300848785,"score_gpt":0.23424336271828586,"score_spread":0.21259059941743708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W560384006","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.27704817,0.0017022148,0.71261567,0.0040681735,0.0035737704,0.00016573779,0.0000028556121,0.00032044644,0.00050295953],"genre_scores_gemma":[0.9497874,0.000068971436,0.048868276,0.00017093093,0.001073749,0.0000015097688,5.8606395e-7,0.000015371008,0.000013221934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986817,0.00003978923,0.00047094942,0.00018131438,0.00039722293,0.0002289922],"domain_scores_gemma":[0.99870205,0.0001462088,0.00026848988,0.000392111,0.00012798769,0.0003631362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086300034,0.00015998355,0.00020880815,0.0008888774,0.000043335258,0.000101284604,0.00075315294,0.000075063086,8.270412e-7],"category_scores_gemma":[0.00021153649,0.00014308245,0.00021934563,0.00082903064,0.000025958789,0.0007262162,0.000070468006,0.0003300141,0.0000073228775],"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.0015426665,0.00059822854,0.00074187334,0.00005399159,0.00040286436,0.0002457787,0.003708559,0.17114192,0.046629068,0.67102665,0.050224595,0.05368378],"study_design_scores_gemma":[0.03439883,0.015798375,0.045566928,0.0018749145,0.00027197643,0.0016736132,0.0003410783,0.1779082,0.03434215,0.18962605,0.4939566,0.0042412854],"about_ca_topic_score_codex":0.0000027903263,"about_ca_topic_score_gemma":1.9714554e-7,"teacher_disagreement_score":0.6727392,"about_ca_system_score_codex":0.000033224456,"about_ca_system_score_gemma":0.00009393778,"threshold_uncertainty_score":0.58347327},"labels":[],"label_agreement":null}]}