{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"3655c7f74ef4","filters":{"venue":"Journal of Cryptographic Engineering"}},"results":[{"id":"W3197657782","doi":"10.1007/s13389-021-00271-w","title":"The SQALE of CSIDH: sublinear Vélu quantum-resistant isogeny action with low exponents","year":2021,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Clarendon Fund; European Commission; University of Waterloo; University of Oxford; Consejo Nacional de Ciencia y Tecnología; H2020 European Research Council; St. Cross College, University of Oxford","keywords":"Isogeny; Mathematics; Quantum; Sublinear function; NIST; Post-quantum cryptography; Discrete mathematics; Computer science; Elliptic curve; Pure mathematics; Quantum computer; Quantum mechanics; Physics","authors":[{"name":"Jorge Chávez-Saab","is_ca":false},{"name":"Jesús-Javier Chi-Domínguez","is_ca":false},{"name":"Samuel Jaques","is_ca":false},{"name":"Francisco Rodríguez‐Henríquez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01231776596756729,"gpt":0.2427799771552245,"spread":0.2304622111876573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001800838,0.0003887615,0.0007255459,0.0007093867,0.0008600578,0.0020052,0.001044487,0.0006598391,0.006024661],"category_scores_gemma":[0.00699384,0.0002848273,0.0006218798,0.0005936965,0.004315747,0.002868132,0.003198171,0.003225816,0.0009618069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001260064,"about_ca_system_score_gemma":0.001287913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007216326,"about_ca_topic_score_gemma":0.0006423512,"domain_scores_codex":[0.9984927,0.0004859324,0.00006932647,0.0001904146,0.0005018177,0.0002597811],"domain_scores_gemma":[0.9965912,0.001760085,0.0001737764,0.000996382,0.0002785079,0.000200024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002331675,0.00004606877,0.000581205,0.00007287097,0.00001794535,0.0001437515,0.0001800747,0.01483379,0.004268007,0.9628994,0.002661269,0.01406258],"study_design_scores_gemma":[0.0001022191,0.0001149457,0.00026165,0.00004795059,0.00002307889,0.0001489826,0.00008642449,0.1654509,0.01350103,0.8145572,0.005666222,0.0000394479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3794844,0.001328234,0.5123624,0.004491177,0.0003983257,0.0002267478,0.000332621,0.001500217,0.09987585],"genre_scores_gemma":[0.9656136,0.0002126187,0.02806003,0.0003563366,0.0001022113,0.00005927757,0.00008226909,0.0001471683,0.005366486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006024661,"threshold_uncertainty_score":0.02015448,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jonathan Taverne","is_ca":false},{"name":"Armando Faz-Hernández","is_ca":false},{"name":"Diego F. Aranha","is_ca":false},{"name":"Francisco Rodríguez‐Henríquez","is_ca":false},{"name":"Darrel Hankerson","is_ca":false},{"name":"Julio López","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02652695602035042,"gpt":0.2340954477578505,"spread":0.2075684917375001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003667407,0.0007677653,0.0004595792,0.00146469,0.0004040774,0.0009757952,0.0007966347,0.0003726146,0.005519629],"category_scores_gemma":[0.001155919,0.0002699575,0.0002785988,0.001087537,0.0003934947,0.002295918,0.0006901254,0.0007073649,0.001466285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004734286,"about_ca_system_score_gemma":0.000911105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008554213,"about_ca_topic_score_gemma":0.001840907,"domain_scores_codex":[0.9995824,0.00003777688,0.00003802622,0.00006825796,0.0002036708,0.00007000164],"domain_scores_gemma":[0.9993415,0.0001892281,0.00006574906,0.0001524063,0.0002021852,0.0000489249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001578318,0.0002894888,0.003097178,0.0004288778,0.00006392183,0.0003528764,0.0003047742,0.0115092,0.2130836,0.03493515,0.01354576,0.7208109],"study_design_scores_gemma":[0.0005381539,0.001564753,0.004283135,0.0001848691,0.000314541,0.001579074,0.000155889,0.3071738,0.5636077,0.03386491,0.0864924,0.0002407283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5116808,0.003302988,0.4396459,0.0007858161,0.001548353,0.0002164945,0.000319881,0.01812836,0.02437148],"genre_scores_gemma":[0.7783548,0.0008600861,0.2021229,0.0003084203,0.0003666132,0.00007175862,0.0005426405,0.0004065871,0.01696611],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.005519629,"threshold_uncertainty_score":0.01846498,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Colin O’Flynn","is_ca":true},{"name":"Zhizhang Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008588975450393664,"gpt":0.2431923204891606,"spread":0.2346033450387669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004906165,0.0003441925,0.000271654,0.0004164685,0.0002138455,0.0004286732,0.0005376135,0.0002740881,0.001711205],"category_scores_gemma":[0.002184887,0.000157454,0.0002091689,0.0003514991,0.000383402,0.0006186097,0.0003286222,0.0004793605,0.0002396439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002813696,"about_ca_system_score_gemma":0.0004994955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003679647,"about_ca_topic_score_gemma":0.0007123656,"domain_scores_codex":[0.9996661,0.00009317129,0.00001763294,0.00005635054,0.0001276724,0.0000391781],"domain_scores_gemma":[0.9991236,0.0004178304,0.0001151463,0.0001984784,0.0001150109,0.0000298501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001679149,0.0002492194,0.004798999,0.0002217683,0.00008124983,0.0003599161,0.0003251887,0.08554187,0.4154756,0.06952047,0.00137245,0.4203741],"study_design_scores_gemma":[0.00005114632,0.000213896,0.0007767089,0.00001633326,0.00003302104,0.0001652588,0.00002587953,0.8363711,0.1521275,0.00885083,0.001352191,0.0000160364],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1008413,0.0001616569,0.8962076,0.0000658787,0.00004699538,0.00003464664,0.00003262305,0.0008930097,0.001716356],"genre_scores_gemma":[0.9034829,0.00007946311,0.0951824,0.00003270694,0.00002168359,0.00002135044,0.00003763246,0.00007756812,0.001064353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001711205,"threshold_uncertainty_score":0.005724609,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean-Claude Bajard","is_ca":false},{"name":"Julien Eynard","is_ca":true},{"name":"Nabil Merkiche","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00809598719957067,"gpt":0.2195884021804402,"spread":0.2114924149808696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006816533,0.0005652665,0.0007502961,0.001487566,0.001546878,0.002181164,0.0008124696,0.001043699,0.004747132],"category_scores_gemma":[0.002168185,0.0002420115,0.0007012309,0.001057922,0.003821217,0.003469526,0.00203748,0.002873587,0.001075176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009703642,"about_ca_system_score_gemma":0.0007344115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000763921,"about_ca_topic_score_gemma":0.0007349401,"domain_scores_codex":[0.9993197,0.0002317216,0.00002598065,0.00007589788,0.0002219605,0.0001247985],"domain_scores_gemma":[0.9995369,0.0002327004,0.00003362838,0.00007677188,0.00008226764,0.00003790298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002098468,0.00001191328,0.00004924119,0.00001954136,0.000003914919,0.00009470095,0.000141442,0.0009967528,0.0006294015,0.9928268,0.0007760299,0.00442933],"study_design_scores_gemma":[0.00000999503,0.00001627907,0.00005519893,0.000008808335,0.0000046223,0.00009538739,0.00003817062,0.004326652,0.0007501654,0.9902956,0.004389098,0.00001006346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.2608609,0.006469165,0.3483387,0.008615354,0.002258445,0.00009627612,0.0001729166,0.0005301783,0.372658],"genre_scores_gemma":[0.9206502,0.002026153,0.04066747,0.0007295193,0.001496881,0.00004416822,0.00008770706,0.0001861058,0.0341118],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.004747132,"threshold_uncertainty_score":0.0158807,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Daniel Lemire","is_ca":true},{"name":"Owen Kaser","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0391017793814229,"gpt":0.2465031806968069,"spread":0.207401401315384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009890081,0.0008730653,0.001128616,0.001348295,0.0007311305,0.001254013,0.00105461,0.0006022098,0.01392997],"category_scores_gemma":[0.002523048,0.0005101033,0.0005773814,0.001669808,0.0006610929,0.003420781,0.001882968,0.0007751391,0.004411709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007758544,"about_ca_system_score_gemma":0.001668661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001360007,"about_ca_topic_score_gemma":0.002449852,"domain_scores_codex":[0.9987276,0.0001739429,0.00009324321,0.0002050198,0.0006114497,0.0001886736],"domain_scores_gemma":[0.9987016,0.0003916134,0.0001036821,0.0005234368,0.000214505,0.00006518338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001789177,0.0002924957,0.001885649,0.0004642297,0.000152327,0.0002048924,0.0003269065,0.008832847,0.07773141,0.04825671,0.0133605,0.8467029],"study_design_scores_gemma":[0.001762179,0.002582035,0.007252275,0.0004988051,0.0006066796,0.00309448,0.000722585,0.4058517,0.3290318,0.1274957,0.1205506,0.0005511488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1910909,0.00569172,0.7685736,0.000747103,0.001054758,0.0003971002,0.0005269651,0.01089795,0.02101979],"genre_scores_gemma":[0.5872691,0.000714872,0.394454,0.0004421358,0.0002533386,0.0001743454,0.001038731,0.0003269054,0.01532652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01392997,"threshold_uncertainty_score":0.04660034,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Galindo","is_ca":false},{"name":"Johann Großschädl","is_ca":false},{"name":"Zhe Liu","is_ca":true},{"name":"Praveen Kumar Vadnala","is_ca":false},{"name":"S. Sree Vivek","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007163993448245064,"gpt":0.246449513312325,"spread":0.2392855198640799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001530878,0.0005697004,0.0006541013,0.000596542,0.0005355076,0.001635358,0.002780213,0.001430939,0.004368457],"category_scores_gemma":[0.003604009,0.0005059075,0.0009469223,0.0004545825,0.001377168,0.002921348,0.003279652,0.002458524,0.001606985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004962783,"about_ca_system_score_gemma":0.001003396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001651421,"about_ca_topic_score_gemma":0.0001228383,"domain_scores_codex":[0.9980933,0.0003542777,0.0001924141,0.0003033176,0.0007210259,0.0003357032],"domain_scores_gemma":[0.9977757,0.0003552593,0.0001651974,0.001346208,0.0002726582,0.00008495545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001325988,0.0007431199,0.003208416,0.001148264,0.0002853663,0.001325863,0.001277052,0.04118223,0.183264,0.5674796,0.005571006,0.1931891],"study_design_scores_gemma":[0.0004309182,0.0009509875,0.001264651,0.0001741934,0.0002451882,0.002121161,0.000204419,0.3477957,0.4525692,0.125909,0.06810234,0.0002322737],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03617443,0.0001666736,0.950745,0.0003177696,0.0001403224,0.000299565,0.00009515504,0.00540137,0.006659616],"genre_scores_gemma":[0.699654,0.0002030845,0.2935146,0.0003079167,0.00004800834,0.0003146771,0.0002229441,0.0003039223,0.005430709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004368457,"threshold_uncertainty_score":0.01461393,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Abdel Alim Kamal","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008622625722298683,"gpt":0.2490173941456714,"spread":0.2403947684233727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00240273,0.001006688,0.0009852012,0.001115024,0.0007812905,0.0021133,0.001619007,0.001488181,0.004889056],"category_scores_gemma":[0.01225265,0.0007337308,0.0005357093,0.0005957905,0.001340054,0.003687254,0.002266236,0.00162355,0.002160626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007817172,"about_ca_system_score_gemma":0.001337977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003031867,"about_ca_topic_score_gemma":0.0005499196,"domain_scores_codex":[0.9959304,0.001205059,0.000363265,0.0004460184,0.001442487,0.0006127851],"domain_scores_gemma":[0.9889296,0.002461011,0.001262562,0.005324193,0.001826897,0.00019573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.005192308,0.0005736172,0.008078518,0.001220423,0.0004587095,0.001327392,0.001202581,0.05442191,0.2812973,0.1535823,0.0142846,0.4783603],"study_design_scores_gemma":[0.0005354484,0.001853681,0.002293291,0.0003719707,0.0004665883,0.001727254,0.0002592702,0.4038757,0.4947975,0.0652932,0.02837934,0.0001468615],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4776424,0.002097318,0.4863979,0.001628076,0.0007962843,0.0002297993,0.0001742097,0.01215715,0.01887694],"genre_scores_gemma":[0.9379415,0.0002075956,0.05748854,0.0002890791,0.0001103793,0.00004442978,0.0001009446,0.0002189857,0.003598647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004889056,"threshold_uncertainty_score":0.01635545,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","authors":[{"name":"Murat Cenk","is_ca":false},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02165276330084879,"gpt":0.2342433627182859,"spread":0.2125905994174371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001752218,0.002479568,0.00173117,0.005050731,0.003089134,0.004956096,0.002221008,0.00175992,0.01725898],"category_scores_gemma":[0.005438955,0.001141456,0.002016639,0.006395616,0.004871107,0.01154617,0.005205544,0.006295448,0.003903471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001718521,"about_ca_system_score_gemma":0.0008142739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000350969,"about_ca_topic_score_gemma":0.0004640412,"domain_scores_codex":[0.998149,0.0003175882,0.000151844,0.0003984185,0.0007154865,0.0002676892],"domain_scores_gemma":[0.996718,0.001926176,0.0002634156,0.0004369748,0.0003299837,0.0003254641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002142598,0.0000917444,0.000251134,0.0003345021,0.00003470585,0.0002253962,0.0003389825,0.00139024,0.002398166,0.9429954,0.01007437,0.0416512],"study_design_scores_gemma":[0.00003279079,0.00005232643,0.0002634288,0.00005263293,0.00004592915,0.0004626784,0.0000558545,0.004518075,0.001724201,0.9653648,0.02738931,0.0000380196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09411442,0.02887004,0.4766232,0.01496416,0.01043787,0.0001946929,0.001077004,0.000957867,0.3727608],"genre_scores_gemma":[0.6224312,0.02089328,0.1430378,0.005758089,0.02011511,0.0004298608,0.00175345,0.001138069,0.1844432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01725898,"threshold_uncertainty_score":0.05773699,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Geovandro C. C. F. Pereira","is_ca":true},{"name":"Javad Doliskani","is_ca":true},{"name":"David Jao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00704499768570218,"gpt":0.1827192526199425,"spread":0.1756742549342403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003134753,0.0006560636,0.0006929768,0.0006137924,0.0005978352,0.001115687,0.0006533596,0.0006776645,0.0123465],"category_scores_gemma":[0.001161273,0.0002479394,0.0004117148,0.0008865129,0.0007463408,0.002634639,0.001321578,0.0009953717,0.001858213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006048085,"about_ca_system_score_gemma":0.001065318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006339101,"about_ca_topic_score_gemma":0.001248089,"domain_scores_codex":[0.9994962,0.00006007678,0.00003385754,0.00009199327,0.0002223913,0.00009558126],"domain_scores_gemma":[0.9995414,0.0001390887,0.00003668315,0.0001707304,0.00008754321,0.00002455609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002364419,0.0002958745,0.001025757,0.0003760297,0.00009487422,0.0009866698,0.0003140013,0.01822882,0.09673636,0.5291809,0.01901676,0.3313796],"study_design_scores_gemma":[0.0008956516,0.001188065,0.001751318,0.0002316861,0.0002649281,0.003337572,0.000342243,0.2831674,0.2380313,0.4104824,0.06011178,0.0001955762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3691433,0.002238024,0.5377611,0.002139599,0.001188998,0.0003507217,0.0006071613,0.005166126,0.08140496],"genre_scores_gemma":[0.8384925,0.0004952016,0.1279345,0.0007015369,0.0002766374,0.0001325396,0.0005337571,0.0002473154,0.03118595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0123465,"threshold_uncertainty_score":0.04130316,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Matthew Mayhew","is_ca":true},{"name":"Radu Mureşan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06317022046290896,"gpt":0.3366096217778632,"spread":0.2734394013149543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001310002,0.001678737,0.001161059,0.003159385,0.0006029541,0.0023243,0.001641599,0.001419109,0.004153825],"category_scores_gemma":[0.002767313,0.0007747477,0.0008593439,0.001684449,0.000756785,0.002832795,0.001303792,0.001963042,0.002213761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008026141,"about_ca_system_score_gemma":0.001009722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002751348,"about_ca_topic_score_gemma":0.0003572098,"domain_scores_codex":[0.9984943,0.0002279879,0.0001414064,0.0002144619,0.0008003489,0.0001215678],"domain_scores_gemma":[0.9978706,0.0008171841,0.0002758916,0.0004232163,0.0005612537,0.00005196956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002263733,0.000221082,0.001544291,0.00166145,0.0001882282,0.0001696389,0.00007435747,0.01824065,0.02880441,0.05038625,0.006923199,0.89156],"study_design_scores_gemma":[0.0001556478,0.002566762,0.004299166,0.002295845,0.0009396506,0.005916632,0.0001665377,0.2573681,0.1726774,0.126095,0.4272077,0.0003115755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.01585578,0.1616923,0.7775502,0.002002851,0.0008151265,0.0004484462,0.0002198886,0.003222623,0.03819281],"genre_scores_gemma":[0.3947718,0.1351699,0.4398511,0.002031539,0.002067088,0.000509959,0.0007610773,0.0005089293,0.02432856],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004153825,"threshold_uncertainty_score":0.01389593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964201351","doi":"10.1007/s13389-011-0008-9","title":"SPA-resistant binary exponentiation with optimal execution time","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","authors":[{"name":"Carlos Moreno","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0106181311011038,"gpt":0.1922593929576475,"spread":0.1816412618565437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001220779,0.00121217,0.001393842,0.001154914,0.0008139694,0.002373582,0.0009909369,0.001201417,0.008652109],"category_scores_gemma":[0.004010501,0.0006420357,0.0009531126,0.00182425,0.0009173807,0.003297871,0.001866258,0.00128722,0.003627025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009516929,"about_ca_system_score_gemma":0.002705136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004016902,"about_ca_topic_score_gemma":0.001012041,"domain_scores_codex":[0.9966571,0.0007115375,0.0003279714,0.0004812069,0.001097494,0.0007246869],"domain_scores_gemma":[0.995756,0.001586095,0.0004108517,0.001662884,0.0003966069,0.0001876152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.01620392,0.001044837,0.005451395,0.0009784215,0.0004888684,0.0009579031,0.000384737,0.1393707,0.1804375,0.1149508,0.02749019,0.5122406],"study_design_scores_gemma":[0.001512283,0.001453071,0.001983191,0.00009113028,0.0003167783,0.001305718,0.0001762234,0.7035936,0.1495088,0.128653,0.0112792,0.0001270253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3427567,0.001969961,0.6196922,0.0020638,0.0006621722,0.0002703523,0.0008871369,0.01183903,0.01985862],"genre_scores_gemma":[0.8416449,0.0002899521,0.1478279,0.0002200386,0.0002023168,0.0001048744,0.0004777003,0.0003706749,0.0088617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008652109,"threshold_uncertainty_score":0.02894425,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Agustín Domínguez-Oviedo","is_ca":false},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03866171637910226,"gpt":0.2225906132771978,"spread":0.1839288968980955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008612432,0.0004153985,0.0004820419,0.0009052546,0.00049746,0.000867809,0.0007945241,0.000882397,0.003257765],"category_scores_gemma":[0.002865679,0.0001436088,0.0002649955,0.0005040368,0.0003828079,0.001042967,0.001230608,0.0005271849,0.0007898253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005953322,"about_ca_system_score_gemma":0.0009226081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004491405,"about_ca_topic_score_gemma":0.0009654408,"domain_scores_codex":[0.9990541,0.0001979263,0.00006882282,0.0001179456,0.0004193945,0.0001417644],"domain_scores_gemma":[0.9985636,0.000416589,0.0001478748,0.0004540686,0.000362919,0.00005499318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002733554,0.0004585095,0.008992515,0.0003511758,0.0001450135,0.0006099871,0.000298132,0.05736887,0.2337132,0.1145847,0.004882934,0.5758614],"study_design_scores_gemma":[0.0001094477,0.0005914187,0.002523181,0.00008513096,0.00006994792,0.0007330938,0.00007264823,0.7558128,0.1964155,0.03672898,0.006797733,0.00006005211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2125178,0.0003626942,0.7753879,0.0003369323,0.0001093325,0.000119338,0.0001509995,0.002730672,0.008284235],"genre_scores_gemma":[0.81788,0.00008185235,0.1778459,0.0001382114,0.00002435546,0.0000491223,0.0001646164,0.00005722411,0.003758785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003257765,"threshold_uncertainty_score":0.01089829,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vidal Attias","is_ca":false},{"name":"Luigi Vigneri","is_ca":false},{"name":"Vassil S. Dimitrov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01440961944567292,"gpt":0.2351199308294662,"spread":0.2207103113837932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003553814,0.0008619361,0.0006636812,0.0007978095,0.0009874409,0.003034244,0.001711223,0.001439933,0.006318423],"category_scores_gemma":[0.0163577,0.0005568129,0.0007135104,0.0006867544,0.002742532,0.01097078,0.005067474,0.003828084,0.003112164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005016553,"about_ca_system_score_gemma":0.0007251481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001649762,"about_ca_topic_score_gemma":0.0003657276,"domain_scores_codex":[0.997481,0.0008147512,0.0002282786,0.0004057307,0.0008000142,0.0002701512],"domain_scores_gemma":[0.9921122,0.002828377,0.0002045936,0.00380789,0.0008698684,0.0001770656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006167476,0.0002013979,0.002085709,0.0004999297,0.00008331719,0.0005825063,0.0009222923,0.0175132,0.03814419,0.5815497,0.008525812,0.3492752],"study_design_scores_gemma":[0.00009323168,0.000329742,0.0005195608,0.0003264468,0.00008099514,0.001017003,0.0003103547,0.07441543,0.03304715,0.7763738,0.1134003,0.00008584662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1421542,0.008547467,0.792498,0.01035641,0.004243886,0.0001602979,0.0001359968,0.004034449,0.03786927],"genre_scores_gemma":[0.7828549,0.00284978,0.1977005,0.002037048,0.001197336,0.00005315632,0.0001422207,0.001140786,0.01202429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006318423,"threshold_uncertainty_score":0.02113724,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"M.A. Hasan","is_ca":true},{"name":"Christophe Négre","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02097325956383962,"gpt":0.2258844092521239,"spread":0.2049111496882843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006544411,0.000763663,0.0006357084,0.0005949728,0.000732709,0.00146012,0.0009859162,0.0006284769,0.009512605],"category_scores_gemma":[0.002118764,0.0004051528,0.0005218628,0.0009572971,0.0009164054,0.002432607,0.001566803,0.001288289,0.001525832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118194,"about_ca_system_score_gemma":0.002568339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005520633,"about_ca_topic_score_gemma":0.001618138,"domain_scores_codex":[0.9990444,0.0002222767,0.0000658523,0.0001852857,0.0003288187,0.0001534155],"domain_scores_gemma":[0.998413,0.0007534126,0.0001449993,0.0003843474,0.0002344214,0.00006984764],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001372312,0.0002219229,0.001000335,0.000480813,0.0001085061,0.0004145017,0.0001882666,0.05636655,0.06103846,0.6847206,0.01115774,0.1829299],"study_design_scores_gemma":[0.0003432904,0.0009490198,0.0005303386,0.00008287474,0.0001939081,0.0008354803,0.00004705786,0.3737643,0.08153076,0.5135476,0.02809682,0.00007857003],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.132452,0.0007687789,0.8123995,0.00167816,0.000293202,0.0003348264,0.0004821152,0.001756453,0.04983505],"genre_scores_gemma":[0.7719713,0.0004816306,0.1976134,0.0006203906,0.0003423059,0.0003577578,0.0004058783,0.0001585911,0.02804868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009512605,"threshold_uncertainty_score":0.0318228,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.009644395364798096,"gpt":0.2390027257456447,"spread":0.2293583303808466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002413391,0.0003897707,0.0003636921,0.0008572588,0.0008209234,0.001147743,0.0003544173,0.0003669355,0.004161412],"category_scores_gemma":[0.0006878171,0.0002242192,0.0004882793,0.000559958,0.0007359448,0.001296341,0.0005921933,0.0011135,0.0007603184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005260984,"about_ca_system_score_gemma":0.0005190389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002048682,"about_ca_topic_score_gemma":0.0003051763,"domain_scores_codex":[0.9997571,0.0000373666,0.00001784102,0.0000529942,0.00008062199,0.00005413814],"domain_scores_gemma":[0.9998304,0.00004902232,0.00003429439,0.00003465716,0.00003049699,0.00002107804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002171447,0.00008272719,0.0006608784,0.0001293244,0.00001530718,0.0003959901,0.0002238471,0.009517489,0.03526864,0.8796311,0.002262686,0.07159492],"study_design_scores_gemma":[0.0001136335,0.0006986466,0.001156727,0.0001209241,0.00004210546,0.002228428,0.0002034149,0.09717447,0.0561685,0.7582101,0.08376303,0.000119947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4094891,0.001233688,0.5237395,0.0006963015,0.0004041769,0.000276464,0.0003034093,0.0008288139,0.06302853],"genre_scores_gemma":[0.8492671,0.0007494236,0.1305209,0.0002622481,0.0001949411,0.0001776135,0.0002978434,0.0001315282,0.01839829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004161412,"threshold_uncertainty_score":0.01392132,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nicolas Méloni","is_ca":false},{"name":"Christophe Négre","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01403674815502639,"gpt":0.215526916183141,"spread":0.2014901680281146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009609766,0.0003654987,0.0004121421,0.0006568903,0.0007141312,0.001262551,0.0006838669,0.0006446873,0.004785513],"category_scores_gemma":[0.005411956,0.0001712674,0.0001485535,0.0006306689,0.001477246,0.002134984,0.001303031,0.0009030135,0.0003797699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004885088,"about_ca_system_score_gemma":0.0004917048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003416362,"about_ca_topic_score_gemma":0.0004707939,"domain_scores_codex":[0.9994531,0.0001095045,0.0000182869,0.00006071784,0.0002002597,0.0001581863],"domain_scores_gemma":[0.9970305,0.001461365,0.0002074987,0.0008021612,0.0003604376,0.0001379856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.006427093,0.0003189995,0.01092819,0.0004977912,0.0001339228,0.001089596,0.0006825905,0.1175952,0.1091953,0.6624112,0.008672104,0.082048],"study_design_scores_gemma":[0.000295952,0.001244915,0.00394243,0.00008889751,0.0001140075,0.001212592,0.0006276744,0.5413347,0.1141463,0.3241825,0.01271671,0.0000934129],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9584184,0.001129204,0.02027965,0.0008833014,0.0001369586,0.00002394102,0.0001242452,0.0003769227,0.01862741],"genre_scores_gemma":[0.9964735,0.0001460687,0.00216801,0.00004338428,0.00002776625,0.000006177771,0.00003452638,0.00002154129,0.001078975],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004785513,"threshold_uncertainty_score":0.01600909,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Dúnia Marchiori","is_ca":false},{"name":"Ricardo Felipe Custódio","is_ca":false},{"name":"Daniel Panario","is_ca":true},{"name":"Lucia Moura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01920748407871984,"gpt":0.2681746827172897,"spread":0.2489671986385699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004903991,0.0006990404,0.001541494,0.002282152,0.001535507,0.003540352,0.002180925,0.002519977,0.002728533],"category_scores_gemma":[0.03737127,0.0009664595,0.0007735551,0.002651502,0.004621415,0.006856777,0.004323159,0.004137369,0.001139559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001553299,"about_ca_system_score_gemma":0.002376266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008009696,"about_ca_topic_score_gemma":0.0008222703,"domain_scores_codex":[0.9925671,0.002572006,0.0003274882,0.0007483986,0.003173808,0.0006112068],"domain_scores_gemma":[0.9738333,0.01686632,0.001734139,0.00502783,0.002125988,0.0004123892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000273125,0.00007821117,0.001164603,0.0001716936,0.00003483671,0.00008325234,0.0002479684,0.0887581,0.003643153,0.8301673,0.002621643,0.07275622],"study_design_scores_gemma":[0.00003576792,0.00004394275,0.0001282076,0.00004530868,0.00001574648,0.0001116082,0.00002805347,0.2564973,0.002535579,0.738785,0.001742425,0.00003111131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03074491,0.0008590356,0.9617332,0.0009727221,0.0001190229,0.00005334077,0.00005230388,0.0005320819,0.004933412],"genre_scores_gemma":[0.794627,0.001130334,0.1961907,0.0002814114,0.0004252341,0.0001790437,0.0001522635,0.0002638648,0.006750193],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004903991,"threshold_uncertainty_score":0.02593505,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; 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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01328726569163282,"gpt":0.2186007287197764,"spread":0.2053134630281435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002522445,0.001110904,0.001464283,0.001423712,0.002027072,0.004780394,0.002618971,0.001842389,0.007811179],"category_scores_gemma":[0.009811809,0.0009287543,0.001256065,0.001721272,0.003618457,0.01281715,0.008607788,0.007041679,0.004377265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001200047,"about_ca_system_score_gemma":0.001601738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001890224,"about_ca_topic_score_gemma":0.0002504837,"domain_scores_codex":[0.996805,0.0006486484,0.0003457987,0.0004439956,0.001280007,0.0004765775],"domain_scores_gemma":[0.9942409,0.00179151,0.0004130917,0.002711828,0.0005276569,0.0003151439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001104573,0.0002219298,0.0003958734,0.000429761,0.00007408227,0.0003815451,0.0004731793,0.0069915,0.01914278,0.8571057,0.007583572,0.1060955],"study_design_scores_gemma":[0.000195505,0.0002438923,0.0001586618,0.0001054045,0.00007497556,0.0004958903,0.0001546578,0.02896928,0.02067285,0.9240975,0.02474095,0.00009034744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08042666,0.002944021,0.8798778,0.003151049,0.001460436,0.00030783,0.0004330715,0.001520154,0.02987896],"genre_scores_gemma":[0.7761319,0.002373506,0.1656877,0.0008599979,0.001154746,0.0004434244,0.0008870092,0.0005111602,0.05195056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007811179,"threshold_uncertainty_score":0.02613103,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Mahmoud AbdelHafeez Sayed","is_ca":true},{"name":"Mostafa Taha","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02479788088699228,"gpt":0.2977358301225645,"spread":0.2729379492355722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00223964,0.0002820696,0.0006011167,0.001145991,0.0003642168,0.001272057,0.0006281814,0.0005474855,0.002273277],"category_scores_gemma":[0.007992178,0.00009158697,0.0003922057,0.0006810124,0.0004451285,0.001569132,0.0005668244,0.0002706301,0.0002144649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00120778,"about_ca_system_score_gemma":0.001067442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001233088,"about_ca_topic_score_gemma":0.0008153481,"domain_scores_codex":[0.9974329,0.000665849,0.0001790282,0.0002050088,0.001306766,0.0002105002],"domain_scores_gemma":[0.9950525,0.002326422,0.0003421067,0.0006040909,0.001536221,0.0001386229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003091944,0.0006527981,0.01445516,0.0004544776,0.0002363013,0.0004695164,0.0002437799,0.4068131,0.08108828,0.09905272,0.002162425,0.3912795],"study_design_scores_gemma":[0.00004497058,0.000549889,0.002309193,0.00001711425,0.00003903469,0.0002166584,0.00007134442,0.9602944,0.02652323,0.009145291,0.0007706021,0.00001835118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6546118,0.0003853355,0.3385345,0.0001573663,0.00006996439,0.0001563893,0.0001640098,0.0003811533,0.00553947],"genre_scores_gemma":[0.9673585,0.00005213492,0.03170116,0.00001118595,0.000007119081,0.00001454974,0.000093152,0.00001310584,0.000749008],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002273277,"threshold_uncertainty_score":0.01184452,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}