{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3427567,0.0019699605,0.6196922,0.0020638003,0.00066217215,0.0002703523,0.0008871369,0.0118390275,0.019858625],"genre_scores_gemma":[0.8416449,0.0002899521,0.14782791,0.00022003856,0.00020231678,0.0001048744,0.00047770035,0.00037067488,0.0088617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665713,0.00071153755,0.00032797141,0.00048120687,0.0010974938,0.0007246869],"domain_scores_gemma":[0.995756,0.0015860946,0.00041085173,0.0016628836,0.00039660686,0.00018761521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012207795,0.0012121703,0.001393842,0.0011549136,0.0008139694,0.0023735815,0.0009909369,0.0012014168,0.008652109],"category_scores_gemma":[0.004010501,0.0006420357,0.0009531126,0.0018242499,0.00091738073,0.0032978707,0.001866258,0.0012872196,0.0036270253],"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.01620392,0.0010448372,0.0054513947,0.0009784215,0.00048886845,0.0009579031,0.000384737,0.13937072,0.18043752,0.114950806,0.027490186,0.51224065],"study_design_scores_gemma":[0.0015122835,0.0014530708,0.0019831907,0.000091130285,0.00031677834,0.001305718,0.00017622336,0.7035936,0.14950882,0.12865299,0.011279198,0.0001270253],"about_ca_topic_score_codex":0.00040169022,"about_ca_topic_score_gemma":0.0010120407,"teacher_disagreement_score":0.008652109,"about_ca_system_score_codex":0.00095169287,"about_ca_system_score_gemma":0.0027051356,"threshold_uncertainty_score":0.028944254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47764236,0.0020973184,0.48639786,0.0016280761,0.0007962843,0.00022979935,0.00017420965,0.01215715,0.018876942],"genre_scores_gemma":[0.9379415,0.00020759563,0.057488542,0.00028907906,0.00011037935,0.000044429777,0.000100944555,0.0002189857,0.0035986474],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959304,0.001205059,0.00036326505,0.00044601836,0.0014424868,0.00061278505],"domain_scores_gemma":[0.98892957,0.0024610108,0.0012625623,0.005324193,0.0018268974,0.00019572998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024027296,0.0010066878,0.0009852012,0.0011150244,0.0007812905,0.0021132997,0.0016190067,0.0014881812,0.004889056],"category_scores_gemma":[0.01225265,0.00073373085,0.00053570926,0.0005957905,0.0013400543,0.0036872537,0.002266236,0.0016235497,0.002160626],"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.005192308,0.0005736172,0.008078518,0.0012204226,0.00045870955,0.0013273922,0.001202581,0.05442191,0.28129733,0.15358226,0.014284604,0.47836033],"study_design_scores_gemma":[0.0005354484,0.0018536808,0.0022932906,0.00037197073,0.00046658833,0.0017272538,0.00025927022,0.4038757,0.49479747,0.0652932,0.028379343,0.00014686151],"about_ca_topic_score_codex":0.00030318665,"about_ca_topic_score_gemma":0.00054991955,"teacher_disagreement_score":0.004889056,"about_ca_system_score_codex":0.0007817172,"about_ca_system_score_gemma":0.0013379775,"threshold_uncertainty_score":0.016355455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51168084,0.0033029881,0.43964586,0.00078581605,0.0015483533,0.00021649455,0.000319881,0.018128358,0.024371484],"genre_scores_gemma":[0.7783548,0.0008600861,0.20212285,0.0003084203,0.00036661324,0.000071758615,0.00054264045,0.00040658715,0.016966108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958235,0.00003777688,0.000038026217,0.000068257956,0.00020367083,0.00007000164],"domain_scores_gemma":[0.99934155,0.00018922813,0.00006574906,0.00015240634,0.0002021852,0.0000489249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036674074,0.0007677653,0.0004595792,0.0014646902,0.0004040774,0.0009757952,0.0007966347,0.0003726146,0.0055196295],"category_scores_gemma":[0.0011559194,0.00026995747,0.0002785988,0.0010875372,0.00039349473,0.0022959176,0.0006901254,0.0007073649,0.0014662846],"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.0015783183,0.0002894888,0.003097178,0.00042887783,0.000063921834,0.0003528764,0.00030477418,0.011509196,0.21308362,0.034935154,0.013545761,0.7208109],"study_design_scores_gemma":[0.0005381539,0.0015647528,0.0042831353,0.00018486907,0.000314541,0.0015790743,0.000155889,0.30717382,0.5636077,0.033864908,0.0864924,0.00024072827],"about_ca_topic_score_codex":0.0008554213,"about_ca_topic_score_gemma":0.0018409069,"teacher_disagreement_score":0.0055196295,"about_ca_system_score_codex":0.00047342858,"about_ca_system_score_gemma":0.00091110496,"threshold_uncertainty_score":0.018464983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100841254,0.00016165692,0.8962076,0.000065878696,0.00004699538,0.000034646637,0.000032623047,0.0008930097,0.0017163561],"genre_scores_gemma":[0.90348285,0.00007946311,0.0951824,0.000032706936,0.000021683585,0.000021350445,0.000037632457,0.00007756812,0.0010643527],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996661,0.000093171286,0.000017632938,0.000056350542,0.00012767242,0.000039178103],"domain_scores_gemma":[0.99912363,0.00041783036,0.00011514633,0.00019847839,0.0001150109,0.000029850098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004906165,0.00034419252,0.00027165402,0.00041646848,0.00021384553,0.0004286732,0.00053761346,0.00027408806,0.0017112048],"category_scores_gemma":[0.002184887,0.00015745398,0.0002091689,0.00035149907,0.00038340196,0.00061860966,0.00032862218,0.00047936052,0.00023964391],"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.0016791488,0.0002492194,0.0047989986,0.00022176832,0.000081249826,0.00035991613,0.00032518874,0.08554187,0.4154756,0.069520466,0.0013724503,0.42037413],"study_design_scores_gemma":[0.00005114632,0.00021389603,0.00077670894,0.000016333259,0.000033021035,0.00016525877,0.000025879532,0.83637106,0.15212755,0.00885083,0.0013521913,0.000016036403],"about_ca_topic_score_codex":0.0003679647,"about_ca_topic_score_gemma":0.00071236555,"teacher_disagreement_score":0.0017112048,"about_ca_system_score_codex":0.0002813696,"about_ca_system_score_gemma":0.00049949554,"threshold_uncertainty_score":0.005724609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9584184,0.0011292038,0.020279652,0.00088330137,0.00013695858,0.000023941018,0.00012424517,0.00037692266,0.018627407],"genre_scores_gemma":[0.9964735,0.00014606866,0.0021680105,0.00004338428,0.000027766255,0.000006177771,0.00003452638,0.000021541287,0.001078975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994531,0.00010950452,0.000018286904,0.000060717837,0.0002002597,0.00015818627],"domain_scores_gemma":[0.9970305,0.0014613646,0.00020749874,0.00080216123,0.00036043764,0.00013798557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096097664,0.0003654987,0.00041214208,0.00065689033,0.00071413117,0.0012625507,0.0006838669,0.0006446873,0.0047855126],"category_scores_gemma":[0.0054119565,0.00017126735,0.00014855349,0.0006306689,0.0014772458,0.0021349844,0.0013030309,0.00090301345,0.00037976995],"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.0064270934,0.00031899955,0.010928189,0.0004977912,0.0001339228,0.001089596,0.0006825905,0.11759522,0.1091953,0.6624112,0.008672104,0.082048],"study_design_scores_gemma":[0.00029595196,0.0012449153,0.0039424305,0.00008889751,0.00011400752,0.0012125915,0.0006276744,0.5413347,0.11414628,0.3241825,0.012716706,0.0000934129],"about_ca_topic_score_codex":0.0003416362,"about_ca_topic_score_gemma":0.0004707939,"teacher_disagreement_score":0.0047855126,"about_ca_system_score_codex":0.00048850884,"about_ca_system_score_gemma":0.0004917048,"threshold_uncertainty_score":0.016009092},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21251783,0.00036269418,0.77538794,0.00033693228,0.000109332505,0.00011933803,0.00015099948,0.002730672,0.008284235],"genre_scores_gemma":[0.81788,0.000081852355,0.17784587,0.00013821144,0.000024355459,0.000049122304,0.0001646164,0.00005722411,0.0037587848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905413,0.00019792629,0.000068822825,0.00011794555,0.00041939455,0.00014176444],"domain_scores_gemma":[0.9985636,0.000416589,0.00014787479,0.00045406865,0.00036291903,0.000054993183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008612432,0.00041539854,0.00048204194,0.00090525456,0.00049746,0.000867809,0.0007945241,0.000882397,0.0032577654],"category_scores_gemma":[0.0028656786,0.00014360876,0.0002649955,0.0005040368,0.00038280795,0.0010429666,0.001230608,0.00052718486,0.0007898253],"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.0027335535,0.00045850952,0.008992515,0.0003511758,0.00014501346,0.00060998707,0.00029813198,0.057368875,0.2337132,0.114584684,0.0048829336,0.5758614],"study_design_scores_gemma":[0.00010944769,0.0005914187,0.0025231806,0.00008513096,0.00006994792,0.00073309377,0.00007264823,0.7558128,0.19641554,0.036728982,0.006797733,0.000060052113],"about_ca_topic_score_codex":0.00044914053,"about_ca_topic_score_gemma":0.0009654408,"teacher_disagreement_score":0.0032577654,"about_ca_system_score_codex":0.0005953322,"about_ca_system_score_gemma":0.00092260813,"threshold_uncertainty_score":0.010898292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13245201,0.0007687789,0.8123995,0.0016781604,0.000293202,0.00033482644,0.00048211517,0.0017564527,0.04983505],"genre_scores_gemma":[0.77197134,0.00048163062,0.19761342,0.00062039064,0.00034230592,0.00035775776,0.0004058783,0.00015859106,0.028048681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904436,0.00022227674,0.0000658523,0.00018528574,0.00032881874,0.00015341549],"domain_scores_gemma":[0.99841297,0.0007534126,0.00014499927,0.0003843474,0.00023442136,0.000069847636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065444113,0.000763663,0.00063570845,0.0005949728,0.00073270896,0.0014601197,0.0009859162,0.0006284769,0.009512605],"category_scores_gemma":[0.002118764,0.00040515276,0.0005218628,0.0009572971,0.0009164054,0.0024326073,0.0015668028,0.0012882885,0.0015258315],"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.0013723121,0.00022192288,0.0010003349,0.000480813,0.00010850607,0.00041450173,0.00018826663,0.05636655,0.06103846,0.68472064,0.011157739,0.18292992],"study_design_scores_gemma":[0.00034329042,0.0009490198,0.0005303386,0.000082874736,0.00019390805,0.00083548034,0.00004705786,0.3737643,0.08153076,0.5135476,0.028096816,0.00007857003],"about_ca_topic_score_codex":0.00055206334,"about_ca_topic_score_gemma":0.0016181383,"teacher_disagreement_score":0.009512605,"about_ca_system_score_codex":0.0011181937,"about_ca_system_score_gemma":0.0025683395,"threshold_uncertainty_score":0.0318228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19109088,0.00569172,0.76857364,0.00074710295,0.0010547582,0.0003971002,0.00052696513,0.010897947,0.02101979],"genre_scores_gemma":[0.5872691,0.00071487203,0.39445397,0.0004421358,0.00025333863,0.00017434539,0.001038731,0.00032690543,0.015326517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987276,0.00017394294,0.00009324321,0.00020501978,0.0006114497,0.0001886736],"domain_scores_gemma":[0.9987016,0.00039161343,0.00010368206,0.0005234368,0.00021450501,0.000065183376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009890081,0.00087306526,0.0011286164,0.0013482955,0.0007311305,0.0012540127,0.0010546101,0.00060220977,0.013929967],"category_scores_gemma":[0.0025230483,0.0005101033,0.0005773814,0.001669808,0.0006610929,0.0034207806,0.001882968,0.0007751391,0.0044117086],"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.001789177,0.00029249574,0.0018856494,0.00046422967,0.00015232702,0.0002048924,0.00032690653,0.008832847,0.07773141,0.048256706,0.013360498,0.84670293],"study_design_scores_gemma":[0.001762179,0.002582035,0.007252275,0.0004988051,0.00060667965,0.0030944804,0.000722585,0.40585166,0.32903183,0.12749572,0.12055064,0.00055114884],"about_ca_topic_score_codex":0.0013600069,"about_ca_topic_score_gemma":0.0024498517,"teacher_disagreement_score":0.013929967,"about_ca_system_score_codex":0.0007758544,"about_ca_system_score_gemma":0.0016686607,"threshold_uncertainty_score":0.04660034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03617443,0.00016667356,0.95074505,0.00031776962,0.00014032243,0.00029956497,0.00009515504,0.00540137,0.0066596163],"genre_scores_gemma":[0.69965404,0.00020308448,0.2935146,0.00030791672,0.000048008336,0.00031467708,0.00022294407,0.0003039223,0.005430709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980933,0.00035427767,0.00019241408,0.00030331756,0.0007210259,0.0003357032],"domain_scores_gemma":[0.99777573,0.00035525928,0.00016519743,0.0013462079,0.0002726582,0.00008495545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015308785,0.0005697004,0.0006541013,0.00059654197,0.0005355076,0.0016353584,0.0027802135,0.0014309393,0.0043684565],"category_scores_gemma":[0.0036040086,0.00050590746,0.0009469223,0.00045458254,0.0013771685,0.0029213477,0.003279652,0.002458524,0.0016069853],"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.001325988,0.0007431199,0.0032084156,0.0011482637,0.00028536635,0.0013258628,0.0012770522,0.041182227,0.18326399,0.56747955,0.005571006,0.1931891],"study_design_scores_gemma":[0.00043091818,0.00095098745,0.0012646513,0.00017419338,0.00024518816,0.002121161,0.00020441896,0.34779572,0.4525692,0.12590896,0.06810234,0.00023227368],"about_ca_topic_score_codex":0.00016514212,"about_ca_topic_score_gemma":0.00012283833,"teacher_disagreement_score":0.0043684565,"about_ca_system_score_codex":0.00049627834,"about_ca_system_score_gemma":0.0010033962,"threshold_uncertainty_score":0.014613926},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015855778,0.16169226,0.77755016,0.0020028509,0.0008151265,0.0004484462,0.00021988862,0.003222623,0.038192812],"genre_scores_gemma":[0.3947718,0.13516992,0.4398511,0.0020315386,0.0020670881,0.000509959,0.0007610773,0.0005089293,0.024328556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849427,0.00022798785,0.00014140637,0.00021446192,0.0008003489,0.00012156777],"domain_scores_gemma":[0.99787056,0.0008171841,0.00027589157,0.00042321635,0.0005612537,0.000051969564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013100024,0.001678737,0.0011610592,0.0031593852,0.00060295407,0.0023243,0.0016415993,0.0014191092,0.004153825],"category_scores_gemma":[0.0027673128,0.0007747477,0.0008593439,0.0016844495,0.00075678504,0.002832795,0.0013037918,0.0019630417,0.0022137614],"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.00022637333,0.00022108195,0.0015442908,0.0016614504,0.00018822821,0.00016963894,0.00007435747,0.018240653,0.028804407,0.050386254,0.006923199,0.89156],"study_design_scores_gemma":[0.00015564784,0.002566762,0.0042991657,0.0022958452,0.0009396506,0.005916632,0.00016653773,0.25736815,0.17267743,0.12609497,0.42720768,0.00031157545],"about_ca_topic_score_codex":0.0002751348,"about_ca_topic_score_gemma":0.0003572098,"teacher_disagreement_score":0.004153825,"about_ca_system_score_codex":0.00080261414,"about_ca_system_score_gemma":0.0010097215,"threshold_uncertainty_score":0.013895929},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26086086,0.0064691645,0.34833872,0.008615354,0.0022584447,0.00009627612,0.00017291663,0.0005301783,0.372658],"genre_scores_gemma":[0.92065024,0.0020261528,0.04066747,0.00072951935,0.0014968808,0.000044168217,0.00008770706,0.00018610575,0.034111798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993197,0.00023172161,0.000025980647,0.00007589788,0.00022196046,0.00012479848],"domain_scores_gemma":[0.9995369,0.0002327004,0.000033628377,0.00007677188,0.00008226764,0.00003790298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068165327,0.0005652665,0.0007502961,0.0014875656,0.0015468784,0.0021811635,0.0008124696,0.0010436992,0.004747132],"category_scores_gemma":[0.002168185,0.00024201146,0.0007012309,0.0010579217,0.0038212168,0.0034695263,0.0020374795,0.0028735867,0.0010751756],"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.00002098468,0.0000119132765,0.000049241185,0.00001954136,0.000003914919,0.00009470095,0.00014144203,0.0009967528,0.00062940153,0.9928268,0.0007760299,0.00442933],"study_design_scores_gemma":[0.00000999503,0.000016279066,0.000055198932,0.000008808335,0.0000046223004,0.00009538739,0.000038170623,0.004326652,0.00075016543,0.9902956,0.0043890984,0.000010063464],"about_ca_topic_score_codex":0.000763921,"about_ca_topic_score_gemma":0.0007349401,"teacher_disagreement_score":0.004747132,"about_ca_system_score_codex":0.0009703642,"about_ca_system_score_gemma":0.00073441153,"threshold_uncertainty_score":0.015880704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40948913,0.0012336879,0.52373946,0.0006963015,0.00040417694,0.00027646398,0.00030340932,0.00082881394,0.06302853],"genre_scores_gemma":[0.8492671,0.00074942363,0.13052088,0.00026224807,0.00019494107,0.00017761353,0.0002978434,0.00013152824,0.01839829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997571,0.000037366597,0.00001784102,0.000052994197,0.00008062199,0.00005413814],"domain_scores_gemma":[0.99983037,0.000049022317,0.000034294386,0.00003465716,0.000030496993,0.000021078044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024133908,0.00038977066,0.00036369215,0.0008572588,0.0008209234,0.0011477431,0.00035441728,0.00036693554,0.004161412],"category_scores_gemma":[0.00068781705,0.00022421917,0.00048827933,0.000559958,0.00073594484,0.0012963408,0.0005921933,0.0011134996,0.00076031836],"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.00021714465,0.000082727194,0.0006608784,0.00012932438,0.000015307181,0.00039599006,0.00022384706,0.009517489,0.03526864,0.8796311,0.0022626864,0.07159492],"study_design_scores_gemma":[0.00011363348,0.0006986466,0.0011567271,0.00012092414,0.00004210546,0.0022284284,0.00020341492,0.09717447,0.056168504,0.75821006,0.08376303,0.000119946955],"about_ca_topic_score_codex":0.00020486816,"about_ca_topic_score_gemma":0.00030517633,"teacher_disagreement_score":0.004161412,"about_ca_system_score_codex":0.00052609836,"about_ca_system_score_gemma":0.0005190389,"threshold_uncertainty_score":0.01392132},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08042666,0.0029440215,0.8798778,0.0031510487,0.0014604364,0.00030782996,0.00043307152,0.0015201538,0.029878959],"genre_scores_gemma":[0.7761319,0.002373506,0.16568768,0.00085999793,0.0011547457,0.00044342445,0.0008870092,0.00051116024,0.051950555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680495,0.00064864836,0.00034579867,0.00044399564,0.0012800068,0.0004765775],"domain_scores_gemma":[0.9942409,0.00179151,0.0004130917,0.0027118279,0.0005276569,0.00031514387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025224448,0.0011109044,0.0014642829,0.0014237115,0.0020270718,0.004780394,0.002618971,0.0018423891,0.0078111794],"category_scores_gemma":[0.009811809,0.0009287543,0.0012560645,0.001721272,0.0036184574,0.012817146,0.008607788,0.007041679,0.0043772655],"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.001104573,0.00022192985,0.00039587336,0.00042976096,0.00007408227,0.00038154513,0.00047317933,0.0069914996,0.01914278,0.8571057,0.007583572,0.10609548],"study_design_scores_gemma":[0.00019550497,0.00024389225,0.00015866179,0.00010540447,0.000074975556,0.0004958903,0.00015465776,0.028969279,0.020672848,0.92409754,0.024740955,0.000090347436],"about_ca_topic_score_codex":0.00018902242,"about_ca_topic_score_gemma":0.0002504837,"teacher_disagreement_score":0.0078111794,"about_ca_system_score_codex":0.0012000472,"about_ca_system_score_gemma":0.0016017382,"threshold_uncertainty_score":0.026131034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36914334,0.0022380238,0.5377611,0.002139599,0.0011889979,0.00035072173,0.0006071613,0.005166126,0.08140496],"genre_scores_gemma":[0.83849245,0.0004952016,0.12793453,0.00070153695,0.0002766374,0.00013253957,0.00053375715,0.0002473154,0.031185953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994962,0.000060076778,0.00003385754,0.00009199327,0.00022239127,0.000095581265],"domain_scores_gemma":[0.9995414,0.00013908868,0.000036683152,0.00017073043,0.00008754321,0.00002455609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031347535,0.0006560636,0.00069297676,0.0006137924,0.00059783517,0.0011156874,0.0006533596,0.00067766453,0.012346498],"category_scores_gemma":[0.0011612732,0.0002479394,0.0004117148,0.0008865129,0.0007463408,0.0026346394,0.0013215779,0.0009953717,0.0018582129],"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.0023644187,0.0002958745,0.0010257566,0.00037602973,0.00009487422,0.0009866698,0.00031400129,0.018228823,0.096736364,0.5291809,0.019016756,0.33137962],"study_design_scores_gemma":[0.00089565164,0.0011880652,0.0017513176,0.00023168609,0.00026492812,0.0033375719,0.00034224303,0.28316742,0.23803133,0.4104824,0.060111783,0.00019557624],"about_ca_topic_score_codex":0.00063391007,"about_ca_topic_score_gemma":0.0012480887,"teacher_disagreement_score":0.012346498,"about_ca_system_score_codex":0.0006048085,"about_ca_system_score_gemma":0.0010653178,"threshold_uncertainty_score":0.041303158},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37948444,0.0013282344,0.5123624,0.004491177,0.00039832573,0.0002267478,0.00033262104,0.0015002171,0.09987585],"genre_scores_gemma":[0.9656136,0.00021261869,0.028060034,0.00035633665,0.0001022113,0.00005927757,0.00008226909,0.00014716826,0.0053664865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984927,0.0004859324,0.00006932647,0.00019041458,0.00050181773,0.00025978108],"domain_scores_gemma":[0.9965912,0.0017600853,0.0001737764,0.000996382,0.00027850785,0.00020002399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018008377,0.0003887615,0.00072554586,0.0007093867,0.00086005783,0.0020052,0.0010444875,0.0006598391,0.0060246605],"category_scores_gemma":[0.0069938404,0.00028482734,0.0006218798,0.00059369655,0.004315747,0.0028681322,0.0031981708,0.0032258157,0.0009618069],"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.00023316755,0.000046068766,0.000581205,0.00007287097,0.000017945347,0.0001437515,0.00018007468,0.014833787,0.0042680074,0.9628994,0.0026612692,0.014062575],"study_design_scores_gemma":[0.00010221911,0.000114945695,0.00026164998,0.00004795059,0.000023078894,0.0001489826,0.00008642449,0.16545093,0.013501033,0.8145572,0.005666222,0.000039447896],"about_ca_topic_score_codex":0.0007216326,"about_ca_topic_score_gemma":0.00064235117,"teacher_disagreement_score":0.0060246605,"about_ca_system_score_codex":0.0012600637,"about_ca_system_score_gemma":0.0012879132,"threshold_uncertainty_score":0.020154476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14215423,0.008547467,0.792498,0.010356408,0.0042438856,0.00016029795,0.0001359968,0.004034449,0.03786927],"genre_scores_gemma":[0.7828549,0.00284978,0.19770052,0.002037048,0.001197336,0.00005315632,0.00014222074,0.0011407858,0.012024288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748105,0.0008147512,0.0002282786,0.0004057307,0.0008000142,0.0002701512],"domain_scores_gemma":[0.99211216,0.0028283766,0.00020459364,0.0038078902,0.0008698684,0.0001770656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003553814,0.0008619361,0.00066368125,0.0007978095,0.0009874409,0.0030342443,0.0017112226,0.0014399326,0.0063184225],"category_scores_gemma":[0.016357696,0.00055681285,0.00071351044,0.00068675436,0.0027425324,0.010970778,0.005067474,0.0038280839,0.0031121636],"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.0006167476,0.00020139787,0.0020857088,0.00049992965,0.000083317194,0.0005825063,0.0009222923,0.017513203,0.038144194,0.5815497,0.008525812,0.34927523],"study_design_scores_gemma":[0.000093231676,0.00032974203,0.0005195608,0.00032644684,0.00008099514,0.0010170025,0.00031035466,0.07441543,0.033047147,0.7763738,0.11340033,0.00008584662],"about_ca_topic_score_codex":0.00016497624,"about_ca_topic_score_gemma":0.00036572755,"teacher_disagreement_score":0.0063184225,"about_ca_system_score_codex":0.00050165533,"about_ca_system_score_gemma":0.0007251481,"threshold_uncertainty_score":0.021137238},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030744912,0.0008590356,0.96173316,0.00097272213,0.000119022916,0.000053340766,0.000052303876,0.0005320819,0.004933412],"genre_scores_gemma":[0.79462695,0.0011303336,0.19619069,0.0002814114,0.00042523412,0.00017904374,0.00015226346,0.00026386484,0.0067501934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99256706,0.0025720058,0.00032748817,0.0007483986,0.0031738083,0.0006112068],"domain_scores_gemma":[0.9738333,0.016866315,0.001734139,0.00502783,0.0021259878,0.0004123892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004903991,0.00069904036,0.0015414937,0.0022821517,0.001535507,0.0035403515,0.0021809246,0.002519977,0.002728533],"category_scores_gemma":[0.037371274,0.0009664595,0.00077355513,0.0026515017,0.004621415,0.0068567772,0.004323159,0.0041373693,0.0011395589],"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.00027312496,0.00007821117,0.0011646026,0.00017169357,0.000034836714,0.00008325234,0.00024796836,0.088758096,0.0036431528,0.8301673,0.0026216432,0.072756216],"study_design_scores_gemma":[0.000035767916,0.000043942746,0.00012820764,0.000045308676,0.000015746476,0.0001116082,0.000028053468,0.25649726,0.0025355788,0.738785,0.0017424253,0.000031111314],"about_ca_topic_score_codex":0.0008009696,"about_ca_topic_score_gemma":0.00082227035,"teacher_disagreement_score":0.004903991,"about_ca_system_score_codex":0.0015532995,"about_ca_system_score_gemma":0.0023762656,"threshold_uncertainty_score":0.025935054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65461177,0.0003853355,0.33853453,0.00015736627,0.000069964386,0.00015638932,0.00016400985,0.00038115328,0.0055394704],"genre_scores_gemma":[0.9673585,0.000052134925,0.031701155,0.000011185946,0.0000071190807,0.000014549735,0.000093152004,0.000013105837,0.000749008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974329,0.00066584896,0.00017902818,0.00020500878,0.001306766,0.00021050023],"domain_scores_gemma":[0.9950525,0.0023264217,0.00034210668,0.0006040909,0.0015362212,0.00013862285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022396403,0.00028206958,0.00060111674,0.0011459909,0.0003642168,0.0012720568,0.0006281814,0.0005474855,0.0022732767],"category_scores_gemma":[0.007992178,0.00009158697,0.00039220566,0.0006810124,0.00044512848,0.0015691321,0.0005668244,0.00027063006,0.00021446486],"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.0030919437,0.0006527981,0.014455157,0.00045447765,0.00023630133,0.0004695164,0.00024377991,0.40681309,0.08108828,0.09905272,0.002162425,0.39127952],"study_design_scores_gemma":[0.000044970584,0.000549889,0.0023091931,0.000017114253,0.000039034694,0.0002166584,0.00007134442,0.96029437,0.026523229,0.009145291,0.0007706021,0.000018351182],"about_ca_topic_score_codex":0.0012330883,"about_ca_topic_score_gemma":0.00081534806,"teacher_disagreement_score":0.0022732767,"about_ca_system_score_codex":0.0012077797,"about_ca_system_score_gemma":0.0010674425,"threshold_uncertainty_score":0.011844516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094114415,0.028870039,0.47662324,0.014964161,0.010437867,0.0001946929,0.001077004,0.00095786696,0.37276077],"genre_scores_gemma":[0.62243116,0.020893278,0.14303777,0.005758089,0.020115105,0.00042986075,0.0017534504,0.0011380686,0.18444324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814904,0.0003175882,0.00015184403,0.00039841855,0.00071548653,0.0002676892],"domain_scores_gemma":[0.996718,0.0019261762,0.00026341557,0.00043697483,0.0003299837,0.00032546412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017522183,0.0024795684,0.0017311703,0.005050731,0.0030891339,0.0049560964,0.002221008,0.0017599202,0.017258985],"category_scores_gemma":[0.005438955,0.0011414558,0.0020166393,0.006395616,0.004871107,0.011546166,0.005205544,0.0062954477,0.0039034714],"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.00021425977,0.000091744405,0.00025113396,0.00033450214,0.00003470585,0.00022539622,0.0003389825,0.0013902404,0.0023981659,0.9429954,0.010074374,0.041651197],"study_design_scores_gemma":[0.000032790795,0.00005232643,0.0002634288,0.000052632928,0.00004592915,0.0004626784,0.0000558545,0.0045180754,0.0017242013,0.9653648,0.027389312,0.0000380196],"about_ca_topic_score_codex":0.000350969,"about_ca_topic_score_gemma":0.00046404116,"teacher_disagreement_score":0.017258985,"about_ca_system_score_codex":0.0017185205,"about_ca_system_score_gemma":0.0008142739,"threshold_uncertainty_score":0.057736993},"labels":[],"label_agreement":null}]}